{"as_of":"2026-08-16T16:19:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9c5bddf0e483c028530440a57f3f78654b26ded9aa071c2186b7ba9b85c34edd","coverage":[{"denominator":38,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":38,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T12:36:06.995176Z","state":"measured"},{"denominator":38,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":38,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/1908.07282/citation-record","integrity":"/paper/1908.07282/integrity","json":"/paper/1908.07282/citation-record.json","paper":"/paper/1908.07282"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:36:07.627569Z","title":"On-the-fly analysis of systems with unbounded, lossy FIFO channels","venue":null,"work_id":"c60ae45a-f1e6-4718-951e-9217cc7b5111","year":1998},"citing_paper":{"arxiv_id":"1908.07282","last_updated":"2020-10-12T13:04:52Z","snapshot_observed_at":"2026-08-16T13:44:00.611016Z","submitted_at":"2019-08-20T11:44:36Z","title":"Verification of Flat FIFO Systems","version":5},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T12:36:06.808903Z"},"links":{"citing_paper":"/paper/1908.07282"},"observation_digest":"sha256:38369c1cd3093fa2624da0735fbce15ba7787aae4bce5381f4cd183a99b623d0","observation_id":"d328697e-0831-4a13-bb98-6a029290f507","resolution":{"observed_at":"2026-08-14T12:36:07.632253Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:36:07.613409Z","title":"Using forward reachability analysis for verification of lossy channel systems.Formal Methods in System Design, 25(1):39– 65, 2004","venue":null,"work_id":"64c04c30-c820-4a94-b2d4-9edd81adda2f","year":2004},"citing_paper":{"arxiv_id":"1908.07282","last_updated":"2020-10-12T13:04:52Z","snapshot_observed_at":"2026-08-16T13:44:00.611016Z","submitted_at":"2019-08-20T11:44:36Z","title":"Verification of Flat FIFO Systems","version":5},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T12:36:06.814621Z"},"links":{"citing_paper":"/paper/1908.07282"},"observation_digest":"sha256:c402a63bbe6b60b9c322492e6f36e8011c7897754033d0f272bf02e77abe07e9","observation_id":"733a95b9-492a-4adb-b8c9-255c38aaf16b","resolution":{"observed_at":"2026-08-14T12:36:07.618421Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:36:07.598051Z","title":"Trex: A tool for reachability analysis of complex systems","venue":null,"work_id":"892a10ed-4aaa-472e-b532-acb569808664","year":2001},"citing_paper":{"arxiv_id":"1908.07282","last_updated":"2020-10-12T13:04:52Z","snapshot_observed_at":"2026-08-16T13:44:00.611016Z","submitted_at":"2019-08-20T11:44:36Z","title":"Verification of Flat FIFO Systems","version":5},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T12:36:06.820624Z"},"links":{"citing_paper":"/paper/1908.07282"},"observation_digest":"sha256:16eeb6cd466f069875a62b796d21bd5bf3ad788576c079cfc369d9cf244d6bc4","observation_id":"57b60d12-e837-4904-a7ef-388d22378d8e","resolution":{"observed_at":"2026-08-14T12:36:07.603237Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:36:07.582459Z","title":"FAST: Fast Acceleration of Symbolic Transition systems","venue":null,"work_id":"0e68f26d-035c-46d9-babf-8b5a62f7680a","year":2003},"citing_paper":{"arxiv_id":"1908.07282","last_updated":"2020-10-12T13:04:52Z","snapshot_observed_at":"2026-08-16T13:44:00.611016Z","submitted_at":"2019-08-20T11:44:36Z","title":"Verification of Flat FIFO Systems","version":5},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T12:36:06.826090Z"},"links":{"citing_paper":"/paper/1908.07282"},"observation_digest":"sha256:7bed568c3849e9e92d72c684337456de6a65a2b58dd988b7129c57a65a42f219","observation_id":"2190d418-43fd-421b-b9b1-6e63c684dffd","resolution":{"observed_at":"2026-08-14T12:36:07.587275Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:36:07.567295Z","title":"FAST: Acceleration from theory to practice","venue":null,"work_id":"0c574818-19a5-493f-9acc-952bf41acc77","year":2008},"citing_paper":{"arxiv_id":"1908.07282","last_updated":"2020-10-12T13:04:52Z","snapshot_observed_at":"2026-08-16T13:44:00.611016Z","submitted_at":"2019-08-20T11:44:36Z","title":"Verification of Flat FIFO Systems","version":5},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T12:36:06.830917Z"},"links":{"citing_paper":"/paper/1908.07282"},"observation_digest":"sha256:d597a2834a3f362e3241170f378fbe226acd4886575f29620583621eb89e7cd0","observation_id":"79eeeb39-7700-4eb6-9563-5b57c9ce8b07","resolution":{"observed_at":"2026-08-14T12:36:07.572279Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:36:07.551846Z","title":"Flat acceleration in symbolic model checking","venue":null,"work_id":"e962793a-05c1-48d1-b61a-3464e896079c","year":2005},"citing_paper":{"arxiv_id":"1908.07282","last_updated":"2020-10-12T13:04:52Z","snapshot_observed_at":"2026-08-16T13:44:00.611016Z","submitted_at":"2019-08-20T11:44:36Z","title":"Verification of Flat FIFO Systems","version":5},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T12:36:06.835297Z"},"links":{"citing_paper":"/paper/1908.07282"},"observation_digest":"sha256:9112882e057d7a5881ced55f787537443203b44c2c71a604d773d8988b026b48","observation_id":"c9301c3d-e55f-45ef-acde-27e82366c384","resolution":{"observed_at":"2026-08-14T12:36:07.556698Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:36:07.536183Z","title":"Domain-specific regular acceleration","venue":null,"work_id":"82f0c10f-c384-40a0-9daf-89a4d0251230","year":2012},"citing_paper":{"arxiv_id":"1908.07282","last_updated":"2020-10-12T13:04:52Z","snapshot_observed_at":"2026-08-16T13:44:00.611016Z","submitted_at":"2019-08-20T11:44:36Z","title":"Verification of Flat FIFO Systems","version":5},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T12:36:06.841859Z"},"links":{"citing_paper":"/paper/1908.07282"},"observation_digest":"sha256:5f3a1e74b563bc89b0a9522309a772ba2f8d46fb3fc84b484dedcab6cde5ac72","observation_id":"8d3fb25d-e501-45d1-be2d-7b11ff079ee4","resolution":{"observed_at":"2026-08-14T12:36:07.541124Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:36:07.521162Z","title":"The power of QDDs (extended abstract)","venue":null,"work_id":"734148ef-0bc8-4bf7-873f-feb96d0dba59","year":1997},"citing_paper":{"arxiv_id":"1908.07282","last_updated":"2020-10-12T13:04:52Z","snapshot_observed_at":"2026-08-16T13:44:00.611016Z","submitted_at":"2019-08-20T11:44:36Z","title":"Verification of Flat FIFO Systems","version":5},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T12:36:06.846660Z"},"links":{"citing_paper":"/paper/1908.07282"},"observation_digest":"sha256:4c76875eb0880e063fcce999143e89da253160b26e09be5b539a016e648dda6a","observation_id":"1f101bb4-52fc-4732-a25a-3f8865879350","resolution":{"observed_at":"2026-08-14T12:36:07.526290Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:36:07.505530Z","title":"Bounded reachability problems are decidable in FIFO machines","venue":null,"work_id":"2b85b6ad-74e6-48af-aece-4aef4946f0b7","year":2020},"citing_paper":{"arxiv_id":"1908.07282","last_updated":"2020-10-12T13:04:52Z","snapshot_observed_at":"2026-08-16T13:44:00.611016Z","submitted_at":"2019-08-20T11:44:36Z","title":"Verification of Flat FIFO Systems","version":5},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T12:36:06.851310Z"},"links":{"citing_paper":"/paper/1908.07282"},"observation_digest":"sha256:38b2eb2af5badd53bf2cb38c5231cee09c7f4f27767435561ab529ea9f65d793","observation_id":"720a6622-4d75-4ac6-b085-84df3ef89bb5","resolution":{"observed_at":"2026-08-14T12:36:07.510782Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:36:07.490033Z","title":"Symbolic reachability analysis of fifo-channel systems with nonregular sets of configurations","venue":null,"work_id":"9729df19-faf9-4408-9391-731f179ae9bd","year":1999},"citing_paper":{"arxiv_id":"1908.07282","last_updated":"2020-10-12T13:04:52Z","snapshot_observed_at":"2026-08-16T13:44:00.611016Z","submitted_at":"2019-08-20T11:44:36Z","title":"Verification of Flat FIFO Systems","version":5},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T12:36:06.856569Z"},"links":{"citing_paper":"/paper/1908.07282"},"observation_digest":"sha256:d530289b67cf9c112d3e75da22971387e856379e3ae70034efe9b26eb15eb5bb","observation_id":"aa444fdc-c625-4594-bbec-3401f7a33d09","resolution":{"observed_at":"2026-08-14T12:36:07.495117Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:36:07.475176Z","title":"Cyclic Petri net reachability sets are semi-linear effectively con- structible","venue":null,"work_id":"0cbd5404-87d0-4462-80d7-e22d0e1b37c3","year":1997},"citing_paper":{"arxiv_id":"1908.07282","last_updated":"2020-10-12T13:04:52Z","snapshot_observed_at":"2026-08-16T13:44:00.611016Z","submitted_at":"2019-08-20T11:44:36Z","title":"Verification of Flat FIFO Systems","version":5},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T12:36:06.861549Z"},"links":{"citing_paper":"/paper/1908.07282"},"observation_digest":"sha256:83e543d01c4d66ea01d9575238d5109748738d1ec88a4fe68a02f6105430a48c","observation_id":"f65503d9-1322-4478-8a39-5cd65811732a","resolution":{"observed_at":"2026-08-14T12:36:07.479986Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1307.5321","last_updated":"2016-02-14T15:50:37Z","snapshot_observed_at":"2026-08-15T00:10:14.281160Z","submitted_at":"2013-07-16T09:55:15Z","title":"The Complexity of Reachability Problems for Flat Counter Machines with Periodic Loops","version":5},"cited_work":{"arxiv_id":"1307.5321","doi":null,"metadata_source":"pith","pith_arxiv_id":"1307.5321","snapshot_observed_at":"2026-08-14T12:36:07.080476Z","title":"The Complexity of Reachability Problems for Flat Counter Machines with Periodic Loops","venue":"cs.CC","work_id":"48a43d74-ad6d-4a3e-aeef-a5a10633aa4d","year":2013},"citing_paper":{"arxiv_id":"1908.07282","last_updated":"2020-10-12T13:04:52Z","snapshot_observed_at":"2026-08-16T13:44:00.611016Z","submitted_at":"2019-08-20T11:44:36Z","title":"Verification of Flat FIFO Systems","version":5},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T12:36:06.866337Z"},"links":{"cited_paper":"/paper/1307.5321","citing_paper":"/paper/1908.07282"},"observation_digest":"sha256:a1cdc7e25605444695aa0ffb5358ddb3fde8bd14e4968c2515d05b703e048a52","observation_id":"86601fc9-16ee-4db6-9084-d2535167f8da","resolution":{"observed_at":"2026-08-14T12:36:07.085902Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:36:07.459960Z","title":"Tool demonstration of the FLATA counter automata toolset","venue":null,"work_id":"180b85e5-bf25-403a-8d9b-a61fa7b5a392","year":2009},"citing_paper":{"arxiv_id":"1908.07282","last_updated":"2020-10-12T13:04:52Z","snapshot_observed_at":"2026-08-16T13:44:00.611016Z","submitted_at":"2019-08-20T11:44:36Z","title":"Verification of Flat FIFO Systems","version":5},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T12:36:06.871776Z"},"links":{"citing_paper":"/paper/1908.07282"},"observation_digest":"sha256:30d1fe1afd49d7fcbc1733862aa25f58889251ca9ddd9df323a7c69dac22ac3d","observation_id":"bfe521c6-f46f-4b53-99da-4a6cb887864c","resolution":{"observed_at":"2026-08-14T12:36:07.464858Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:36:07.445236Z","title":"On communicating finite-state machines","venue":null,"work_id":"bbc582e3-6e75-4fbb-af69-9c195cddbbdb","year":1983},"citing_paper":{"arxiv_id":"1908.07282","last_updated":"2020-10-12T13:04:52Z","snapshot_observed_at":"2026-08-16T13:44:00.611016Z","submitted_at":"2019-08-20T11:44:36Z","title":"Verification of Flat FIFO Systems","version":5},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T12:36:06.876448Z"},"links":{"citing_paper":"/paper/1908.07282"},"observation_digest":"sha256:1e553080bd344be395dde8c93ce94c3ca08859398bdf829ef780bfd7f20f39dd","observation_id":"42a3e062-a224-40d2-b4f4-ea698271b686","resolution":{"observed_at":"2026-08-14T12:36:07.450490Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:36:07.430633Z","title":"Choreography and orchestration conformance for system design","venue":null,"work_id":"0a0cd41f-ad45-4f8f-b458-a3513bc64429","year":2006},"citing_paper":{"arxiv_id":"1908.07282","last_updated":"2020-10-12T13:04:52Z","snapshot_observed_at":"2026-08-16T13:44:00.611016Z","submitted_at":"2019-08-20T11:44:36Z","title":"Verification of Flat FIFO Systems","version":5},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T12:36:06.881496Z"},"links":{"citing_paper":"/paper/1908.07282"},"observation_digest":"sha256:e63e6ca18fd8d8d20450562417a2214729a1b5157fc410d39914b9eeab7544b5","observation_id":"d541b241-757d-4f2b-b3e3-375780443587","resolution":{"observed_at":"2026-08-14T12:36:07.435089Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:36:07.416057Z","title":"Verification of programs with half-duplex communication.Information and Computation, 202(2):166–190, November 2005","venue":null,"work_id":"e772cde8-e5b4-4ff0-9c25-5d5694224e64","year":2005},"citing_paper":{"arxiv_id":"1908.07282","last_updated":"2020-10-12T13:04:52Z","snapshot_observed_at":"2026-08-16T13:44:00.611016Z","submitted_at":"2019-08-20T11:44:36Z","title":"Verification of Flat FIFO Systems","version":5},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T12:36:06.886383Z"},"links":{"citing_paper":"/paper/1908.07282"},"observation_digest":"sha256:a91729b628e19f769987931668c578dd870a5e4f6c32203a484b3c0e8abc514d","observation_id":"729fb27d-0374-465f-b6d5-fa4a2b83a278","resolution":{"observed_at":"2026-08-14T12:36:07.420634Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:36:07.400588Z","title":"Model- checking counting temporal logics on flat structures","venue":null,"work_id":"3de0e707-48de-4a88-a5db-900da08ac77d","year":2017},"citing_paper":{"arxiv_id":"1908.07282","last_updated":"2020-10-12T13:04:52Z","snapshot_observed_at":"2026-08-16T13:44:00.611016Z","submitted_at":"2019-08-20T11:44:36Z","title":"Verification of Flat FIFO Systems","version":5},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T12:36:06.890830Z"},"links":{"citing_paper":"/paper/1908.07282"},"observation_digest":"sha256:752805d66ce83f045ce7c08efc8c14d634decc20f003b9b336d2b8c5b1c849c2","observation_id":"5abe7ca6-151a-4640-9f1f-f7c1aff5af03","resolution":{"observed_at":"2026-08-14T12:36:07.405690Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:36:07.385969Z","title":"Demri, A","venue":null,"work_id":"08916532-a6b6-4b60-a62d-ecb0151cd5d7","year":2006},"citing_paper":{"arxiv_id":"1908.07282","last_updated":"2020-10-12T13:04:52Z","snapshot_observed_at":"2026-08-16T13:44:00.611016Z","submitted_at":"2019-08-20T11:44:36Z","title":"Verification of Flat FIFO Systems","version":5},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T12:36:06.895383Z"},"links":{"citing_paper":"/paper/1908.07282"},"observation_digest":"sha256:d2513d92107ef99830b4b5ed2bb14aafe5fc4c290bda1434ce228b29f8d7c16f","observation_id":"cd86dd20-d434-4672-8891-0ca9158b1ae8","resolution":{"observed_at":"2026-08-14T12:36:07.390679Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:36:07.370951Z","title":"Equivalence between model-checking flat counter systems and presburger arithmetic","venue":null,"work_id":"84c4939b-18af-4d1f-8b31-85c1dce1118c","year":2017},"citing_paper":{"arxiv_id":"1908.07282","last_updated":"2020-10-12T13:04:52Z","snapshot_observed_at":"2026-08-16T13:44:00.611016Z","submitted_at":"2019-08-20T11:44:36Z","title":"Verification of Flat FIFO Systems","version":5},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T12:36:06.900296Z"},"links":{"citing_paper":"/paper/1908.07282"},"observation_digest":"sha256:8fdf687809505b20f33ad939ca9a0ba390acf49af6d680dd84fab55d24c114b5","observation_id":"ea8d57e5-5667-44f4-a67e-26dc7ccff127","resolution":{"observed_at":"2026-08-14T12:36:07.375786Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:36:07.355378Z","title":"On the complexity of verifying regular properties on flat counter systems","venue":null,"work_id":"cf1ed5c1-c864-49e8-8bd0-e85a68f91962","year":2013},"citing_paper":{"arxiv_id":"1908.07282","last_updated":"2020-10-12T13:04:52Z","snapshot_observed_at":"2026-08-16T13:44:00.611016Z","submitted_at":"2019-08-20T11:44:36Z","title":"Verification of Flat FIFO Systems","version":5},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T12:36:06.904888Z"},"links":{"citing_paper":"/paper/1908.07282"},"observation_digest":"sha256:3689291e2966cff87857c46f0c72e63dd90a8004b5b0f796bd403b5d35c70f5a","observation_id":"8c647dd3-e4a4-4ebb-8b42-7d9b30096eb6","resolution":{"observed_at":"2026-08-14T12:36:07.360565Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:36:07.338657Z","title":"Taming past LTL and flat counter systems","venue":null,"work_id":"e93ebb9e-2040-4e6c-a0d7-074dcd2912be","year":2015},"citing_paper":{"arxiv_id":"1908.07282","last_updated":"2020-10-12T13:04:52Z","snapshot_observed_at":"2026-08-16T13:44:00.611016Z","submitted_at":"2019-08-20T11:44:36Z","title":"Verification of Flat FIFO Systems","version":5},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T12:36:06.909628Z"},"links":{"citing_paper":"/paper/1908.07282"},"observation_digest":"sha256:d30b735de838ce7a3f6bf5399bfcff9319141871278ab96dcf3d9e16f473ac83","observation_id":"16bfb3e2-7c04-4127-892c-48d46f0db82d","resolution":{"observed_at":"2026-08-14T12:36:07.343875Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:36:07.323212Z","title":"Model-checking CTL* over flat Presburger counter systems","venue":null,"work_id":"958924c7-cdc7-4b11-a920-77f28d924a79","year":2010},"citing_paper":{"arxiv_id":"1908.07282","last_updated":"2020-10-12T13:04:52Z","snapshot_observed_at":"2026-08-16T13:44:00.611016Z","submitted_at":"2019-08-20T11:44:36Z","title":"Verification of Flat FIFO Systems","version":5},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T12:36:06.914995Z"},"links":{"citing_paper":"/paper/1908.07282"},"observation_digest":"sha256:5e0dcc5f1e3701b9552fd71070af9ddf1af17b776ac3ec1fc49ce1906b2e6323","observation_id":"530138ad-78b0-4f6b-99e5-d029c1c23b99","resolution":{"observed_at":"2026-08-14T12:36:07.328148Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:36:07.307311Z","title":"Structurally cyclic petri nets.Logical Methods in Computer Science , 11(4), 2015","venue":null,"work_id":"d115e45e-2e53-4f70-9031-44476ea6259d","year":2015},"citing_paper":{"arxiv_id":"1908.07282","last_updated":"2020-10-12T13:04:52Z","snapshot_observed_at":"2026-08-16T13:44:00.611016Z","submitted_at":"2019-08-20T11:44:36Z","title":"Verification of Flat FIFO Systems","version":5},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T12:36:06.919755Z"},"links":{"citing_paper":"/paper/1908.07282"},"observation_digest":"sha256:edbdde1a51eff64e7eb8c8b62caac5b41890f7f3f26891b5a89a5953b20f18cb","observation_id":"8fec4b75-ab7f-4108-9b90-bd7eb8a421b8","resolution":{"observed_at":"2026-08-14T12:36:07.312735Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:36:07.291170Z","title":"A perfect model for bounded verification","venue":null,"work_id":"c52ed662-3a98-402a-9c4a-70a4fbbef434","year":2012},"citing_paper":{"arxiv_id":"1908.07282","last_updated":"2020-10-12T13:04:52Z","snapshot_observed_at":"2026-08-16T13:44:00.611016Z","submitted_at":"2019-08-20T11:44:36Z","title":"Verification of Flat FIFO Systems","version":5},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T12:36:06.924843Z"},"links":{"citing_paper":"/paper/1908.07282"},"observation_digest":"sha256:6dae3755ea790115909be5ca37d78af2aee7e53bd183e30338b93695f09e9491","observation_id":"dde975ab-9929-4fb7-bcad-adfb9257f7a9","resolution":{"observed_at":"2026-08-14T12:36:07.296507Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:36:07.274840Z","title":"Structuration des syst` emes de transitions: applications au contrˆ ole du parall´ elisme par files fifo, Th` ese d’Etat","venue":null,"work_id":"96d97be6-479e-4a36-b8d9-504a7c2206cd","year":1986},"citing_paper":{"arxiv_id":"1908.07282","last_updated":"2020-10-12T13:04:52Z","snapshot_observed_at":"2026-08-16T13:44:00.611016Z","submitted_at":"2019-08-20T11:44:36Z","title":"Verification of Flat FIFO Systems","version":5},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T12:36:06.930490Z"},"links":{"citing_paper":"/paper/1908.07282"},"observation_digest":"sha256:2ff70be0f90ac034b68636a101cf0acc086eaf59db4de42a9ffc989ed9f38903","observation_id":"046a694e-ce34-446f-a982-d9a90842bc7a","resolution":{"observed_at":"2026-08-14T12:36:07.279987Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:36:07.259714Z","title":"Forward analysis for WSTS, part II: Complete WSTS","venue":null,"work_id":"bb476985-38a5-4633-8671-b41f01e16510","year":2012},"citing_paper":{"arxiv_id":"1908.07282","last_updated":"2020-10-12T13:04:52Z","snapshot_observed_at":"2026-08-16T13:44:00.611016Z","submitted_at":"2019-08-20T11:44:36Z","title":"Verification of Flat FIFO Systems","version":5},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T12:36:06.935193Z"},"links":{"citing_paper":"/paper/1908.07282"},"observation_digest":"sha256:adb77efef3e8320d3b628a6d6afb927d45c6c5d879264c28937c8ce6d34788f4","observation_id":"9e1e5e9b-3118-41f6-b54e-ea31779ec642","resolution":{"observed_at":"2026-08-14T12:36:07.264523Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:36:07.243250Z","title":"Synchronizability of communicating finite state machines is not decidable","venue":null,"work_id":"9f6353aa-4bdc-4128-807e-e4b3db1715fd","year":2017},"citing_paper":{"arxiv_id":"1908.07282","last_updated":"2020-10-12T13:04:52Z","snapshot_observed_at":"2026-08-16T13:44:00.611016Z","submitted_at":"2019-08-20T11:44:36Z","title":"Verification of Flat FIFO Systems","version":5},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T12:36:06.939638Z"},"links":{"citing_paper":"/paper/1908.07282"},"observation_digest":"sha256:08b63c4be0305db38406f441436d05d0372d0857185924f25c0c91f83e6df074","observation_id":"3f0b1cdd-1f2a-4902-9266-f100597f834e","resolution":{"observed_at":"2026-08-14T12:36:07.248627Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:36:07.227620Z","title":"Purushothaman Iyer, and Gr´ egoire Sutre","venue":null,"work_id":"717db4ae-c69c-41f0-9813-355ea109d257","year":2003},"citing_paper":{"arxiv_id":"1908.07282","last_updated":"2020-10-12T13:04:52Z","snapshot_observed_at":"2026-08-16T13:44:00.611016Z","submitted_at":"2019-08-20T11:44:36Z","title":"Verification of Flat FIFO Systems","version":5},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T12:36:06.944267Z"},"links":{"citing_paper":"/paper/1908.07282"},"observation_digest":"sha256:85de96dc4eda32f49e2ef5950842be24faca2e114f856750f487e5b214457102","observation_id":"563a3597-a5d8-480d-827b-64ae6b152ac7","resolution":{"observed_at":"2026-08-14T12:36:07.232599Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:36:07.211065Z","title":"On communicating automata with bounded channels","venue":null,"work_id":"2a030d61-27a7-4b6b-9fe4-2f847b12f2d4","year":2007},"citing_paper":{"arxiv_id":"1908.07282","last_updated":"2020-10-12T13:04:52Z","snapshot_observed_at":"2026-08-16T13:44:00.611016Z","submitted_at":"2019-08-20T11:44:36Z","title":"Verification of Flat FIFO Systems","version":5},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T12:36:06.948637Z"},"links":{"citing_paper":"/paper/1908.07282"},"observation_digest":"sha256:b68d66f08c8682b983a2c43c0cc77de8bf61cf13e3dd7a863e1d1b6d8ba7aca4","observation_id":"ace6677d-b633-4938-9e25-0f0d2ed8c791","resolution":{"observed_at":"2026-08-14T12:36:07.216367Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:36:07.195869Z","title":"On the complexity of model checking counter automata","venue":null,"work_id":"d64d5f9e-1c67-42e2-ab67-209754eed12f","year":2012},"citing_paper":{"arxiv_id":"1908.07282","last_updated":"2020-10-12T13:04:52Z","snapshot_observed_at":"2026-08-16T13:44:00.611016Z","submitted_at":"2019-08-20T11:44:36Z","title":"Verification of Flat FIFO Systems","version":5},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T12:36:06.953333Z"},"links":{"citing_paper":"/paper/1908.07282"},"observation_digest":"sha256:5e292e4ca523fe11590edbd2485595d32764dfe442731ceb850f02ade959e7cd","observation_id":"2b42e462-89b7-40ff-9caf-2d57a7c320db","resolution":{"observed_at":"2026-08-14T12:36:07.200577Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:36:07.179732Z","title":null,"venue":null,"work_id":"a51a71ec-8f59-4c56-b9ce-8be4605b95b1","year":2016},"citing_paper":{"arxiv_id":"1908.07282","last_updated":"2020-10-12T13:04:52Z","snapshot_observed_at":"2026-08-16T13:44:00.611016Z","submitted_at":"2019-08-20T11:44:36Z","title":"Verification of Flat FIFO Systems","version":5},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T12:36:06.957877Z"},"links":{"citing_paper":"/paper/1908.07282"},"observation_digest":"sha256:2620c7be22e6fe0c36e2466c5061c7b511ab0503cea17eb33f3dfc852f22a71e","observation_id":"ed2f8e7a-5b05-425f-9d79-c7e9e1a04374","resolution":{"observed_at":"2026-08-14T12:36:07.184457Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:36:07.162653Z","title":"Testing for unboundedness of FIFO channels","venue":null,"work_id":"ac6fbfc3-d251-40f8-897c-c036d5e54033","year":1993},"citing_paper":{"arxiv_id":"1908.07282","last_updated":"2020-10-12T13:04:52Z","snapshot_observed_at":"2026-08-16T13:44:00.611016Z","submitted_at":"2019-08-20T11:44:36Z","title":"Verification of Flat FIFO Systems","version":5},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-14T12:36:06.962186Z"},"links":{"citing_paper":"/paper/1908.07282"},"observation_digest":"sha256:4ac330cf27ad8d56dc79ef847a630b10f86bdfebafee697f2143f3b95a5efa3a","observation_id":"35fff65d-51b7-43df-bd67-7ccba3c1c1ac","resolution":{"observed_at":"2026-08-14T12:36:07.167918Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1901.09606","last_updated":"2019-05-21T12:20:06Z","snapshot_observed_at":"2026-08-14T17:25:00.855276Z","submitted_at":"2019-01-28T11:24:29Z","title":"Verifying Asynchronous Interactions via Communicating Session Automata","version":2},"cited_work":{"arxiv_id":"1901.09606","doi":null,"metadata_source":"pith","pith_arxiv_id":"1901.09606","snapshot_observed_at":"2026-08-14T12:36:07.059237Z","title":"Verifying Asynchronous Interactions via Communicating Session Automata","venue":"cs.PL","work_id":"3ec248b4-13be-4ba1-abce-b9ce4f12454a","year":2019},"citing_paper":{"arxiv_id":"1908.07282","last_updated":"2020-10-12T13:04:52Z","snapshot_observed_at":"2026-08-16T13:44:00.611016Z","submitted_at":"2019-08-20T11:44:36Z","title":"Verification of Flat FIFO Systems","version":5},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-14T12:36:06.967497Z"},"links":{"cited_paper":"/paper/1901.09606","citing_paper":"/paper/1908.07282"},"observation_digest":"sha256:5b01d5dade65c84a783106f8af2f946c71b26801502cb7eca77de5036c7dc714","observation_id":"b856cd80-4d2d-4ac2-8dbd-c4f5e6240e38","resolution":{"observed_at":"2026-08-14T12:36:07.064157Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:36:07.147700Z","title":"Papadimitriou","venue":null,"work_id":"4832a492-5f11-4cf8-b110-9f8c8647ca61","year":1981},"citing_paper":{"arxiv_id":"1908.07282","last_updated":"2020-10-12T13:04:52Z","snapshot_observed_at":"2026-08-16T13:44:00.611016Z","submitted_at":"2019-08-20T11:44:36Z","title":"Verification of Flat FIFO Systems","version":5},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-14T12:36:06.973188Z"},"links":{"citing_paper":"/paper/1908.07282"},"observation_digest":"sha256:040e5ef40fcc2bb5c87e0437a66268f541febd5cba78bb76dda7eba430525fab","observation_id":"d01e16a0-de32-4dc5-90d7-45a2bf3aff33","resolution":{"observed_at":"2026-08-14T12:36:07.152409Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:36:07.130311Z","title":"Complexity hierarchies beyond elementary","venue":null,"work_id":"311ee952-6e7d-4cf0-b825-d38793fb9f6e","year":2016},"citing_paper":{"arxiv_id":"1908.07282","last_updated":"2020-10-12T13:04:52Z","snapshot_observed_at":"2026-08-16T13:44:00.611016Z","submitted_at":"2019-08-20T11:44:36Z","title":"Verification of Flat FIFO Systems","version":5},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-14T12:36:06.978968Z"},"links":{"citing_paper":"/paper/1908.07282"},"observation_digest":"sha256:a1a2dad706f4601529c7a213b013ee94509e6267a6c206690f3fea41a1211edd","observation_id":"9f13abef-7aab-413b-9fb2-cf895e2c2f62","resolution":{"observed_at":"2026-08-14T12:36:07.136342Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2007.05269","last_updated":"2020-07-10T09:27:55Z","snapshot_observed_at":"2026-07-06T09:37:06.286839Z","submitted_at":"2020-07-10T09:27:55Z","title":"On flat lossy channel machines","version":1},"cited_work":{"arxiv_id":"2007.05269","doi":null,"metadata_source":"pith","pith_arxiv_id":"2007.05269","snapshot_observed_at":"2026-08-14T12:36:07.033164Z","title":"On flat lossy channel machines","venue":"cs.LO","work_id":"61841bbb-b732-4c65-ae3f-43ec26723089","year":2020},"citing_paper":{"arxiv_id":"1908.07282","last_updated":"2020-10-12T13:04:52Z","snapshot_observed_at":"2026-08-16T13:44:00.611016Z","submitted_at":"2019-08-20T11:44:36Z","title":"Verification of Flat FIFO Systems","version":5},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-14T12:36:06.983607Z"},"links":{"cited_paper":"/paper/2007.05269","citing_paper":"/paper/1908.07282"},"observation_digest":"sha256:19577cd8316f9a374e88bfd325a53757b166990d6bba3407ca5c0c8b30ed7841","observation_id":"47d342ba-67a1-422f-9532-021e7bec1099","resolution":{"observed_at":"2026-08-14T12:36:07.041330Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:36:07.113610Z","title":"Personal communication, 2018","venue":null,"work_id":"33c9c184-4785-40c8-acf0-3af421e76a47","year":2018},"citing_paper":{"arxiv_id":"1908.07282","last_updated":"2020-10-12T13:04:52Z","snapshot_observed_at":"2026-08-16T13:44:00.611016Z","submitted_at":"2019-08-20T11:44:36Z","title":"Verification of Flat FIFO Systems","version":5},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-14T12:36:06.989610Z"},"links":{"citing_paper":"/paper/1908.07282"},"observation_digest":"sha256:a1f5aeac9e4d4f136e9e581bfee820d9a4f026db169fc25d9ed9c300efbebcdf","observation_id":"db042fef-8176-41b9-99ae-d6e16c2d23c6","resolution":{"observed_at":"2026-08-14T12:36:07.119197Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:36:07.096830Z","title":"Communication protocols and error recovery procedures","venue":null,"work_id":"30beec5c-1464-4985-bc06-ad61e2d1865f","year":1975},"citing_paper":{"arxiv_id":"1908.07282","last_updated":"2020-10-12T13:04:52Z","snapshot_observed_at":"2026-08-16T13:44:00.611016Z","submitted_at":"2019-08-20T11:44:36Z","title":"Verification of Flat FIFO Systems","version":5},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-14T12:36:06.995176Z"},"links":{"citing_paper":"/paper/1908.07282"},"observation_digest":"sha256:dfb0c2e2aaa07d0cca4375054d1dda3a9c6bbb8d01a589b9bee36368815cd10a","observation_id":"2e824f9d-4c9a-4c32-ab56-d687783ed144","resolution":{"observed_at":"2026-08-14T12:36:07.102607Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.07282","last_updated":"2020-10-12T13:04:52Z","latest_version":5,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-16T13:44:00.611016Z","submitted_at":"2019-08-20T11:44:36Z","title":"Verification of Flat FIFO Systems"},"reference_resolution":{"displayed":38,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":3,"verified_fuzzy":34},"total_outbound_references":38},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 38 of 38 outbound references and 0 inbound Pith citation observations for arXiv:1908.07282."}