{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:3P4MGOVKN4VUBTNN2CIWW2OK32","short_pith_number":"pith:3P4MGOVK","canonical_record":{"source":{"id":"2502.07067","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2025-02-10T21:59:01Z","cross_cats_sorted":[],"title_canon_sha256":"ed6c1c6ce3e083fb0cd7438d5759a59c5ffd756a901c8e3769469b2538f79770","abstract_canon_sha256":"5a264bfea865b25541f2f5280c57cb175107bdbed25ddbacd898ea76e1a9570d"},"schema_version":"1.0"},"canonical_sha256":"dbf8c33aaa6f2b40cdadd0916b69cade8a02b3115e4e961994049b7d186927c0","source":{"kind":"arxiv","id":"2502.07067","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.07067","created_at":"2026-07-05T10:12:31Z"},{"alias_kind":"arxiv_version","alias_value":"2502.07067v1","created_at":"2026-07-05T10:12:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.07067","created_at":"2026-07-05T10:12:31Z"},{"alias_kind":"pith_short_12","alias_value":"3P4MGOVKN4VU","created_at":"2026-07-05T10:12:31Z"},{"alias_kind":"pith_short_16","alias_value":"3P4MGOVKN4VUBTNN","created_at":"2026-07-05T10:12:31Z"},{"alias_kind":"pith_short_8","alias_value":"3P4MGOVK","created_at":"2026-07-05T10:12:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:3P4MGOVKN4VUBTNN2CIWW2OK32","target":"record","payload":{"canonical_record":{"source":{"id":"2502.07067","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2025-02-10T21:59:01Z","cross_cats_sorted":[],"title_canon_sha256":"ed6c1c6ce3e083fb0cd7438d5759a59c5ffd756a901c8e3769469b2538f79770","abstract_canon_sha256":"5a264bfea865b25541f2f5280c57cb175107bdbed25ddbacd898ea76e1a9570d"},"schema_version":"1.0"},"canonical_sha256":"dbf8c33aaa6f2b40cdadd0916b69cade8a02b3115e4e961994049b7d186927c0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:12:31.923685Z","signature_b64":"DuNSxthjaio6AMrw9pDus5KcxluzmaCAD4Hk7Sj0O8Pk3DyQkoSEbGbBIT+SSifzqTneLUuwpSRx2whgQJQKCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dbf8c33aaa6f2b40cdadd0916b69cade8a02b3115e4e961994049b7d186927c0","last_reissued_at":"2026-07-05T10:12:31.923253Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:12:31.923253Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2502.07067","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T10:12:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bJL8Er/GdfgDnMRaL/LK8BTXyuwyCtd+XyHeAZPPeLmPFycdG2WY+y2iR3xp4N3kZNpd/Gj/j+zJLlkhXVlpCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T17:19:48.892685Z"},"content_sha256":"fee766eb8b84b1791bee33bba7555d4261aaf624985546a748144121283d363b","schema_version":"1.0","event_id":"sha256:fee766eb8b84b1791bee33bba7555d4261aaf624985546a748144121283d363b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:3P4MGOVKN4VUBTNN2CIWW2OK32","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Repository-level Code Search with Neural Retrieval Methods","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Jamie Callan, Luyu Gao, Siddharth Gandhi","submitted_at":"2025-02-10T21:59:01Z","abstract_excerpt":"This paper presents a multi-stage reranking system for repository-level code search, which leverages the vastly available commit histories of large open-source repositories to aid in bug fixing. We define the task of repository-level code search as retrieving the set of files from the current state of a code repository that are most relevant to addressing a user's question or bug. The proposed approach combines BM25-based retrieval over commit messages with neural reranking using CodeBERT to identify the most pertinent files. By learning patterns from diverse repositories and their commit hist"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.07067","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/2502.07067/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T10:12:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I/EB6rbCNxFb2VhzxoelwqJs9srCmKLOKpl9vKMMMS1UbzR++lDUcUmKLzsiqLps4Ec0SksewJ4PtCWL9IbFBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T17:19:48.893659Z"},"content_sha256":"16004aaddfe74e22aabece0329cb5875c56d932d2dbe88f56f05f0053927748e","schema_version":"1.0","event_id":"sha256:16004aaddfe74e22aabece0329cb5875c56d932d2dbe88f56f05f0053927748e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3P4MGOVKN4VUBTNN2CIWW2OK32/bundle.json","state_url":"https://pith.science/pith/3P4MGOVKN4VUBTNN2CIWW2OK32/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3P4MGOVKN4VUBTNN2CIWW2OK32/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-03T17:19:48Z","links":{"resolver":"https://pith.science/pith/3P4MGOVKN4VUBTNN2CIWW2OK32","bundle":"https://pith.science/pith/3P4MGOVKN4VUBTNN2CIWW2OK32/bundle.json","state":"https://pith.science/pith/3P4MGOVKN4VUBTNN2CIWW2OK32/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3P4MGOVKN4VUBTNN2CIWW2OK32/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:3P4MGOVKN4VUBTNN2CIWW2OK32","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"5a264bfea865b25541f2f5280c57cb175107bdbed25ddbacd898ea76e1a9570d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2025-02-10T21:59:01Z","title_canon_sha256":"ed6c1c6ce3e083fb0cd7438d5759a59c5ffd756a901c8e3769469b2538f79770"},"schema_version":"1.0","source":{"id":"2502.07067","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.07067","created_at":"2026-07-05T10:12:31Z"},{"alias_kind":"arxiv_version","alias_value":"2502.07067v1","created_at":"2026-07-05T10:12:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.07067","created_at":"2026-07-05T10:12:31Z"},{"alias_kind":"pith_short_12","alias_value":"3P4MGOVKN4VU","created_at":"2026-07-05T10:12:31Z"},{"alias_kind":"pith_short_16","alias_value":"3P4MGOVKN4VUBTNN","created_at":"2026-07-05T10:12:31Z"},{"alias_kind":"pith_short_8","alias_value":"3P4MGOVK","created_at":"2026-07-05T10:12:31Z"}],"graph_snapshots":[{"event_id":"sha256:16004aaddfe74e22aabece0329cb5875c56d932d2dbe88f56f05f0053927748e","target":"graph","created_at":"2026-07-05T10:12:31Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2502.07067/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper presents a multi-stage reranking system for repository-level code search, which leverages the vastly available commit histories of large open-source repositories to aid in bug fixing. We define the task of repository-level code search as retrieving the set of files from the current state of a code repository that are most relevant to addressing a user's question or bug. The proposed approach combines BM25-based retrieval over commit messages with neural reranking using CodeBERT to identify the most pertinent files. By learning patterns from diverse repositories and their commit hist","authors_text":"Jamie Callan, Luyu Gao, Siddharth Gandhi","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2025-02-10T21:59:01Z","title":"Repository-level Code Search with Neural Retrieval Methods"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.07067","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:fee766eb8b84b1791bee33bba7555d4261aaf624985546a748144121283d363b","target":"record","created_at":"2026-07-05T10:12:31Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"5a264bfea865b25541f2f5280c57cb175107bdbed25ddbacd898ea76e1a9570d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2025-02-10T21:59:01Z","title_canon_sha256":"ed6c1c6ce3e083fb0cd7438d5759a59c5ffd756a901c8e3769469b2538f79770"},"schema_version":"1.0","source":{"id":"2502.07067","kind":"arxiv","version":1}},"canonical_sha256":"dbf8c33aaa6f2b40cdadd0916b69cade8a02b3115e4e961994049b7d186927c0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dbf8c33aaa6f2b40cdadd0916b69cade8a02b3115e4e961994049b7d186927c0","first_computed_at":"2026-07-05T10:12:31.923253Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:12:31.923253Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DuNSxthjaio6AMrw9pDus5KcxluzmaCAD4Hk7Sj0O8Pk3DyQkoSEbGbBIT+SSifzqTneLUuwpSRx2whgQJQKCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:12:31.923685Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.07067","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fee766eb8b84b1791bee33bba7555d4261aaf624985546a748144121283d363b","sha256:16004aaddfe74e22aabece0329cb5875c56d932d2dbe88f56f05f0053927748e"],"state_sha256":"7164e32f71c42063f0c61631867a39d2f4e1d9b05511a90e748801c62d5d29ca"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LCsxUT2OKvxT4L87JMuyWifftLl3/AflZfxVqj/n1/Mav1/F1MZT+lJlGsCX4fyhXVv5e7CPDQWAGHPZpoUTAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T17:19:48.900176Z","bundle_sha256":"8d8fddc0a5273f9435467941f4ae10f0ff01134540eef43bdc7f2600bc01a422"}}