{"as_of":"2026-08-16T05:58:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5eca54a13b96489c42e4ab2cd5c2632a1a324790cd7fe6b18f7e451be90a80a8","coverage":[{"denominator":32,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":32,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T15:02:44.548850Z","state":"measured"},{"denominator":32,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":32,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+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.02087/citation-record","integrity":"/paper/1908.02087/integrity","json":"/paper/1908.02087/citation-record.json","paper":"/paper/1908.02087"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2014.05959","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:02:45.297120Z","title":"International Journal of Critical Computer-Based Systems (IJCCBS) 5(1/2) (2014)","venue":null,"work_id":"b2fc8aba-e9fc-4ec6-b251-440b3b4a40b0","year":2014},"citing_paper":{"arxiv_id":"1908.02087","last_updated":"2019-08-06T11:45:28Z","snapshot_observed_at":"2026-08-14T14:51:54.372941Z","submitted_at":"2019-08-06T11:45:28Z","title":"A State Class Construction for Computing the Intersection of Time Petri Nets Languages","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T15:02:44.359962Z"},"links":{"citing_paper":"/paper/1908.02087"},"observation_digest":"sha256:534942307669350037a547409fcdf8821c4d02606e7cb9122b54ab28d7e33776","observation_id":"5d392770-6c30-4bbc-b581-489e291b61d8","resolution":{"observed_at":"2026-08-14T15:02:45.304496Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T15:02:44.369477Z","title":"Theoretical Computer Science 126(2) (1994)","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"1908.02087","last_updated":"2019-08-06T11:45:28Z","snapshot_observed_at":"2026-08-14T14:51:54.372941Z","submitted_at":"2019-08-06T11:45:28Z","title":"A State Class Construction for Computing the Intersection of Time Petri Nets Languages","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T15:02:44.369477Z"},"links":{"citing_paper":"/paper/1908.02087"},"observation_digest":"sha256:746d0963f13db26f7a741f3dda89d004d275a445b3c3eb60d8fa3f3c2e765b49","observation_id":"370db4b0-bec8-4398-a45f-9f03bce58650","resolution":{"observed_at":"2026-08-14T15:02:44.369477Z","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":"10.1016/s0304-3975(02)00006-3","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:02:44.779569Z","title":null,"venue":null,"work_id":"9df11a68-ca42-479a-be53-50ccf5518630","year":2002},"citing_paper":{"arxiv_id":"1908.02087","last_updated":"2019-08-06T11:45:28Z","snapshot_observed_at":"2026-08-14T14:51:54.372941Z","submitted_at":"2019-08-06T11:45:28Z","title":"A State Class Construction for Computing the Intersection of Time Petri Nets Languages","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T15:02:44.376046Z"},"links":{"citing_paper":"/paper/1908.02087"},"observation_digest":"sha256:251bda8457574e6901cd9c0be6da7fa3ce8e533a67d34bd6d8629dd75cbf3aa3","observation_id":"407f5137-5eb8-460e-85cf-14d5d6af737b","resolution":{"observed_at":"2026-08-14T15:02:44.784406Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T15:02:44.382499Z","title":"Journal of the ACM 49(2) (2002)","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"1908.02087","last_updated":"2019-08-06T11:45:28Z","snapshot_observed_at":"2026-08-14T14:51:54.372941Z","submitted_at":"2019-08-06T11:45:28Z","title":"A State Class Construction for Computing the Intersection of Time Petri Nets Languages","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T15:02:44.382499Z"},"links":{"citing_paper":"/paper/1908.02087"},"observation_digest":"sha256:7fb9a5f96883fafab912a48df4d139c273ca429a54e67c84a12a28b5f84c0722","observation_id":"eb3c8d30-e204-402f-a969-6631e39e7fe7","resolution":{"observed_at":"2026-08-14T15:02:44.382499Z","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":"2016.25887","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:02:45.161369Z","title":"IEEE Transactions on Automatic Control 62(3) (2017)","venue":null,"work_id":"e12cedf6-da9f-4d24-a9ce-cae120d13576","year":2017},"citing_paper":{"arxiv_id":"1908.02087","last_updated":"2019-08-06T11:45:28Z","snapshot_observed_at":"2026-08-14T14:51:54.372941Z","submitted_at":"2019-08-06T11:45:28Z","title":"A State Class Construction for Computing the Intersection of Time Petri Nets Languages","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T15:02:44.388325Z"},"links":{"citing_paper":"/paper/1908.02087"},"observation_digest":"sha256:c11ddee6cb737f9e4484161e2ac6195211050e183c40471e8e6dfe69e90b6eb9","observation_id":"ec89b88d-4018-45b8-9db5-f765aad1207c","resolution":{"observed_at":"2026-08-14T15:02:45.169098Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/sefm.2006.27","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:02:44.764731Z","title":"In: Software Engineering and Formal Methods (SEFM)","venue":null,"work_id":"31b6cb0b-e7d7-4230-b52f-050c46d8a05b","year":2006},"citing_paper":{"arxiv_id":"1908.02087","last_updated":"2019-08-06T11:45:28Z","snapshot_observed_at":"2026-08-14T14:51:54.372941Z","submitted_at":"2019-08-06T11:45:28Z","title":"A State Class Construction for Computing the Intersection of Time Petri Nets Languages","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T15:02:44.395866Z"},"links":{"citing_paper":"/paper/1908.02087"},"observation_digest":"sha256:4a4bfe8aefa89e412338ce38645b49c1e17428c4f9174e0d67ddf6dc643c2321","observation_id":"ffef3506-1893-4079-903f-eab87a3a7b5c","resolution":{"observed_at":"2026-08-14T15:02:44.769619Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T15:02:45.433863Z","title":"In: Formal Modeling and Analysis of Timed Systems (FORMATS)","venue":null,"work_id":"3402c683-642a-487e-b17d-2f11dc267e54","year":2005},"citing_paper":{"arxiv_id":"1908.02087","last_updated":"2019-08-06T11:45:28Z","snapshot_observed_at":"2026-08-14T14:51:54.372941Z","submitted_at":"2019-08-06T11:45:28Z","title":"A State Class Construction for Computing the Intersection of Time Petri Nets Languages","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T15:02:44.402455Z"},"links":{"citing_paper":"/paper/1908.02087"},"observation_digest":"sha256:add536b511f25519710cdf537caa9f7b9868fe4847c527391f3b458eacf86048","observation_id":"eea72661-5ec7-4585-895a-2f3cd3e8fbfe","resolution":{"observed_at":"2026-08-14T15:02:45.438452Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T15:02:44.408835Z","title":"IEEE Trans","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"1908.02087","last_updated":"2019-08-06T11:45:28Z","snapshot_observed_at":"2026-08-14T14:51:54.372941Z","submitted_at":"2019-08-06T11:45:28Z","title":"A State Class Construction for Computing the Intersection of Time Petri Nets Languages","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T15:02:44.408835Z"},"links":{"citing_paper":"/paper/1908.02087"},"observation_digest":"sha256:1761cdb5d4d13cba05461d3c63e5f8a37092a7dc01c7b209c193cb5f4b0b8eac","observation_id":"da5bcf87-5c02-46e4-98cb-67e519c5f47c","resolution":{"observed_at":"2026-08-14T15:02:44.408835Z","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-14T15:02:45.419224Z","title":"In: Proceedings IFIP (1983)","venue":null,"work_id":"acc0c2a3-b66d-4ce5-bba6-e7449da84f6e","year":1983},"citing_paper":{"arxiv_id":"1908.02087","last_updated":"2019-08-06T11:45:28Z","snapshot_observed_at":"2026-08-14T14:51:54.372941Z","submitted_at":"2019-08-06T11:45:28Z","title":"A State Class Construction for Computing the Intersection of Time Petri Nets Languages","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T15:02:44.416759Z"},"links":{"citing_paper":"/paper/1908.02087"},"observation_digest":"sha256:85c606010f61c1ebdafae6d1cdfcbb0cf0d09c0208da86c8d072ae17da2d1df5","observation_id":"8699d1e2-146f-413a-9001-a909f5c07c5c","resolution":{"observed_at":"2026-08-14T15:02:45.423886Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T15:02:44.422794Z","title":"In: Formal Modeling and Anal- ysis of Timed Systems (FORMATS)","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"1908.02087","last_updated":"2019-08-06T11:45:28Z","snapshot_observed_at":"2026-08-14T14:51:54.372941Z","submitted_at":"2019-08-06T11:45:28Z","title":"A State Class Construction for Computing the Intersection of Time Petri Nets Languages","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T15:02:44.422794Z"},"links":{"citing_paper":"/paper/1908.02087"},"observation_digest":"sha256:a9ddc2914a8c43d6617a3becd4f179bdcf88134a0827c1b6237798ef966c5b69","observation_id":"b8d91892-e26e-4d98-be86-ec26fb104499","resolution":{"observed_at":"2026-08-14T15:02:44.422794Z","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":"10.1007/978-3-540-75596-8_37","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:02:44.730607Z","title":"In: Automated Technology for Verifi- cation and Analysis (ATVA)","venue":null,"work_id":"bc71fe5e-aa38-4b1b-8c45-579c505c08c6","year":2007},"citing_paper":{"arxiv_id":"1908.02087","last_updated":"2019-08-06T11:45:28Z","snapshot_observed_at":"2026-08-14T14:51:54.372941Z","submitted_at":"2019-08-06T11:45:28Z","title":"A State Class Construction for Computing the Intersection of Time Petri Nets Languages","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T15:02:44.428609Z"},"links":{"citing_paper":"/paper/1908.02087"},"observation_digest":"sha256:cda07d10a11110eaf26153db4ef94575b52ae77e1d95479ad32774d0ab7adfd4","observation_id":"af2615b5-3b15-42ca-b472-1e274bf2fc77","resolution":{"observed_at":"2026-08-14T15:02:44.735722Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T15:02:45.403870Z","title":"International Journal of Production Research 42(14) (2004)","venue":null,"work_id":"26f93dd6-44f9-4ae9-a7d7-67565ca47776","year":2004},"citing_paper":{"arxiv_id":"1908.02087","last_updated":"2019-08-06T11:45:28Z","snapshot_observed_at":"2026-08-14T14:51:54.372941Z","submitted_at":"2019-08-06T11:45:28Z","title":"A State Class Construction for Computing the Intersection of Time Petri Nets Languages","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T15:02:44.437283Z"},"links":{"citing_paper":"/paper/1908.02087"},"observation_digest":"sha256:4ff2ab227b26930f4fb8eedd620b397005bafb6bb099a08836822d2543c0b765","observation_id":"bea1ca80-21cc-49f7-a13a-978840626bae","resolution":{"observed_at":"2026-08-14T15:02:45.408748Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T15:02:44.444009Z","title":"In: TACAS","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"1908.02087","last_updated":"2019-08-06T11:45:28Z","snapshot_observed_at":"2026-08-14T14:51:54.372941Z","submitted_at":"2019-08-06T11:45:28Z","title":"A State Class Construction for Computing the Intersection of Time Petri Nets Languages","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T15:02:44.444009Z"},"links":{"citing_paper":"/paper/1908.02087"},"observation_digest":"sha256:c3eb83bf4d0f3d4c10e29cff6ed914701bcab46608513efea183ee3b33baa4a3","observation_id":"5d7b3e37-6ed9-4353-abb3-3548f6e24231","resolution":{"observed_at":"2026-08-14T15:02:44.444009Z","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":"10.1016/j.scico.2016.08.008","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:02:44.705658Z","title":"Science of Computer Programming132(2) (2016)","venue":null,"work_id":"b5bc92e4-ec22-444d-9eae-eb3de0e900bc","year":2016},"citing_paper":{"arxiv_id":"1908.02087","last_updated":"2019-08-06T11:45:28Z","snapshot_observed_at":"2026-08-14T14:51:54.372941Z","submitted_at":"2019-08-06T11:45:28Z","title":"A State Class Construction for Computing the Intersection of Time Petri Nets Languages","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T15:02:44.449742Z"},"links":{"citing_paper":"/paper/1908.02087"},"observation_digest":"sha256:652880d9236f7ab41a44f11a22290eade81209929bad0e710c5566a78743bc1b","observation_id":"029913bb-02be-42b9-81d3-8fd52ce816a8","resolution":{"observed_at":"2026-08-14T15:02:44.710393Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T15:02:44.455356Z","title":"https://doi.org/10.1016/j.tcs.2008.03.030 Computing the Language Intersection of TPN 17","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"1908.02087","last_updated":"2019-08-06T11:45:28Z","snapshot_observed_at":"2026-08-14T14:51:54.372941Z","submitted_at":"2019-08-06T11:45:28Z","title":"A State Class Construction for Computing the Intersection of Time Petri Nets Languages","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T15:02:44.455356Z"},"links":{"citing_paper":"/paper/1908.02087"},"observation_digest":"sha256:fe3d14cf7e019e7be5186ff075a9ff691fdc082e5e0f95a047bd92f9d1937973","observation_id":"adfe0812-62f2-49e4-8c17-4e707df6ca3f","resolution":{"observed_at":"2026-08-14T15:02:44.455356Z","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":"10.1007/11867340_5","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:02:44.678878Z","title":"In: Formal Modeling and Analysis of Timed Systems (FORMATS)","venue":null,"work_id":"8bc75e09-5f15-4caa-81cd-d4906217fa25","year":2006},"citing_paper":{"arxiv_id":"1908.02087","last_updated":"2019-08-06T11:45:28Z","snapshot_observed_at":"2026-08-14T14:51:54.372941Z","submitted_at":"2019-08-06T11:45:28Z","title":"A State Class Construction for Computing the Intersection of Time Petri Nets Languages","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T15:02:44.460800Z"},"links":{"citing_paper":"/paper/1908.02087"},"observation_digest":"sha256:614338d5d8d48b4f370863b715d138952ca94102f3aef21cef84fa25e1104e42","observation_id":"68289656-8415-42e1-8306-97c35f565369","resolution":{"observed_at":"2026-08-14T15:02:44.684394Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2012.22003","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:02:45.078557Z","title":"IEEE Trans","venue":null,"work_id":"1c440074-40a0-4449-a9aa-614019cc5de7","year":2012},"citing_paper":{"arxiv_id":"1908.02087","last_updated":"2019-08-06T11:45:28Z","snapshot_observed_at":"2026-08-14T14:51:54.372941Z","submitted_at":"2019-08-06T11:45:28Z","title":"A State Class Construction for Computing the Intersection of Time Petri Nets Languages","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T15:02:44.466446Z"},"links":{"citing_paper":"/paper/1908.02087"},"observation_digest":"sha256:250e83e903c22cb91f6d5154b3e59041ef36d4eec0b2bd4dd69a2c1bbf460567","observation_id":"70503ffe-a7a3-4e92-92a9-a410651af61d","resolution":{"observed_at":"2026-08-14T15:02:45.088725Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T15:02:45.389712Z","title":"In: ICINCO-ICSO (2009)","venue":null,"work_id":"df870bbc-8dde-4858-8275-e33fb28da58a","year":2009},"citing_paper":{"arxiv_id":"1908.02087","last_updated":"2019-08-06T11:45:28Z","snapshot_observed_at":"2026-08-14T14:51:54.372941Z","submitted_at":"2019-08-06T11:45:28Z","title":"A State Class Construction for Computing the Intersection of Time Petri Nets Languages","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T15:02:44.471848Z"},"links":{"citing_paper":"/paper/1908.02087"},"observation_digest":"sha256:af31bc2c4448c85e6606897e6625090ffb10aa0d66fe816a7d37f482d80476e6","observation_id":"d5387c85-a310-4ce2-8a2b-767b3a934152","resolution":{"observed_at":"2026-08-14T15:02:45.394425Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T15:02:44.477234Z","title":"Journal of Systems and Software 79(10) (2006)","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"1908.02087","last_updated":"2019-08-06T11:45:28Z","snapshot_observed_at":"2026-08-14T14:51:54.372941Z","submitted_at":"2019-08-06T11:45:28Z","title":"A State Class Construction for Computing the Intersection of Time Petri Nets Languages","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T15:02:44.477234Z"},"links":{"citing_paper":"/paper/1908.02087"},"observation_digest":"sha256:27efb3332b95e883495028900fd075191665f24ac487ef41e800daac94f23589","observation_id":"d867b93b-3b72-4530-a24a-138a23c8356e","resolution":{"observed_at":"2026-08-14T15:02:44.477234Z","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-14T15:02:45.374669Z","title":"In: IJCAI (2003)","venue":null,"work_id":"1aef6efa-32ca-4380-be3e-a2436b562dcc","year":2003},"citing_paper":{"arxiv_id":"1908.02087","last_updated":"2019-08-06T11:45:28Z","snapshot_observed_at":"2026-08-14T14:51:54.372941Z","submitted_at":"2019-08-06T11:45:28Z","title":"A State Class Construction for Computing the Intersection of Time Petri Nets Languages","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T15:02:44.483021Z"},"links":{"citing_paper":"/paper/1908.02087"},"observation_digest":"sha256:5bb74b057da83e2b725263be9c47708ca0ce4bbb5a047f485ec726ad177e5ff9","observation_id":"45e4a4c0-2ee2-4acc-85a5-99535ae34332","resolution":{"observed_at":"2026-08-14T15:02:45.379555Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T15:02:45.359688Z","title":"https: //projects.laas.fr/twina/ (2019)","venue":null,"work_id":"9fbdf7db-91dc-4a5e-83a9-88d1a6042940","year":2019},"citing_paper":{"arxiv_id":"1908.02087","last_updated":"2019-08-06T11:45:28Z","snapshot_observed_at":"2026-08-14T14:51:54.372941Z","submitted_at":"2019-08-06T11:45:28Z","title":"A State Class Construction for Computing the Intersection of Time Petri Nets Languages","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T15:02:44.490196Z"},"links":{"citing_paper":"/paper/1908.02087"},"observation_digest":"sha256:6a77822dce5245c2690b882b8ea1fb155801445e7dbf276d089a1108cf28eb21","observation_id":"e5802a2a-3f2a-428e-8217-7e1c33e21deb","resolution":{"observed_at":"2026-08-14T15:02:45.364299Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/11513988_41","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:02:44.652353Z","title":"In: Computer Aided Verification (CAV)","venue":null,"work_id":"4f7df3fa-4b1f-460c-afb9-88dd9b3a6a1c","year":2005},"citing_paper":{"arxiv_id":"1908.02087","last_updated":"2019-08-06T11:45:28Z","snapshot_observed_at":"2026-08-14T14:51:54.372941Z","submitted_at":"2019-08-06T11:45:28Z","title":"A State Class Construction for Computing the Intersection of Time Petri Nets Languages","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T15:02:44.499198Z"},"links":{"citing_paper":"/paper/1908.02087"},"observation_digest":"sha256:cbf941e29d45bae4f3fd0793beb610049b385e5da75e0137a92d40d62329fd63","observation_id":"3f1c03ef-d99d-4d0e-8e2c-b393d1c15f39","resolution":{"observed_at":"2026-08-14T15:02:44.657506Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s10626-016-0234-5","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:02:44.635406Z","title":"Discrete Event Dynamic Systems 27(1) (2017)","venue":null,"work_id":"1aa04f1e-2eba-4a88-a376-8f7389f2c5f2","year":2017},"citing_paper":{"arxiv_id":"1908.02087","last_updated":"2019-08-06T11:45:28Z","snapshot_observed_at":"2026-08-14T14:51:54.372941Z","submitted_at":"2019-08-06T11:45:28Z","title":"A State Class Construction for Computing the Intersection of Time Petri Nets Languages","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T15:02:44.504305Z"},"links":{"citing_paper":"/paper/1908.02087"},"observation_digest":"sha256:ba1b819e7a355c1cdda2ebc58e89f0ac9c5767455305196c4a99a31bb658fee2","observation_id":"d823a9d7-c31b-4e57-9a39-000ac13d7fc5","resolution":{"observed_at":"2026-08-14T15:02:44.640523Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/9.940942","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:02:44.619607Z","title":"IEEE Transactions on Automatic Control 46(8) (2001)","venue":null,"work_id":"1a76e603-5d3b-4bb9-a383-2f032a40e6ad","year":2001},"citing_paper":{"arxiv_id":"1908.02087","last_updated":"2019-08-06T11:45:28Z","snapshot_observed_at":"2026-08-14T14:51:54.372941Z","submitted_at":"2019-08-06T11:45:28Z","title":"A State Class Construction for Computing the Intersection of Time Petri Nets Languages","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T15:02:44.509621Z"},"links":{"citing_paper":"/paper/1908.02087"},"observation_digest":"sha256:e91b44052264b42bdb5145ddcd58f1551c01d37059bfd59b501eeceff244a4d1","observation_id":"4c3e7c0f-1cfe-4094-8e60-ad47800e3402","resolution":{"observed_at":"2026-08-14T15:02:44.624820Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T15:02:44.514450Z","title":"Journal of the ACM (JACM) 47(2) (2000)","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"1908.02087","last_updated":"2019-08-06T11:45:28Z","snapshot_observed_at":"2026-08-14T14:51:54.372941Z","submitted_at":"2019-08-06T11:45:28Z","title":"A State Class Construction for Computing the Intersection of Time Petri Nets Languages","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T15:02:44.514450Z"},"links":{"citing_paper":"/paper/1908.02087"},"observation_digest":"sha256:584a7b2a9de869adb8b76a3a94076a49f06aee0bcea9f491087b2f0f4077d048","observation_id":"e987df9b-5df7-4e17-9ace-e9b8ae689b6a","resolution":{"observed_at":"2026-08-14T15:02:44.514450Z","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-14T15:02:45.345756Z","title":null,"venue":null,"work_id":"b737dedd-5398-4544-a405-2fc5dff5b101","year":1974},"citing_paper":{"arxiv_id":"1908.02087","last_updated":"2019-08-06T11:45:28Z","snapshot_observed_at":"2026-08-14T14:51:54.372941Z","submitted_at":"2019-08-06T11:45:28Z","title":"A State Class Construction for Computing the Intersection of Time Petri Nets Languages","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T15:02:44.519249Z"},"links":{"citing_paper":"/paper/1908.02087"},"observation_digest":"sha256:ab6ed9e702a1cfa4d96e17410309e58e093fb3dfe68db8f9ee6ac70d1edb0019","observation_id":"1b01d9cc-d826-4d89-8fb0-15ac6b08e1d1","resolution":{"observed_at":"2026-08-14T15:02:45.350234Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T15:02:44.524689Z","title":"Discrete Event Dynamic Systems 21(3) (2011)","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"1908.02087","last_updated":"2019-08-06T11:45:28Z","snapshot_observed_at":"2026-08-14T14:51:54.372941Z","submitted_at":"2019-08-06T11:45:28Z","title":"A State Class Construction for Computing the Intersection of Time Petri Nets Languages","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T15:02:44.524689Z"},"links":{"citing_paper":"/paper/1908.02087"},"observation_digest":"sha256:bf129de00813981a9a709f3b308efb7b4aec91ac1cd920147aa9e6f06f078a6d","observation_id":"9f1a5791-597e-4523-ba6e-67f3644dffe1","resolution":{"observed_at":"2026-08-14T15:02:44.524689Z","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-14T15:02:45.329866Z","title":"Proceedings of the IEEE77(1) (1989)","venue":null,"work_id":"dd6ecac2-9288-4419-91d4-0160146c6d38","year":1989},"citing_paper":{"arxiv_id":"1908.02087","last_updated":"2019-08-06T11:45:28Z","snapshot_observed_at":"2026-08-14T14:51:54.372941Z","submitted_at":"2019-08-06T11:45:28Z","title":"A State Class Construction for Computing the Intersection of Time Petri Nets Languages","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T15:02:44.529476Z"},"links":{"citing_paper":"/paper/1908.02087"},"observation_digest":"sha256:035c583398e7be4a87f380a0aeae33cbd7b241e506960662937275f7f021f5d0","observation_id":"e453db9b-a1a1-4b9f-bd31-7414062d32e5","resolution":{"observed_at":"2026-08-14T15:02:45.335091Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T15:02:45.314182Z","title":"IEEE Transactions on automatic control 40(9) (1995)","venue":null,"work_id":"52a35cdb-10fb-4bfa-ae97-368b83fbe967","year":1995},"citing_paper":{"arxiv_id":"1908.02087","last_updated":"2019-08-06T11:45:28Z","snapshot_observed_at":"2026-08-14T14:51:54.372941Z","submitted_at":"2019-08-06T11:45:28Z","title":"A State Class Construction for Computing the Intersection of Time Petri Nets Languages","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T15:02:44.534158Z"},"links":{"citing_paper":"/paper/1908.02087"},"observation_digest":"sha256:3eae52f2907777c7f866d69e74c39c08fc6d17ba053564c0592ebd7b83c38e2c","observation_id":"09b5224a-8363-43c1-92ef-6191c7018d4a","resolution":{"observed_at":"2026-08-14T15:02:45.318968Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1997.64473","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:02:44.936545Z","title":"In: Workshop on Future Trends of Distributed Com- puting Systems","venue":null,"work_id":"a06bfdfb-a262-409b-b018-969b5bc6ec16","year":1997},"citing_paper":{"arxiv_id":"1908.02087","last_updated":"2019-08-06T11:45:28Z","snapshot_observed_at":"2026-08-14T14:51:54.372941Z","submitted_at":"2019-08-06T11:45:28Z","title":"A State Class Construction for Computing the Intersection of Time Petri Nets Languages","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T15:02:44.539020Z"},"links":{"citing_paper":"/paper/1908.02087"},"observation_digest":"sha256:3de50d833606d4adff0ba8e0cd165319dded93887a523cdb4b8ac4ee02a95745","observation_id":"8659e84b-b595-420a-8e32-130788074142","resolution":{"observed_at":"2026-08-14T15:02:44.944271Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/3-540-45739-9_14","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:02:44.592284Z","title":"In: Formal Tech- niques in Real-Time and Fault-Tolerant Systems (FTRTFT) (2002)","venue":null,"work_id":"3d9f7f7f-c504-4023-b1ae-bb5b7f46d978","year":2002},"citing_paper":{"arxiv_id":"1908.02087","last_updated":"2019-08-06T11:45:28Z","snapshot_observed_at":"2026-08-14T14:51:54.372941Z","submitted_at":"2019-08-06T11:45:28Z","title":"A State Class Construction for Computing the Intersection of Time Petri Nets Languages","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T15:02:44.544186Z"},"links":{"citing_paper":"/paper/1908.02087"},"observation_digest":"sha256:1077514b540f66ca1de61dc81a4b33d98768dffd3410914c02e93c9b2f821e01","observation_id":"4b21836f-e01e-4448-81dd-3a9b39b01f7c","resolution":{"observed_at":"2026-08-14T15:02:44.598377Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T15:02:44.548850Z","title":"IEEE Transactions on Automatic Control 60(9) (2015)","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"1908.02087","last_updated":"2019-08-06T11:45:28Z","snapshot_observed_at":"2026-08-14T14:51:54.372941Z","submitted_at":"2019-08-06T11:45:28Z","title":"A State Class Construction for Computing the Intersection of Time Petri Nets Languages","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-14T15:02:44.548850Z"},"links":{"citing_paper":"/paper/1908.02087"},"observation_digest":"sha256:03e2cb0dc149c234e2573ef69ce917bfb32c1da702671994eb1e040538c4a15c","observation_id":"4789116e-5b4e-49f8-8fa0-ad5afa3e0d4d","resolution":{"observed_at":"2026-08-14T15:02:44.548850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"1908.02087","last_updated":"2019-08-06T11:45:28Z","latest_version":1,"primary_category":"cs.LO","snapshot_observed_at":"2026-08-14T14:51:54.372941Z","submitted_at":"2019-08-06T11:45:28Z","title":"A State Class Construction for Computing the Intersection of Time Petri Nets Languages"},"reference_resolution":{"displayed":32,"state_counts":{"malformed_identifier":0,"metadata_mismatch":4,"parse_uncertain":0,"unresolved":11,"verified_exact":9,"verified_fuzzy":8},"total_outbound_references":32},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 32 of 32 outbound references and 0 inbound Pith citation observations for arXiv:1908.02087."}