{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:IUI4O6M4EPKSZIOE4VAA7ZI5BS","short_pith_number":"pith:IUI4O6M4","canonical_record":{"source":{"id":"1908.07282","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2019-08-20T11:44:36Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"14a9c237edda3e85b4c0cc0edf96941511c1e2beb99f52b1d2b637d207dcfe54","abstract_canon_sha256":"269e913fa66134f9da0b2f8665cc7a2c02d8f9cda7a66534ca2b63d2cbe9ac1e"},"schema_version":"1.0"},"canonical_sha256":"4511c7799c23d52ca1c4e5400fe51d0cb5ab1675b82f3c6120dd8edff5c7420a","source":{"kind":"arxiv","id":"1908.07282","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.07282","created_at":"2026-07-05T06:23:27Z"},{"alias_kind":"arxiv_version","alias_value":"1908.07282v5","created_at":"2026-07-05T06:23:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.07282","created_at":"2026-07-05T06:23:27Z"},{"alias_kind":"pith_short_12","alias_value":"IUI4O6M4EPKS","created_at":"2026-07-05T06:23:27Z"},{"alias_kind":"pith_short_16","alias_value":"IUI4O6M4EPKSZIOE","created_at":"2026-07-05T06:23:27Z"},{"alias_kind":"pith_short_8","alias_value":"IUI4O6M4","created_at":"2026-07-05T06:23:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:IUI4O6M4EPKSZIOE4VAA7ZI5BS","target":"record","payload":{"canonical_record":{"source":{"id":"1908.07282","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2019-08-20T11:44:36Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"14a9c237edda3e85b4c0cc0edf96941511c1e2beb99f52b1d2b637d207dcfe54","abstract_canon_sha256":"269e913fa66134f9da0b2f8665cc7a2c02d8f9cda7a66534ca2b63d2cbe9ac1e"},"schema_version":"1.0"},"canonical_sha256":"4511c7799c23d52ca1c4e5400fe51d0cb5ab1675b82f3c6120dd8edff5c7420a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:23:27.841156Z","signature_b64":"q9T5/Y3klJ3ENyGnHyABUbf5sbnza79iCONNM3wCjdgmEMrdWmrGZqHh7ikdN8JYowUUcceYk6ejksrWbm3HDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4511c7799c23d52ca1c4e5400fe51d0cb5ab1675b82f3c6120dd8edff5c7420a","last_reissued_at":"2026-07-05T06:23:27.840743Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:23:27.840743Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.07282","source_version":5,"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-05T06:23:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yao4xOJL0h1QdGR5QEp/PTKussEhvq8rOjR1zSRgZ6YHUcD/PqX4GYAUAaKBU1JToZAS4UI8tGopyfAQ6YR/Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T18:07:15.198857Z"},"content_sha256":"2d8ed691743fcebfd164e916788b40b69ac332298fed48e93d209e21346808b9","schema_version":"1.0","event_id":"sha256:2d8ed691743fcebfd164e916788b40b69ac332298fed48e93d209e21346808b9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:IUI4O6M4EPKSZIOE4VAA7ZI5BS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Verification of Flat FIFO Systems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.CC","authors_text":"Alain Finkel, M. Praveen","submitted_at":"2019-08-20T11:44:36Z","abstract_excerpt":"The decidability and complexity of reachability problems and model-checking for flat counter machines have been explored in detail. However, only few results are known for flat (lossy) FIFO machines, only in some particular cases (a single loop or a single bounded expression). We prove, by establishing reductions between properties, and by reducing SAT to a subset of these properties that many verification problems like reachability, non-termination, unboundedness are NP-complete for flat FIFO machines, generalizing similar existing results for flat counter machines. We also show that reachabi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.07282","kind":"arxiv","version":5},"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/1908.07282/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-05T06:23:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vSffKoKqaOB2SzBK1SxlmGoVS06vcYOzHI1GqNtbhT1LZFv1mfyl3VdLX6HUpwaDXewZEk/KdeTXZgC3BaFuDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T18:07:15.199804Z"},"content_sha256":"db4172e9e0dd12438e642b7a795fcbe77dac57e22053b889695f26a174419667","schema_version":"1.0","event_id":"sha256:db4172e9e0dd12438e642b7a795fcbe77dac57e22053b889695f26a174419667"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IUI4O6M4EPKSZIOE4VAA7ZI5BS/bundle.json","state_url":"https://pith.science/pith/IUI4O6M4EPKSZIOE4VAA7ZI5BS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IUI4O6M4EPKSZIOE4VAA7ZI5BS/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-08-16T18:07:15Z","links":{"resolver":"https://pith.science/pith/IUI4O6M4EPKSZIOE4VAA7ZI5BS","bundle":"https://pith.science/pith/IUI4O6M4EPKSZIOE4VAA7ZI5BS/bundle.json","state":"https://pith.science/pith/IUI4O6M4EPKSZIOE4VAA7ZI5BS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IUI4O6M4EPKSZIOE4VAA7ZI5BS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:IUI4O6M4EPKSZIOE4VAA7ZI5BS","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":"269e913fa66134f9da0b2f8665cc7a2c02d8f9cda7a66534ca2b63d2cbe9ac1e","cross_cats_sorted":["cs.LO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2019-08-20T11:44:36Z","title_canon_sha256":"14a9c237edda3e85b4c0cc0edf96941511c1e2beb99f52b1d2b637d207dcfe54"},"schema_version":"1.0","source":{"id":"1908.07282","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.07282","created_at":"2026-07-05T06:23:27Z"},{"alias_kind":"arxiv_version","alias_value":"1908.07282v5","created_at":"2026-07-05T06:23:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.07282","created_at":"2026-07-05T06:23:27Z"},{"alias_kind":"pith_short_12","alias_value":"IUI4O6M4EPKS","created_at":"2026-07-05T06:23:27Z"},{"alias_kind":"pith_short_16","alias_value":"IUI4O6M4EPKSZIOE","created_at":"2026-07-05T06:23:27Z"},{"alias_kind":"pith_short_8","alias_value":"IUI4O6M4","created_at":"2026-07-05T06:23:27Z"}],"graph_snapshots":[{"event_id":"sha256:db4172e9e0dd12438e642b7a795fcbe77dac57e22053b889695f26a174419667","target":"graph","created_at":"2026-07-05T06:23:27Z","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/1908.07282/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The decidability and complexity of reachability problems and model-checking for flat counter machines have been explored in detail. However, only few results are known for flat (lossy) FIFO machines, only in some particular cases (a single loop or a single bounded expression). We prove, by establishing reductions between properties, and by reducing SAT to a subset of these properties that many verification problems like reachability, non-termination, unboundedness are NP-complete for flat FIFO machines, generalizing similar existing results for flat counter machines. We also show that reachabi","authors_text":"Alain Finkel, M. Praveen","cross_cats":["cs.LO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2019-08-20T11:44:36Z","title":"Verification of Flat FIFO Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.07282","kind":"arxiv","version":5},"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:2d8ed691743fcebfd164e916788b40b69ac332298fed48e93d209e21346808b9","target":"record","created_at":"2026-07-05T06:23:27Z","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":"269e913fa66134f9da0b2f8665cc7a2c02d8f9cda7a66534ca2b63d2cbe9ac1e","cross_cats_sorted":["cs.LO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2019-08-20T11:44:36Z","title_canon_sha256":"14a9c237edda3e85b4c0cc0edf96941511c1e2beb99f52b1d2b637d207dcfe54"},"schema_version":"1.0","source":{"id":"1908.07282","kind":"arxiv","version":5}},"canonical_sha256":"4511c7799c23d52ca1c4e5400fe51d0cb5ab1675b82f3c6120dd8edff5c7420a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4511c7799c23d52ca1c4e5400fe51d0cb5ab1675b82f3c6120dd8edff5c7420a","first_computed_at":"2026-07-05T06:23:27.840743Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:23:27.840743Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"q9T5/Y3klJ3ENyGnHyABUbf5sbnza79iCONNM3wCjdgmEMrdWmrGZqHh7ikdN8JYowUUcceYk6ejksrWbm3HDA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:23:27.841156Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.07282","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2d8ed691743fcebfd164e916788b40b69ac332298fed48e93d209e21346808b9","sha256:db4172e9e0dd12438e642b7a795fcbe77dac57e22053b889695f26a174419667"],"state_sha256":"823a920a097a43d2dd87e478ab239e2de1b66ecfc6812d44ed9176d912dccb58"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yOf8r6f1uTDpgKVpGdXZJ7kTjkinYiXs+NCBxxbqfSLJuXE3It36WkJiV3qrZB5PPDdEO0JKdwqXIfBZMNoDDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T18:07:15.205873Z","bundle_sha256":"357ecdbbd62cbb90247d2575b0fffbe1c44d96b2016549e0bee770934af43ff6"}}