{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:2HIXRMDF3HGZO4JCVLGRTY2J7E","short_pith_number":"pith:2HIXRMDF","canonical_record":{"source":{"id":"1611.00574","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-11-02T12:56:15Z","cross_cats_sorted":["cs.LO","cs.SE"],"title_canon_sha256":"d38eebca5aab7a13b1960ad9f677886e7ead6f28cebea74e1765efc54baa1f7d","abstract_canon_sha256":"c028b6475ddba3c1e0832b90c71d9c72be5d9bda5f19b29d82356d2065926821"},"schema_version":"1.0"},"canonical_sha256":"d1d178b065d9cd977122aacd19e349f90ce986f36dc87aed615051426972699a","source":{"kind":"arxiv","id":"1611.00574","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.00574","created_at":"2026-05-18T00:20:17Z"},{"alias_kind":"arxiv_version","alias_value":"1611.00574v2","created_at":"2026-05-18T00:20:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.00574","created_at":"2026-05-18T00:20:17Z"},{"alias_kind":"pith_short_12","alias_value":"2HIXRMDF3HGZ","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2HIXRMDF3HGZO4JC","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2HIXRMDF","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:2HIXRMDF3HGZO4JCVLGRTY2J7E","target":"record","payload":{"canonical_record":{"source":{"id":"1611.00574","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-11-02T12:56:15Z","cross_cats_sorted":["cs.LO","cs.SE"],"title_canon_sha256":"d38eebca5aab7a13b1960ad9f677886e7ead6f28cebea74e1765efc54baa1f7d","abstract_canon_sha256":"c028b6475ddba3c1e0832b90c71d9c72be5d9bda5f19b29d82356d2065926821"},"schema_version":"1.0"},"canonical_sha256":"d1d178b065d9cd977122aacd19e349f90ce986f36dc87aed615051426972699a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:17.639378Z","signature_b64":"a0ddDTardespEbs6iMMWLUjApIIOS03LM0CLjbkpAPBVc5KExG2pIA4jsG5pAurRS2fZTy2/AiXS8aNN8p7sBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d1d178b065d9cd977122aacd19e349f90ce986f36dc87aed615051426972699a","last_reissued_at":"2026-05-18T00:20:17.638674Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:17.638674Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.00574","source_version":2,"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-18T00:20:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ky7PgCjX/bSKtYjuZExpcgys0qyS1+6n6S+tcazMDG4N1612F3f3uviBvShYXNEYwlCNiD2fNKGpDvX5MBlvCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:19:10.332944Z"},"content_sha256":"64241e765c6a0c95c85d1959f59bf43e436a2024f85e387cd75d848eb94cba65","schema_version":"1.0","event_id":"sha256:64241e765c6a0c95c85d1959f59bf43e436a2024f85e387cd75d848eb94cba65"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:2HIXRMDF3HGZO4JCVLGRTY2J7E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Compositional Reasoning for Shared-variable Concurrent Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO","cs.SE"],"primary_cat":"cs.FL","authors_text":"Alwen Tiu, David Sanan, Fuyuan Zhang, Jun Sun, Shang-Wei Lin, Yang Liu, Yongwang Zhao","submitted_at":"2016-11-02T12:56:15Z","abstract_excerpt":"Scalable and automatic formal verification for concurrent systems is always demanding. In this paper, we propose a verification framework to support automated compositional reasoning for concurrent programs with shared variables. Our framework models concurrent programs as succinct automata and supports the verification of multiple important properties. Safety verification and simulations of succinct automata are parallel compositional, and safety properties of succinct automata are preserved under refinements. We generate succinct automata from infinite state concurrent programs in an automat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.00574","kind":"arxiv","version":2},"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-18T00:20:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"89XPvrP64m6tKAQr+ImJ3zPdzWqZeMg/fFI6sTl/zih8aRF8STeZqbx5I0REyHp4L+vPfVIfqaU1RNz9iAOBBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:19:10.333543Z"},"content_sha256":"149010e2a527d319c4161110b82f1455b72fbaa8e804dbe550401b23ea6f0e4c","schema_version":"1.0","event_id":"sha256:149010e2a527d319c4161110b82f1455b72fbaa8e804dbe550401b23ea6f0e4c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2HIXRMDF3HGZO4JCVLGRTY2J7E/bundle.json","state_url":"https://pith.science/pith/2HIXRMDF3HGZO4JCVLGRTY2J7E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2HIXRMDF3HGZO4JCVLGRTY2J7E/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-26T15:19:10Z","links":{"resolver":"https://pith.science/pith/2HIXRMDF3HGZO4JCVLGRTY2J7E","bundle":"https://pith.science/pith/2HIXRMDF3HGZO4JCVLGRTY2J7E/bundle.json","state":"https://pith.science/pith/2HIXRMDF3HGZO4JCVLGRTY2J7E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2HIXRMDF3HGZO4JCVLGRTY2J7E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:2HIXRMDF3HGZO4JCVLGRTY2J7E","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":"c028b6475ddba3c1e0832b90c71d9c72be5d9bda5f19b29d82356d2065926821","cross_cats_sorted":["cs.LO","cs.SE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-11-02T12:56:15Z","title_canon_sha256":"d38eebca5aab7a13b1960ad9f677886e7ead6f28cebea74e1765efc54baa1f7d"},"schema_version":"1.0","source":{"id":"1611.00574","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.00574","created_at":"2026-05-18T00:20:17Z"},{"alias_kind":"arxiv_version","alias_value":"1611.00574v2","created_at":"2026-05-18T00:20:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.00574","created_at":"2026-05-18T00:20:17Z"},{"alias_kind":"pith_short_12","alias_value":"2HIXRMDF3HGZ","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2HIXRMDF3HGZO4JC","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2HIXRMDF","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:149010e2a527d319c4161110b82f1455b72fbaa8e804dbe550401b23ea6f0e4c","target":"graph","created_at":"2026-05-18T00:20:17Z","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":"Scalable and automatic formal verification for concurrent systems is always demanding. In this paper, we propose a verification framework to support automated compositional reasoning for concurrent programs with shared variables. Our framework models concurrent programs as succinct automata and supports the verification of multiple important properties. Safety verification and simulations of succinct automata are parallel compositional, and safety properties of succinct automata are preserved under refinements. We generate succinct automata from infinite state concurrent programs in an automat","authors_text":"Alwen Tiu, David Sanan, Fuyuan Zhang, Jun Sun, Shang-Wei Lin, Yang Liu, Yongwang Zhao","cross_cats":["cs.LO","cs.SE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-11-02T12:56:15Z","title":"Compositional Reasoning for Shared-variable Concurrent Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.00574","kind":"arxiv","version":2},"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:64241e765c6a0c95c85d1959f59bf43e436a2024f85e387cd75d848eb94cba65","target":"record","created_at":"2026-05-18T00:20:17Z","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":"c028b6475ddba3c1e0832b90c71d9c72be5d9bda5f19b29d82356d2065926821","cross_cats_sorted":["cs.LO","cs.SE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-11-02T12:56:15Z","title_canon_sha256":"d38eebca5aab7a13b1960ad9f677886e7ead6f28cebea74e1765efc54baa1f7d"},"schema_version":"1.0","source":{"id":"1611.00574","kind":"arxiv","version":2}},"canonical_sha256":"d1d178b065d9cd977122aacd19e349f90ce986f36dc87aed615051426972699a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d1d178b065d9cd977122aacd19e349f90ce986f36dc87aed615051426972699a","first_computed_at":"2026-05-18T00:20:17.638674Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:17.638674Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"a0ddDTardespEbs6iMMWLUjApIIOS03LM0CLjbkpAPBVc5KExG2pIA4jsG5pAurRS2fZTy2/AiXS8aNN8p7sBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:17.639378Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.00574","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:64241e765c6a0c95c85d1959f59bf43e436a2024f85e387cd75d848eb94cba65","sha256:149010e2a527d319c4161110b82f1455b72fbaa8e804dbe550401b23ea6f0e4c"],"state_sha256":"e08d8aa3731ecf635913fab6a260171c5164a3c7056b76e3a1787f9d4d227b8f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ahJv8Y1EovXn/MAidraziWu9uW8hcxEJ0mWoGBTA/oj4ft6GgzA9cf0VsOMRjDtarDez8KXxI9Yq09i9JO0mAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T15:19:10.336174Z","bundle_sha256":"a60be3c64e948a528820fe014a63b4cb74dd2280fe6a7c4db88610fffbdac859"}}