{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:MSZNOQR4EPHKJADK3L5OLKHAQE","short_pith_number":"pith:MSZNOQR4","canonical_record":{"source":{"id":"0801.0677","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.LO","submitted_at":"2008-01-04T13:14:31Z","cross_cats_sorted":[],"title_canon_sha256":"8ea07885f20beb30fe8eed6361fa4f38c5190e473ab6fd829a809b3c9f32557e","abstract_canon_sha256":"80d1d8ae6e0270cd129612be4dcdabcc33819d2df6baab8d140171c38a11b0e6"},"schema_version":"1.0"},"canonical_sha256":"64b2d7423c23cea4806adafae5a8e0811d95442a85cbcac6571f8cf99e8fc093","source":{"kind":"arxiv","id":"0801.0677","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0801.0677","created_at":"2026-07-04T15:06:38Z"},{"alias_kind":"arxiv_version","alias_value":"0801.0677v1","created_at":"2026-07-04T15:06:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0801.0677","created_at":"2026-07-04T15:06:38Z"},{"alias_kind":"pith_short_12","alias_value":"MSZNOQR4EPHK","created_at":"2026-07-04T15:06:38Z"},{"alias_kind":"pith_short_16","alias_value":"MSZNOQR4EPHKJADK","created_at":"2026-07-04T15:06:38Z"},{"alias_kind":"pith_short_8","alias_value":"MSZNOQR4","created_at":"2026-07-04T15:06:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:MSZNOQR4EPHKJADK3L5OLKHAQE","target":"record","payload":{"canonical_record":{"source":{"id":"0801.0677","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.LO","submitted_at":"2008-01-04T13:14:31Z","cross_cats_sorted":[],"title_canon_sha256":"8ea07885f20beb30fe8eed6361fa4f38c5190e473ab6fd829a809b3c9f32557e","abstract_canon_sha256":"80d1d8ae6e0270cd129612be4dcdabcc33819d2df6baab8d140171c38a11b0e6"},"schema_version":"1.0"},"canonical_sha256":"64b2d7423c23cea4806adafae5a8e0811d95442a85cbcac6571f8cf99e8fc093","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:06:38.011296Z","signature_b64":"xx0Sb35I0SDZEpJLusqUAGynT9tirsBE3ObbKFtyyl7vJ8CQfXc4VcyIB/+KeeylwEiSrZMxk0rzyFv+Ut6IDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64b2d7423c23cea4806adafae5a8e0811d95442a85cbcac6571f8cf99e8fc093","last_reissued_at":"2026-07-04T15:06:38.010928Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:06:38.010928Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0801.0677","source_version":1,"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-07-04T15:06:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IJwSJcRwMVXrjq2q6KGWYrVS7hnUyNvzBpX4nVAK3D6sEWYHdLMjuar8uql3hOHczC8/mvcO/1QLyAR6w0p1Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T12:34:13.692948Z"},"content_sha256":"168c5f7f607127b0c1a6b85503e685cd7f3d0f1d60187a69f88772ca02fb4007","schema_version":"1.0","event_id":"sha256:168c5f7f607127b0c1a6b85503e685cd7f3d0f1d60187a69f88772ca02fb4007"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:MSZNOQR4EPHKJADK3L5OLKHAQE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finite-state concurrent programs can be expressed pairwise","license":"","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Paul C. Attie","submitted_at":"2008-01-04T13:14:31Z","abstract_excerpt":"We present a \\emph{pairwise normal form} for finite-state shared memory concurrent programs: all variables are shared between exactly two processes, and the guards on transitions are conjunctions of conditions over this pairwise shared state. This representation has been used to efficiently (in polynomial time) synthesize and model-check correctness properties of concurrent programs. Our main result is that any finite state concurrent program can be transformed into pairwise normal form. Specifically, if $Q$ is an arbitrary finite-state shared memory concurrent program, then there exists a fin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0801.0677","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/0801.0677/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T15:06:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lbGJhQNj3dppvEwKD34VVZU9q5XzRGR4CBGxMmrzZIgyfkhZ1BKP3ZsIAAzFEeM3G5iDHvBulI2ihy1hCf0uDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T12:34:13.693341Z"},"content_sha256":"756ecd30b6fd15a021b22f87ea174853465184060e2f7ee9daf04b997e3dd74d","schema_version":"1.0","event_id":"sha256:756ecd30b6fd15a021b22f87ea174853465184060e2f7ee9daf04b997e3dd74d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MSZNOQR4EPHKJADK3L5OLKHAQE/bundle.json","state_url":"https://pith.science/pith/MSZNOQR4EPHKJADK3L5OLKHAQE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MSZNOQR4EPHKJADK3L5OLKHAQE/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-07-05T12:34:13Z","links":{"resolver":"https://pith.science/pith/MSZNOQR4EPHKJADK3L5OLKHAQE","bundle":"https://pith.science/pith/MSZNOQR4EPHKJADK3L5OLKHAQE/bundle.json","state":"https://pith.science/pith/MSZNOQR4EPHKJADK3L5OLKHAQE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MSZNOQR4EPHKJADK3L5OLKHAQE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:MSZNOQR4EPHKJADK3L5OLKHAQE","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":"80d1d8ae6e0270cd129612be4dcdabcc33819d2df6baab8d140171c38a11b0e6","cross_cats_sorted":[],"license":"","primary_cat":"cs.LO","submitted_at":"2008-01-04T13:14:31Z","title_canon_sha256":"8ea07885f20beb30fe8eed6361fa4f38c5190e473ab6fd829a809b3c9f32557e"},"schema_version":"1.0","source":{"id":"0801.0677","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0801.0677","created_at":"2026-07-04T15:06:38Z"},{"alias_kind":"arxiv_version","alias_value":"0801.0677v1","created_at":"2026-07-04T15:06:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0801.0677","created_at":"2026-07-04T15:06:38Z"},{"alias_kind":"pith_short_12","alias_value":"MSZNOQR4EPHK","created_at":"2026-07-04T15:06:38Z"},{"alias_kind":"pith_short_16","alias_value":"MSZNOQR4EPHKJADK","created_at":"2026-07-04T15:06:38Z"},{"alias_kind":"pith_short_8","alias_value":"MSZNOQR4","created_at":"2026-07-04T15:06:38Z"}],"graph_snapshots":[{"event_id":"sha256:756ecd30b6fd15a021b22f87ea174853465184060e2f7ee9daf04b997e3dd74d","target":"graph","created_at":"2026-07-04T15:06:38Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/0801.0677/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present a \\emph{pairwise normal form} for finite-state shared memory concurrent programs: all variables are shared between exactly two processes, and the guards on transitions are conjunctions of conditions over this pairwise shared state. This representation has been used to efficiently (in polynomial time) synthesize and model-check correctness properties of concurrent programs. Our main result is that any finite state concurrent program can be transformed into pairwise normal form. Specifically, if $Q$ is an arbitrary finite-state shared memory concurrent program, then there exists a fin","authors_text":"Paul C. Attie","cross_cats":[],"headline":"","license":"","primary_cat":"cs.LO","submitted_at":"2008-01-04T13:14:31Z","title":"Finite-state concurrent programs can be expressed pairwise"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0801.0677","kind":"arxiv","version":1},"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:168c5f7f607127b0c1a6b85503e685cd7f3d0f1d60187a69f88772ca02fb4007","target":"record","created_at":"2026-07-04T15:06:38Z","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":"80d1d8ae6e0270cd129612be4dcdabcc33819d2df6baab8d140171c38a11b0e6","cross_cats_sorted":[],"license":"","primary_cat":"cs.LO","submitted_at":"2008-01-04T13:14:31Z","title_canon_sha256":"8ea07885f20beb30fe8eed6361fa4f38c5190e473ab6fd829a809b3c9f32557e"},"schema_version":"1.0","source":{"id":"0801.0677","kind":"arxiv","version":1}},"canonical_sha256":"64b2d7423c23cea4806adafae5a8e0811d95442a85cbcac6571f8cf99e8fc093","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"64b2d7423c23cea4806adafae5a8e0811d95442a85cbcac6571f8cf99e8fc093","first_computed_at":"2026-07-04T15:06:38.010928Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:06:38.010928Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xx0Sb35I0SDZEpJLusqUAGynT9tirsBE3ObbKFtyyl7vJ8CQfXc4VcyIB/+KeeylwEiSrZMxk0rzyFv+Ut6IDw==","signature_status":"signed_v1","signed_at":"2026-07-04T15:06:38.011296Z","signed_message":"canonical_sha256_bytes"},"source_id":"0801.0677","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:168c5f7f607127b0c1a6b85503e685cd7f3d0f1d60187a69f88772ca02fb4007","sha256:756ecd30b6fd15a021b22f87ea174853465184060e2f7ee9daf04b997e3dd74d"],"state_sha256":"91da29e0faf56127fcd24cb865e0d4590d570c9ddeba4efc99e7f9e155b561d4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ygbjI236XQiT7cRu9VtS49KEMzitlLDjJRaJcffaLs4W5Wk+f/QmRtLTh8NzMFK9UENLkOjr0WrwT/ivywT0Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T12:34:13.695284Z","bundle_sha256":"2e63fa38aed589886862b76388b757b4e439c48223da8028ffbe243200eab8f7"}}