{"_canonicalization":{"envelope_id":"axm_ + sha256(envelope minus {signature, axiom_id, anchors})","envelope_signature":"ed25519(envelope minus {signature, axiom_id})","json":"sort_keys=True, separators=(',',':'), ensure_ascii=False, allow_nan=False, utf-8","leaf_hash":"sha256(0x00 || canonical_json(envelope_full))","seal_signature":"ed25519(seal minus {signature, sig_algorithm})"},"axiom_id":"axm_1d1a53565906ec4cc893e32ce4161b3411962dfae1a2ebf42d88f4d97ba71590","bitcoin_anchor":{"bitcoin_attestations":[],"calendar_attestations":[],"ots_url":"","stamped_at":"","status":"pending_next_stamp"},"envelope":{"anchors":[{"chain":"crovia.axiom_graph","height":0,"merkle_proof":"spider_vendor_press_v1","root_at_anchor":"spider_vendor_press_v1"}],"axiom_id":"axm_1d1a53565906ec4cc893e32ce4161b3411962dfae1a2ebf42d88f4d97ba71590","axiom_type":"AX.OBS","body":{"axiom_subtype":"news.vendor_press.v1","category":"news","fingerprint":"0fb945123cd2693444b766f6ea910db9909cb22ced96e90268384eda00018962","published":"Wed, 15 Jul 2026 00:00:00 -0400","receipt_hash":"0fb945123cd2693444b766f6ea910db9909cb22ced96e90268384eda00018962","schema":"spider.news.vendor_press.v1","spider":"vendor_press","spider_record":{"axiom_subtype":"news.vendor_press.v1","category":"news","decision_hint":"POSITIVE","envelope_target":"AX.OBS","fingerprint":"0fb945123cd2693444b766f6ea910db9909cb22ced96e90268384eda00018962","observed_at":"2026-07-15T04:44:03.592429Z","parent_run_hash":"d49a6cf532e74153266f377b7760fc948d950d80ed41fc3e3eb82b58f5597ead","published":"Wed, 15 Jul 2026 00:00:00 -0400","runtime_version":"0.1.0","schema":"spider.news.vendor_press.v1","source_status":200,"source_url":"https://export.arxiv.org/rss/cs.AI","spider":"vendor_press","summary_excerpt":"arXiv:2607.12605v1 Announce Type: cross \nAbstract: Large language models (LLMs) have improved automated program repair (APR), but two limitations remain. First, raw execution traces are often too large and repetitive to serve as effective model context. Second, repeated patch sampling may produce different implementations without yielding distinct root-cause hypotheses or repair strategies. We present CT-Repair, an agentic APR framework representing static and dynamic evidence as queryable Code Property Graph (CPG) and Temporal Execution Graph (TEG). CT-Repair applies a three-stage filtering pipeline to construct compact TEGs. Three finite-state-machine-guided agents analyze each bug from static, dynamic, and hybrid perspectives and independently produce evidence-grounded repair strategies. A strategy-guided generation procedure instantiates these strategies as candidate patches and uses validation feedback to refine the most promising strategy.\n  We evaluate CT-Repair on 854 Java bugs","title":"Multi-Perspective Agentic Program Repair via Code Property Graphs and Temporal Execution Graphs","url":"https://arxiv.org/abs/2607.12605","vendor":"arxiv_cs_ai"},"summary":"arXiv:2607.12605v1 Announce Type: cross \nAbstract: Large language models (LLMs) have improved automated program repair (APR), but two limitations remain. First, raw execution traces are often too large and repetitive to serve as effective model context. Second, repeated patch sampling may produce different implementations without yielding distinct root-cause hypotheses or repair strategies. We present CT-Repair, an agentic APR framework representing static and dynamic evidence as queryable Code Property Graph (CPG) and Temporal Execution Graph (TEG). CT-Repair applies a three-stage filtering pipeline to construct compact TEGs. Three finite-state-machine-guided agents analyze each bug from static, dynamic, and hybrid perspectives and independently produce evidence-grounded repair strategies. A strategy-guided generation procedure instantiates these strategies as candidate patches and uses validation feedback to refine the most promising strategy.\n  We evaluate CT-Repair on 854 Java bugs","title":"Multi-Perspective Agentic Program Repair via Code Property Graphs and Temporal Execution Graphs","vendor":"arxiv_cs_ai"},"confidence":{"method":"deterministic"},"decision":"POSITIVE","issued_at":"2026-07-15T04:44:03Z","notes":"Spider vendor_press (news) news.vendor_press.v1","object":{"captured_by":"crovia.spider.vendor_press","primary_source_url":"https://arxiv.org/abs/2607.12605"},"predecessors":[],"schema":"crovia.axiom.v1","signature":"ed25519:91f51458218d895e1c5ca2fa9e55a250daddd455a913a21a5d89ae70718b225996160a0d5dd198a250e4b468c5ecba492bbb90ef0e0033440de08d217834c30b","signer":"crovia.substrate","subject":{"observed_at":"2026-07-15T04:44:03Z","source_collector":"spider:vendor_press","target_id":"https://arxiv.org/abs/2607.12605"},"tsa":{"authority":"crovia.substrate.bootstrap","rfc3161_token":"{\"kind\":\"crovia.bootstrap.tsa\",\"source_jsonl\":\"/opt/crovia/spider/data/news/vendor_press_v1.jsonl\",\"source_seal_merkle_root\":\"spider_vendor_press_v1\",\"upgrade_path\":\"Sessione H \\u2014 OpenTimestamps weekly anchor\"}"},"zk_mode":"clear","zk_proof":null},"ledger":{"leaf_hash":"c4129810f8cd30e192d8171b5e2cd71477db733ddff5ddaf9493e82b2913b5c0","leaf_index":316483,"ledger_path":"/opt/crovia/substrate/axiom_ledger.jsonl"},"merkle_proof":{"hash_alg":"sha256","leaf_prefix":"0x00","node_prefix":"0x01","odd_leaf_rule":"duplicate_last","path":[{"sibling":"879e040099a198489dd5ab6372ec3084958c34dcb4ce3918859f50d3138ec96a","side":"left"},{"sibling":"96ace1724bab4e7fb10924835db9acf60a9defaf5ff905d4274db5e161d56635","side":"left"},{"sibling":"5d2f0ca3b658a415d76c3e1efd87969eabb1a44e737a2a955a2234e80b1a922f","side":"right"},{"sibling":"0a7697c226612d2183dcf23496f3b70964ed68390e28c4b873dec0f963940ce5","side":"right"},{"sibling":"80374a188ef4b438d17d48e691cb7d59dd428dd84f9781a41f4938e06ef913b3","side":"right"},{"sibling":"71093330df11a61846ce241fed3c9ef1545532e993f39e3bf6c938868a1c905d","side":"right"},{"sibling":"5436dbbae79dbce31676274ba50aef18052108604eec1fa3a36023d740b2cf09","side":"left"},{"sibling":"c07de1952926cdb34af34c5c0baaf9021a0ab704be6665431e37a7c145fca4d5","side":"right"},{"sibling":"1c7f1bf97993e3a126824f8350788b168c4c13264fb03a73b3ede312035d3527","side":"right"},{"sibling":"84a7590e6b24dd07ed46597f19deb75d9ad247b4227b17f30857ec7cc0fc5c21","side":"right"},{"sibling":"c8d3d8cb0183b912107f9781ad2a1b6c0c9424906c5907c09deeb5bea9d7b571","side":"left"},{"sibling":"0cb62c0ada57a2406a6bcb100889d3e8b29a15efeed07adaff5bb90a5e80612a","side":"right"},{"sibling":"0b69289b25462ddd6166f6f49004cfc8ada0ab4f10adafe188347817bdd46e37","side":"left"},{"sibling":"1418b281cd985b5ed411ef25f2017a1826cc14919b6fad3934e6ceeec693699b","side":"right"},{"sibling":"f302542c38ba7c3aab7c9280dd60259ecec777dca6e6f71b6f0729b0b8791b72","side":"left"},{"sibling":"d8b9143917b539c543cf4448cec00131f8b807bd8004979c54ebe09798748c66","side":"left"},{"sibling":"abe4a8c706e530484d1e96a8988cb09eab85928b2050985500ab289753fe3eec","side":"right"},{"sibling":"f436dccf82aa2c1eb7bfa3eb84316e116aaf64dc55cd9592597118f6cb0648f6","side":"right"},{"sibling":"1cecb7f447febd025aac272837c80de218aecc6485d2395a509b2a1f1b9c746e","side":"left"}]},"schema":"crovia.axiom_proof.v1","seal":{"first_collector_run_id":"","first_receipt_hash":"","jsonl_path":"/opt/crovia/substrate/axiom_ledger.jsonl","key_id":"430895f101d38164","last_collector_run_id":"","last_receipt_hash":"","leaf_count":316730,"merkle_root":"a8e6e5be81ea6f5b5f2227422459bf39455fe9f0b6602b4d1ce6977dbfd78bc7","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","run_id":"hourly_json_retrofit_20260715T053701Z","schema":"crovia.seal.v1","seal_family_version":"crovia-seal-family/1","seal_kind":"substrate_batch","sealed_at":"2026-07-15T05:38:24Z","sig_algorithm":"ed25519","signature":"df1678d268b5a07413e2ca6e748c3f40b6cfedea930a18d843489a4ab513da791bf0a886caab1b918d0989f8ebaaf3d0035ca2aa777913b1ad29979f1deb9a0c","signer_version":"1.1.0"},"trust_root":{"key_id":"430895f101d38164","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","signature_algorithm":"ed25519","url":"/registry/canon/TRUST_ROOT.md"},"verifier":{"spec":"/registry/canon/AXIOM_RECEIPT_v1.md","url":"/v/axm_1d1a53565906ec4cc893e32ce4161b3411962dfae1a2ebf42d88f4d97ba71590"}}