{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:2QSZ2JUOUGYOBB5HHAO5ALZFJ7","short_pith_number":"pith:2QSZ2JUO","schema_version":"1.0","canonical_sha256":"d4259d268ea1b0e087a7381dd02f254fce184f50b55b055c4304697cbf3604ea","source":{"kind":"arxiv","id":"2607.29658","version":1},"attestation_state":"computed","paper":{"title":"Reusing Past Repairs Through Hierarchical Trajectory Abstraction for Coding Agents","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Jiayuan Zhou, Ruiqi Pan, Tse-Hsun Chen, Yisen Xu","submitted_at":"2026-07-31T17:38:48Z","abstract_excerpt":"Although LLM-driven repair agents can tackle complex, repository-level issues, they treat every issue independently and discard the procedural knowledge accumulated from previous repairs. We introduce STAIR, a framework that converts historical repair trajectories into hierarchical, reusable plans that can be adapted to steer future repairs. Each past trajectory is transformed into a multi-level tree that ranges from fine-grained diagnostic actions to high-level repair strategies, encoding experience at several granularities. When a new issue arrives, STAIR selects relevant plan nodes from mul"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2607.29658","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2026-07-31T17:38:48Z","cross_cats_sorted":[],"title_canon_sha256":"d863ef7787722bb471bfa82f99a014b3a4fab57574235b73e510dcfc36a9f54d","abstract_canon_sha256":"18a8a6a17079bb452ac9c9081e6c1261a7b0a008161fafd6db6f237f65c1121a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-03T01:41:40.716678Z","signature_b64":"2MHLVoIU4qTWAaF1aDYgZtSHgEBnzpieptKK6d83H3zTC7wBfb2/gZLXNC4XQhbxM2M8qdzuVa7wkeynJrRzDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4259d268ea1b0e087a7381dd02f254fce184f50b55b055c4304697cbf3604ea","last_reissued_at":"2026-08-03T01:41:40.714833Z","signature_status":"signed_v1","first_computed_at":"2026-08-03T01:41:40.714833Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reusing Past Repairs Through Hierarchical Trajectory Abstraction for Coding Agents","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Jiayuan Zhou, Ruiqi Pan, Tse-Hsun Chen, Yisen Xu","submitted_at":"2026-07-31T17:38:48Z","abstract_excerpt":"Although LLM-driven repair agents can tackle complex, repository-level issues, they treat every issue independently and discard the procedural knowledge accumulated from previous repairs. We introduce STAIR, a framework that converts historical repair trajectories into hierarchical, reusable plans that can be adapted to steer future repairs. Each past trajectory is transformed into a multi-level tree that ranges from fine-grained diagnostic actions to high-level repair strategies, encoding experience at several granularities. When a new issue arrives, STAIR selects relevant plan nodes from mul"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.29658","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.29658/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2607.29658","created_at":"2026-08-03T01:41:40.715854+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.29658v1","created_at":"2026-08-03T01:41:40.715854+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.29658","created_at":"2026-08-03T01:41:40.715854+00:00"},{"alias_kind":"pith_short_12","alias_value":"2QSZ2JUOUGYO","created_at":"2026-08-03T01:41:40.715854+00:00"},{"alias_kind":"pith_short_16","alias_value":"2QSZ2JUOUGYOBB5H","created_at":"2026-08-03T01:41:40.715854+00:00"},{"alias_kind":"pith_short_8","alias_value":"2QSZ2JUO","created_at":"2026-08-03T01:41:40.715854+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2QSZ2JUOUGYOBB5HHAO5ALZFJ7","json":"https://pith.science/pith/2QSZ2JUOUGYOBB5HHAO5ALZFJ7.json","graph_json":"https://pith.science/api/pith-number/2QSZ2JUOUGYOBB5HHAO5ALZFJ7/graph.json","events_json":"https://pith.science/api/pith-number/2QSZ2JUOUGYOBB5HHAO5ALZFJ7/events.json","paper":"https://pith.science/paper/2QSZ2JUO"},"agent_actions":{"view_html":"https://pith.science/pith/2QSZ2JUOUGYOBB5HHAO5ALZFJ7","download_json":"https://pith.science/pith/2QSZ2JUOUGYOBB5HHAO5ALZFJ7.json","view_paper":"https://pith.science/paper/2QSZ2JUO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.29658&json=true","fetch_graph":"https://pith.science/api/pith-number/2QSZ2JUOUGYOBB5HHAO5ALZFJ7/graph.json","fetch_events":"https://pith.science/api/pith-number/2QSZ2JUOUGYOBB5HHAO5ALZFJ7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2QSZ2JUOUGYOBB5HHAO5ALZFJ7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2QSZ2JUOUGYOBB5HHAO5ALZFJ7/action/storage_attestation","attest_author":"https://pith.science/pith/2QSZ2JUOUGYOBB5HHAO5ALZFJ7/action/author_attestation","sign_citation":"https://pith.science/pith/2QSZ2JUOUGYOBB5HHAO5ALZFJ7/action/citation_signature","submit_replication":"https://pith.science/pith/2QSZ2JUOUGYOBB5HHAO5ALZFJ7/action/replication_record"}},"created_at":"2026-08-03T01:41:40.715854+00:00","updated_at":"2026-08-03T01:41:40.715854+00:00"}