{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:TUEBQUCAQUMT24O5QMIFOJ7RPB","short_pith_number":"pith:TUEBQUCA","schema_version":"1.0","canonical_sha256":"9d0818504085193d71dd83105727f17871ebe49e03ed8d886e42622047cfc5e9","source":{"kind":"arxiv","id":"1802.06551","version":1},"attestation_state":"computed","paper":{"title":"Verifying Semantic Conflict-Freedom in Three-Way Program Merges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Isil Dillig, Marcelo Sousa, Shuvendu Lahiri","submitted_at":"2018-02-19T08:51:38Z","abstract_excerpt":"Even though many programmers rely on 3-way merge tools to integrate changes from different branches, such tools can introduce subtle bugs in the integration process. This paper aims to mitigate this problem by defining a semantic notion of confict-freedom, which ensures that the merged program does not introduce new unwanted behaviors. We also show how to verify this property using a novel, compositional algorithm that combines lightweight dependence analysis for shared program fragments and precise relational reasoning for the modifications. We evaluate our tool called SafeMerge on 52 real-wo"},"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":"1802.06551","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-02-19T08:51:38Z","cross_cats_sorted":[],"title_canon_sha256":"f04172452d970630b611403e026670fa6faeab6345d054e744c976dfce17e2f2","abstract_canon_sha256":"0eae6ee3b981b261c7a4ecc291dee12b6a176be8e0b8d5b040fad0bf6a5d45d8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:02.969129Z","signature_b64":"+f2dXyeouOnwvogVAT5EmgLhArCf4SMfZLZbvp7ptD3sGxOPMWNfahDgja1JGxImr76e2C0TRuSn8qSoYXO8CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d0818504085193d71dd83105727f17871ebe49e03ed8d886e42622047cfc5e9","last_reissued_at":"2026-05-18T00:23:02.968479Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:02.968479Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Verifying Semantic Conflict-Freedom in Three-Way Program Merges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Isil Dillig, Marcelo Sousa, Shuvendu Lahiri","submitted_at":"2018-02-19T08:51:38Z","abstract_excerpt":"Even though many programmers rely on 3-way merge tools to integrate changes from different branches, such tools can introduce subtle bugs in the integration process. This paper aims to mitigate this problem by defining a semantic notion of confict-freedom, which ensures that the merged program does not introduce new unwanted behaviors. We also show how to verify this property using a novel, compositional algorithm that combines lightweight dependence analysis for shared program fragments and precise relational reasoning for the modifications. We evaluate our tool called SafeMerge on 52 real-wo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06551","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":""},"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":"1802.06551","created_at":"2026-05-18T00:23:02.968597+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.06551v1","created_at":"2026-05-18T00:23:02.968597+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06551","created_at":"2026-05-18T00:23:02.968597+00:00"},{"alias_kind":"pith_short_12","alias_value":"TUEBQUCAQUMT","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"TUEBQUCAQUMT24O5","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"TUEBQUCA","created_at":"2026-05-18T12:32:56.356000+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.00041","citing_title":"ATM: CID-Brokered Pre-Write Admission for Multi-Agent Code Co-Synthesis","ref_index":40,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TUEBQUCAQUMT24O5QMIFOJ7RPB","json":"https://pith.science/pith/TUEBQUCAQUMT24O5QMIFOJ7RPB.json","graph_json":"https://pith.science/api/pith-number/TUEBQUCAQUMT24O5QMIFOJ7RPB/graph.json","events_json":"https://pith.science/api/pith-number/TUEBQUCAQUMT24O5QMIFOJ7RPB/events.json","paper":"https://pith.science/paper/TUEBQUCA"},"agent_actions":{"view_html":"https://pith.science/pith/TUEBQUCAQUMT24O5QMIFOJ7RPB","download_json":"https://pith.science/pith/TUEBQUCAQUMT24O5QMIFOJ7RPB.json","view_paper":"https://pith.science/paper/TUEBQUCA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.06551&json=true","fetch_graph":"https://pith.science/api/pith-number/TUEBQUCAQUMT24O5QMIFOJ7RPB/graph.json","fetch_events":"https://pith.science/api/pith-number/TUEBQUCAQUMT24O5QMIFOJ7RPB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TUEBQUCAQUMT24O5QMIFOJ7RPB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TUEBQUCAQUMT24O5QMIFOJ7RPB/action/storage_attestation","attest_author":"https://pith.science/pith/TUEBQUCAQUMT24O5QMIFOJ7RPB/action/author_attestation","sign_citation":"https://pith.science/pith/TUEBQUCAQUMT24O5QMIFOJ7RPB/action/citation_signature","submit_replication":"https://pith.science/pith/TUEBQUCAQUMT24O5QMIFOJ7RPB/action/replication_record"}},"created_at":"2026-05-18T00:23:02.968597+00:00","updated_at":"2026-05-18T00:23:02.968597+00:00"}