{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ICF7DDAVFSXI6OXOPAXF7AWXH2","short_pith_number":"pith:ICF7DDAV","schema_version":"1.0","canonical_sha256":"408bf18c152cae8f3aee782e5f82d73eb5943ed336cca2e85024846420d7ffb3","source":{"kind":"arxiv","id":"1506.07635","version":3},"attestation_state":"computed","paper":{"title":"From Traces To Proofs: Proving Concurrent Program Safe","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SE"],"primary_cat":"cs.PL","authors_text":"Chinmay Narayan, S.Arun-Kumar, Shibashis Guha, Subodh Sharma","submitted_at":"2015-06-25T06:56:00Z","abstract_excerpt":"Nondeterminism in scheduling is the cardinal reason for difficulty in proving correctness of concurrent programs. A powerful proof strategy was recently proposed [6] to show the correctness of such programs. The approach captured data-flow dependencies among the instructions of an interleaved and error-free execution of threads. These data-flow dependencies were represented by an inductive data-flow graph (iDFG), which, in a nutshell, denotes a set of executions of the concurrent program that gave rise to the discovered data-flow dependencies. The iDFGs were further transformed in to alternati"},"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":"1506.07635","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-06-25T06:56:00Z","cross_cats_sorted":["cs.SE"],"title_canon_sha256":"00bba70d1f37699e7781499897480534352c7606512713dfeaad0e467d6fb2a7","abstract_canon_sha256":"754c0128767a93b6ac970724ac526fc2fcbef5a2323616e4ec72db2dbf5b9005"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:07.189978Z","signature_b64":"q2TBozTVasySk1IgaStztwoAwVnLAVvHH7/KmvboAH4jwlCIT+DUf3/B2BaR6vtiMRLrEujfDl2n+/Sl1oXUCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"408bf18c152cae8f3aee782e5f82d73eb5943ed336cca2e85024846420d7ffb3","last_reissued_at":"2026-05-18T01:16:07.189423Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:07.189423Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"From Traces To Proofs: Proving Concurrent Program Safe","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SE"],"primary_cat":"cs.PL","authors_text":"Chinmay Narayan, S.Arun-Kumar, Shibashis Guha, Subodh Sharma","submitted_at":"2015-06-25T06:56:00Z","abstract_excerpt":"Nondeterminism in scheduling is the cardinal reason for difficulty in proving correctness of concurrent programs. A powerful proof strategy was recently proposed [6] to show the correctness of such programs. The approach captured data-flow dependencies among the instructions of an interleaved and error-free execution of threads. These data-flow dependencies were represented by an inductive data-flow graph (iDFG), which, in a nutshell, denotes a set of executions of the concurrent program that gave rise to the discovered data-flow dependencies. The iDFGs were further transformed in to alternati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.07635","kind":"arxiv","version":3},"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":"1506.07635","created_at":"2026-05-18T01:16:07.189511+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.07635v3","created_at":"2026-05-18T01:16:07.189511+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.07635","created_at":"2026-05-18T01:16:07.189511+00:00"},{"alias_kind":"pith_short_12","alias_value":"ICF7DDAVFSXI","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"ICF7DDAVFSXI6OXO","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"ICF7DDAV","created_at":"2026-05-18T12:29:25.134429+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/ICF7DDAVFSXI6OXOPAXF7AWXH2","json":"https://pith.science/pith/ICF7DDAVFSXI6OXOPAXF7AWXH2.json","graph_json":"https://pith.science/api/pith-number/ICF7DDAVFSXI6OXOPAXF7AWXH2/graph.json","events_json":"https://pith.science/api/pith-number/ICF7DDAVFSXI6OXOPAXF7AWXH2/events.json","paper":"https://pith.science/paper/ICF7DDAV"},"agent_actions":{"view_html":"https://pith.science/pith/ICF7DDAVFSXI6OXOPAXF7AWXH2","download_json":"https://pith.science/pith/ICF7DDAVFSXI6OXOPAXF7AWXH2.json","view_paper":"https://pith.science/paper/ICF7DDAV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.07635&json=true","fetch_graph":"https://pith.science/api/pith-number/ICF7DDAVFSXI6OXOPAXF7AWXH2/graph.json","fetch_events":"https://pith.science/api/pith-number/ICF7DDAVFSXI6OXOPAXF7AWXH2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ICF7DDAVFSXI6OXOPAXF7AWXH2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ICF7DDAVFSXI6OXOPAXF7AWXH2/action/storage_attestation","attest_author":"https://pith.science/pith/ICF7DDAVFSXI6OXOPAXF7AWXH2/action/author_attestation","sign_citation":"https://pith.science/pith/ICF7DDAVFSXI6OXOPAXF7AWXH2/action/citation_signature","submit_replication":"https://pith.science/pith/ICF7DDAVFSXI6OXOPAXF7AWXH2/action/replication_record"}},"created_at":"2026-05-18T01:16:07.189511+00:00","updated_at":"2026-05-18T01:16:07.189511+00:00"}