{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2003:3KDVSVDQWNIM7WZKNVJLAIIOGG","short_pith_number":"pith:3KDVSVDQ","canonical_record":{"source":{"id":"cs/0306121","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2003-06-22T19:18:55Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"fc3d7c641199bc9ce05e137bcb9f5f92514c92128a250442b8f2e18228072d89","abstract_canon_sha256":"33aaeffec616c2d27fb23737a25043f1abdc5b1f19a7fc89580761526bd23854"},"schema_version":"1.0"},"canonical_sha256":"da87595470b350cfdb2a6d52b0210e318703c331f2c15fc133da253860ad3c35","source":{"kind":"arxiv","id":"cs/0306121","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0306121","created_at":"2026-05-18T03:59:38Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0306121v2","created_at":"2026-05-18T03:59:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0306121","created_at":"2026-05-18T03:59:38Z"},{"alias_kind":"pith_short_12","alias_value":"3KDVSVDQWNIM","created_at":"2026-05-18T12:25:51Z"},{"alias_kind":"pith_short_16","alias_value":"3KDVSVDQWNIM7WZK","created_at":"2026-05-18T12:25:51Z"},{"alias_kind":"pith_short_8","alias_value":"3KDVSVDQ","created_at":"2026-05-18T12:25:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2003:3KDVSVDQWNIM7WZKNVJLAIIOGG","target":"record","payload":{"canonical_record":{"source":{"id":"cs/0306121","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2003-06-22T19:18:55Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"fc3d7c641199bc9ce05e137bcb9f5f92514c92128a250442b8f2e18228072d89","abstract_canon_sha256":"33aaeffec616c2d27fb23737a25043f1abdc5b1f19a7fc89580761526bd23854"},"schema_version":"1.0"},"canonical_sha256":"da87595470b350cfdb2a6d52b0210e318703c331f2c15fc133da253860ad3c35","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:59:38.819884Z","signature_b64":"09A4vyZ1l4ii9Qcji6n5VAjFEUIbZq5o01n/f1aAc/ksuZb0sHa2fambMSaOKW4gxg8eQ6cRyHS/iyiWw4BKBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da87595470b350cfdb2a6d52b0210e318703c331f2c15fc133da253860ad3c35","last_reissued_at":"2026-05-18T03:59:38.819374Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:59:38.819374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cs/0306121","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-18T03:59:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1h8tfy+E3Cs56EUV3WcjYGfZqCzRuGuwt7rfBsGd8GfmFs+tzLAFzk05/E6SyeMOJxhBDg6I9cisIth6h8RDBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T22:37:03.939368Z"},"content_sha256":"0d595cfa33ea0e6c1040f4b848e11fbb1835dbe355567d24fb38ab2a80a9af63","schema_version":"1.0","event_id":"sha256:0d595cfa33ea0e6c1040f4b848e11fbb1835dbe355567d24fb38ab2a80a9af63"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2003:3KDVSVDQWNIM7WZKNVJLAIIOGG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reachability problems for communicating finite state machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.LO","authors_text":"Jan Pachl","submitted_at":"2003-06-22T19:18:55Z","abstract_excerpt":"The paper deals with the verification of reachability properties in a commonly used state transition model of communication protocols, which consists of finite state machines connected by potentially unbounded FIFO channels. Although simple reachability problems are undecidable for general protocols with unbounded channels, they are decidable for the protocols with the recognizable channel property. The decidability question is open for the protocols with the rational channel property."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0306121","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-18T03:59:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"doqpGQpEvkQGlhoujb1ILiUACel4s/5tGaOtYhw4K/tUVrtZe6hyXsdcY4TEektpYRQXK1THv5dah350btRkCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T22:37:03.939718Z"},"content_sha256":"3d63c307ca620e4157e1a7417865e74041c776bad503e7f3fd62dbba484a059c","schema_version":"1.0","event_id":"sha256:3d63c307ca620e4157e1a7417865e74041c776bad503e7f3fd62dbba484a059c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3KDVSVDQWNIM7WZKNVJLAIIOGG/bundle.json","state_url":"https://pith.science/pith/3KDVSVDQWNIM7WZKNVJLAIIOGG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3KDVSVDQWNIM7WZKNVJLAIIOGG/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-01T22:37:03Z","links":{"resolver":"https://pith.science/pith/3KDVSVDQWNIM7WZKNVJLAIIOGG","bundle":"https://pith.science/pith/3KDVSVDQWNIM7WZKNVJLAIIOGG/bundle.json","state":"https://pith.science/pith/3KDVSVDQWNIM7WZKNVJLAIIOGG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3KDVSVDQWNIM7WZKNVJLAIIOGG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2003:3KDVSVDQWNIM7WZKNVJLAIIOGG","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":"33aaeffec616c2d27fb23737a25043f1abdc5b1f19a7fc89580761526bd23854","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2003-06-22T19:18:55Z","title_canon_sha256":"fc3d7c641199bc9ce05e137bcb9f5f92514c92128a250442b8f2e18228072d89"},"schema_version":"1.0","source":{"id":"cs/0306121","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0306121","created_at":"2026-05-18T03:59:38Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0306121v2","created_at":"2026-05-18T03:59:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0306121","created_at":"2026-05-18T03:59:38Z"},{"alias_kind":"pith_short_12","alias_value":"3KDVSVDQWNIM","created_at":"2026-05-18T12:25:51Z"},{"alias_kind":"pith_short_16","alias_value":"3KDVSVDQWNIM7WZK","created_at":"2026-05-18T12:25:51Z"},{"alias_kind":"pith_short_8","alias_value":"3KDVSVDQ","created_at":"2026-05-18T12:25:51Z"}],"graph_snapshots":[{"event_id":"sha256:3d63c307ca620e4157e1a7417865e74041c776bad503e7f3fd62dbba484a059c","target":"graph","created_at":"2026-05-18T03:59: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"},"paper":{"abstract_excerpt":"The paper deals with the verification of reachability properties in a commonly used state transition model of communication protocols, which consists of finite state machines connected by potentially unbounded FIFO channels. Although simple reachability problems are undecidable for general protocols with unbounded channels, they are decidable for the protocols with the recognizable channel property. The decidability question is open for the protocols with the rational channel property.","authors_text":"Jan Pachl","cross_cats":["cs.NI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2003-06-22T19:18:55Z","title":"Reachability problems for communicating finite state machines"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0306121","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:0d595cfa33ea0e6c1040f4b848e11fbb1835dbe355567d24fb38ab2a80a9af63","target":"record","created_at":"2026-05-18T03:59: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":"33aaeffec616c2d27fb23737a25043f1abdc5b1f19a7fc89580761526bd23854","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2003-06-22T19:18:55Z","title_canon_sha256":"fc3d7c641199bc9ce05e137bcb9f5f92514c92128a250442b8f2e18228072d89"},"schema_version":"1.0","source":{"id":"cs/0306121","kind":"arxiv","version":2}},"canonical_sha256":"da87595470b350cfdb2a6d52b0210e318703c331f2c15fc133da253860ad3c35","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"da87595470b350cfdb2a6d52b0210e318703c331f2c15fc133da253860ad3c35","first_computed_at":"2026-05-18T03:59:38.819374Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:59:38.819374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"09A4vyZ1l4ii9Qcji6n5VAjFEUIbZq5o01n/f1aAc/ksuZb0sHa2fambMSaOKW4gxg8eQ6cRyHS/iyiWw4BKBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:59:38.819884Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0306121","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0d595cfa33ea0e6c1040f4b848e11fbb1835dbe355567d24fb38ab2a80a9af63","sha256:3d63c307ca620e4157e1a7417865e74041c776bad503e7f3fd62dbba484a059c"],"state_sha256":"650aa733a251d82cfcb7a14fbc6c9d48ce77bc7e86c13d30b2d2dda98c9763e6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oMSpWhn1TNbRN1frjI6+tPKsY9aaGBx9foFyft5uaF7OAyiYbTE4l6fEz7XDQSaqYf5F1rq9RzdxVufe3Gm1Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T22:37:03.941653Z","bundle_sha256":"367a6fa949d4f37256f162e89babbe86bc9ccc550090698511342294738c8358"}}