{"as_of":"2026-08-07T21:04:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2b9767d919374f74e8c4467916a8c21805d2162e7761b32e316b7b0315adc265","coverage":[{"denominator":47,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":47,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T10:30:39.354628Z","state":"measured"},{"denominator":48,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":48,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T18:26:25.308545Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-06T18:26:25.903361Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2506.05187","last_updated":"2025-08-20T12:45:08Z","snapshot_observed_at":"2026-08-07T10:20:29.481426Z","submitted_at":"2025-06-05T16:00:36Z","title":"Classical and Quantum Query Complexity of Boolean Functions under Indefinite Causal Order","version":2},"cited_work":{"arxiv_id":"2506.05187","doi":null,"metadata_source":"pith","pith_arxiv_id":"2506.05187","snapshot_observed_at":"2026-08-06T18:26:25.903361Z","title":"Classical and Quantum Query Complexity of Boolean Functions under Indefinite Causal Order","venue":"quant-ph","work_id":"562e05fc-1f29-44fb-921e-3e9d03d18d24","year":2025},"citing_paper":{"arxiv_id":"2507.08781","last_updated":"2025-07-11T17:43:54Z","snapshot_observed_at":"2026-08-06T22:42:18.760058Z","submitted_at":"2025-07-11T17:43:54Z","title":"Routing Quantum Control of Causal Order","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T18:26:25.308545Z"},"links":{"cited_paper":"/paper/2506.05187","citing_paper":"/paper/2507.08781"},"observation_digest":"sha256:85fbbcbfd16ecf9504cf726a6621ea20b8ae4af9f0e20a008630807aeee1153a","observation_id":"6efb5857-7a4b-4949-9ff9-a13a0f8f99f7","resolution":{"observed_at":"2026-08-06T18:26:25.907165Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2506.05187/citation-record","integrity":"/paper/2506.05187/integrity","json":"/paper/2506.05187/citation-record.json","paper":"/paper/2506.05187"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:30:40.248571Z","title":"Version 10.1","venue":null,"work_id":"c7622861-e961-4311-846a-f666a45b74bb","year":null},"citing_paper":{"arxiv_id":"2506.05187","last_updated":"2025-08-20T12:45:08Z","snapshot_observed_at":"2026-08-07T10:20:29.481426Z","submitted_at":"2025-06-05T16:00:36Z","title":"Classical and Quantum Query Complexity of Boolean Functions under Indefinite Causal Order","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T10:30:39.185571Z"},"links":{"citing_paper":"/paper/2506.05187"},"observation_digest":"sha256:279477e836a54f349e303c9170e32799967afc1d2065a63adf8ffe83bdae3f8c","observation_id":"d5577816-3a0b-42b4-8ad3-70511bcaefa8","resolution":{"observed_at":"2026-08-07T10:30:40.251977Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.26421/qic5.2-9","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:30:39.421870Z","title":"Quantum Info","venue":null,"work_id":"ea77088c-9d1e-4a99-9479-7b4944bcab40","year":2003},"citing_paper":{"arxiv_id":"2506.05187","last_updated":"2025-08-20T12:45:08Z","snapshot_observed_at":"2026-08-07T10:20:29.481426Z","submitted_at":"2025-06-05T16:00:36Z","title":"Classical and Quantum Query Complexity of Boolean Functions under Indefinite Causal Order","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T10:30:39.189707Z"},"links":{"citing_paper":"/paper/2506.05187"},"observation_digest":"sha256:61e6c41b8ed96e68c1087045d36019292efafab8cc7493f46be8cad0c78d49c2","observation_id":"b7d2cc13-5f45-489e-966e-61ac48232013","resolution":{"observed_at":"2026-08-07T10:30:39.426348Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2796.10528","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:30:40.202977Z","title":"SIGACT News 36(1), pp","venue":null,"work_id":"696f553d-3b7b-4cdc-8cef-86f849264b74","year":2005},"citing_paper":{"arxiv_id":"2506.05187","last_updated":"2025-08-20T12:45:08Z","snapshot_observed_at":"2026-08-07T10:20:29.481426Z","submitted_at":"2025-06-05T16:00:36Z","title":"Classical and Quantum Query Complexity of Boolean Functions under Indefinite Causal Order","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T10:30:39.193431Z"},"links":{"citing_paper":"/paper/2506.05187"},"observation_digest":"sha256:4eab5ac075cff179069b5a7bdf8077a494d4394206825f1ed40e0d02ee1a36b9","observation_id":"59e4c447-a100-4cb2-88a2-4de4bf6318a9","resolution":{"observed_at":"2026-08-07T10:30:40.208972Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2008.0350","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:30:40.122792Z","title":null,"venue":null,"work_id":"cd99bba4-9956-4fd8-ab64-0f58b317b9bc","year":2009},"citing_paper":{"arxiv_id":"2506.05187","last_updated":"2025-08-20T12:45:08Z","snapshot_observed_at":"2026-08-07T10:20:29.481426Z","submitted_at":"2025-06-05T16:00:36Z","title":"Classical and Quantum Query Complexity of Boolean Functions under Indefinite Causal Order","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T10:30:39.196845Z"},"links":{"citing_paper":"/paper/2506.05187"},"observation_digest":"sha256:19bfa6db0b666484d3e4e6b275048709cf69678ea5ac194a0a7dd58d09647f1b","observation_id":"46c93413-c3b3-488b-9818-9ced1a8b559a","resolution":{"observed_at":"2026-08-07T10:30:40.127760Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2307.10285","last_updated":"2024-02-14T13:43:55Z","snapshot_observed_at":"2026-08-06T11:00:42.653748Z","submitted_at":"2023-07-18T13:12:55Z","title":"Quantum Query Complexity of Boolean Functions under Indefinite Causal Order","version":3},"cited_work":{"arxiv_id":"2307.10285","doi":null,"metadata_source":"pith","pith_arxiv_id":"2307.10285","snapshot_observed_at":"2026-08-07T10:30:40.055522Z","title":"Quantum Query Complexity of Boolean Functions under Indefinite Causal Order","venue":"quant-ph","work_id":"ca3dcfc5-b1e7-4198-bf95-808878ee8178","year":2023},"citing_paper":{"arxiv_id":"2506.05187","last_updated":"2025-08-20T12:45:08Z","snapshot_observed_at":"2026-08-07T10:20:29.481426Z","submitted_at":"2025-06-05T16:00:36Z","title":"Classical and Quantum Query Complexity of Boolean Functions under Indefinite Causal Order","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T10:30:39.200114Z"},"links":{"cited_paper":"/paper/2307.10285","citing_paper":"/paper/2506.05187"},"observation_digest":"sha256:8f6aa6883077e714386d22b91ad0059ab6482f2d89b7e113905791038dbf013f","observation_id":"c262dd57-d6d1-4b13-8eeb-4354dcce7270","resolution":{"observed_at":"2026-08-07T10:30:40.059345Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:30:39.204496Z","title":null,"venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2506.05187","last_updated":"2025-08-20T12:45:08Z","snapshot_observed_at":"2026-08-07T10:20:29.481426Z","submitted_at":"2025-06-05T16:00:36Z","title":"Classical and Quantum Query Complexity of Boolean Functions under Indefinite Causal Order","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T10:30:39.204496Z"},"links":{"citing_paper":"/paper/2506.05187"},"observation_digest":"sha256:8a6b3f77b13ac16ee3d88d61cf9bf728c53a3f87dbd03b56f8fefc5b20c3250b","observation_id":"c84d4756-63b9-4071-a41d-043d58e974ee","resolution":{"observed_at":"2026-08-07T10:30:39.204496Z","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":"8608.24887","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:30:39.967799Z","title":"In: Proc","venue":null,"work_id":"7c4a7615-7021-476f-8a34-a6e00fb0c576","year":2013},"citing_paper":{"arxiv_id":"2506.05187","last_updated":"2025-08-20T12:45:08Z","snapshot_observed_at":"2026-08-07T10:20:29.481426Z","submitted_at":"2025-06-05T16:00:36Z","title":"Classical and Quantum Query Complexity of Boolean Functions under Indefinite Causal Order","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T10:30:39.208393Z"},"links":{"citing_paper":"/paper/2506.05187"},"observation_digest":"sha256:2c18014403b98510c9426043006bacc4e4c11d78bb4f0643f48ea8c19edbe879","observation_id":"eb87ea31-ba95-4262-856f-ca68d0ad5558","resolution":{"observed_at":"2026-08-07T10:30:39.972988Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1712.06349","last_updated":"2017-12-18T11:36:40Z","snapshot_observed_at":"2026-08-04T10:39:27.488916Z","submitted_at":"2017-12-18T11:36:40Z","title":"Understanding Quantum Algorithms via Query Complexity","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1712.06349","snapshot_observed_at":"2026-08-07T10:30:39.212047Z","title":"In: Proc","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.05187","last_updated":"2025-08-20T12:45:08Z","snapshot_observed_at":"2026-08-07T10:20:29.481426Z","submitted_at":"2025-06-05T16:00:36Z","title":"Classical and Quantum Query Complexity of Boolean Functions under Indefinite Causal Order","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T10:30:39.212047Z"},"links":{"cited_paper":"/paper/1712.06349","citing_paper":"/paper/2506.05187"},"observation_digest":"sha256:fb7444c14cf2217e8507069c1c90abfbe52fa541bbf167afcc5fdcdaf8e90808","observation_id":"859b8f5c-ee0a-4aba-b9bc-c588bcc9096d","resolution":{"observed_at":"2026-08-07T10:30:39.212047Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1506.03776","last_updated":"2015-10-22T13:55:13Z","snapshot_observed_at":"2026-07-06T04:20:39.291510Z","submitted_at":"2015-06-11T18:57:54Z","title":"Witnessing causal nonseparability","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1506.03776","snapshot_observed_at":"2026-08-07T10:30:39.216412Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2506.05187","last_updated":"2025-08-20T12:45:08Z","snapshot_observed_at":"2026-08-07T10:20:29.481426Z","submitted_at":"2025-06-05T16:00:36Z","title":"Classical and Quantum Query Complexity of Boolean Functions under Indefinite Causal Order","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T10:30:39.216412Z"},"links":{"cited_paper":"/paper/1506.03776","citing_paper":"/paper/2506.05187"},"observation_digest":"sha256:9dee34e51094942d3ea9b2d9d1f88c3f8d4a60a7f829b6d0dc440d86a5a4df30","observation_id":"793cc8c4-5bc9-4844-a0fb-958c808e06d0","resolution":{"observed_at":"2026-08-07T10:30:39.216412Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1401.8127","last_updated":"2020-06-09T10:18:03Z","snapshot_observed_at":"2026-08-07T09:36:41.634389Z","submitted_at":"2014-01-31T11:00:00Z","title":"Computational advantage from quantum-controlled ordering of gates","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1401.8127","snapshot_observed_at":"2026-08-07T10:30:39.220756Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2506.05187","last_updated":"2025-08-20T12:45:08Z","snapshot_observed_at":"2026-08-07T10:20:29.481426Z","submitted_at":"2025-06-05T16:00:36Z","title":"Classical and Quantum Query Complexity of Boolean Functions under Indefinite Causal Order","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T10:30:39.220756Z"},"links":{"cited_paper":"/paper/1401.8127","citing_paper":"/paper/2506.05187"},"observation_digest":"sha256:461eed0876b881fc6ec511ef215aba8fc5dff732e5b3de7f055e894d4b23b9f0","observation_id":"03bdf59b-cf2b-4a7a-b63d-9366a5c84877","resolution":{"observed_at":"2026-08-07T10:30:39.220756Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1611.08535","last_updated":"2020-03-13T10:12:23Z","snapshot_observed_at":"2026-07-06T05:20:09.181803Z","submitted_at":"2016-11-25T17:53:13Z","title":"A purification postulate for quantum mechanics with indefinite causal order","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1611.08535","snapshot_observed_at":"2026-08-07T10:30:39.224202Z","title":"Quantum 1, p","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.05187","last_updated":"2025-08-20T12:45:08Z","snapshot_observed_at":"2026-08-07T10:20:29.481426Z","submitted_at":"2025-06-05T16:00:36Z","title":"Classical and Quantum Query Complexity of Boolean Functions under Indefinite Causal Order","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T10:30:39.224202Z"},"links":{"cited_paper":"/paper/1611.08535","citing_paper":"/paper/2506.05187"},"observation_digest":"sha256:ed207e5c1aaecbe908339142dda0fe85950d3291da272689c0640761b520fdf5","observation_id":"fbe29744-1c51-424b-b7da-ba77461fd8b0","resolution":{"observed_at":"2026-08-07T10:30:39.224202Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1706.09854","last_updated":"2025-03-05T19:17:13Z","snapshot_observed_at":"2026-07-06T05:49:06.163525Z","submitted_at":"2017-06-29T17:03:55Z","title":"Quantum computation with indefinite causal structures","version":4},"cited_work":{"arxiv_id":"1706.09854","doi":null,"metadata_source":"pith","pith_arxiv_id":"1706.09854","snapshot_observed_at":"2026-08-07T10:30:39.850968Z","title":"Quantum computation with indefinite causal structures","venue":"quant-ph","work_id":"ab6adf59-16c3-4c3c-8420-86f764b9e317","year":2017},"citing_paper":{"arxiv_id":"2506.05187","last_updated":"2025-08-20T12:45:08Z","snapshot_observed_at":"2026-08-07T10:20:29.481426Z","submitted_at":"2025-06-05T16:00:36Z","title":"Classical and Quantum Query Complexity of Boolean Functions under Indefinite Causal Order","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T10:30:39.227756Z"},"links":{"cited_paper":"/paper/1706.09854","citing_paper":"/paper/2506.05187"},"observation_digest":"sha256:e49bdd0c33c2debc275d9bb371f5a6e8c8ef7acfc48e9506cc4e54fc03f14175","observation_id":"ab415423-2053-46ea-9555-a9943ae00bf7","resolution":{"observed_at":"2026-08-07T10:30:39.854732Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:30:39.231314Z","title":null,"venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2506.05187","last_updated":"2025-08-20T12:45:08Z","snapshot_observed_at":"2026-08-07T10:20:29.481426Z","submitted_at":"2025-06-05T16:00:36Z","title":"Classical and Quantum Query Complexity of Boolean Functions under Indefinite Causal Order","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T10:30:39.231314Z"},"links":{"citing_paper":"/paper/2506.05187"},"observation_digest":"sha256:4ced307ed9b759613ecc6b88c940612f73f72fcad966a6208214445ec3d05305","observation_id":"ce28ed7b-4a94-41c3-8707-465f55408071","resolution":{"observed_at":"2026-08-07T10:30:39.231314Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2003.12144","last_updated":"2020-03-26T20:23:04Z","snapshot_observed_at":"2026-07-06T09:07:40.397451Z","submitted_at":"2020-03-26T20:23:04Z","title":"Metrics and Optimization of Internal Poses for Highly Redundant Truss-Like Serialized Parallel Manipulators","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2003.12144","snapshot_observed_at":"2026-08-07T10:30:39.234691Z","title":"In: Proc","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2506.05187","last_updated":"2025-08-20T12:45:08Z","snapshot_observed_at":"2026-08-07T10:20:29.481426Z","submitted_at":"2025-06-05T16:00:36Z","title":"Classical and Quantum Query Complexity of Boolean Functions under Indefinite Causal Order","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T10:30:39.234691Z"},"links":{"cited_paper":"/paper/2003.12144","citing_paper":"/paper/2506.05187"},"observation_digest":"sha256:7aef89c41a84b1c732763f20b309d5b55d62ab07000202837eb16c6c5682fa0e","observation_id":"d6e48c95-cec5-44e8-81e9-21c1b2626c19","resolution":{"observed_at":"2026-08-07T10:30:39.234691Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1403.7333","last_updated":"2014-09-16T10:23:09Z","snapshot_observed_at":"2026-07-06T03:39:42.982226Z","submitted_at":"2014-03-28T10:44:51Z","title":"Maximal incompatibility of locally classical behavior and global causal order in multi-party scenarios","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1403.7333","snapshot_observed_at":"2026-08-07T10:30:39.238034Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2506.05187","last_updated":"2025-08-20T12:45:08Z","snapshot_observed_at":"2026-08-07T10:20:29.481426Z","submitted_at":"2025-06-05T16:00:36Z","title":"Classical and Quantum Query Complexity of Boolean Functions under Indefinite Causal Order","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T10:30:39.238034Z"},"links":{"cited_paper":"/paper/1403.7333","citing_paper":"/paper/2506.05187"},"observation_digest":"sha256:aa9d17b0e759aec328c1ca496e440375c05095d9f219066d6ad33ff31075407b","observation_id":"8a9062a3-87d4-47a7-8bf3-421cbd389251","resolution":{"observed_at":"2026-08-07T10:30:39.238034Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2104.06234","last_updated":"2022-03-22T10:10:38Z","snapshot_observed_at":"2026-07-06T10:59:11.495225Z","submitted_at":"2021-04-13T14:25:46Z","title":"Unlimited non-causal correlations and their relation to non-locality","version":3},"cited_work":{"arxiv_id":"2104.06234","doi":null,"metadata_source":"pith","pith_arxiv_id":"2104.06234","snapshot_observed_at":"2026-08-07T10:30:39.818214Z","title":"Unlimited non-causal correlations and their relation to non-locality","venue":"quant-ph","work_id":"14d1a344-7f47-4400-bd07-fd56f5272e2e","year":2021},"citing_paper":{"arxiv_id":"2506.05187","last_updated":"2025-08-20T12:45:08Z","snapshot_observed_at":"2026-08-07T10:20:29.481426Z","submitted_at":"2025-06-05T16:00:36Z","title":"Classical and Quantum Query Complexity of Boolean Functions under Indefinite Causal Order","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T10:30:39.241341Z"},"links":{"cited_paper":"/paper/2104.06234","citing_paper":"/paper/2506.05187"},"observation_digest":"sha256:f39d34c2b100b1d19e289627d23f54f88ac5dcb9a8c1b6e97be466d4dac43cdc","observation_id":"74daab45-2336-4fac-a1ef-89652dd2dca6","resolution":{"observed_at":"2026-08-07T10:30:39.822559Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2004.12921","last_updated":"2021-09-06T00:54:12Z","snapshot_observed_at":"2026-07-06T09:15:35.314874Z","submitted_at":"2020-04-27T16:34:51Z","title":"Equivalence of Grandfather and Information Antinomy Under Intervention","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.12921","snapshot_observed_at":"2026-08-07T10:30:39.244761Z","title":"In: Proc","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.05187","last_updated":"2025-08-20T12:45:08Z","snapshot_observed_at":"2026-08-07T10:20:29.481426Z","submitted_at":"2025-06-05T16:00:36Z","title":"Classical and Quantum Query Complexity of Boolean Functions under Indefinite Causal Order","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T10:30:39.244761Z"},"links":{"cited_paper":"/paper/2004.12921","citing_paper":"/paper/2506.05187"},"observation_digest":"sha256:32fd0b578dad493cf51bf96b12fe7e941f4110cfe55f29dc02ed273524b148a7","observation_id":"39f9a72f-899c-4a85-9510-f9b0e67424f4","resolution":{"observed_at":"2026-08-07T10:30:39.244761Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1511.05444","last_updated":"2016-04-05T07:52:49Z","snapshot_observed_at":"2026-07-06T04:36:48.493556Z","submitted_at":"2015-11-17T15:46:33Z","title":"Device-independent test of causal order and relations to fixed-points","version":2},"cited_work":{"arxiv_id":"1511.05444","doi":null,"metadata_source":"pith","pith_arxiv_id":"1511.05444","snapshot_observed_at":"2026-08-07T10:30:39.793868Z","title":"Device-independent test of causal order and relations to fixed-points","venue":"quant-ph","work_id":"e91be661-59e5-43d9-b9dc-4e5cb34f69e4","year":2015},"citing_paper":{"arxiv_id":"2506.05187","last_updated":"2025-08-20T12:45:08Z","snapshot_observed_at":"2026-08-07T10:20:29.481426Z","submitted_at":"2025-06-05T16:00:36Z","title":"Classical and Quantum Query Complexity of Boolean Functions under Indefinite Causal Order","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T10:30:39.248435Z"},"links":{"cited_paper":"/paper/1511.05444","citing_paper":"/paper/2506.05187"},"observation_digest":"sha256:779b204caa885340af2d17c5bd3c434ed41b3275197faf7fdb87b3421becedcc","observation_id":"a26da0e2-d2c7-47c9-89d4-3ac9cbcb8c1f","resolution":{"observed_at":"2026-08-07T10:30:39.797658Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1507.01714","last_updated":"2016-01-15T00:09:56Z","snapshot_observed_at":"2026-07-06T04:23:03.606380Z","submitted_at":"2015-07-07T08:52:09Z","title":"The space of logically consistent classical processes without causal order","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1507.01714","snapshot_observed_at":"2026-08-07T10:30:39.251808Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.05187","last_updated":"2025-08-20T12:45:08Z","snapshot_observed_at":"2026-08-07T10:20:29.481426Z","submitted_at":"2025-06-05T16:00:36Z","title":"Classical and Quantum Query Complexity of Boolean Functions under Indefinite Causal Order","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T10:30:39.251808Z"},"links":{"cited_paper":"/paper/1507.01714","citing_paper":"/paper/2506.05187"},"observation_digest":"sha256:aa3a1f71718a3fd6cc09bed6faf28749fecfd7c0092cd37b0654e256497b0478","observation_id":"ecc997ef-0963-44ae-b1fe-0e542520efa2","resolution":{"observed_at":"2026-08-07T10:30:39.251808Z","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":"2017.0698","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:30:39.767759Z","title":null,"venue":null,"work_id":"a152f39f-7a1f-4ab8-a338-fbdc534dd1d0","year":2018},"citing_paper":{"arxiv_id":"2506.05187","last_updated":"2025-08-20T12:45:08Z","snapshot_observed_at":"2026-08-07T10:20:29.481426Z","submitted_at":"2025-06-05T16:00:36Z","title":"Classical and Quantum Query Complexity of Boolean Functions under Indefinite Causal Order","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T10:30:39.255710Z"},"links":{"citing_paper":"/paper/2506.05187"},"observation_digest":"sha256:d8c0968f04a508d750e7075daef7fd6fe95194c5dfba5d2e4126c7b44a89a365","observation_id":"ff30ca21-8da8-4586-827e-fdb5954077d9","resolution":{"observed_at":"2026-08-07T10:30:39.772987Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2011.08300","last_updated":"2021-11-17T11:40:39Z","snapshot_observed_at":"2026-08-07T17:39:58.022272Z","submitted_at":"2020-11-16T21:49:43Z","title":"Strict hierarchy between parallel, sequential, and indefinite-causal-order strategies for channel discrimination","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2011.08300","snapshot_observed_at":"2026-08-07T10:30:39.259859Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.05187","last_updated":"2025-08-20T12:45:08Z","snapshot_observed_at":"2026-08-07T10:20:29.481426Z","submitted_at":"2025-06-05T16:00:36Z","title":"Classical and Quantum Query Complexity of Boolean Functions under Indefinite Causal Order","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T10:30:39.259859Z"},"links":{"cited_paper":"/paper/2011.08300","citing_paper":"/paper/2506.05187"},"observation_digest":"sha256:2bd259e3286a92af324a06372d322f575f022126903387771e88bb4ec5dda50d","observation_id":"6314a192-9697-434d-822c-a62ef144632b","resolution":{"observed_at":"2026-08-07T10:30:39.259859Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:30:39.263271Z","title":null,"venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2506.05187","last_updated":"2025-08-20T12:45:08Z","snapshot_observed_at":"2026-08-07T10:20:29.481426Z","submitted_at":"2025-06-05T16:00:36Z","title":"Classical and Quantum Query Complexity of Boolean Functions under Indefinite Causal Order","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T10:30:39.263271Z"},"links":{"citing_paper":"/paper/2506.05187"},"observation_digest":"sha256:e498f9b2e6b8794cb38389ea286f39e75ee271ca4f59d1603221928c9476bddb","observation_id":"b6a17734-3295-48f5-98b1-309f3a490193","resolution":{"observed_at":"2026-08-07T10:30:39.263271Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:30:39.266707Z","title":"Brun (2003): Computers with closed timelike curves can solve hard problems efficiently","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2506.05187","last_updated":"2025-08-20T12:45:08Z","snapshot_observed_at":"2026-08-07T10:20:29.481426Z","submitted_at":"2025-06-05T16:00:36Z","title":"Classical and Quantum Query Complexity of Boolean Functions under Indefinite Causal Order","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T10:30:39.266707Z"},"links":{"citing_paper":"/paper/2506.05187"},"observation_digest":"sha256:1766774e1502af77da488f49584354aa599c9b999ab1daca0181a11b97797d11","observation_id":"5d7fac6b-aa18-4be2-ac86-21a242d7f8ac","resolution":{"observed_at":"2026-08-07T10:30:39.266707Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:30:39.270079Z","title":null,"venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2506.05187","last_updated":"2025-08-20T12:45:08Z","snapshot_observed_at":"2026-08-07T10:20:29.481426Z","submitted_at":"2025-06-05T16:00:36Z","title":"Classical and Quantum Query Complexity of Boolean Functions under Indefinite Causal Order","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T10:30:39.270079Z"},"links":{"citing_paper":"/paper/2506.05187"},"observation_digest":"sha256:6af5194e1b3ddb0741ddfa9cb761f47023af78f4834ad24a647931c96d8e01cf","observation_id":"e226651c-e901-44f1-84be-8a4ce1cef544","resolution":{"observed_at":"2026-08-07T10:30:39.270079Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1109.5154","last_updated":"2012-11-27T16:56:45Z","snapshot_observed_at":"2026-07-06T02:34:32.759448Z","submitted_at":"2011-09-23T18:39:29Z","title":"Perfect discrimination of no-signalling channels via quantum superposition of causal structures","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1109.5154","snapshot_observed_at":"2026-08-07T10:30:39.273241Z","title":null,"venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2506.05187","last_updated":"2025-08-20T12:45:08Z","snapshot_observed_at":"2026-08-07T10:20:29.481426Z","submitted_at":"2025-06-05T16:00:36Z","title":"Classical and Quantum Query Complexity of Boolean Functions under Indefinite Causal Order","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T10:30:39.273241Z"},"links":{"cited_paper":"/paper/1109.5154","citing_paper":"/paper/2506.05187"},"observation_digest":"sha256:c6892fbdaaccebdaf0bded64e70ae1a0453643a9172355a97b6274f9d3dad1f0","observation_id":"546e11a9-46c0-4235-9455-497b62becce3","resolution":{"observed_at":"2026-08-07T10:30:39.273241Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"0712.1325","last_updated":"2007-12-09T03:55:02Z","snapshot_observed_at":"2026-07-06T01:32:58.935959Z","submitted_at":"2007-12-09T03:55:02Z","title":"Quantum Circuits Architecture","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"0712.1325","snapshot_observed_at":"2026-08-07T10:30:39.277373Z","title":null,"venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2506.05187","last_updated":"2025-08-20T12:45:08Z","snapshot_observed_at":"2026-08-07T10:20:29.481426Z","submitted_at":"2025-06-05T16:00:36Z","title":"Classical and Quantum Query Complexity of Boolean Functions under Indefinite Causal Order","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T10:30:39.277373Z"},"links":{"cited_paper":"/paper/0712.1325","citing_paper":"/paper/2506.05187"},"observation_digest":"sha256:b7fd41695e9e642ef7f655eb6c72c559ad3f52f49e61afae76f5da33dc7d2e6d","observation_id":"1e100ee3-7119-4377-a71d-3860e692f785","resolution":{"observed_at":"2026-08-07T10:30:39.277373Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"0804.0180","last_updated":"2008-10-22T13:41:45Z","snapshot_observed_at":"2026-08-07T08:36:22.925609Z","submitted_at":"2008-04-01T13:59:55Z","title":"Transforming quantum operations: quantum supermaps","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"0804.0180","snapshot_observed_at":"2026-08-07T10:30:39.280961Z","title":"Europhys","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2506.05187","last_updated":"2025-08-20T12:45:08Z","snapshot_observed_at":"2026-08-07T10:20:29.481426Z","submitted_at":"2025-06-05T16:00:36Z","title":"Classical and Quantum Query Complexity of Boolean Functions under Indefinite Causal Order","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T10:30:39.280961Z"},"links":{"cited_paper":"/paper/0804.0180","citing_paper":"/paper/2506.05187"},"observation_digest":"sha256:3c56ed1d5469e30e19b1154c0fb007cdfd36089b5c3e57f8802d31e147d6c380","observation_id":"6546e88e-c45b-41e2-803b-e322e9b4e837","resolution":{"observed_at":"2026-08-07T10:30:39.280961Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"0904.4483","last_updated":"2009-12-21T13:42:55Z","snapshot_observed_at":"2026-07-06T01:56:38.654874Z","submitted_at":"2009-04-28T20:46:14Z","title":"Theoretical framework for quantum networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"0904.4483","snapshot_observed_at":"2026-08-07T10:30:39.284254Z","title":null,"venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2506.05187","last_updated":"2025-08-20T12:45:08Z","snapshot_observed_at":"2026-08-07T10:20:29.481426Z","submitted_at":"2025-06-05T16:00:36Z","title":"Classical and Quantum Query Complexity of Boolean Functions under Indefinite Causal Order","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T10:30:39.284254Z"},"links":{"cited_paper":"/paper/0904.4483","citing_paper":"/paper/2506.05187"},"observation_digest":"sha256:e0a1be0b3b78b3b0d3aa73b3d29c1a6dbc6a5394e436ea07832b7a41ab0e8648","observation_id":"da9405c0-c72c-41bd-b558-02ad9a548a94","resolution":{"observed_at":"2026-08-07T10:30:39.284254Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"0912.0195","last_updated":"2013-10-27T11:57:15Z","snapshot_observed_at":"2026-07-06T02:04:36.977116Z","submitted_at":"2009-12-01T16:19:13Z","title":"Quantum computations without definite causal structure","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"0912.0195","snapshot_observed_at":"2026-08-07T10:30:39.288578Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2506.05187","last_updated":"2025-08-20T12:45:08Z","snapshot_observed_at":"2026-08-07T10:20:29.481426Z","submitted_at":"2025-06-05T16:00:36Z","title":"Classical and Quantum Query Complexity of Boolean Functions under Indefinite Causal Order","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T10:30:39.288578Z"},"links":{"cited_paper":"/paper/0912.0195","citing_paper":"/paper/2506.05187"},"observation_digest":"sha256:91d2f2f07b8317350a228a2531bdbc47cd1fcee61d250ba30c03d01edea10c8e","observation_id":"5d2f6a43-3573-4a5e-b6b5-9c6d20599a9d","resolution":{"observed_at":"2026-08-07T10:30:39.288578Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:30:39.292841Z","title":"Linear Algebra Appl","venue":null,"work_id":null,"year":1975},"citing_paper":{"arxiv_id":"2506.05187","last_updated":"2025-08-20T12:45:08Z","snapshot_observed_at":"2026-08-07T10:20:29.481426Z","submitted_at":"2025-06-05T16:00:36Z","title":"Classical and Quantum Query Complexity of Boolean Functions under Indefinite Causal Order","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T10:30:39.292841Z"},"links":{"citing_paper":"/paper/2506.05187"},"observation_digest":"sha256:58837591810cad72fb4e1043b98777d0763e0dcd731e848d2f450030f01cced1","observation_id":"7e53de6f-b465-47e4-82a6-8db5e235cd14","resolution":{"observed_at":"2026-08-07T10:30:39.292841Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:30:39.296231Z","title":null,"venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2506.05187","last_updated":"2025-08-20T12:45:08Z","snapshot_observed_at":"2026-08-07T10:20:29.481426Z","submitted_at":"2025-06-05T16:00:36Z","title":"Classical and Quantum Query Complexity of Boolean Functions under Indefinite Causal Order","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T10:30:39.296231Z"},"links":{"citing_paper":"/paper/2506.05187"},"observation_digest":"sha256:9eff6503d5d8ffefd7d7a9dda939adb0c4d6be0f4f7d827de25af9cd556c286f","observation_id":"57ad6a21-ffa1-40d6-8c3f-1b0d747cd14b","resolution":{"observed_at":"2026-08-07T10:30:39.296231Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:30:39.299699Z","title":null,"venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2506.05187","last_updated":"2025-08-20T12:45:08Z","snapshot_observed_at":"2026-08-07T10:20:29.481426Z","submitted_at":"2025-06-05T16:00:36Z","title":"Classical and Quantum Query Complexity of Boolean Functions under Indefinite Causal Order","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T10:30:39.299699Z"},"links":{"citing_paper":"/paper/2506.05187"},"observation_digest":"sha256:9e8ce1733a53928c1cf9eb7e81304a46b5b55bac53250ea1f7cc8db8b4d16e00","observation_id":"b0488735-7fbb-437f-8cdc-8e07ec467449","resolution":{"observed_at":"2026-08-07T10:30:39.299699Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1605.07372","last_updated":"2016-09-09T13:32:49Z","snapshot_observed_at":"2026-08-05T01:16:42.861261Z","submitted_at":"2016-05-24T10:58:23Z","title":"Exponential Communication Complexity Advantage from Quantum Superposition of the Direction of Communication","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1605.07372","snapshot_observed_at":"2026-08-07T10:30:39.303020Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.05187","last_updated":"2025-08-20T12:45:08Z","snapshot_observed_at":"2026-08-07T10:20:29.481426Z","submitted_at":"2025-06-05T16:00:36Z","title":"Classical and Quantum Query Complexity of Boolean Functions under Indefinite Causal Order","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T10:30:39.303020Z"},"links":{"cited_paper":"/paper/1605.07372","citing_paper":"/paper/2506.05187"},"observation_digest":"sha256:1bb393fb373f5e045a65188c2c7c7f6759efe372f74a4db4d82ae2f3b2196e17","observation_id":"5f641538-9022-42a4-8f70-b710f11d1366","resolution":{"observed_at":"2026-08-07T10:30:39.303020Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:30:39.306595Z","title":null,"venue":null,"work_id":null,"year":1972},"citing_paper":{"arxiv_id":"2506.05187","last_updated":"2025-08-20T12:45:08Z","snapshot_observed_at":"2026-08-07T10:20:29.481426Z","submitted_at":"2025-06-05T16:00:36Z","title":"Classical and Quantum Query Complexity of Boolean Functions under Indefinite Causal Order","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T10:30:39.306595Z"},"links":{"citing_paper":"/paper/2506.05187"},"observation_digest":"sha256:5cf7f0e5ea12c95a8c64261accec91b89b09110f2aa77e2326d251cdc90e40f1","observation_id":"9aedbac1-c67e-4302-8e61-993b9e3f9bf5","resolution":{"observed_at":"2026-08-07T10:30:39.306595Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.18420","last_updated":"2024-10-01T17:46:25Z","snapshot_observed_at":"2026-08-06T02:45:01.980049Z","submitted_at":"2024-09-27T03:18:28Z","title":"Exponential separation in quantum query complexity of the quantum switch with respect to simulations with standard quantum circuits","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.18420","snapshot_observed_at":"2026-08-07T10:30:39.310321Z","title":"arXiv:2409.18420","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.05187","last_updated":"2025-08-20T12:45:08Z","snapshot_observed_at":"2026-08-07T10:20:29.481426Z","submitted_at":"2025-06-05T16:00:36Z","title":"Classical and Quantum Query Complexity of Boolean Functions under Indefinite Causal Order","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T10:30:39.310321Z"},"links":{"cited_paper":"/paper/2409.18420","citing_paper":"/paper/2506.05187"},"observation_digest":"sha256:b35091b86492b7ef4ca5de4552cd366a0fa625a3159f0e68da4f62e6aecc26d3","observation_id":"8f90db54-1697-48ae-99d0-f9413a21600c","resolution":{"observed_at":"2026-08-07T10:30:39.310321Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2004.13938","last_updated":"2024-05-07T08:03:03Z","snapshot_observed_at":"2026-08-06T22:36:22.727627Z","submitted_at":"2020-04-29T03:23:18Z","title":"Families of sequences with good family complexity and cross-correlation measure","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.13938","snapshot_observed_at":"2026-08-07T10:30:39.313636Z","title":"In: 2004 Proc","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2506.05187","last_updated":"2025-08-20T12:45:08Z","snapshot_observed_at":"2026-08-07T10:20:29.481426Z","submitted_at":"2025-06-05T16:00:36Z","title":"Classical and Quantum Query Complexity of Boolean Functions under Indefinite Causal Order","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T10:30:39.313636Z"},"links":{"cited_paper":"/paper/2004.13938","citing_paper":"/paper/2506.05187"},"observation_digest":"sha256:4cf060709e646e34223ce981ae0159a29fa42ddeda052c5aa6e392dbf52c1c0f","observation_id":"04ef365c-6450-45c3-98f2-b16327a58aad","resolution":{"observed_at":"2026-08-07T10:30:39.313636Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1302.4207","last_updated":"2013-02-18T10:12:29Z","snapshot_observed_at":"2026-07-06T03:06:38.805247Z","submitted_at":"2013-02-18T10:12:29Z","title":"A composition theorem for decision tree complexity","version":1},"cited_work":{"arxiv_id":"1302.4207","doi":null,"metadata_source":"pith","pith_arxiv_id":"1302.4207","snapshot_observed_at":"2026-08-07T10:30:39.494809Z","title":"A composition theorem for decision tree complexity","venue":"cs.CC","work_id":"84486643-7ed2-4195-8a8a-6446ce69eecd","year":2013},"citing_paper":{"arxiv_id":"2506.05187","last_updated":"2025-08-20T12:45:08Z","snapshot_observed_at":"2026-08-07T10:20:29.481426Z","submitted_at":"2025-06-05T16:00:36Z","title":"Classical and Quantum Query Complexity of Boolean Functions under Indefinite Causal Order","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T10:30:39.317122Z"},"links":{"cited_paper":"/paper/1302.4207","citing_paper":"/paper/2506.05187"},"observation_digest":"sha256:6a50e56fafae65a1b10ea859d7bbed4c22c2da2cdea62911b69bdb417ffbd3b9","observation_id":"f4efd9f0-34e1-4e8f-8ee3-dd7fcb064497","resolution":{"observed_at":"2026-08-07T10:30:39.498457Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1111.0475","last_updated":"2013-09-09T07:58:27Z","snapshot_observed_at":"2026-07-06T02:36:51.014298Z","submitted_at":"2011-11-02T12:20:16Z","title":"On exact quantum query complexity","version":2},"cited_work":{"arxiv_id":"1111.0475","doi":null,"metadata_source":"pith","pith_arxiv_id":"1111.0475","snapshot_observed_at":"2026-08-07T10:30:39.480017Z","title":"On exact quantum query complexity","venue":"quant-ph","work_id":"501962a1-6009-4a26-b72a-256b2fa5ea67","year":2011},"citing_paper":{"arxiv_id":"2506.05187","last_updated":"2025-08-20T12:45:08Z","snapshot_observed_at":"2026-08-07T10:20:29.481426Z","submitted_at":"2025-06-05T16:00:36Z","title":"Classical and Quantum Query Complexity of Boolean Functions under Indefinite Causal Order","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T10:30:39.320555Z"},"links":{"cited_paper":"/paper/1111.0475","citing_paper":"/paper/2506.05187"},"observation_digest":"sha256:fd22ec80974663a8e77b0276a613ef317514ca2997e4e30330e30970b0a536a9","observation_id":"a3bcd5b9-a90c-4a8f-a1c3-038632922d11","resolution":{"observed_at":"2026-08-07T10:30:39.484594Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1105.4464","last_updated":"2013-02-14T13:28:22Z","snapshot_observed_at":"2026-08-06T08:22:55.784410Z","submitted_at":"2011-05-23T10:53:09Z","title":"Quantum correlations with no causal order","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1105.4464","snapshot_observed_at":"2026-08-07T10:30:39.323833Z","title":"Nature Commun","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2506.05187","last_updated":"2025-08-20T12:45:08Z","snapshot_observed_at":"2026-08-07T10:20:29.481426Z","submitted_at":"2025-06-05T16:00:36Z","title":"Classical and Quantum Query Complexity of Boolean Functions under Indefinite Causal Order","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T10:30:39.323833Z"},"links":{"cited_paper":"/paper/1105.4464","citing_paper":"/paper/2506.05187"},"observation_digest":"sha256:99c6c85913099bee3ff6e2566eec3fd08be95567b2374619c0824eb6185ac0ee","observation_id":"501e2013-5aec-46e8-bac4-a9803ffba6b5","resolution":{"observed_at":"2026-08-07T10:30:39.323833Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1506.05449","last_updated":"2016-09-12T20:00:29Z","snapshot_observed_at":"2026-07-06T04:21:12.631665Z","submitted_at":"2015-06-17T19:59:47Z","title":"Causal and causally separable processes","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1506.05449","snapshot_observed_at":"2026-08-07T10:30:39.328187Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.05187","last_updated":"2025-08-20T12:45:08Z","snapshot_observed_at":"2026-08-07T10:20:29.481426Z","submitted_at":"2025-06-05T16:00:36Z","title":"Classical and Quantum Query Complexity of Boolean Functions under Indefinite Causal Order","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T10:30:39.328187Z"},"links":{"cited_paper":"/paper/1506.05449","citing_paper":"/paper/2506.05187"},"observation_digest":"sha256:4801ea4981021d6c1fa1e8e4677d2fba7049c392e406ca240ab6b95e5f003029","observation_id":"26d1f1e3-e0be-4b03-b763-acc9bf1337ff","resolution":{"observed_at":"2026-08-07T10:30:39.328187Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:30:39.331700Z","title":"Simon (1997): On the Power of Quantum Computation","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2506.05187","last_updated":"2025-08-20T12:45:08Z","snapshot_observed_at":"2026-08-07T10:20:29.481426Z","submitted_at":"2025-06-05T16:00:36Z","title":"Classical and Quantum Query Complexity of Boolean Functions under Indefinite Causal Order","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T10:30:39.331700Z"},"links":{"citing_paper":"/paper/2506.05187"},"observation_digest":"sha256:400c4cfa764107b256220016ebfaaeb97f15a3072411defbd61bbceabcd91be1","observation_id":"4243c194-28bb-4b9d-81a5-246f67338779","resolution":{"observed_at":"2026-08-07T10:30:39.331700Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.07817","last_updated":"2021-02-09T11:30:38Z","snapshot_observed_at":"2026-07-06T08:58:14.863801Z","submitted_at":"2020-02-18T19:00:01Z","title":"Computational advantage from quantum superposition of multiple temporal orders of photonic gates","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.07817","snapshot_observed_at":"2026-08-07T10:30:39.335171Z","title":"Taddei, Jaime Cariñe, Daniel Martínez, Tania García, Nayda Guerrero, Alastair A","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.05187","last_updated":"2025-08-20T12:45:08Z","snapshot_observed_at":"2026-08-07T10:20:29.481426Z","submitted_at":"2025-06-05T16:00:36Z","title":"Classical and Quantum Query Complexity of Boolean Functions under Indefinite Causal Order","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T10:30:39.335171Z"},"links":{"cited_paper":"/paper/2002.07817","citing_paper":"/paper/2506.05187"},"observation_digest":"sha256:2651850deffae805b21be4175a7d30acade205dbb0945d27050b6d9896bd630b","observation_id":"9101b3a5-0c69-4b8a-8238-d642bc55c1e8","resolution":{"observed_at":"2026-08-07T10:30:39.335171Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1807.10557","last_updated":"2019-02-01T13:53:01Z","snapshot_observed_at":"2026-07-06T06:52:40.820972Z","submitted_at":"2018-07-27T12:43:23Z","title":"On the definition and characterisation of multipartite causal (non)separability","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1807.10557","snapshot_observed_at":"2026-08-07T10:30:39.338700Z","title":"Abbott & Cyril Branciard (2019): On the definition and characterisation of multipartite causal (non) separability","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.05187","last_updated":"2025-08-20T12:45:08Z","snapshot_observed_at":"2026-08-07T10:20:29.481426Z","submitted_at":"2025-06-05T16:00:36Z","title":"Classical and Quantum Query Complexity of Boolean Functions under Indefinite Causal Order","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T10:30:39.338700Z"},"links":{"cited_paper":"/paper/1807.10557","citing_paper":"/paper/2506.05187"},"observation_digest":"sha256:9de92f014affef88ff0c0a7f8a72e12a662c4686353df3bfaabd1bf68a43e3e6","observation_id":"ba14e6aa-e840-41bf-be93-d06e4fb0ef82","resolution":{"observed_at":"2026-08-07T10:30:39.338700Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2101.08796","last_updated":"2023-06-19T13:02:02Z","snapshot_observed_at":"2026-07-06T10:34:29.894974Z","submitted_at":"2021-01-21T19:00:06Z","title":"Quantum circuits with classical versus quantum control of causal order","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2101.08796","snapshot_observed_at":"2026-08-07T10:30:39.342012Z","title":"back in time","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.05187","last_updated":"2025-08-20T12:45:08Z","snapshot_observed_at":"2026-08-07T10:20:29.481426Z","submitted_at":"2025-06-05T16:00:36Z","title":"Classical and Quantum Query Complexity of Boolean Functions under Indefinite Causal Order","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T10:30:39.342012Z"},"links":{"cited_paper":"/paper/2101.08796","citing_paper":"/paper/2506.05187"},"observation_digest":"sha256:7bb8c302a34e3b5a320211d33264e412053aeea072e35811261b44e5f0989f15","observation_id":"03865126-b0ee-426a-90a4-08950f67fd7a","resolution":{"observed_at":"2026-08-07T10:30:39.342012Z","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-07T10:30:40.237578Z","title":"Then there exist (i′ 1,i′ 2,i′","venue":null,"work_id":"f0185f38-b23d-4cc1-aa2a-29fd4c426bdd","year":null},"citing_paper":{"arxiv_id":"2506.05187","last_updated":"2025-08-20T12:45:08Z","snapshot_observed_at":"2026-08-07T10:20:29.481426Z","submitted_at":"2025-06-05T16:00:36Z","title":"Classical and Quantum Query Complexity of Boolean Functions under Indefinite Causal Order","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T10:30:39.346844Z"},"links":{"citing_paper":"/paper/2506.05187"},"observation_digest":"sha256:2b28ba984686dc91bfaea29cb196c1ad616e960c81dd72c830d495077e9d474d","observation_id":"1a7ec33c-274a-4d62-85a3-b6c57796f32b","resolution":{"observed_at":"2026-08-07T10:30:40.240961Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:30:40.226676Z","title":"(52) This shows that (i′ 1,i′ 2,i′","venue":null,"work_id":"06520546-2f54-437e-bc91-675036e11176","year":null},"citing_paper":{"arxiv_id":"2506.05187","last_updated":"2025-08-20T12:45:08Z","snapshot_observed_at":"2026-08-07T10:20:29.481426Z","submitted_at":"2025-06-05T16:00:36Z","title":"Classical and Quantum Query Complexity of Boolean Functions under Indefinite Causal Order","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T10:30:39.350477Z"},"links":{"citing_paper":"/paper/2506.05187"},"observation_digest":"sha256:9dcc1808dc1a3bf10fe5b53fa9560b1992cf870c83a4cbcb49687fa9b7f9abbc","observation_id":"03172413-a5e6-442a-ba20-38aea20c2184","resolution":{"observed_at":"2026-08-07T10:30:40.231003Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:30:40.216241Z","title":"classical","venue":null,"work_id":"c1f2a8d0-f1cc-468d-a011-a84e702d323b","year":null},"citing_paper":{"arxiv_id":"2506.05187","last_updated":"2025-08-20T12:45:08Z","snapshot_observed_at":"2026-08-07T10:20:29.481426Z","submitted_at":"2025-06-05T16:00:36Z","title":"Classical and Quantum Query Complexity of Boolean Functions under Indefinite Causal Order","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-07T10:30:39.354628Z"},"links":{"citing_paper":"/paper/2506.05187"},"observation_digest":"sha256:939f6fb9a59396e6638f90a61a0c03053963c37e95b1d263ad792e866f718017","observation_id":"f7e13fd6-e1fa-4350-adc9-50c22d0d5a71","resolution":{"observed_at":"2026-08-07T10:30:40.220306Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.05187","last_updated":"2025-08-20T12:45:08Z","latest_version":2,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-07T10:20:29.481426Z","submitted_at":"2025-06-05T16:00:36Z","title":"Classical and Quantum Query Complexity of Boolean Functions under Indefinite Causal Order"},"reference_resolution":{"displayed":47,"state_counts":{"malformed_identifier":1,"metadata_mismatch":3,"parse_uncertain":0,"unresolved":32,"verified_exact":8,"verified_fuzzy":3},"total_outbound_references":47},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 47 of 47 outbound references and 1 inbound Pith citation observation for arXiv:2506.05187."}