{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:6UUH4II3KYRI3E6477DALKCOQR","short_pith_number":"pith:6UUH4II3","canonical_record":{"source":{"id":"1304.1185","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-04-03T20:56:20Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"24c18e41035a161c9421ea2f09e92591155877869464c23a4e21fddff4a79226","abstract_canon_sha256":"17dc9ffbd3a1660703ae8d6179f87a72b703b4da0147d3308c29637d7d16e3ad"},"schema_version":"1.0"},"canonical_sha256":"f5287e211b56228d93dcffc605a84e846220fdbb45e412570c5090d3174ab85f","source":{"kind":"arxiv","id":"1304.1185","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.1185","created_at":"2026-05-18T02:03:45Z"},{"alias_kind":"arxiv_version","alias_value":"1304.1185v2","created_at":"2026-05-18T02:03:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.1185","created_at":"2026-05-18T02:03:45Z"},{"alias_kind":"pith_short_12","alias_value":"6UUH4II3KYRI","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6UUH4II3KYRI3E64","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6UUH4II3","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:6UUH4II3KYRI3E6477DALKCOQR","target":"record","payload":{"canonical_record":{"source":{"id":"1304.1185","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-04-03T20:56:20Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"24c18e41035a161c9421ea2f09e92591155877869464c23a4e21fddff4a79226","abstract_canon_sha256":"17dc9ffbd3a1660703ae8d6179f87a72b703b4da0147d3308c29637d7d16e3ad"},"schema_version":"1.0"},"canonical_sha256":"f5287e211b56228d93dcffc605a84e846220fdbb45e412570c5090d3174ab85f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:03:45.505939Z","signature_b64":"pBr76zqRHTTk4ZN6T7QxoC6VZs96zZgKQTdF6TkiY5IPrfpGJ/cQkTA/HxZIkNgWvG+yOnz/r9TwwOzTH37TAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f5287e211b56228d93dcffc605a84e846220fdbb45e412570c5090d3174ab85f","last_reissued_at":"2026-05-18T02:03:45.505513Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:03:45.505513Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.1185","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-18T02:03:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lyRGW2AWValupoICX5Jg//UajAekjjA4yqSm7GdJg93dDoTWefrhSqTYMQ5Dml0kLC6e/Wy412QGXe9DzUHpBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T21:08:11.644117Z"},"content_sha256":"7a4313a38f564d5eb84d3d3c338155785897552c251ad2703d08802ce0e9ff88","schema_version":"1.0","event_id":"sha256:7a4313a38f564d5eb84d3d3c338155785897552c251ad2703d08802ce0e9ff88"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:6UUH4II3KYRI3E6477DALKCOQR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parameterized Verification of Asynchronous Shared-Memory Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"Javier Esparza, Pierre Ganty, Rupak Majumdar","submitted_at":"2013-04-03T20:56:20Z","abstract_excerpt":"We characterize the complexity of the safety verification problem for parameterized systems consisting of a leader process and arbitrarily many anonymous and identical contributors. Processes communicate through a shared, bounded-value register. While each operation on the register is atomic, there is no synchronization primitive to execute a sequence of operations atomically. We analyze the complexity of the safety verification problem when processes are modeled by finite-state machines, pushdown machines, and Turing machines. The problem is coNP-complete when all processes are finite-state m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.1185","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-18T02:03:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TA8VyTnCFpMFMmAjfVrCi1poyLWPo5E36wAPcpi9VmQvMSVV/COTd2Y5TnT4pWd0L3AjKiov947KmOp5B3D1CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T21:08:11.644848Z"},"content_sha256":"258e25d93cf76852d01e04350b3832ebcb3ae2c5c3f36cbd6488b77a92e4b89f","schema_version":"1.0","event_id":"sha256:258e25d93cf76852d01e04350b3832ebcb3ae2c5c3f36cbd6488b77a92e4b89f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6UUH4II3KYRI3E6477DALKCOQR/bundle.json","state_url":"https://pith.science/pith/6UUH4II3KYRI3E6477DALKCOQR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6UUH4II3KYRI3E6477DALKCOQR/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-06-07T21:08:11Z","links":{"resolver":"https://pith.science/pith/6UUH4II3KYRI3E6477DALKCOQR","bundle":"https://pith.science/pith/6UUH4II3KYRI3E6477DALKCOQR/bundle.json","state":"https://pith.science/pith/6UUH4II3KYRI3E6477DALKCOQR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6UUH4II3KYRI3E6477DALKCOQR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:6UUH4II3KYRI3E6477DALKCOQR","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":"17dc9ffbd3a1660703ae8d6179f87a72b703b4da0147d3308c29637d7d16e3ad","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-04-03T20:56:20Z","title_canon_sha256":"24c18e41035a161c9421ea2f09e92591155877869464c23a4e21fddff4a79226"},"schema_version":"1.0","source":{"id":"1304.1185","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.1185","created_at":"2026-05-18T02:03:45Z"},{"alias_kind":"arxiv_version","alias_value":"1304.1185v2","created_at":"2026-05-18T02:03:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.1185","created_at":"2026-05-18T02:03:45Z"},{"alias_kind":"pith_short_12","alias_value":"6UUH4II3KYRI","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6UUH4II3KYRI3E64","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6UUH4II3","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:258e25d93cf76852d01e04350b3832ebcb3ae2c5c3f36cbd6488b77a92e4b89f","target":"graph","created_at":"2026-05-18T02:03:45Z","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":"We characterize the complexity of the safety verification problem for parameterized systems consisting of a leader process and arbitrarily many anonymous and identical contributors. Processes communicate through a shared, bounded-value register. While each operation on the register is atomic, there is no synchronization primitive to execute a sequence of operations atomically. We analyze the complexity of the safety verification problem when processes are modeled by finite-state machines, pushdown machines, and Turing machines. The problem is coNP-complete when all processes are finite-state m","authors_text":"Javier Esparza, Pierre Ganty, Rupak Majumdar","cross_cats":["cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-04-03T20:56:20Z","title":"Parameterized Verification of Asynchronous Shared-Memory Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.1185","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:7a4313a38f564d5eb84d3d3c338155785897552c251ad2703d08802ce0e9ff88","target":"record","created_at":"2026-05-18T02:03:45Z","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":"17dc9ffbd3a1660703ae8d6179f87a72b703b4da0147d3308c29637d7d16e3ad","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-04-03T20:56:20Z","title_canon_sha256":"24c18e41035a161c9421ea2f09e92591155877869464c23a4e21fddff4a79226"},"schema_version":"1.0","source":{"id":"1304.1185","kind":"arxiv","version":2}},"canonical_sha256":"f5287e211b56228d93dcffc605a84e846220fdbb45e412570c5090d3174ab85f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f5287e211b56228d93dcffc605a84e846220fdbb45e412570c5090d3174ab85f","first_computed_at":"2026-05-18T02:03:45.505513Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:03:45.505513Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pBr76zqRHTTk4ZN6T7QxoC6VZs96zZgKQTdF6TkiY5IPrfpGJ/cQkTA/HxZIkNgWvG+yOnz/r9TwwOzTH37TAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:03:45.505939Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.1185","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7a4313a38f564d5eb84d3d3c338155785897552c251ad2703d08802ce0e9ff88","sha256:258e25d93cf76852d01e04350b3832ebcb3ae2c5c3f36cbd6488b77a92e4b89f"],"state_sha256":"e2aec776b9cd5aae7b11c69c4c94118cd53ab321a54f0aa4f26f7d49c31391ae"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9K5P6BuliXFMW8Q3al5zQLf9bfMeLTe5OfF2EFISk0+k5OEKd2f4uQwsK4TamhE/SZnHkmIBSyJzbka6EPwSBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T21:08:11.648858Z","bundle_sha256":"776c27bedebfd6fd6db6fa97c60dda18ff854bba56cac6af87353ed095a9c03f"}}