{"as_of":"2026-08-13T04:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d610c81b1ac9c83e601dc895c19dd0f85617bcefb7d27eaecde56cb1c809c1c6","coverage":[{"denominator":36,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":36,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T12:30:39.056397Z","state":"measured"},{"denominator":37,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":37,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T12:30:38.939597Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-12T18:16:22.223912Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2411.17250","last_updated":"2025-02-17T16:49:25Z","snapshot_observed_at":"2026-08-12T12:18:07.820769Z","submitted_at":"2024-11-26T09:28:43Z","title":"Weakly acyclic diagrams: A data structure for infinite-state symbolic verification","version":2},"cited_work":{"arxiv_id":"2411.17250","doi":"10.48550/arxiv.2411.17250","metadata_source":"pith","pith_arxiv_id":"2411.17250","snapshot_observed_at":"2026-08-12T18:16:22.223912Z","title":"Weakly acyclic diagrams: A data structure for infinite-state symbolic verification","venue":"cs.LO","work_id":"7171ca3b-5d8d-42ea-8029-bc09d16c8c50","year":2024},"citing_paper":{"arxiv_id":"2411.17250","last_updated":"2025-02-17T16:49:25Z","snapshot_observed_at":"2026-08-12T12:18:07.820769Z","submitted_at":"2024-11-26T09:28:43Z","title":"Weakly acyclic diagrams: A data structure for infinite-state symbolic verification","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T12:30:38.939597Z"},"links":{"cited_paper":"/paper/2411.17250","citing_paper":"/paper/2411.17250"},"observation_digest":"sha256:0662bb406766734b435ae6517a6539ba40e70d7e198589a0d9ac23cbee706fbe","observation_id":"4ccffd58-8b4c-4e64-b27b-941bd7cb0f4c","resolution":{"observed_at":"2026-08-12T12:30:39.238093Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2411.17250/citation-record","integrity":"/paper/2411.17250/integrity","json":"/paper/2411.17250/citation-record.json","paper":"/paper/2411.17250"},"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-12T12:30:40.202256Z","title":"International Journal on Software Tools for Technology Transfer 14(2), 109–118 (2012)","venue":null,"work_id":"30ceaacf-cb09-4702-9c03-50aa5392af53","year":2012},"citing_paper":{"arxiv_id":"2411.17250","last_updated":"2025-02-17T16:49:25Z","snapshot_observed_at":"2026-08-12T12:18:07.820769Z","submitted_at":"2024-11-26T09:28:43Z","title":"Weakly acyclic diagrams: A data structure for infinite-state symbolic verification","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T12:30:38.888755Z"},"links":{"citing_paper":"/paper/2411.17250"},"observation_digest":"sha256:2ddb1959c317d84326d8e55e5501c795045ae19c3f13650befc77baee7ace1dc","observation_id":"ea3a2746-f2d1-499e-b8b2-0fd9c53eb2d1","resolution":{"observed_at":"2026-08-12T12:30:40.207523Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-030-91384-7_5","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:30:39.278701Z","title":"In: Model Checking, Synthesis, and Learning – Essays Dedicated to Bengt Jonsson on The Occasion of His 60th Birthday","venue":null,"work_id":"f325e973-f749-4dec-b54a-2e690da27433","year":2021},"citing_paper":{"arxiv_id":"2411.17250","last_updated":"2025-02-17T16:49:25Z","snapshot_observed_at":"2026-08-12T12:18:07.820769Z","submitted_at":"2024-11-26T09:28:43Z","title":"Weakly acyclic diagrams: A data structure for infinite-state symbolic verification","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T12:30:38.894047Z"},"links":{"citing_paper":"/paper/2411.17250"},"observation_digest":"sha256:a56f09fc5a6967dca97b0708f69604e246e8cea709241798147fdacc3ad04089","observation_id":"16df54d9-cf6d-4fce-bccf-bb1f364e1019","resolution":{"observed_at":"2026-08-12T12:30:39.284109Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:30:38.899038Z","title":"In: Proc","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2411.17250","last_updated":"2025-02-17T16:49:25Z","snapshot_observed_at":"2026-08-12T12:18:07.820769Z","submitted_at":"2024-11-26T09:28:43Z","title":"Weakly acyclic diagrams: A data structure for infinite-state symbolic verification","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T12:30:38.899038Z"},"links":{"citing_paper":"/paper/2411.17250"},"observation_digest":"sha256:64b5e45eb1459ad59fc83393dd7d6955e11aef4a20b68faec87a205cd8dc8b19","observation_id":"46b3b3be-bb96-4b03-81db-8f73f8abef28","resolution":{"observed_at":"2026-08-12T12:30:38.899038Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:30:38.903742Z","title":"In: Proc","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2411.17250","last_updated":"2025-02-17T16:49:25Z","snapshot_observed_at":"2026-08-12T12:18:07.820769Z","submitted_at":"2024-11-26T09:28:43Z","title":"Weakly acyclic diagrams: A data structure for infinite-state symbolic verification","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T12:30:38.903742Z"},"links":{"citing_paper":"/paper/2411.17250"},"observation_digest":"sha256:5aeca62269fc3985386fc5e66b296351fd0811bc62ef0dac336aea514bb77a21","observation_id":"4cbb7212-6a30-4e05-84f8-176f817a1c6d","resolution":{"observed_at":"2026-08-12T12:30:38.903742Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:30:40.187293Z","title":"In: Proc","venue":null,"work_id":"a81de90d-9bb0-46ba-b9ec-5e39b5482d6d","year":2004},"citing_paper":{"arxiv_id":"2411.17250","last_updated":"2025-02-17T16:49:25Z","snapshot_observed_at":"2026-08-12T12:18:07.820769Z","submitted_at":"2024-11-26T09:28:43Z","title":"Weakly acyclic diagrams: A data structure for infinite-state symbolic verification","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T12:30:38.909506Z"},"links":{"citing_paper":"/paper/2411.17250"},"observation_digest":"sha256:cbf06928ec963a1f413b8e7dcb93301e17be8ed19e06da240f250500dab61089","observation_id":"f626e9b6-6ab8-49f0-bcdc-c57b2ef045b1","resolution":{"observed_at":"2026-08-12T12:30:40.192581Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T12:30:40.172559Z","title":"In: Proc","venue":null,"work_id":"9678a0a8-203e-4ed1-bc92-67f04c4c12c9","year":null},"citing_paper":{"arxiv_id":"2411.17250","last_updated":"2025-02-17T16:49:25Z","snapshot_observed_at":"2026-08-12T12:18:07.820769Z","submitted_at":"2024-11-26T09:28:43Z","title":"Weakly acyclic diagrams: A data structure for infinite-state symbolic verification","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T12:30:38.916062Z"},"links":{"citing_paper":"/paper/2411.17250"},"observation_digest":"sha256:74aff1947c323fcd1cf3d1ff8af69645c7c4623b835ef2da26167c73d9c748dd","observation_id":"25a0ecb0-aae2-43d7-b5eb-fdd619874017","resolution":{"observed_at":"2026-08-12T12:30:40.177228Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-319-10575-8_21","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:30:39.248477Z","title":"In: Handbook of Model Checking, pp","venue":null,"work_id":"a691d740-8aff-48ed-9b91-ada3c64fd393","year":2018},"citing_paper":{"arxiv_id":"2411.17250","last_updated":"2025-02-17T16:49:25Z","snapshot_observed_at":"2026-08-12T12:18:07.820769Z","submitted_at":"2024-11-26T09:28:43Z","title":"Weakly acyclic diagrams: A data structure for infinite-state symbolic verification","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T12:30:38.926129Z"},"links":{"citing_paper":"/paper/2411.17250"},"observation_digest":"sha256:d427b73e6087bed95ac636bbaa39526fc60b91e4f16b443a52449a1398f6345e","observation_id":"21050918-d393-43c8-a734-466a71239260","resolution":{"observed_at":"2026-08-12T12:30:39.253143Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:30:38.930778Z","title":"IEEE Transactions on Computers27(6), 509– 516 (1978), https://doi.org/10.1109/TC.1978.1675141","venue":null,"work_id":null,"year":1978},"citing_paper":{"arxiv_id":"2411.17250","last_updated":"2025-02-17T16:49:25Z","snapshot_observed_at":"2026-08-12T12:18:07.820769Z","submitted_at":"2024-11-26T09:28:43Z","title":"Weakly acyclic diagrams: A data structure for infinite-state symbolic verification","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T12:30:38.930778Z"},"links":{"citing_paper":"/paper/2411.17250"},"observation_digest":"sha256:0b5cfc53750b368e358166dee45d5d94937d65295b71212f9f3952b04ccc0baf","observation_id":"7a362c4e-51f5-49ac-b9c2-ddc70a22724e","resolution":{"observed_at":"2026-08-12T12:30:38.930778Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:30:40.157471Z","title":null,"venue":null,"work_id":"bb341159-0611-4ad6-ae94-6d7894f3ddef","year":1998},"citing_paper":{"arxiv_id":"2411.17250","last_updated":"2025-02-17T16:49:25Z","snapshot_observed_at":"2026-08-12T12:18:07.820769Z","submitted_at":"2024-11-26T09:28:43Z","title":"Weakly acyclic diagrams: A data structure for infinite-state symbolic verification","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T12:30:38.935365Z"},"links":{"citing_paper":"/paper/2411.17250"},"observation_digest":"sha256:d98f5c0a746bed097a13ffad2fd7f7b1d27a9048df2ce02f34511eeee942d8e5","observation_id":"7d90e554-9ec4-473b-a8e5-7aff6b7dc01d","resolution":{"observed_at":"2026-08-12T12:30:40.162254Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.17250","last_updated":"2025-02-17T16:49:25Z","snapshot_observed_at":"2026-08-12T12:18:07.820769Z","submitted_at":"2024-11-26T09:28:43Z","title":"Weakly acyclic diagrams: A data structure for infinite-state symbolic verification","version":2},"cited_work":{"arxiv_id":"2411.17250","doi":"10.48550/arxiv.2411.17250","metadata_source":"pith","pith_arxiv_id":"2411.17250","snapshot_observed_at":"2026-08-12T18:16:22.223912Z","title":"Weakly acyclic diagrams: A data structure for infinite-state symbolic verification","venue":"cs.LO","work_id":"7171ca3b-5d8d-42ea-8029-bc09d16c8c50","year":2024},"citing_paper":{"arxiv_id":"2411.17250","last_updated":"2025-02-17T16:49:25Z","snapshot_observed_at":"2026-08-12T12:18:07.820769Z","submitted_at":"2024-11-26T09:28:43Z","title":"Weakly acyclic diagrams: A data structure for infinite-state symbolic verification","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T12:30:38.939597Z"},"links":{"cited_paper":"/paper/2411.17250","citing_paper":"/paper/2411.17250"},"observation_digest":"sha256:0662bb406766734b435ae6517a6539ba40e70d7e198589a0d9ac23cbee706fbe","observation_id":"4ccffd58-8b4c-4e64-b27b-941bd7cb0f4c","resolution":{"observed_at":"2026-08-12T12:30:39.238093Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1023/a:1008719024240","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:30:39.211586Z","title":"Formal Methods in System Design (FMSD) 14(3), 237–255 (1999)","venue":null,"work_id":"9bbcc387-ad12-4681-b6f7-2001c7394c12","year":1999},"citing_paper":{"arxiv_id":"2411.17250","last_updated":"2025-02-17T16:49:25Z","snapshot_observed_at":"2026-08-12T12:18:07.820769Z","submitted_at":"2024-11-26T09:28:43Z","title":"Weakly acyclic diagrams: A data structure for infinite-state symbolic verification","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T12:30:38.944741Z"},"links":{"citing_paper":"/paper/2411.17250"},"observation_digest":"sha256:6e6dfedcdd30e04a2197e68e6d918aad31e2fd7627ca5c430f917ee13443674e","observation_id":"413f08c2-2182-4012-b975-f0522dffcb5f","resolution":{"observed_at":"2026-08-12T12:30:39.217097Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:30:38.949423Z","title":"Information and Computation205(2), 199–224 (2007)","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2411.17250","last_updated":"2025-02-17T16:49:25Z","snapshot_observed_at":"2026-08-12T12:18:07.820769Z","submitted_at":"2024-11-26T09:28:43Z","title":"Weakly acyclic diagrams: A data structure for infinite-state symbolic verification","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T12:30:38.949423Z"},"links":{"citing_paper":"/paper/2411.17250"},"observation_digest":"sha256:dfa4ec490cbbf2c1e68060609557a028d57d89f7b695f277a1929093e4b6e7c5","observation_id":"235c9acd-b3c4-40cc-a85e-d1f387658880","resolution":{"observed_at":"2026-08-12T12:30:38.949423Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:30:38.954174Z","title":"IEEE Transactions on Computers35(8), 677–691 (1986)","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2411.17250","last_updated":"2025-02-17T16:49:25Z","snapshot_observed_at":"2026-08-12T12:18:07.820769Z","submitted_at":"2024-11-26T09:28:43Z","title":"Weakly acyclic diagrams: A data structure for infinite-state symbolic verification","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T12:30:38.954174Z"},"links":{"citing_paper":"/paper/2411.17250"},"observation_digest":"sha256:deef3d1a5f2c3298568077abfdda47c4f55401ecbea3a11396ec717e5ed4694d","observation_id":"28d0021a-6dff-4135-bbbb-603aac805540","resolution":{"observed_at":"2026-08-12T12:30:38.954174Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:30:38.958559Z","title":"In: Handbook of Model Checking, pp","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2411.17250","last_updated":"2025-02-17T16:49:25Z","snapshot_observed_at":"2026-08-12T12:18:07.820769Z","submitted_at":"2024-11-26T09:28:43Z","title":"Weakly acyclic diagrams: A data structure for infinite-state symbolic verification","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T12:30:38.958559Z"},"links":{"citing_paper":"/paper/2411.17250"},"observation_digest":"sha256:114b8a11917ffb24f535f342db670e60c804bd2aa9d5d9f107d6a50d449c926f","observation_id":"6331c6c4-7b3d-4194-8b0d-49be45d06ee5","resolution":{"observed_at":"2026-08-12T12:30:38.958559Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:30:38.963181Z","title":"Journal of Computer and System Sciences20(1), 32–49 (1980), https://doi.org/10.1016/0022-0000(80) 90003-3","venue":null,"work_id":null,"year":1980},"citing_paper":{"arxiv_id":"2411.17250","last_updated":"2025-02-17T16:49:25Z","snapshot_observed_at":"2026-08-12T12:18:07.820769Z","submitted_at":"2024-11-26T09:28:43Z","title":"Weakly acyclic diagrams: A data structure for infinite-state symbolic verification","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T12:30:38.963181Z"},"links":{"citing_paper":"/paper/2411.17250"},"observation_digest":"sha256:7c096300d06db79d4d2c0ffd67e2a77f3cd957af38a5a499848bbed344b953ab","observation_id":"5eee4419-2a1e-462c-a0fb-bbb5299947d5","resolution":{"observed_at":"2026-08-12T12:30:38.963181Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:30:40.142883Z","title":"In: Handbook of Model Checking, pp","venue":null,"work_id":"84be2a50-933f-4b65-9a1c-fd7201477496","year":2018},"citing_paper":{"arxiv_id":"2411.17250","last_updated":"2025-02-17T16:49:25Z","snapshot_observed_at":"2026-08-12T12:18:07.820769Z","submitted_at":"2024-11-26T09:28:43Z","title":"Weakly acyclic diagrams: A data structure for infinite-state symbolic verification","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T12:30:38.967701Z"},"links":{"citing_paper":"/paper/2411.17250"},"observation_digest":"sha256:9cdc211f0bdc10e136c062fae10999358761423941ae56752f4bc98e831e6da9","observation_id":"40aae5f4-ef4d-41dd-98aa-252c3b78728e","resolution":{"observed_at":"2026-08-12T12:30:40.147524Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"records/8354894","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:30:39.514434Z","title":"In: Proc","venue":null,"work_id":"085f4d6e-db58-4aea-ab11-202647d0a5ec","year":2024},"citing_paper":{"arxiv_id":"2411.17250","last_updated":"2025-02-17T16:49:25Z","snapshot_observed_at":"2026-08-12T12:18:07.820769Z","submitted_at":"2024-11-26T09:28:43Z","title":"Weakly acyclic diagrams: A data structure for infinite-state symbolic verification","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T12:30:38.972427Z"},"links":{"citing_paper":"/paper/2411.17250"},"observation_digest":"sha256:2e896f4f5f47a90b01ad006c741bee4e0520bf7ba5f5f95ca9476387b1731a6a","observation_id":"a334cb29-fd6c-45f7-9ec9-4a15282df4b5","resolution":{"observed_at":"2026-08-12T12:30:39.521848Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T12:30:40.127495Z","title":"International Journal on Software Tools for Technology Transfer (STTT)5(2-3), 268–297 (2004)","venue":null,"work_id":"5626a3dc-1117-47fa-9db8-62c835168144","year":2004},"citing_paper":{"arxiv_id":"2411.17250","last_updated":"2025-02-17T16:49:25Z","snapshot_observed_at":"2026-08-12T12:18:07.820769Z","submitted_at":"2024-11-26T09:28:43Z","title":"Weakly acyclic diagrams: A data structure for infinite-state symbolic verification","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T12:30:38.977079Z"},"links":{"citing_paper":"/paper/2411.17250"},"observation_digest":"sha256:aad992b7b10561e990dd74418fa82c71b613e9f9b945fdf95d9b0a55a67be5c3","observation_id":"4a3200ca-c393-4f67-9e11-263c60aa9c10","resolution":{"observed_at":"2026-08-12T12:30:40.132397Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T12:30:40.112771Z","title":null,"venue":null,"work_id":"6bbb540b-530a-4b53-8de1-066f371a5d45","year":1976},"citing_paper":{"arxiv_id":"2411.17250","last_updated":"2025-02-17T16:49:25Z","snapshot_observed_at":"2026-08-12T12:18:07.820769Z","submitted_at":"2024-11-26T09:28:43Z","title":"Weakly acyclic diagrams: A data structure for infinite-state symbolic verification","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-12T12:30:38.981505Z"},"links":{"citing_paper":"/paper/2411.17250"},"observation_digest":"sha256:2f6a5cd3ff0d937c7f01318a5a17018a317086c1f115ffa58da49f0005ffdedc","observation_id":"89ea04c2-a574-43b1-9abf-a83308f8f368","resolution":{"observed_at":"2026-08-12T12:30:40.117429Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T12:30:40.098119Z","title":"MIT Press (2023)","venue":null,"work_id":"5d372aff-408c-4ad8-8e28-e0b792c77c18","year":2023},"citing_paper":{"arxiv_id":"2411.17250","last_updated":"2025-02-17T16:49:25Z","snapshot_observed_at":"2026-08-12T12:18:07.820769Z","submitted_at":"2024-11-26T09:28:43Z","title":"Weakly acyclic diagrams: A data structure for infinite-state symbolic verification","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-12T12:30:38.985749Z"},"links":{"citing_paper":"/paper/2411.17250"},"observation_digest":"sha256:66905f3e5ff305f094cc3fde46cb8dce27962aebfcb8fc98e6b96904615d4b78","observation_id":"c53b9151-54e4-430e-ad10-bc83c8ef66f6","resolution":{"observed_at":"2026-08-12T12:30:40.102721Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/lics.1999","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:30:39.168523Z","title":"In: Proc","venue":null,"work_id":"26f04c44-c97b-4b06-846d-83add4af8ddf","year":1999},"citing_paper":{"arxiv_id":"2411.17250","last_updated":"2025-02-17T16:49:25Z","snapshot_observed_at":"2026-08-12T12:18:07.820769Z","submitted_at":"2024-11-26T09:28:43Z","title":"Weakly acyclic diagrams: A data structure for infinite-state symbolic verification","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-12T12:30:38.989846Z"},"links":{"citing_paper":"/paper/2411.17250"},"observation_digest":"sha256:09194cd5f11ea591249d7d202fd7aae2e61c0acee888f425a41a38190550984e","observation_id":"0b1bcc74-30ae-439f-9ff5-2cf52c405234","resolution":{"observed_at":"2026-08-12T12:30:39.173179Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-319-08867-9_40","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:30:39.153987Z","title":"In: Proc","venue":null,"work_id":"7911e34b-9aa2-406a-a79d-7ed46ae1e4c2","year":2014},"citing_paper":{"arxiv_id":"2411.17250","last_updated":"2025-02-17T16:49:25Z","snapshot_observed_at":"2026-08-12T12:18:07.820769Z","submitted_at":"2024-11-26T09:28:43Z","title":"Weakly acyclic diagrams: A data structure for infinite-state symbolic verification","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-12T12:30:38.994747Z"},"links":{"citing_paper":"/paper/2411.17250"},"observation_digest":"sha256:173b893e75383d6ec918f08fb616e12528dc7d8fddd75c18df8f112265a1081e","observation_id":"c49deb1a-b4ef-41d7-884a-3543e7d9022f","resolution":{"observed_at":"2026-08-12T12:30:39.158452Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T12:30:40.081484Z","title":"https://doi.org/10.1016/ S0304-3975(00)00102-X","venue":null,"work_id":"12609c1f-c099-491e-92af-97755313a8bb","year":2001},"citing_paper":{"arxiv_id":"2411.17250","last_updated":"2025-02-17T16:49:25Z","snapshot_observed_at":"2026-08-12T12:18:07.820769Z","submitted_at":"2024-11-26T09:28:43Z","title":"Weakly acyclic diagrams: A data structure for infinite-state symbolic verification","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-12T12:30:38.999624Z"},"links":{"citing_paper":"/paper/2411.17250"},"observation_digest":"sha256:117d3bf98820bcfb8787b10675f034bef9475541fc0e53678c458bf86a39adfa","observation_id":"fd1d99c9-f3f2-45ff-9982-3b14f04cf879","resolution":{"observed_at":"2026-08-12T12:30:40.087135Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T12:30:40.065707Z","title":null,"venue":null,"work_id":"e87d54b9-c0b8-4869-83e2-22123764fa1b","year":2007},"citing_paper":{"arxiv_id":"2411.17250","last_updated":"2025-02-17T16:49:25Z","snapshot_observed_at":"2026-08-12T12:18:07.820769Z","submitted_at":"2024-11-26T09:28:43Z","title":"Weakly acyclic diagrams: A data structure for infinite-state symbolic verification","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-12T12:30:39.004104Z"},"links":{"citing_paper":"/paper/2411.17250"},"observation_digest":"sha256:413422d7136f8e7a43d8441ece4da8f01295a811e56e3dac95c06718cfa4a93c","observation_id":"eb9e0623-0955-4763-a7c7-a023072e2421","resolution":{"observed_at":"2026-08-12T12:30:40.070339Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2282.30922","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:30:39.433743Z","title":"In: Proc","venue":null,"work_id":"58d2715d-c403-4490-ba46-9a8462a63594","year":2017},"citing_paper":{"arxiv_id":"2411.17250","last_updated":"2025-02-17T16:49:25Z","snapshot_observed_at":"2026-08-12T12:18:07.820769Z","submitted_at":"2024-11-26T09:28:43Z","title":"Weakly acyclic diagrams: A data structure for infinite-state symbolic verification","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-12T12:30:39.008589Z"},"links":{"citing_paper":"/paper/2411.17250"},"observation_digest":"sha256:62539804e9c9e7742408d967bff4d2f44c0fbabfbc3a78fd4b40d719e8d39cf1","observation_id":"286d04d6-1a78-4efc-8e77-2b2e0c9e04a1","resolution":{"observed_at":"2026-08-12T12:30:39.441430Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T12:30:40.050309Z","title":"In: Proc","venue":null,"work_id":"6d7ae2cf-f511-4617-9640-86fceceee033","year":2009},"citing_paper":{"arxiv_id":"2411.17250","last_updated":"2025-02-17T16:49:25Z","snapshot_observed_at":"2026-08-12T12:18:07.820769Z","submitted_at":"2024-11-26T09:28:43Z","title":"Weakly acyclic diagrams: A data structure for infinite-state symbolic verification","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-12T12:30:39.013494Z"},"links":{"citing_paper":"/paper/2411.17250"},"observation_digest":"sha256:95f30a7b46a04223f5a9231a575c68c426023a95ad19653aab337a87ba6aea79","observation_id":"d70b9dde-7de9-4781-be9f-96d9e8c341d5","resolution":{"observed_at":"2026-08-12T12:30:40.055123Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-642-28756-5_34","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:30:39.139807Z","title":"In: Proc","venue":null,"work_id":"52c573af-9331-4040-a707-04a5ab6225e9","year":2012},"citing_paper":{"arxiv_id":"2411.17250","last_updated":"2025-02-17T16:49:25Z","snapshot_observed_at":"2026-08-12T12:18:07.820769Z","submitted_at":"2024-11-26T09:28:43Z","title":"Weakly acyclic diagrams: A data structure for infinite-state symbolic verification","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-12T12:30:39.018267Z"},"links":{"citing_paper":"/paper/2411.17250"},"observation_digest":"sha256:b5de5c67daacb7e7e3df58ee0f456ba72eb9e01f80a563f10b82564c8efbdb3d","observation_id":"f7e72921-acef-4b70-b713-27cfba3cdcc3","resolution":{"observed_at":"2026-08-12T12:30:39.144357Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T12:30:40.029325Z","title":"BRICS, Department of Computer Science, University of Aarhus (January 2001), notes Series NS-01-1","venue":null,"work_id":"8cc1bf6c-20cb-421f-b627-99da9414675e","year":2001},"citing_paper":{"arxiv_id":"2411.17250","last_updated":"2025-02-17T16:49:25Z","snapshot_observed_at":"2026-08-12T12:18:07.820769Z","submitted_at":"2024-11-26T09:28:43Z","title":"Weakly acyclic diagrams: A data structure for infinite-state symbolic verification","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-12T12:30:39.022734Z"},"links":{"citing_paper":"/paper/2411.17250"},"observation_digest":"sha256:16c472d3c97f4ba6424a83b25d187481c38008a407a90fe0dafd99485bfd3462","observation_id":"fbed1e0d-d927-49cd-aa4c-065950f4b4ee","resolution":{"observed_at":"2026-08-12T12:30:40.035047Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.ic.2017.06.004","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:30:39.124728Z","title":"Information and Computation255, 177–192 (2017)","venue":null,"work_id":"4d8b6324-fbdd-4bff-842c-28c28f00427d","year":2017},"citing_paper":{"arxiv_id":"2411.17250","last_updated":"2025-02-17T16:49:25Z","snapshot_observed_at":"2026-08-12T12:18:07.820769Z","submitted_at":"2024-11-26T09:28:43Z","title":"Weakly acyclic diagrams: A data structure for infinite-state symbolic verification","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-12T12:30:39.027433Z"},"links":{"citing_paper":"/paper/2411.17250"},"observation_digest":"sha256:fa3fdde9629368eef34c10888e738a6c3c69401c5d07e5314a0e17aa52acf505","observation_id":"dbca757c-18ca-4351-9d09-547fd235b9ca","resolution":{"observed_at":"2026-08-12T12:30:39.129764Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T12:30:40.013009Z","title":"Logical Methods in Computer Science17(2) (2021)","venue":null,"work_id":"0369a960-ab4c-4658-8dd8-e89af2391f21","year":2021},"citing_paper":{"arxiv_id":"2411.17250","last_updated":"2025-02-17T16:49:25Z","snapshot_observed_at":"2026-08-12T12:18:07.820769Z","submitted_at":"2024-11-26T09:28:43Z","title":"Weakly acyclic diagrams: A data structure for infinite-state symbolic verification","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-12T12:30:39.032035Z"},"links":{"citing_paper":"/paper/2411.17250"},"observation_digest":"sha256:3b62916407f7da0d79b224a8498270e32cf0048bb69d028c97d0486326933491","observation_id":"2adba41c-3c76-4b5b-99e9-9e6b765da9f6","resolution":{"observed_at":"2026-08-12T12:30:40.018407Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:30:39.036558Z","title":"Proceedings of the IEEE 77(4), 541–580 (1989)","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2411.17250","last_updated":"2025-02-17T16:49:25Z","snapshot_observed_at":"2026-08-12T12:18:07.820769Z","submitted_at":"2024-11-26T09:28:43Z","title":"Weakly acyclic diagrams: A data structure for infinite-state symbolic verification","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-12T12:30:39.036558Z"},"links":{"citing_paper":"/paper/2411.17250"},"observation_digest":"sha256:a3b7cb0b15c4b18fcf1b6dc110eb9e0aa17b49bad5bdb89eca1b5ac18e57f73c","observation_id":"22eb85b5-ab9a-4817-a37c-06cb5e5f4a2f","resolution":{"observed_at":"2026-08-12T12:30:39.036558Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:30:39.997911Z","title":"North Oxford, London and Plenum (1986)","venue":null,"work_id":"38fd4730-b698-4b46-a2d1-052e67cb4048","year":1986},"citing_paper":{"arxiv_id":"2411.17250","last_updated":"2025-02-17T16:49:25Z","snapshot_observed_at":"2026-08-12T12:18:07.820769Z","submitted_at":"2024-11-26T09:28:43Z","title":"Weakly acyclic diagrams: A data structure for infinite-state symbolic verification","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-12T12:30:39.041209Z"},"links":{"citing_paper":"/paper/2411.17250"},"observation_digest":"sha256:b02800d983b436cfbd4ff80cc979bdc0dfedd6400dd2481424d51f2977ac1c4f","observation_id":"73a5fff3-c361-4cf3-b294-bf31ef4fa349","resolution":{"observed_at":"2026-08-12T12:30:40.002682Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.mfcs.2024.81","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:30:39.098879Z","title":"In: Proc","venue":null,"work_id":"6bdf926e-61bc-42d9-b000-ed0bd2ff42d3","year":2024},"citing_paper":{"arxiv_id":"2411.17250","last_updated":"2025-02-17T16:49:25Z","snapshot_observed_at":"2026-08-12T12:18:07.820769Z","submitted_at":"2024-11-26T09:28:43Z","title":"Weakly acyclic diagrams: A data structure for infinite-state symbolic verification","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-12T12:30:39.045680Z"},"links":{"citing_paper":"/paper/2411.17250"},"observation_digest":"sha256:d7c2078b5d1e8dc0d0ed5670ef88ede51f44093b6311efe5f9db0f7f58813f76","observation_id":"9c133e07-f49b-4003-accc-90de142a8862","resolution":{"observed_at":"2026-08-12T12:30:39.104745Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:30:39.051033Z","title":"In: Proc","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2411.17250","last_updated":"2025-02-17T16:49:25Z","snapshot_observed_at":"2026-08-12T12:18:07.820769Z","submitted_at":"2024-11-26T09:28:43Z","title":"Weakly acyclic diagrams: A data structure for infinite-state symbolic verification","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-12T12:30:39.051033Z"},"links":{"citing_paper":"/paper/2411.17250"},"observation_digest":"sha256:f4b327ee519c038fa0750a3bfb5585a43accd2284d4103cac00c47ce0ea8acba","observation_id":"898fcb18-7ce0-4490-a73b-8cd244a4467e","resolution":{"observed_at":"2026-08-12T12:30:39.051033Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"de/1721365","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:30:39.354580Z","title":"¬flag(q)","venue":null,"work_id":"82fc0fcc-cec0-42da-a9bb-fa91109fe548","year":2024},"citing_paper":{"arxiv_id":"2411.17250","last_updated":"2025-02-17T16:49:25Z","snapshot_observed_at":"2026-08-12T12:18:07.820769Z","submitted_at":"2024-11-26T09:28:43Z","title":"Weakly acyclic diagrams: A data structure for infinite-state symbolic verification","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-12T12:30:39.056397Z"},"links":{"citing_paper":"/paper/2411.17250"},"observation_digest":"sha256:80163c525615bed82c76597708d988973c1631c2981cc617753224b128e77369","observation_id":"9883c912-e573-4a16-9643-cc2cb4697a4e","resolution":{"observed_at":"2026-08-12T12:30:39.363118Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/3-540-60218-6_25","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:30:39.263669Z","title":"https://doi.org/10.1007/3-540-60218-6_25","venue":null,"work_id":"9dbf58f3-1ef2-446a-9062-47bf1616420b","year":1995},"citing_paper":{"arxiv_id":"2411.17250","last_updated":"2025-02-17T16:49:25Z","snapshot_observed_at":"2026-08-12T12:18:07.820769Z","submitted_at":"2024-11-26T09:28:43Z","title":"Weakly acyclic diagrams: A data structure for infinite-state symbolic verification","version":2},"reference_index":347,"source":"pdf_text","source_observed_at":"2026-08-12T12:30:38.920773Z"},"links":{"citing_paper":"/paper/2411.17250"},"observation_digest":"sha256:b4769be2756eebbf4ccc8f9c3bb04c4d97dfc6460be1b4971c86ffae7b883ad6","observation_id":"8b869ae1-5ee8-4a34-b95f-df6610ab7be5","resolution":{"observed_at":"2026-08-12T12:30:39.268789Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2411.17250","last_updated":"2025-02-17T16:49:25Z","latest_version":2,"primary_category":"cs.LO","snapshot_observed_at":"2026-08-12T12:18:07.820769Z","submitted_at":"2024-11-26T09:28:43Z","title":"Weakly acyclic diagrams: A data structure for infinite-state symbolic verification"},"reference_resolution":{"displayed":36,"state_counts":{"malformed_identifier":7,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":11,"verified_exact":11,"verified_fuzzy":5},"total_outbound_references":36},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 36 of 36 outbound references and 1 inbound Pith citation observation for arXiv:2411.17250."}