{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:DBJPT6B2O6FTK3IXWJHWN56IPU","short_pith_number":"pith:DBJPT6B2","canonical_record":{"source":{"id":"2605.17279","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2026-05-17T06:21:40Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"4ee047462545419fb480bbfb47f5a7c7b189d0d317a1998c381f9d2595c88a19","abstract_canon_sha256":"f58d77385b95fa9cd072c071d82ee6fb9a971cc184025bc5b32363f4d4df07f2"},"schema_version":"1.0"},"canonical_sha256":"1852f9f83a778b356d17b24f66f7c87d2885c1697d38e2cce01205f46de995d4","source":{"kind":"arxiv","id":"2605.17279","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.17279","created_at":"2026-05-20T00:03:49Z"},{"alias_kind":"arxiv_version","alias_value":"2605.17279v1","created_at":"2026-05-20T00:03:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.17279","created_at":"2026-05-20T00:03:49Z"},{"alias_kind":"pith_short_12","alias_value":"DBJPT6B2O6FT","created_at":"2026-05-20T00:03:49Z"},{"alias_kind":"pith_short_16","alias_value":"DBJPT6B2O6FTK3IX","created_at":"2026-05-20T00:03:49Z"},{"alias_kind":"pith_short_8","alias_value":"DBJPT6B2","created_at":"2026-05-20T00:03:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:DBJPT6B2O6FTK3IXWJHWN56IPU","target":"record","payload":{"canonical_record":{"source":{"id":"2605.17279","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2026-05-17T06:21:40Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"4ee047462545419fb480bbfb47f5a7c7b189d0d317a1998c381f9d2595c88a19","abstract_canon_sha256":"f58d77385b95fa9cd072c071d82ee6fb9a971cc184025bc5b32363f4d4df07f2"},"schema_version":"1.0"},"canonical_sha256":"1852f9f83a778b356d17b24f66f7c87d2885c1697d38e2cce01205f46de995d4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:03:49.466519Z","signature_b64":"mMONr1+no8zRktP30ZPY2VtyJTELTT0c5tM9Gfn0VAxw+wKsjMlTLJJ5cNZO1hVHazOJ4J1Qoix80/K03045AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1852f9f83a778b356d17b24f66f7c87d2885c1697d38e2cce01205f46de995d4","last_reissued_at":"2026-05-20T00:03:49.465711Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:03:49.465711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.17279","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-05-20T00:03:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XvIWvS0Z6pN4kDdAIXQqYZ2KWqCkk23eZGtdMu0UisONvxdZdnZJXQEmMkYN/LYbPFpDcMayUB6DnFyMH+W4Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T17:15:32.808067Z"},"content_sha256":"3c7b7b865dfb1086a29044e04ec83e48221e6fcce044434b5eca95f78cfc441e","schema_version":"1.0","event_id":"sha256:3c7b7b865dfb1086a29044e04ec83e48221e6fcce044434b5eca95f78cfc441e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:DBJPT6B2O6FTK3IXWJHWN56IPU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Rover: Context-aware Conflict Resolution with LLM","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Rover builds multi-layer code graphs so LLMs can resolve merge conflicts more accurately than prior tools or models alone.","cross_cats":["cs.AI"],"primary_cat":"cs.SE","authors_text":"Changhua Luo, Chenxiong Qian, Jiayi Lin, Junzhe Li, Qingyu Zhang","submitted_at":"2026-05-17T06:21:40Z","abstract_excerpt":"Code merging is a significant challenge, particularly in large-scale projects. Existing solutions, including program analysis and machine learning, show promise but face critical limitations. Program analysis lacks the ability to infer developers' intentions, relying on conservative strategies that offload unresolved conflicts for manual handling. Meanwhile, model-based approaches struggle with conflicts involving complex code dependencies due to insufficient contextual awareness. To address these gaps, we introduce Rover, a novel conflict resolution system that integrates program analysis wit"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Evaluation results show that Rover surpasses all of these approaches in terms of conflict resolution, achieving higher similarity to ground-truth resolutions at character, lexical, and semantic levels.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the Multi-layer Code Property Graph plus graph connectivity clustering will reliably produce contexts that allow the LLM to infer developer intentions and generate correct resolutions without introducing new errors or hallucinations.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Rover uses a new Multi-layer Code Property Graph and clustering to supply LLMs with dependency-aware contexts, outperforming standalone LLMs, MergeGen, and WizardMerge on similarity to ground-truth conflict resolutions.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Rover builds multi-layer code graphs so LLMs can resolve merge conflicts more accurately than prior tools or models alone.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"0ea8ce9c87213c5891323e9348d66115a1e60929271d983ce4c48ad82e2cba38"},"source":{"id":"2605.17279","kind":"arxiv","version":1},"verdict":{"id":"f496cecc-b9e7-40ad-a1b2-f94624150eef","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T23:01:10.989483Z","strongest_claim":"Evaluation results show that Rover surpasses all of these approaches in terms of conflict resolution, achieving higher similarity to ground-truth resolutions at character, lexical, and semantic levels.","one_line_summary":"Rover uses a new Multi-layer Code Property Graph and clustering to supply LLMs with dependency-aware contexts, outperforming standalone LLMs, MergeGen, and WizardMerge on similarity to ground-truth conflict resolutions.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the Multi-layer Code Property Graph plus graph connectivity clustering will reliably produce contexts that allow the LLM to infer developer intentions and generate correct resolutions without introducing new errors or hallucinations.","pith_extraction_headline":"Rover builds multi-layer code graphs so LLMs can resolve merge conflicts more accurately than prior tools or models alone."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.17279/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T23:31:20.190599Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T23:13:08.749964Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T22:01:57.828430Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T21:33:23.773360Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"7eb4e13e2b6ee74d4fb97da94fc3336f37caff49c0c75c3736a3e5df4bf63379"},"references":{"count":50,"sample":[{"doi":"","year":2018,"title":"Paola Accioly, Paulo Borba, and Guilherme Cavalcanti. 2018. Understanding semi-structured merge conflict character- istics in open-source java projects.Empirical Software Engineering23 (2018), 2051–20","work_id":"377ccd1d-ecb7-442b-aa9f-4b2bed1f0df2","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"gpt-oss-120b & gpt-oss-20b Model Card","work_id":"178c1f7e-4f19-4392-a45d-45a6dfa88ead","ref_index":2,"cited_arxiv_id":"2508.10925","is_internal_anchor":true},{"doi":"","year":2013,"title":"Mehdi Ahmed-Nacer, Pascal Urso, and François Charoy. 2013. Improving textual merge result. In9th IEEE International Conference on Collaborative Computing: Networking, Applications and Worksharing. IEE","work_id":"28bf93e6-9cee-4fbb-ab65-92bab9ec2a79","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2023,"title":"Waad Aldndni, Na Meng, and Francisco Servant. 2023. Automatic prediction of developers’ resolutions for software merge conflicts.Journal of Systems and Software206 (2023), 111836","work_id":"844fb4f2-d335-45fa-8180-17cd2dee7532","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2012,"title":"Sven Apel, Olaf Leßenich, and Christian Lengauer. 2012. Structured merge with auto-tuning: balancing precision and performance. InProceedings of the 27th IEEE/ACM International Conference on Automated","work_id":"c081fafe-12d8-4666-96c8-54b7d0bacd41","ref_index":6,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":50,"snapshot_sha256":"17dab6aee0bb6cb08d472521aadc2d2487be06ed3bca0d2f6dbcb2f1bc50407a","internal_anchors":5},"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":"f496cecc-b9e7-40ad-a1b2-f94624150eef"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:03:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OUwZ5Xha9agCGO7N0Jj+WW6/3IHlxETRuRe6k1FxT+PZQqi78muWNYXYxdXR0NGFn8eB267PBRPogJYtCsDuCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T17:15:32.808783Z"},"content_sha256":"10f498194002c43272ac8dca54cf50718eaf919085fb916c6afa966a01284063","schema_version":"1.0","event_id":"sha256:10f498194002c43272ac8dca54cf50718eaf919085fb916c6afa966a01284063"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DBJPT6B2O6FTK3IXWJHWN56IPU/bundle.json","state_url":"https://pith.science/pith/DBJPT6B2O6FTK3IXWJHWN56IPU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DBJPT6B2O6FTK3IXWJHWN56IPU/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-05-20T17:15:32Z","links":{"resolver":"https://pith.science/pith/DBJPT6B2O6FTK3IXWJHWN56IPU","bundle":"https://pith.science/pith/DBJPT6B2O6FTK3IXWJHWN56IPU/bundle.json","state":"https://pith.science/pith/DBJPT6B2O6FTK3IXWJHWN56IPU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DBJPT6B2O6FTK3IXWJHWN56IPU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:DBJPT6B2O6FTK3IXWJHWN56IPU","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":"f58d77385b95fa9cd072c071d82ee6fb9a971cc184025bc5b32363f4d4df07f2","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2026-05-17T06:21:40Z","title_canon_sha256":"4ee047462545419fb480bbfb47f5a7c7b189d0d317a1998c381f9d2595c88a19"},"schema_version":"1.0","source":{"id":"2605.17279","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.17279","created_at":"2026-05-20T00:03:49Z"},{"alias_kind":"arxiv_version","alias_value":"2605.17279v1","created_at":"2026-05-20T00:03:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.17279","created_at":"2026-05-20T00:03:49Z"},{"alias_kind":"pith_short_12","alias_value":"DBJPT6B2O6FT","created_at":"2026-05-20T00:03:49Z"},{"alias_kind":"pith_short_16","alias_value":"DBJPT6B2O6FTK3IX","created_at":"2026-05-20T00:03:49Z"},{"alias_kind":"pith_short_8","alias_value":"DBJPT6B2","created_at":"2026-05-20T00:03:49Z"}],"graph_snapshots":[{"event_id":"sha256:10f498194002c43272ac8dca54cf50718eaf919085fb916c6afa966a01284063","target":"graph","created_at":"2026-05-20T00:03:49Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"Evaluation results show that Rover surpasses all of these approaches in terms of conflict resolution, achieving higher similarity to ground-truth resolutions at character, lexical, and semantic levels."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the Multi-layer Code Property Graph plus graph connectivity clustering will reliably produce contexts that allow the LLM to infer developer intentions and generate correct resolutions without introducing new errors or hallucinations."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Rover uses a new Multi-layer Code Property Graph and clustering to supply LLMs with dependency-aware contexts, outperforming standalone LLMs, MergeGen, and WizardMerge on similarity to ground-truth conflict resolutions."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Rover builds multi-layer code graphs so LLMs can resolve merge conflicts more accurately than prior tools or models alone."}],"snapshot_sha256":"0ea8ce9c87213c5891323e9348d66115a1e60929271d983ce4c48ad82e2cba38"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T23:31:20.190599Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T23:13:08.749964Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T22:01:57.828430Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T21:33:23.773360Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.17279/integrity.json","findings":[],"snapshot_sha256":"7eb4e13e2b6ee74d4fb97da94fc3336f37caff49c0c75c3736a3e5df4bf63379","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Code merging is a significant challenge, particularly in large-scale projects. Existing solutions, including program analysis and machine learning, show promise but face critical limitations. Program analysis lacks the ability to infer developers' intentions, relying on conservative strategies that offload unresolved conflicts for manual handling. Meanwhile, model-based approaches struggle with conflicts involving complex code dependencies due to insufficient contextual awareness. To address these gaps, we introduce Rover, a novel conflict resolution system that integrates program analysis wit","authors_text":"Changhua Luo, Chenxiong Qian, Jiayi Lin, Junzhe Li, Qingyu Zhang","cross_cats":["cs.AI"],"headline":"Rover builds multi-layer code graphs so LLMs can resolve merge conflicts more accurately than prior tools or models alone.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2026-05-17T06:21:40Z","title":"Rover: Context-aware Conflict Resolution with LLM"},"references":{"count":50,"internal_anchors":5,"resolved_work":50,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Paola Accioly, Paulo Borba, and Guilherme Cavalcanti. 2018. Understanding semi-structured merge conflict character- istics in open-source java projects.Empirical Software Engineering23 (2018), 2051–20","work_id":"377ccd1d-ecb7-442b-aa9f-4b2bed1f0df2","year":2018},{"cited_arxiv_id":"2508.10925","doi":"","is_internal_anchor":true,"ref_index":2,"title":"gpt-oss-120b & gpt-oss-20b Model Card","work_id":"178c1f7e-4f19-4392-a45d-45a6dfa88ead","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Mehdi Ahmed-Nacer, Pascal Urso, and François Charoy. 2013. Improving textual merge result. In9th IEEE International Conference on Collaborative Computing: Networking, Applications and Worksharing. IEE","work_id":"28bf93e6-9cee-4fbb-ab65-92bab9ec2a79","year":2013},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Waad Aldndni, Na Meng, and Francisco Servant. 2023. Automatic prediction of developers’ resolutions for software merge conflicts.Journal of Systems and Software206 (2023), 111836","work_id":"844fb4f2-d335-45fa-8180-17cd2dee7532","year":2023},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":6,"title":"Sven Apel, Olaf Leßenich, and Christian Lengauer. 2012. Structured merge with auto-tuning: balancing precision and performance. InProceedings of the 27th IEEE/ACM International Conference on Automated","work_id":"c081fafe-12d8-4666-96c8-54b7d0bacd41","year":2012}],"snapshot_sha256":"17dab6aee0bb6cb08d472521aadc2d2487be06ed3bca0d2f6dbcb2f1bc50407a"},"source":{"id":"2605.17279","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T23:01:10.989483Z","id":"f496cecc-b9e7-40ad-a1b2-f94624150eef","model_set":{"reader":"grok-4.3"},"one_line_summary":"Rover uses a new Multi-layer Code Property Graph and clustering to supply LLMs with dependency-aware contexts, outperforming standalone LLMs, MergeGen, and WizardMerge on similarity to ground-truth conflict resolutions.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Rover builds multi-layer code graphs so LLMs can resolve merge conflicts more accurately than prior tools or models alone.","strongest_claim":"Evaluation results show that Rover surpasses all of these approaches in terms of conflict resolution, achieving higher similarity to ground-truth resolutions at character, lexical, and semantic levels.","weakest_assumption":"That the Multi-layer Code Property Graph plus graph connectivity clustering will reliably produce contexts that allow the LLM to infer developer intentions and generate correct resolutions without introducing new errors or hallucinations."}},"verdict_id":"f496cecc-b9e7-40ad-a1b2-f94624150eef"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3c7b7b865dfb1086a29044e04ec83e48221e6fcce044434b5eca95f78cfc441e","target":"record","created_at":"2026-05-20T00:03:49Z","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":"f58d77385b95fa9cd072c071d82ee6fb9a971cc184025bc5b32363f4d4df07f2","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2026-05-17T06:21:40Z","title_canon_sha256":"4ee047462545419fb480bbfb47f5a7c7b189d0d317a1998c381f9d2595c88a19"},"schema_version":"1.0","source":{"id":"2605.17279","kind":"arxiv","version":1}},"canonical_sha256":"1852f9f83a778b356d17b24f66f7c87d2885c1697d38e2cce01205f46de995d4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1852f9f83a778b356d17b24f66f7c87d2885c1697d38e2cce01205f46de995d4","first_computed_at":"2026-05-20T00:03:49.465711Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:03:49.465711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mMONr1+no8zRktP30ZPY2VtyJTELTT0c5tM9Gfn0VAxw+wKsjMlTLJJ5cNZO1hVHazOJ4J1Qoix80/K03045AQ==","signature_status":"signed_v1","signed_at":"2026-05-20T00:03:49.466519Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.17279","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3c7b7b865dfb1086a29044e04ec83e48221e6fcce044434b5eca95f78cfc441e","sha256:10f498194002c43272ac8dca54cf50718eaf919085fb916c6afa966a01284063"],"state_sha256":"60b2a4ff8debfe60976c9e38866d0dfb175ba70ecf25b5e9cf3acee6b199f27e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yQaw4+LDJRRV+VzP4QcLxn25t0lz7R1GCtH2nPP4hoiPDhVkpj66Kalp6BrPbSQZLv6By5crhFwer4Y1O89rDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T17:15:32.812645Z","bundle_sha256":"a28c91193999d3d4e083128529c567eac0ab75cb43bc2238fdd1ca77061b392b"}}