{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:IUI4O6M4EPKSZIOE4VAA7ZI5BS","short_pith_number":"pith:IUI4O6M4","schema_version":"1.0","canonical_sha256":"4511c7799c23d52ca1c4e5400fe51d0cb5ab1675b82f3c6120dd8edff5c7420a","source":{"kind":"arxiv","id":"1908.07282","version":5},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1908.07282","created_at":"2026-07-05T06:23:27.840804+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.07282v5","created_at":"2026-07-05T06:23:27.840804+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.07282","created_at":"2026-07-05T06:23:27.840804+00:00"},{"alias_kind":"pith_short_12","alias_value":"IUI4O6M4EPKS","created_at":"2026-07-05T06:23:27.840804+00:00"},{"alias_kind":"pith_short_16","alias_value":"IUI4O6M4EPKSZIOE","created_at":"2026-07-05T06:23:27.840804+00:00"},{"alias_kind":"pith_short_8","alias_value":"IUI4O6M4","created_at":"2026-07-05T06:23:27.840804+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IUI4O6M4EPKSZIOE4VAA7ZI5BS","json":"https://pith.science/pith/IUI4O6M4EPKSZIOE4VAA7ZI5BS.json","graph_json":"https://pith.science/api/pith-number/IUI4O6M4EPKSZIOE4VAA7ZI5BS/graph.json","events_json":"https://pith.science/api/pith-number/IUI4O6M4EPKSZIOE4VAA7ZI5BS/events.json","paper":"https://pith.science/paper/IUI4O6M4"},"agent_actions":{"view_html":"https://pith.science/pith/IUI4O6M4EPKSZIOE4VAA7ZI5BS","download_json":"https://pith.science/pith/IUI4O6M4EPKSZIOE4VAA7ZI5BS.json","view_paper":"https://pith.science/paper/IUI4O6M4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.07282&json=true","fetch_graph":"https://pith.science/api/pith-number/IUI4O6M4EPKSZIOE4VAA7ZI5BS/graph.json","fetch_events":"https://pith.science/api/pith-number/IUI4O6M4EPKSZIOE4VAA7ZI5BS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IUI4O6M4EPKSZIOE4VAA7ZI5BS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IUI4O6M4EPKSZIOE4VAA7ZI5BS/action/storage_attestation","attest_author":"https://pith.science/pith/IUI4O6M4EPKSZIOE4VAA7ZI5BS/action/author_attestation","sign_citation":"https://pith.science/pith/IUI4O6M4EPKSZIOE4VAA7ZI5BS/action/citation_signature","submit_replication":"https://pith.science/pith/IUI4O6M4EPKSZIOE4VAA7ZI5BS/action/replication_record"}},"created_at":"2026-07-05T06:23:27.840804+00:00","updated_at":"2026-07-05T06:23:27.840804+00:00"}