{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ICF7DDAVFSXI6OXOPAXF7AWXH2","short_pith_number":"pith:ICF7DDAV","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"},"canonical_sha256":"408bf18c152cae8f3aee782e5f82d73eb5943ed336cca2e85024846420d7ffb3","source":{"kind":"arxiv","id":"1506.07635","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.07635","created_at":"2026-05-18T01:16:07Z"},{"alias_kind":"arxiv_version","alias_value":"1506.07635v3","created_at":"2026-05-18T01:16:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.07635","created_at":"2026-05-18T01:16:07Z"},{"alias_kind":"pith_short_12","alias_value":"ICF7DDAVFSXI","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"ICF7DDAVFSXI6OXO","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"ICF7DDAV","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ICF7DDAVFSXI6OXOPAXF7AWXH2","target":"record","payload":{"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"},"canonical_sha256":"408bf18c152cae8f3aee782e5f82d73eb5943ed336cca2e85024846420d7ffb3","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"},"source_kind":"arxiv","source_id":"1506.07635","source_version":3,"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-18T01:16:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mhHfEl1XAXvnmDdr8vO4KhsMqF5rDRLSn1QL3bycGRZXzEwVwoLdp7LBlAq1ZZNjQ4bHurqiawzPfUS1sOKHDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T16:11:09.647622Z"},"content_sha256":"8a0eea3693fba05250ef27bc2d5f3fc70911e21b23888f2d6ffe4a04e86cca4b","schema_version":"1.0","event_id":"sha256:8a0eea3693fba05250ef27bc2d5f3fc70911e21b23888f2d6ffe4a04e86cca4b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ICF7DDAVFSXI6OXOPAXF7AWXH2","target":"graph","payload":{"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"},"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-05-18T01:16:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SFVRRKyx0geZ4nw2g+7YvfwPoRUPoG3rninwzo5bjnPwoaMFg9jxAmZt3BdxW9+vP9bMvSEPhQqwkL0GJx6HBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T16:11:09.647983Z"},"content_sha256":"d2c6e1808adbd8f0b984c693dadeed7c62e7df98a37270e3dbef25f4e0efbd0e","schema_version":"1.0","event_id":"sha256:d2c6e1808adbd8f0b984c693dadeed7c62e7df98a37270e3dbef25f4e0efbd0e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ICF7DDAVFSXI6OXOPAXF7AWXH2/bundle.json","state_url":"https://pith.science/pith/ICF7DDAVFSXI6OXOPAXF7AWXH2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ICF7DDAVFSXI6OXOPAXF7AWXH2/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-21T16:11:09Z","links":{"resolver":"https://pith.science/pith/ICF7DDAVFSXI6OXOPAXF7AWXH2","bundle":"https://pith.science/pith/ICF7DDAVFSXI6OXOPAXF7AWXH2/bundle.json","state":"https://pith.science/pith/ICF7DDAVFSXI6OXOPAXF7AWXH2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ICF7DDAVFSXI6OXOPAXF7AWXH2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ICF7DDAVFSXI6OXOPAXF7AWXH2","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":"754c0128767a93b6ac970724ac526fc2fcbef5a2323616e4ec72db2dbf5b9005","cross_cats_sorted":["cs.SE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-06-25T06:56:00Z","title_canon_sha256":"00bba70d1f37699e7781499897480534352c7606512713dfeaad0e467d6fb2a7"},"schema_version":"1.0","source":{"id":"1506.07635","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.07635","created_at":"2026-05-18T01:16:07Z"},{"alias_kind":"arxiv_version","alias_value":"1506.07635v3","created_at":"2026-05-18T01:16:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.07635","created_at":"2026-05-18T01:16:07Z"},{"alias_kind":"pith_short_12","alias_value":"ICF7DDAVFSXI","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"ICF7DDAVFSXI6OXO","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"ICF7DDAV","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:d2c6e1808adbd8f0b984c693dadeed7c62e7df98a37270e3dbef25f4e0efbd0e","target":"graph","created_at":"2026-05-18T01:16:07Z","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"},"paper":{"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","authors_text":"Chinmay Narayan, S.Arun-Kumar, Shibashis Guha, Subodh Sharma","cross_cats":["cs.SE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-06-25T06:56:00Z","title":"From Traces To Proofs: Proving Concurrent Program Safe"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.07635","kind":"arxiv","version":3},"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:8a0eea3693fba05250ef27bc2d5f3fc70911e21b23888f2d6ffe4a04e86cca4b","target":"record","created_at":"2026-05-18T01:16:07Z","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":"754c0128767a93b6ac970724ac526fc2fcbef5a2323616e4ec72db2dbf5b9005","cross_cats_sorted":["cs.SE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-06-25T06:56:00Z","title_canon_sha256":"00bba70d1f37699e7781499897480534352c7606512713dfeaad0e467d6fb2a7"},"schema_version":"1.0","source":{"id":"1506.07635","kind":"arxiv","version":3}},"canonical_sha256":"408bf18c152cae8f3aee782e5f82d73eb5943ed336cca2e85024846420d7ffb3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"408bf18c152cae8f3aee782e5f82d73eb5943ed336cca2e85024846420d7ffb3","first_computed_at":"2026-05-18T01:16:07.189423Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:07.189423Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"q2TBozTVasySk1IgaStztwoAwVnLAVvHH7/KmvboAH4jwlCIT+DUf3/B2BaR6vtiMRLrEujfDl2n+/Sl1oXUCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:07.189978Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.07635","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8a0eea3693fba05250ef27bc2d5f3fc70911e21b23888f2d6ffe4a04e86cca4b","sha256:d2c6e1808adbd8f0b984c693dadeed7c62e7df98a37270e3dbef25f4e0efbd0e"],"state_sha256":"715b260a8ab2ab5c5e59cf530b49c7e2135278beda5b28b558827f74ee1cb5d4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uvs73RKv9WLBCVZy+toDhQiFv06FBaJxiliCF4fNMDjziv9gGcyIBXjXm2LLljVU7E1oPGR6ywr/HFol/HFKBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T16:11:09.650764Z","bundle_sha256":"09c4ee74f41bdcc350eaf438aff2659d27e79c55a4db1227780ec6c628edad73"}}