{"as_of":"2026-08-14T11:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0dbbe5a239e96b8e762835379983be41da20f960ab87a0a97ee24f9d804964fc","coverage":[{"denominator":37,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":37,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-11T11:50:26.030339Z","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-14T06:32:32.682623+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-07-31T21:02:17.918796Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2606.19017","last_updated":"2026-06-17T12:39:15Z","snapshot_observed_at":"2026-08-13T07:25:49.930528Z","submitted_at":"2026-06-17T12:39:15Z","title":"Completeness for Probabilistic Boolean Tapes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2606.19017","snapshot_observed_at":"2026-07-31T21:02:17.918796Z","title":"Completeness for","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.24212","last_updated":"2026-07-27T09:44:17Z","snapshot_observed_at":"2026-08-09T11:58:19.946876Z","submitted_at":"2026-07-27T09:44:17Z","title":"Convex Biproducts, Stochastic Matrices and Tape Diagrams","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-07-31T21:02:17.918796Z"},"links":{"cited_paper":"/paper/2606.19017","citing_paper":"/paper/2607.24212"},"observation_digest":"sha256:4fe882dd36c9e5f2d4fbc113290e699d855438d44b9f2df5a92965e7a2544e69","observation_id":"da3fb1b3-ff0a-4d9b-b36e-b6fc124b056c","resolution":{"observed_at":"2026-07-31T21:02:17.918796Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2606.19017/citation-record","integrity":"/paper/2606.19017/integrity","json":"/paper/2606.19017/citation-record.json","paper":"/paper/2606.19017"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"1401.4973","last_updated":"2014-01-20T16:35:23Z","snapshot_observed_at":"2026-08-13T07:25:55.306472Z","submitted_at":"2014-01-20T16:35:23Z","title":"What are the fundamental structures of concurrency? We still don't know!","version":1},"cited_work":{"arxiv_id":"1401.4973","doi":null,"metadata_source":"pith","pith_arxiv_id":"1401.4973","snapshot_observed_at":"2026-07-04T02:49:24.898501Z","title":"What are the fundamental structures of concurrency? We still don't know!","venue":"cs.LO","work_id":"8743a7ca-1b56-4c39-8dfe-3d0d44c8c3b6","year":2014},"citing_paper":{"arxiv_id":"2606.19017","last_updated":"2026-06-17T12:39:15Z","snapshot_observed_at":"2026-08-13T07:25:49.930528Z","submitted_at":"2026-06-17T12:39:15Z","title":"Completeness for Probabilistic Boolean Tapes","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-26T19:03:40.635333Z"},"links":{"cited_paper":"/paper/1401.4973","citing_paper":"/paper/2606.19017"},"observation_digest":"sha256:3303f39d106139d3bd68cb18a04009e5b1ef0bf1438ed161945fadddc4fee801","observation_id":"3dc740f6-ef15-420c-a84b-d3589efaf117","resolution":{"observed_at":"2026-07-04T02:49:24.900030Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2310.18156","doi":"10.48550/arxiv.2310.18156","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Sufficient incorrectness logic: SIL and separation SIL","venue":"arXiv (Cornell University)","work_id":"85ebb7be-5712-4a45-a18d-422e4f444eaf","year":2023},"citing_paper":{"arxiv_id":"2606.19017","last_updated":"2026-06-17T12:39:15Z","snapshot_observed_at":"2026-08-13T07:25:49.930528Z","submitted_at":"2026-06-17T12:39:15Z","title":"Completeness for Probabilistic Boolean Tapes","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-26T19:03:40.635333Z"},"links":{"citing_paper":"/paper/2606.19017"},"observation_digest":"sha256:b7c8ddbcc28f5d7ce2cba4f91e1c0bc65ae822e0e43b2ad41557c2fd22f350f3","observation_id":"8a838be7-eeba-4614-80de-617e8abaa496","resolution":{"observed_at":"2026-07-04T02:49:24.908667Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.48550/arxiv.2310","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T07:13:15.821123Z","title":"Tripp and J","venue":null,"work_id":"89496afc-752b-4a8f-83ea-343d39affd1a","year":2023},"citing_paper":{"arxiv_id":"2606.19017","last_updated":"2026-06-17T12:39:15Z","snapshot_observed_at":"2026-08-13T07:25:49.930528Z","submitted_at":"2026-06-17T12:39:15Z","title":"Completeness for Probabilistic Boolean Tapes","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-26T19:03:40.635333Z"},"links":{"citing_paper":"/paper/2606.19017"},"observation_digest":"sha256:6b1f810b5f99d27fab1af93fa8beebd9062d6ee4387bb6492c62fb1f060152b6","observation_id":"09896f51-a944-4070-b46e-1b5f39e6f978","resolution":{"observed_at":"2026-06-26T19:09:48.008293Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-05-21T21:53:07.561222+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-21T21:53:07.561222+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2601.01472","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-04T02:49:24.907928Z","title":"8 Filippo Bonchi, Cipriano Junior Cioffo, Alessandro Di Giorgio, and Elena Di Lavore","venue":null,"work_id":"f4233044-271f-4062-8885-9f2c4b194a7c","year":null},"citing_paper":{"arxiv_id":"2606.19017","last_updated":"2026-06-17T12:39:15Z","snapshot_observed_at":"2026-08-13T07:25:49.930528Z","submitted_at":"2026-06-17T12:39:15Z","title":"Completeness for Probabilistic Boolean Tapes","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-26T19:03:40.635333Z"},"links":{"citing_paper":"/paper/2606.19017"},"observation_digest":"sha256:81540b98b600e1747fc7640aba87fbc8b857f8f9b65a9f47cde715dcd4f089b8","observation_id":"8767bbc1-ea6c-408c-8064-50cd8489eac2","resolution":{"observed_at":"2026-07-04T02:49:24.909422Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.calco.2025.11","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"In: Cîrstea, C., Knapp, A","venue":"ArXiv.org","work_id":"422382de-df0c-4cc4-91a7-38c825317f01","year":2025},"citing_paper":{"arxiv_id":"2606.19017","last_updated":"2026-06-17T12:39:15Z","snapshot_observed_at":"2026-08-13T07:25:49.930528Z","submitted_at":"2026-06-17T12:39:15Z","title":"Completeness for Probabilistic Boolean Tapes","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-26T19:03:40.635333Z"},"links":{"citing_paper":"/paper/2606.19017"},"observation_digest":"sha256:bc43a649d2364beefc40ba5e7897e2053405c4ab4715b979ebf7085aad179a36","observation_id":"0ad50641-6268-4509-ba5a-6597deb56885","resolution":{"observed_at":"2026-06-26T19:09:47.988391Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"5433.2025","doi":"10.1109/lics65433.2025.00009","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Separation and definability in fragments of two-variable first-order logic with counting","venue":null,"work_id":"059669f8-6309-4cb0-b818-20d5adf94399","year":2025},"citing_paper":{"arxiv_id":"2606.19017","last_updated":"2026-06-17T12:39:15Z","snapshot_observed_at":"2026-08-13T07:25:49.930528Z","submitted_at":"2026-06-17T12:39:15Z","title":"Completeness for Probabilistic Boolean Tapes","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-26T19:03:40.635333Z"},"links":{"citing_paper":"/paper/2606.19017"},"observation_digest":"sha256:dc82082c5c2a05be3ef8e6d456df353c75a2558ff337fa5e64e51f6219e55f58","observation_id":"f967a15a-89de-4330-bf29-cc7dfdee4e7c","resolution":{"observed_at":"2026-06-26T19:09:48.021966Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3290338","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Proceedings of the ACM on Programming Languages","work_id":"5a3ee29b-9f5f-495e-9dbd-5e4eee62a4eb","year":2019},"citing_paper":{"arxiv_id":"2606.19017","last_updated":"2026-06-17T12:39:15Z","snapshot_observed_at":"2026-08-13T07:25:49.930528Z","submitted_at":"2026-06-17T12:39:15Z","title":"Completeness for Probabilistic Boolean Tapes","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-26T19:03:40.635333Z"},"links":{"citing_paper":"/paper/2606.19017"},"observation_digest":"sha256:155634d5610bd644d0b51c4f3c8e5b62a5daefa1149ae86dd6559f93e26b8f22","observation_id":"f9622ccf-f01e-42ce-8bc6-eac05b0cbb46","resolution":{"observed_at":"2026-06-26T19:09:48.010099Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"6726.267699","doi":"10.1145/2676726.2676993","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"InProceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","venue":null,"work_id":"0052cb2b-1705-43d2-bfe3-72b1acb8e4df","year":2015},"citing_paper":{"arxiv_id":"2606.19017","last_updated":"2026-06-17T12:39:15Z","snapshot_observed_at":"2026-08-13T07:25:49.930528Z","submitted_at":"2026-06-17T12:39:15Z","title":"Completeness for Probabilistic Boolean Tapes","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-26T19:03:40.635333Z"},"links":{"citing_paper":"/paper/2606.19017"},"observation_digest":"sha256:e5e68b19ef5495e608e6f61d97365afc5a50244ac07868d17d6e4d43ba01d915","observation_id":"ed9312a3-252e-4d31-af68-c1c145238e49","resolution":{"observed_at":"2026-06-26T19:09:48.027726Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-07-12T15:49:16.115765+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T15:49:16.115765+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1512.05813","last_updated":"2015-12-17T22:17:36Z","snapshot_observed_at":"2026-08-07T00:07:24.786600Z","submitted_at":"2015-12-17T22:17:36Z","title":"An Introduction to Effectus Theory","version":1},"cited_work":{"arxiv_id":"1512.05813","doi":null,"metadata_source":"pith","pith_arxiv_id":"1512.05813","snapshot_observed_at":"2026-07-04T02:49:24.909849Z","title":"An introduction to effectus theory","venue":"cs.LO","work_id":"7c727d7f-a2b6-4fd8-805c-9d2a04e3ae36","year":2015},"citing_paper":{"arxiv_id":"2606.19017","last_updated":"2026-06-17T12:39:15Z","snapshot_observed_at":"2026-08-13T07:25:49.930528Z","submitted_at":"2026-06-17T12:39:15Z","title":"Completeness for Probabilistic Boolean Tapes","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-26T19:03:40.635333Z"},"links":{"cited_paper":"/paper/1512.05813","citing_paper":"/paper/2606.19017"},"observation_digest":"sha256:08eb68d3fb7f3ca8ccfa1837406d53cf666c7610adbdcd83e6e76fa18cd157c7","observation_id":"3262eca6-85b2-48f7-b16d-87e8b592657a","resolution":{"observed_at":"2026-07-04T02:49:24.910891Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1701.07400","last_updated":"2018-03-02T03:46:28Z","snapshot_observed_at":"2026-08-02T12:00:25.232511Z","submitted_at":"2017-01-25T17:44:28Z","title":"Two Roads to Classicality","version":2},"cited_work":{"arxiv_id":"1701.07400","doi":null,"metadata_source":"pith","pith_arxiv_id":"1701.07400","snapshot_observed_at":"2026-06-26T19:09:48.002003Z","title":"Two Roads to Classicality","venue":"quant-ph","work_id":"d562ca6f-231c-459e-a65f-08670c19a4d6","year":2017},"citing_paper":{"arxiv_id":"2606.19017","last_updated":"2026-06-17T12:39:15Z","snapshot_observed_at":"2026-08-13T07:25:49.930528Z","submitted_at":"2026-06-17T12:39:15Z","title":"Completeness for Probabilistic Boolean Tapes","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-11T11:50:26.030339Z"},"links":{"cited_paper":"/paper/1701.07400","citing_paper":"/paper/2606.19017"},"observation_digest":"sha256:c3bf511b4a0a8efc85c50d5053c286fa2561ed84728278ab2ca9b4c299958c1b","observation_id":"60c53a99-8d87-4c5d-bd0c-762216e2d75c","resolution":{"observed_at":"2026-06-26T19:09:48.003320Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06-26T19:03:40.635333Z","title":"Automatic inference of necessary preconditions","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2606.19017","last_updated":"2026-06-17T12:39:15Z","snapshot_observed_at":"2026-08-13T07:25:49.930528Z","submitted_at":"2026-06-17T12:39:15Z","title":"Completeness for Probabilistic Boolean Tapes","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-26T19:03:40.635333Z"},"links":{"citing_paper":"/paper/2606.19017"},"observation_digest":"sha256:b7fe52e52c3b1ca4286a0cc9350b70a75bbe75e465f238d6507c67abb0c6b418","observation_id":"4e5e79ef-5c3b-4e3a-b75d-09ac2fee9ac8","resolution":{"observed_at":"2026-06-26T19:03:40.635333Z","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-642-35873-9","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Springer, 2013.doi:10.1007/978-3-642-35873-9\\_10","venue":"Lecture notes in computer science","work_id":"1db2b4df-c89c-4a7a-b57b-301c2c84ba91","year":2013},"citing_paper":{"arxiv_id":"2606.19017","last_updated":"2026-06-17T12:39:15Z","snapshot_observed_at":"2026-08-13T07:25:49.930528Z","submitted_at":"2026-06-17T12:39:15Z","title":"Completeness for Probabilistic Boolean Tapes","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-26T19:03:40.635333Z"},"links":{"citing_paper":"/paper/2606.19017"},"observation_digest":"sha256:78829b74bfb2858c7df2669f27616def875342d47356ac8d9e6f2e23f2f73da7","observation_id":"6b054a5c-7758-4f9d-944e-4f2f8c4319d3","resolution":{"observed_at":"2026-06-26T19:09:47.990037Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-07-12T19:49:20.398436+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T19:49:20.398436+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2301.12989","last_updated":"2025-04-17T17:48:17Z","snapshot_observed_at":"2026-08-13T12:55:08.170001Z","submitted_at":"2023-01-30T15:31:08Z","title":"Evidential Decision Theory via Partial Markov Categories","version":4},"cited_work":{"arxiv_id":"2301.12989","doi":"10.48550/arxiv.2301.12989","metadata_source":"arxiv_reference","pith_arxiv_id":"2301.12989","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Evidential decision theory via partial markov categories","venue":"arXiv (Cornell University)","work_id":"4e82ab82-03ea-42da-9710-3acae467a72d","year":null},"citing_paper":{"arxiv_id":"2606.19017","last_updated":"2026-06-17T12:39:15Z","snapshot_observed_at":"2026-08-13T07:25:49.930528Z","submitted_at":"2026-06-17T12:39:15Z","title":"Completeness for Probabilistic Boolean Tapes","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-26T19:03:40.635333Z"},"links":{"cited_paper":"/paper/2301.12989","citing_paper":"/paper/2606.19017"},"observation_digest":"sha256:e74f26affdbd0378eeb34872d8e5635fb2e9389da0079a9754c38b048c738d83","observation_id":"3da2da4a-bb8a-483d-a58a-3ecb699f7e3e","resolution":{"observed_at":"2026-07-04T02:49:24.912038Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2301.12989","last_updated":"2025-04-17T17:48:17Z","snapshot_observed_at":"2026-08-13T12:55:08.170001Z","submitted_at":"2023-01-30T15:31:08Z","title":"Evidential Decision Theory via Partial Markov Categories","version":4},"cited_work":{"arxiv_id":"2301.12989","doi":"10.48550/arxiv.2301.12989","metadata_source":"arxiv_reference","pith_arxiv_id":"2301.12989","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Evidential decision theory via partial markov categories","venue":"arXiv (Cornell University)","work_id":"4e82ab82-03ea-42da-9710-3acae467a72d","year":null},"citing_paper":{"arxiv_id":"2606.19017","last_updated":"2026-06-17T12:39:15Z","snapshot_observed_at":"2026-08-13T07:25:49.930528Z","submitted_at":"2026-06-17T12:39:15Z","title":"Completeness for Probabilistic Boolean Tapes","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-26T19:03:40.635333Z"},"links":{"cited_paper":"/paper/2301.12989","citing_paper":"/paper/2606.19017"},"observation_digest":"sha256:ab835d20e4428679fa8eee4d6ffb6fd661c49484536812828fd6b3c20236a239","observation_id":"07bcbd53-2fcc-4789-8c1c-cc528be5308a","resolution":{"observed_at":"2026-06-26T19:09:48.006356Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2502.03477","doi":"10.48550/arxiv.2502.03477","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Partial Markov categories","venue":"ArXiv.org","work_id":"683a3f9c-63a0-4327-9971-8906964ebfa7","year":2025},"citing_paper":{"arxiv_id":"2606.19017","last_updated":"2026-06-17T12:39:15Z","snapshot_observed_at":"2026-08-13T07:25:49.930528Z","submitted_at":"2026-06-17T12:39:15Z","title":"Completeness for Probabilistic Boolean Tapes","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-26T19:03:40.635333Z"},"links":{"citing_paper":"/paper/2606.19017"},"observation_digest":"sha256:3fd649296f9ba2b1259d4b9813c4c66f7fce80d6d0ffa9a460bb86bb505b96ba","observation_id":"9018bf1c-9f43-4585-ba49-2210ce738cad","resolution":{"observed_at":"2026-06-26T19:09:48.000683Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06-26T19:03:40.635333Z","title":"A categorical approach to open and interconnected dynamical systems","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.19017","last_updated":"2026-06-17T12:39:15Z","snapshot_observed_at":"2026-08-13T07:25:49.930528Z","submitted_at":"2026-06-17T12:39:15Z","title":"Completeness for Probabilistic Boolean Tapes","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-26T19:03:40.635333Z"},"links":{"citing_paper":"/paper/2606.19017"},"observation_digest":"sha256:d943b13adfda75052b4050f57e7c13dc45f9326d0afc112e4e89f8ca8ba6cf11","observation_id":"43c9a8f0-9856-42d3-824d-7773039d95d6","resolution":{"observed_at":"2026-06-26T19:03:40.635333Z","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-06-26T19:03:40.635333Z","title":"String diagrams for regular logic (extended abstract)","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.19017","last_updated":"2026-06-17T12:39:15Z","snapshot_observed_at":"2026-08-13T07:25:49.930528Z","submitted_at":"2026-06-17T12:39:15Z","title":"Completeness for Probabilistic Boolean Tapes","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-26T19:03:40.635333Z"},"links":{"citing_paper":"/paper/2606.19017"},"observation_digest":"sha256:5860edf4a15e60b831717590ca678ea80cafb1f03819d54032239f1d2272f8ba","observation_id":"1d46d0f8-3b8c-4026-997d-ddfe728a2c3c","resolution":{"observed_at":"2026-06-26T19:03:40.635333Z","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.4204/eptcs.323","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Electronic Proceedings in Theoretical Computer Science","work_id":"4e5ce68f-387d-47bd-96c9-210acfd9784d","year":null},"citing_paper":{"arxiv_id":"2606.19017","last_updated":"2026-06-17T12:39:15Z","snapshot_observed_at":"2026-08-13T07:25:49.930528Z","submitted_at":"2026-06-17T12:39:15Z","title":"Completeness for Probabilistic Boolean Tapes","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-26T19:03:40.635333Z"},"links":{"citing_paper":"/paper/2606.19017"},"observation_digest":"sha256:6915b0a6044e9a8f785b0da0e7c11128fdbebfd789df87b0153d2ddca9a71e68","observation_id":"b07119c2-ced8-4c7a-8a5d-f8d1244da5dd","resolution":{"observed_at":"2026-06-26T19:09:47.994429Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.14049","last_updated":"2023-08-25T11:22:48Z","snapshot_observed_at":"2026-08-13T12:17:39.337183Z","submitted_at":"2023-03-24T15:01:05Z","title":"Weakly Markov categories and weakly affine monads","version":2},"cited_work":{"arxiv_id":"2303.14049","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2303.14049","snapshot_observed_at":"2026-07-04T02:49:24.904873Z","title":"Weakly markov categories and weakly affine monads.arXiv preprint arXiv:2303.14049,","venue":null,"work_id":"36e07fff-e5bb-4446-b9c1-09466f9655c9","year":null},"citing_paper":{"arxiv_id":"2606.19017","last_updated":"2026-06-17T12:39:15Z","snapshot_observed_at":"2026-08-13T07:25:49.930528Z","submitted_at":"2026-06-17T12:39:15Z","title":"Completeness for Probabilistic Boolean Tapes","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-26T19:03:40.635333Z"},"links":{"cited_paper":"/paper/2303.14049","citing_paper":"/paper/2606.19017"},"observation_digest":"sha256:59b3a12b1042dac2593917daa79229c4429aa9195b96299f5a613ea878807d82","observation_id":"caad1fa9-bd76-4b72-b2ff-ea1786be12c6","resolution":{"observed_at":"2026-07-04T02:49:24.906644Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2105.02639","last_updated":"2021-09-16T15:08:19Z","snapshot_observed_at":"2026-08-13T19:27:43.336753Z","submitted_at":"2021-05-06T13:19:07Z","title":"De Finetti's Theorem in Categorical Probability","version":3},"cited_work":{"arxiv_id":"2105.02639","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2105.02639","snapshot_observed_at":"2026-07-04T02:49:24.904205Z","title":"De finetti’s theorem in categorical probability.arXiv preprint arXiv:2105.02639,","venue":null,"work_id":"6223d648-f51a-4041-8209-10c5b21c0f5c","year":2016},"citing_paper":{"arxiv_id":"2606.19017","last_updated":"2026-06-17T12:39:15Z","snapshot_observed_at":"2026-08-13T07:25:49.930528Z","submitted_at":"2026-06-17T12:39:15Z","title":"Completeness for Probabilistic Boolean Tapes","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-26T19:03:40.635333Z"},"links":{"cited_paper":"/paper/2105.02639","citing_paper":"/paper/2606.19017"},"observation_digest":"sha256:54ad725d7f8a96df784cbe9284f543ac3f995f557b815d33219f75153be14aca","observation_id":"6a3f7c40-6648-45e9-b4a1-016ae2a51963","resolution":{"observed_at":"2026-07-04T02:49:24.905751Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2016.788665","doi":"10.1109/fmcad.2016.7886655","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"doi:10.1109/FMCAD.2016.7886655 , url =","venue":null,"work_id":"73041255-d2aa-4339-99de-3807557481d4","year":2016},"citing_paper":{"arxiv_id":"2606.19017","last_updated":"2026-06-17T12:39:15Z","snapshot_observed_at":"2026-08-13T07:25:49.930528Z","submitted_at":"2026-06-17T12:39:15Z","title":"Completeness for Probabilistic Boolean Tapes","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-26T19:03:40.635333Z"},"links":{"citing_paper":"/paper/2606.19017"},"observation_digest":"sha256:ed03d2f73695b6aace84a19161a8bddf11830fbadcd3046e1dfbdd6766e94773","observation_id":"23206609-1989-4652-b199-1ec55cc47c5e","resolution":{"observed_at":"2026-06-26T19:09:47.995098Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2107.10526","last_updated":"2021-07-22T08:56:41Z","snapshot_observed_at":"2026-08-13T18:41:59.267551Z","submitted_at":"2021-07-22T08:56:41Z","title":"Bimonoidal Categories, $E_n$-Monoidal Categories, and Algebraic $K$-Theory","version":1},"cited_work":{"arxiv_id":"2107.10526","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2107.10526","snapshot_observed_at":"2026-07-04T02:49:24.885900Z","title":"Bimonoidal categories, e_n-monoidal categories, and algebraic k-theory","venue":null,"work_id":"5515b2ad-1386-4bad-84f1-4010e5e3216e","year":null},"citing_paper":{"arxiv_id":"2606.19017","last_updated":"2026-06-17T12:39:15Z","snapshot_observed_at":"2026-08-13T07:25:49.930528Z","submitted_at":"2026-06-17T12:39:15Z","title":"Completeness for Probabilistic Boolean Tapes","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-26T19:03:40.635333Z"},"links":{"cited_paper":"/paper/2107.10526","citing_paper":"/paper/2606.19017"},"observation_digest":"sha256:4f5da18951ec68cfa623c91951ec16b0f8d4081dae4b0bd1a68081a5c4430a9b","observation_id":"cd7b52bd-7e02-464f-9514-f3a110899738","resolution":{"observed_at":"2026-07-04T02:49:24.887530Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/0001-8708(91)90003-p","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"The geometry of tensor calculus, I.Advances in Mathematics, 88(1):55–112, July 1991.doi:10.1016/0001-8708(91)90003-P","venue":"Advances in Mathematics","work_id":"ecc24637-5a40-4f18-8ddf-fdaa8caf3474","year":1991},"citing_paper":{"arxiv_id":"2606.19017","last_updated":"2026-06-17T12:39:15Z","snapshot_observed_at":"2026-08-13T07:25:49.930528Z","submitted_at":"2026-06-17T12:39:15Z","title":"Completeness for Probabilistic Boolean Tapes","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-26T19:03:40.635333Z"},"links":{"citing_paper":"/paper/2606.19017"},"observation_digest":"sha256:ddd71b9edb6f275d50f1987816c7d84ddb96033a0549b6366727e0d74753c783","observation_id":"043a6af9-a33c-433c-96a0-06482c800a5e","resolution":{"observed_at":"2026-06-26T19:09:48.013853Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/bfb0059555","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"[Law63] F","venue":"Lecture notes in mathematics","work_id":"1eff89c8-4e58-4eed-a72a-bb9982731e1b","year":1972},"citing_paper":{"arxiv_id":"2606.19017","last_updated":"2026-06-17T12:39:15Z","snapshot_observed_at":"2026-08-13T07:25:49.930528Z","submitted_at":"2026-06-17T12:39:15Z","title":"Completeness for Probabilistic Boolean Tapes","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-26T19:03:40.635333Z"},"links":{"citing_paper":"/paper/2606.19017"},"observation_digest":"sha256:858bec93efb118d9d9d2bb54c3f6232b6695532a9b725968c3bae41fe23c1dc5","observation_id":"eeda6282-0f93-482c-a460-db0391030060","resolution":{"observed_at":"2026-06-26T19:09:48.011905Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06-26T19:03:40.635333Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.19017","last_updated":"2026-06-17T12:39:15Z","snapshot_observed_at":"2026-08-13T07:25:49.930528Z","submitted_at":"2026-06-17T12:39:15Z","title":"Completeness for Probabilistic Boolean Tapes","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-26T19:03:40.635333Z"},"links":{"citing_paper":"/paper/2606.19017"},"observation_digest":"sha256:98890dc55f324081e7483407109d91792855313be2dc20e1c3fa882a921a5be7","observation_id":"35594e94-d5fd-44a6-89ee-23a4cb379fc7","resolution":{"observed_at":"2026-06-26T19:03:40.635333Z","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":"9108.320912","doi":"10.1145/3209108.320912","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"In: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science , LICS ’18, Association for Comput- ing Machinery, New York, NY, USA, pp","venue":null,"work_id":"160f4622-3c09-4df8-bfed-2be57eff0f8d","year":2018},"citing_paper":{"arxiv_id":"2606.19017","last_updated":"2026-06-17T12:39:15Z","snapshot_observed_at":"2026-08-13T07:25:49.930528Z","submitted_at":"2026-06-17T12:39:15Z","title":"Completeness for Probabilistic Boolean Tapes","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-26T19:03:40.635333Z"},"links":{"citing_paper":"/paper/2606.19017"},"observation_digest":"sha256:3e05add63e683378863aa09cd8cc7e829e6f9593d361c7b4253cb79abb3b10ad","observation_id":"195a6428-2e21-472d-9b46-378bb4b17f28","resolution":{"observed_at":"2026-06-26T19:09:48.017033Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06-26T19:03:40.635333Z","title":"A complete axiomatisation of equivalence for discrete probabilistic programming","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.19017","last_updated":"2026-06-17T12:39:15Z","snapshot_observed_at":"2026-08-13T07:25:49.930528Z","submitted_at":"2026-06-17T12:39:15Z","title":"Completeness for Probabilistic Boolean Tapes","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-06-26T19:03:40.635333Z"},"links":{"citing_paper":"/paper/2606.19017"},"observation_digest":"sha256:668f63968832c3a77e96390c7a0da796949319bf06c710a0dd4e8efa7a0bb2b0","observation_id":"cc98cee4-427d-456b-9c58-0291e164b5fe","resolution":{"observed_at":"2026-06-26T19:03:40.635333Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.14701","last_updated":"2024-08-27T00:00:16Z","snapshot_observed_at":"2026-08-12T22:56:59.482783Z","submitted_at":"2024-08-27T00:00:16Z","title":"A Complete Axiomatisation of Equivalence for Discrete Probabilistic Programming","version":1},"cited_work":{"arxiv_id":"2408.14701","doi":"10.48550/arxiv.2408.14701","metadata_source":"arxiv_reference","pith_arxiv_id":"2408.14701","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"48550/ARXIV.2408.14701","venue":"arXiv (Cornell University)","work_id":"90d29071-abd7-4f03-9c6d-2c4b00bbf965","year":2023},"citing_paper":{"arxiv_id":"2606.19017","last_updated":"2026-06-17T12:39:15Z","snapshot_observed_at":"2026-08-13T07:25:49.930528Z","submitted_at":"2026-06-17T12:39:15Z","title":"Completeness for Probabilistic Boolean Tapes","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-06-26T19:03:40.635333Z"},"links":{"cited_paper":"/paper/2408.14701","citing_paper":"/paper/2606.19017"},"observation_digest":"sha256:2206749b66704c93c26febd2ae4e48ab3e653e48cc173a3df8fb301e2a63cd76","observation_id":"d72634e1-3b64-46d8-b0b4-dc59e745c2ef","resolution":{"observed_at":"2026-07-04T02:49:24.902861Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-030-71995-1_24","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"doi:10.1007/978-3-030-71995-1_24","venue":"Lecture notes in computer science","work_id":"7d5714d6-f111-4cc0-8b53-4b0660bd8a46","year":null},"citing_paper":{"arxiv_id":"2606.19017","last_updated":"2026-06-17T12:39:15Z","snapshot_observed_at":"2026-08-13T07:25:49.930528Z","submitted_at":"2026-06-17T12:39:15Z","title":"Completeness for Probabilistic Boolean Tapes","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-26T19:03:40.635333Z"},"links":{"citing_paper":"/paper/2606.19017"},"observation_digest":"sha256:acf28edfcb58f3983bf46dbdaf8a2dc4e04c4f69c94f1054628830db72de1f9d","observation_id":"2796fc35-b4c0-417e-8fac-a76df532b60a","resolution":{"observed_at":"2026-06-26T19:09:48.019014Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1814.366208","doi":"10.1145/3661814.3662084","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Thilikos, and Alexandre Vigny","venue":null,"work_id":"747748f6-2158-4daa-8238-938aafcdc656","year":2024},"citing_paper":{"arxiv_id":"2606.19017","last_updated":"2026-06-17T12:39:15Z","snapshot_observed_at":"2026-08-13T07:25:49.930528Z","submitted_at":"2026-06-17T12:39:15Z","title":"Completeness for Probabilistic Boolean Tapes","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-06-26T19:03:40.635333Z"},"links":{"citing_paper":"/paper/2606.19017"},"observation_digest":"sha256:e0b8e6ba6889c1a8989b8e1ed0a6a9dba25b05aa0f53f59d302f2d83a01f0453","observation_id":"ab469944-c782-4293-bf4f-4f584776b3b4","resolution":{"observed_at":"2026-06-26T19:09:48.024875Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-642-12821-9_4","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Selinger","venue":"Lecture notes in physics","work_id":"f106b8b5-873a-403c-919a-0985fd0cab76","year":2025},"citing_paper":{"arxiv_id":"2606.19017","last_updated":"2026-06-17T12:39:15Z","snapshot_observed_at":"2026-08-13T07:25:49.930528Z","submitted_at":"2026-06-17T12:39:15Z","title":"Completeness for Probabilistic Boolean Tapes","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-06-26T19:03:40.635333Z"},"links":{"citing_paper":"/paper/2606.19017"},"observation_digest":"sha256:cf7a0bfe8e6da798b316c74c46756666c0f6389d2058aac77e38ca2444295199","observation_id":"a5e27819-d95e-4dca-90f5-49064ee0ef34","resolution":{"observed_at":"2026-06-26T19:09:47.996091Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-07-11T00:19:42.520844+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T00:19:42.520844+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-14T06:32:18.44784+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-06-26T19:03:40.635333Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.19017","last_updated":"2026-06-17T12:39:15Z","snapshot_observed_at":"2026-08-13T07:25:49.930528Z","submitted_at":"2026-06-17T12:39:15Z","title":"Completeness for Probabilistic Boolean Tapes","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-06-26T19:03:40.635333Z"},"links":{"citing_paper":"/paper/2606.19017"},"observation_digest":"sha256:5e9d1f34ac29ae6d3d1b8b9164b0c7848f6963b4ae77e7350bd1159c1f8803fa","observation_id":"151d3c55-2793-4530-b5cc-6a0a5607189d","resolution":{"observed_at":"2026-06-26T19:03:40.635333Z","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-06-26T19:03:40.635333Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.19017","last_updated":"2026-06-17T12:39:15Z","snapshot_observed_at":"2026-08-13T07:25:49.930528Z","submitted_at":"2026-06-17T12:39:15Z","title":"Completeness for Probabilistic Boolean Tapes","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-06-26T19:03:40.635333Z"},"links":{"citing_paper":"/paper/2606.19017"},"observation_digest":"sha256:f3c0695d6b38394654b7cc6c801f8e6fa6ae63c40fe87e11af4e13fb49e78551","observation_id":"be2cf552-948e-4051-9f83-8632541b9939","resolution":{"observed_at":"2026-06-26T19:03:40.635333Z","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-06-26T19:03:40.635333Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.19017","last_updated":"2026-06-17T12:39:15Z","snapshot_observed_at":"2026-08-13T07:25:49.930528Z","submitted_at":"2026-06-17T12:39:15Z","title":"Completeness for Probabilistic Boolean Tapes","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-06-26T19:03:40.635333Z"},"links":{"citing_paper":"/paper/2606.19017"},"observation_digest":"sha256:93c4058c6cd4a605b79d5adf50a5daa06bc553f32d6f7501e6221b607fd681aa","observation_id":"c29985a0-b98a-4cd1-a7de-77901d24d08d","resolution":{"observed_at":"2026-06-26T19:03:40.635333Z","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-06-26T19:03:40.635333Z","title":"The base case c = p is proved before the statement of the proposition","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.19017","last_updated":"2026-06-17T12:39:15Z","snapshot_observed_at":"2026-08-13T07:25:49.930528Z","submitted_at":"2026-06-17T12:39:15Z","title":"Completeness for Probabilistic Boolean Tapes","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-06-26T19:03:40.635333Z"},"links":{"citing_paper":"/paper/2606.19017"},"observation_digest":"sha256:5c51e81df56b3020b5ff89330f2c4f46411a5b20bf7754fdf92b6cdd6d58e0fa","observation_id":"0c0c0af4-6731-4790-9116-6c898b465fc5","resolution":{"observed_at":"2026-06-26T19:03:40.635333Z","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-06-26T19:03:40.635333Z","title":"Proof.It follows from (17), Theorem 17 and Proposition 10.◀ Proof of Lemma","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.19017","last_updated":"2026-06-17T12:39:15Z","snapshot_observed_at":"2026-08-13T07:25:49.930528Z","submitted_at":"2026-06-17T12:39:15Z","title":"Completeness for Probabilistic Boolean Tapes","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-06-26T19:03:40.635333Z"},"links":{"citing_paper":"/paper/2606.19017"},"observation_digest":"sha256:c60f0838e637c78f4cda93058cde9c7051d96a787572c5f791d75b69664fdf71","observation_id":"a7f3cd61-351e-46fa-a806-c885d0bc171d","resolution":{"observed_at":"2026-06-26T19:03:40.635333Z","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-06-26T19:03:40.635333Z","title":"By Lemma 11, each partial Boolean circuit in DiagPB[A0,A m] is either a Boolean circuit in DiagB[1,A m] or it is of the form ⊥ m","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.19017","last_updated":"2026-06-17T12:39:15Z","snapshot_observed_at":"2026-08-13T07:25:49.930528Z","submitted_at":"2026-06-17T12:39:15Z","title":"Completeness for Probabilistic Boolean Tapes","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-06-26T19:03:40.635333Z"},"links":{"citing_paper":"/paper/2606.19017"},"observation_digest":"sha256:516e2791d36d9e5eb6f28bd2a843b9e3803d184c23ed647dd12106fc13aadbca","observation_id":"934ab3a3-cbc9-4734-b0f8-43fd0cbc4d67","resolution":{"observed_at":"2026-06-26T19:03:40.635333Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.19017","last_updated":"2026-06-17T12:39:15Z","latest_version":1,"primary_category":"cs.LO","snapshot_observed_at":"2026-08-13T07:25:49.930528Z","submitted_at":"2026-06-17T12:39:15Z","title":"Completeness for Probabilistic Boolean Tapes"},"reference_resolution":{"displayed":37,"state_counts":{"malformed_identifier":1,"metadata_mismatch":13,"parse_uncertain":0,"unresolved":10,"verified_exact":13,"verified_fuzzy":0},"total_outbound_references":37},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 37 of 37 outbound references and 1 inbound Pith citation observation for arXiv:2606.19017."}