{"as_of":"2026-08-15T20:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b6663429c2ae48f69d58a13209ff5d67605cc9e6d99196990a4e43581d101ba3","coverage":[{"denominator":54,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":54,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T19:27:05.798866Z","state":"measured"},{"denominator":54,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":54,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2412.06938/citation-record","integrity":"/paper/2412.06938/integrity","json":"/paper/2412.06938/citation-record.json","paper":"/paper/2412.06938"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T19:27:05.547007Z","title":"Wehner, D","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.06938","last_updated":"2024-12-09T19:26:49Z","snapshot_observed_at":"2026-08-12T18:41:53.352365Z","submitted_at":"2024-12-09T19:26:49Z","title":"Optimising entanglement distribution policies under classical communication constraints assisted by reinforcement learning","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-11T19:27:05.547007Z"},"links":{"citing_paper":"/paper/2412.06938"},"observation_digest":"sha256:1f08ea4547e1ef545ebfcd5d166f9af673ea234be1467cf9d71affebe62a766e","observation_id":"0e8efee0-a415-4ebe-8d26-a6e76b68e7d6","resolution":{"observed_at":"2026-08-11T19:27:05.547007Z","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-11T19:27:06.753251Z","title":null,"venue":null,"work_id":"25622ef0-321b-48d9-bc5a-cd5119cc6fd7","year":null},"citing_paper":{"arxiv_id":"2412.06938","last_updated":"2024-12-09T19:26:49Z","snapshot_observed_at":"2026-08-12T18:41:53.352365Z","submitted_at":"2024-12-09T19:26:49Z","title":"Optimising entanglement distribution policies under classical communication constraints assisted by reinforcement learning","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-11T19:27:05.541244Z"},"links":{"citing_paper":"/paper/2412.06938"},"observation_digest":"sha256:88b3866ddc893e731e759701d952b09bd54eb096300bcf0950e3b608748b79ec","observation_id":"7ee31850-ead6-45ef-a366-94e0464942c2","resolution":{"observed_at":"2026-08-11T19:27:06.757933Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T19:27:06.738943Z","title":null,"venue":null,"work_id":"4b5e9ea9-9976-42b2-8ee7-91ba6f8994c0","year":2014},"citing_paper":{"arxiv_id":"2412.06938","last_updated":"2024-12-09T19:26:49Z","snapshot_observed_at":"2026-08-12T18:41:53.352365Z","submitted_at":"2024-12-09T19:26:49Z","title":"Optimising entanglement distribution policies under classical communication constraints assisted by reinforcement learning","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T19:27:05.552206Z"},"links":{"citing_paper":"/paper/2412.06938"},"observation_digest":"sha256:ed18010a3792df33c0d0d999e3fb48d9fa00a6b64b44ba15d6c12aad1c601db1","observation_id":"919e5b1d-b930-4093-8210-a04df306a80d","resolution":{"observed_at":"2026-08-11T19:27:06.743450Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T19:27:05.557331Z","title":null,"venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2412.06938","last_updated":"2024-12-09T19:26:49Z","snapshot_observed_at":"2026-08-12T18:41:53.352365Z","submitted_at":"2024-12-09T19:26:49Z","title":"Optimising entanglement distribution policies under classical communication constraints assisted by reinforcement learning","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-11T19:27:05.557331Z"},"links":{"citing_paper":"/paper/2412.06938"},"observation_digest":"sha256:4efbdffd8b3221db1abb6b6d46d0e803d043e52d284297982b2018731958871d","observation_id":"22e18bf7-0c2f-4365-b0f7-2c634c8ee414","resolution":{"observed_at":"2026-08-11T19:27:05.557331Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"0807.4154","last_updated":"2009-12-12T12:44:58Z","snapshot_observed_at":"2026-08-15T10:10:11.708923Z","submitted_at":"2008-07-25T18:35:00Z","title":"Universal blind quantum computation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"0807.4154","snapshot_observed_at":"2026-08-11T19:27:05.562214Z","title":"Broadbent, J","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2412.06938","last_updated":"2024-12-09T19:26:49Z","snapshot_observed_at":"2026-08-12T18:41:53.352365Z","submitted_at":"2024-12-09T19:26:49Z","title":"Optimising entanglement distribution policies under classical communication constraints assisted by reinforcement learning","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-11T19:27:05.562214Z"},"links":{"cited_paper":"/paper/0807.4154","citing_paper":"/paper/2412.06938"},"observation_digest":"sha256:5d05db9eabda314c392fe2344a0f1afb2c9d4deb6bc526643fec8a1b4924a0ea","observation_id":"2c71556c-613f-4420-849f-414ca44e0120","resolution":{"observed_at":"2026-08-11T19:27:05.562214Z","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-11T19:27:06.714766Z","title":"Gottesman, T","venue":null,"work_id":"6e9d530b-3d64-4727-a206-66b1d191c437","year":2012},"citing_paper":{"arxiv_id":"2412.06938","last_updated":"2024-12-09T19:26:49Z","snapshot_observed_at":"2026-08-12T18:41:53.352365Z","submitted_at":"2024-12-09T19:26:49Z","title":"Optimising entanglement distribution policies under classical communication constraints assisted by reinforcement learning","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-11T19:27:05.567492Z"},"links":{"citing_paper":"/paper/2412.06938"},"observation_digest":"sha256:6549023a2d856705eb5fe594f5b15fcac71da3b559944ff3d5fdcf2c96651ca8","observation_id":"33c37da6-5b29-460e-9fe0-92336b2354b2","resolution":{"observed_at":"2026-08-11T19:27:06.718953Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T19:27:05.572300Z","title":"Kómár, E","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2412.06938","last_updated":"2024-12-09T19:26:49Z","snapshot_observed_at":"2026-08-12T18:41:53.352365Z","submitted_at":"2024-12-09T19:26:49Z","title":"Optimising entanglement distribution policies under classical communication constraints assisted by reinforcement learning","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-11T19:27:05.572300Z"},"links":{"citing_paper":"/paper/2412.06938"},"observation_digest":"sha256:648363df09588dba36545c39ab4e367ed71a4c5c289b05fce2b0e4d162642d4e","observation_id":"19894c32-c911-496c-993a-6c8ef1c9c5c2","resolution":{"observed_at":"2026-08-11T19:27:05.572300Z","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-11T19:27:05.577832Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2412.06938","last_updated":"2024-12-09T19:26:49Z","snapshot_observed_at":"2026-08-12T18:41:53.352365Z","submitted_at":"2024-12-09T19:26:49Z","title":"Optimising entanglement distribution policies under classical communication constraints assisted by reinforcement learning","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-11T19:27:05.577832Z"},"links":{"citing_paper":"/paper/2412.06938"},"observation_digest":"sha256:c1fa5b42c2b31093a289652d9bcfcad45ecca3e9feae2bf79e75c0e935eef6c5","observation_id":"4838e1f4-edef-437e-8e29-16a5c4140fa0","resolution":{"observed_at":"2026-08-11T19:27:05.577832Z","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-11T19:27:05.582737Z","title":null,"venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2412.06938","last_updated":"2024-12-09T19:26:49Z","snapshot_observed_at":"2026-08-12T18:41:53.352365Z","submitted_at":"2024-12-09T19:26:49Z","title":"Optimising entanglement distribution policies under classical communication constraints assisted by reinforcement learning","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T19:27:05.582737Z"},"links":{"citing_paper":"/paper/2412.06938"},"observation_digest":"sha256:17c2473e4789f9c6c4ec1b5afab96baf3d541a85a967f5c8d145b8b59dbff460","observation_id":"a6bf0e9f-5d27-4728-bac4-b517ab66a094","resolution":{"observed_at":"2026-08-11T19:27:05.582737Z","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-11T19:27:05.587672Z","title":null,"venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2412.06938","last_updated":"2024-12-09T19:26:49Z","snapshot_observed_at":"2026-08-12T18:41:53.352365Z","submitted_at":"2024-12-09T19:26:49Z","title":"Optimising entanglement distribution policies under classical communication constraints assisted by reinforcement learning","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-11T19:27:05.587672Z"},"links":{"citing_paper":"/paper/2412.06938"},"observation_digest":"sha256:861be937a946221da8349eec473a694593abf0dd91ebba564d9020e9313c36f1","observation_id":"8fffd2fb-4d53-4353-9494-584ddd2f0acb","resolution":{"observed_at":"2026-08-11T19:27:05.587672Z","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-11T19:27:06.658376Z","title":null,"venue":null,"work_id":"9775ea2e-a825-4a3b-9529-ade3c3da6372","year":2011},"citing_paper":{"arxiv_id":"2412.06938","last_updated":"2024-12-09T19:26:49Z","snapshot_observed_at":"2026-08-12T18:41:53.352365Z","submitted_at":"2024-12-09T19:26:49Z","title":"Optimising entanglement distribution policies under classical communication constraints assisted by reinforcement learning","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T19:27:05.592341Z"},"links":{"citing_paper":"/paper/2412.06938"},"observation_digest":"sha256:c11b3ec55e54eac1d3c505595e261b3fbc32afaf480d328da5c2cc8ef6bba77b","observation_id":"6af1f385-4dc6-4ba8-9eb5-42eb3b54479c","resolution":{"observed_at":"2026-08-11T19:27:06.663494Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T19:27:05.597206Z","title":"Azuma, S","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.06938","last_updated":"2024-12-09T19:26:49Z","snapshot_observed_at":"2026-08-12T18:41:53.352365Z","submitted_at":"2024-12-09T19:26:49Z","title":"Optimising entanglement distribution policies under classical communication constraints assisted by reinforcement learning","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-11T19:27:05.597206Z"},"links":{"citing_paper":"/paper/2412.06938"},"observation_digest":"sha256:9e744067e12e82ddae58331f667fde61fb29b8b302622765ecbb4d23763b468a","observation_id":"f841f736-1b49-46b7-9171-17702a17381a","resolution":{"observed_at":"2026-08-11T19:27:05.597206Z","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-11T19:27:06.632298Z","title":null,"venue":null,"work_id":"2b02b8e2-47e7-4657-902a-009ce63603ef","year":1993},"citing_paper":{"arxiv_id":"2412.06938","last_updated":"2024-12-09T19:26:49Z","snapshot_observed_at":"2026-08-12T18:41:53.352365Z","submitted_at":"2024-12-09T19:26:49Z","title":"Optimising entanglement distribution policies under classical communication constraints assisted by reinforcement learning","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-11T19:27:05.601857Z"},"links":{"citing_paper":"/paper/2412.06938"},"observation_digest":"sha256:911a3118814866a7439748cd84325ddf4482b2cf8df8197a03aa21927ea76b93","observation_id":"983d4d23-35a6-40e2-b2a3-8537a04d6d01","resolution":{"observed_at":"2026-08-11T19:27:06.637284Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T19:27:06.617329Z","title":"Event-ready-detectors","venue":null,"work_id":"7ac1bdf2-daf8-49af-b7f0-e0766af890ad","year":1993},"citing_paper":{"arxiv_id":"2412.06938","last_updated":"2024-12-09T19:26:49Z","snapshot_observed_at":"2026-08-12T18:41:53.352365Z","submitted_at":"2024-12-09T19:26:49Z","title":"Optimising entanglement distribution policies under classical communication constraints assisted by reinforcement learning","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-11T19:27:05.606450Z"},"links":{"citing_paper":"/paper/2412.06938"},"observation_digest":"sha256:0be08fedaeebaff0e9681468db69c732cda1079d86ffd2410192250c2f511a21","observation_id":"08329922-45a1-4cf6-8d8b-d330d87a31e7","resolution":{"observed_at":"2026-08-11T19:27:06.622122Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.07146","last_updated":"2025-05-08T21:14:09Z","snapshot_observed_at":"2026-08-14T22:10:09.824143Z","submitted_at":"2024-04-10T16:24:51Z","title":"On noise in swap ASAP repeater chains: exact analytics, distributions and tight approximations","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.07146","snapshot_observed_at":"2026-08-11T19:27:05.611204Z","title":"Goodenough, T","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.06938","last_updated":"2024-12-09T19:26:49Z","snapshot_observed_at":"2026-08-12T18:41:53.352365Z","submitted_at":"2024-12-09T19:26:49Z","title":"Optimising entanglement distribution policies under classical communication constraints assisted by reinforcement learning","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T19:27:05.611204Z"},"links":{"cited_paper":"/paper/2404.07146","citing_paper":"/paper/2412.06938"},"observation_digest":"sha256:676b669b5d9f7c8b14ea6878ea41590f708009fdfedcf9cf9a77722a4b06aadb","observation_id":"faac0975-d626-4dbe-b715-a8747e181d0e","resolution":{"observed_at":"2026-08-11T19:27:05.611204Z","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-11T19:27:06.601758Z","title":"Coopmans, S","venue":null,"work_id":"bb74b3bf-e2ae-45af-b797-300c7c0cd428","year":2022},"citing_paper":{"arxiv_id":"2412.06938","last_updated":"2024-12-09T19:26:49Z","snapshot_observed_at":"2026-08-12T18:41:53.352365Z","submitted_at":"2024-12-09T19:26:49Z","title":"Optimising entanglement distribution policies under classical communication constraints assisted by reinforcement learning","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-11T19:27:05.616218Z"},"links":{"citing_paper":"/paper/2412.06938"},"observation_digest":"sha256:97b6ac629556844a4818e6218674ae5ce1b16d4128d297881e0d798ffc155e47","observation_id":"edaaa206-a130-4c8e-9e0a-d671bab24d94","resolution":{"observed_at":"2026-08-11T19:27:06.606480Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T19:27:06.586533Z","title":"Kamin, E","venue":null,"work_id":"08e84f1a-b8d0-483d-a41f-26ad52ebd4dc","year":2023},"citing_paper":{"arxiv_id":"2412.06938","last_updated":"2024-12-09T19:26:49Z","snapshot_observed_at":"2026-08-12T18:41:53.352365Z","submitted_at":"2024-12-09T19:26:49Z","title":"Optimising entanglement distribution policies under classical communication constraints assisted by reinforcement learning","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-11T19:27:05.620953Z"},"links":{"citing_paper":"/paper/2412.06938"},"observation_digest":"sha256:406c7381d99c664ef2dde0d1c5c3a4f132411da7daacf99c8d05d22357187033","observation_id":"32560899-03f5-41ba-bcbc-6d1876e8f4ab","resolution":{"observed_at":"2026-08-11T19:27:06.591206Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2111.10994","last_updated":"2021-11-22T05:20:10Z","snapshot_observed_at":"2026-08-13T17:29:58.378811Z","submitted_at":"2021-11-22T05:20:10Z","title":"Entanglement Swapping for Repeater Chains with Finite Memory Sizes","version":1},"cited_work":{"arxiv_id":"2111.10994","doi":null,"metadata_source":"pith","pith_arxiv_id":"2111.10994","snapshot_observed_at":"2026-08-11T19:27:06.113565Z","title":"Entanglement Swapping for Repeater Chains with Finite Memory Sizes","venue":"quant-ph","work_id":"24a9d08b-8b73-4510-be7c-44b61da519d6","year":2021},"citing_paper":{"arxiv_id":"2412.06938","last_updated":"2024-12-09T19:26:49Z","snapshot_observed_at":"2026-08-12T18:41:53.352365Z","submitted_at":"2024-12-09T19:26:49Z","title":"Optimising entanglement distribution policies under classical communication constraints assisted by reinforcement learning","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-11T19:27:05.625958Z"},"links":{"cited_paper":"/paper/2111.10994","citing_paper":"/paper/2412.06938"},"observation_digest":"sha256:8ce78c4e7666c5363b1847b532a7109a21fbfa107e7aef26b68f1cb64a6b2b21","observation_id":"1f1da076-9edc-42af-99b8-4ce02aa6f17c","resolution":{"observed_at":"2026-08-11T19:27:06.119148Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.18252","last_updated":"2024-05-28T15:03:09Z","snapshot_observed_at":"2026-08-15T00:01:43.142819Z","submitted_at":"2024-05-28T15:03:09Z","title":"On the Analysis of Quantum Repeater Chains with Sequential Swaps","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.18252","snapshot_observed_at":"2026-08-11T19:27:05.630998Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.06938","last_updated":"2024-12-09T19:26:49Z","snapshot_observed_at":"2026-08-12T18:41:53.352365Z","submitted_at":"2024-12-09T19:26:49Z","title":"Optimising entanglement distribution policies under classical communication constraints assisted by reinforcement learning","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-11T19:27:05.630998Z"},"links":{"cited_paper":"/paper/2405.18252","citing_paper":"/paper/2412.06938"},"observation_digest":"sha256:c0c0cb7fb39191621560a96a390ede8808daef2029be81d074ca41d1804c3e9a","observation_id":"9cfdb57f-00da-4a0c-a0cf-1d81c2d7448d","resolution":{"observed_at":"2026-08-11T19:27:05.630998Z","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-11T19:27:06.570430Z","title":"Shchukin and P","venue":null,"work_id":"a2882e76-d203-4044-ab9f-9961bab21d44","year":2022},"citing_paper":{"arxiv_id":"2412.06938","last_updated":"2024-12-09T19:26:49Z","snapshot_observed_at":"2026-08-12T18:41:53.352365Z","submitted_at":"2024-12-09T19:26:49Z","title":"Optimising entanglement distribution policies under classical communication constraints assisted by reinforcement learning","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-11T19:27:05.636018Z"},"links":{"citing_paper":"/paper/2412.06938"},"observation_digest":"sha256:329be46912a11cdf51ebfbfd65fd268edb5aaaee2fc6dab747f7f17acb429b3c","observation_id":"bc654e91-a896-4a8a-851f-2f00d0f3057d","resolution":{"observed_at":"2026-08-11T19:27:06.575469Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T19:27:06.552997Z","title":null,"venue":null,"work_id":"9f91c240-11d6-4f36-9d7b-60b7d413b4df","year":2023},"citing_paper":{"arxiv_id":"2412.06938","last_updated":"2024-12-09T19:26:49Z","snapshot_observed_at":"2026-08-12T18:41:53.352365Z","submitted_at":"2024-12-09T19:26:49Z","title":"Optimising entanglement distribution policies under classical communication constraints assisted by reinforcement learning","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-11T19:27:05.640373Z"},"links":{"citing_paper":"/paper/2412.06938"},"observation_digest":"sha256:07a81a6dfe3271b7da07f5f1391ac3641fa1643a9f317f62a3b72986d47e232c","observation_id":"2055aff2-66c3-46a6-8000-214d43dee948","resolution":{"observed_at":"2026-08-11T19:27:06.558172Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T19:27:06.535630Z","title":"Haldar, P","venue":null,"work_id":"c2a72f00-00ce-4d62-8091-68fa9a38dc29","year":2024},"citing_paper":{"arxiv_id":"2412.06938","last_updated":"2024-12-09T19:26:49Z","snapshot_observed_at":"2026-08-12T18:41:53.352365Z","submitted_at":"2024-12-09T19:26:49Z","title":"Optimising entanglement distribution policies under classical communication constraints assisted by reinforcement learning","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-11T19:27:05.644546Z"},"links":{"citing_paper":"/paper/2412.06938"},"observation_digest":"sha256:9999fa66a98f42b7c131c3c3753b653ceb2d430f767fd8fb2bc755ca99507135","observation_id":"b41601d1-c5eb-4552-8908-89399aeaa717","resolution":{"observed_at":"2026-08-11T19:27:06.540780Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T19:27:06.519973Z","title":null,"venue":null,"work_id":"af99b381-d694-4d04-aa25-750dd2fcfd89","year":2021},"citing_paper":{"arxiv_id":"2412.06938","last_updated":"2024-12-09T19:26:49Z","snapshot_observed_at":"2026-08-12T18:41:53.352365Z","submitted_at":"2024-12-09T19:26:49Z","title":"Optimising entanglement distribution policies under classical communication constraints assisted by reinforcement learning","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-11T19:27:05.648695Z"},"links":{"citing_paper":"/paper/2412.06938"},"observation_digest":"sha256:bad926ca4bb1bf3b513ce494dda5b935b2853c33481c6c4ac84430269b99235b","observation_id":"ea08e650-15d6-4063-a821-dad3a5c6279a","resolution":{"observed_at":"2026-08-11T19:27:06.524579Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.18306","last_updated":"2024-07-25T18:00:08Z","snapshot_observed_at":"2026-08-12T23:14:37.819932Z","submitted_at":"2024-07-25T18:00:08Z","title":"Design and demonstration of an operating system for executing applications on quantum network nodes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.18306","snapshot_observed_at":"2026-08-11T19:27:05.652927Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.06938","last_updated":"2024-12-09T19:26:49Z","snapshot_observed_at":"2026-08-12T18:41:53.352365Z","submitted_at":"2024-12-09T19:26:49Z","title":"Optimising entanglement distribution policies under classical communication constraints assisted by reinforcement learning","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-11T19:27:05.652927Z"},"links":{"cited_paper":"/paper/2407.18306","citing_paper":"/paper/2412.06938"},"observation_digest":"sha256:50649f9ddb57d6277730acff214030ab8ada934e75287d667a1eb7181573e0fd","observation_id":"370b9505-deff-49c2-bac3-c06919336662","resolution":{"observed_at":"2026-08-11T19:27:05.652927Z","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-11T19:27:06.503863Z","title":null,"venue":null,"work_id":"95254023-0207-4593-ace8-762cddebc265","year":2023},"citing_paper":{"arxiv_id":"2412.06938","last_updated":"2024-12-09T19:26:49Z","snapshot_observed_at":"2026-08-12T18:41:53.352365Z","submitted_at":"2024-12-09T19:26:49Z","title":"Optimising entanglement distribution policies under classical communication constraints assisted by reinforcement learning","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-11T19:27:05.657454Z"},"links":{"citing_paper":"/paper/2412.06938"},"observation_digest":"sha256:816d050d6dd1c3287952a6c24779af920e64c3ea922e89701aa0d6e8eb856e77","observation_id":"fe2066ee-e48f-4120-8232-581fea5fd2df","resolution":{"observed_at":"2026-08-11T19:27:06.508829Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T19:27:06.488849Z","title":"Rozpędek, K","venue":null,"work_id":"4e20f57c-2a12-40a3-be45-05af7618231a","year":2018},"citing_paper":{"arxiv_id":"2412.06938","last_updated":"2024-12-09T19:26:49Z","snapshot_observed_at":"2026-08-12T18:41:53.352365Z","submitted_at":"2024-12-09T19:26:49Z","title":"Optimising entanglement distribution policies under classical communication constraints assisted by reinforcement learning","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-11T19:27:05.662160Z"},"links":{"citing_paper":"/paper/2412.06938"},"observation_digest":"sha256:81c1314fed63b71400f174a43babe022635fb16ad437fec9ae45aab469e64dc1","observation_id":"eec5bcf4-9e00-4a09-b431-6485e2e46804","resolution":{"observed_at":"2026-08-11T19:27:06.493263Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T19:27:06.474499Z","title":null,"venue":null,"work_id":"f1ab3ff2-0fe5-4852-9e8e-9eac38867d22","year":2021},"citing_paper":{"arxiv_id":"2412.06938","last_updated":"2024-12-09T19:26:49Z","snapshot_observed_at":"2026-08-12T18:41:53.352365Z","submitted_at":"2024-12-09T19:26:49Z","title":"Optimising entanglement distribution policies under classical communication constraints assisted by reinforcement learning","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-11T19:27:05.666900Z"},"links":{"citing_paper":"/paper/2412.06938"},"observation_digest":"sha256:72789f9270c101e4a0a6fffb7c6050a1c97064c95b098a2bf0d000bf01af5d26","observation_id":"0097bea0-0e73-425b-894e-5785a76469a6","resolution":{"observed_at":"2026-08-11T19:27:06.478885Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.13168","last_updated":"2025-05-12T18:08:44Z","snapshot_observed_at":"2026-08-13T04:35:52.864901Z","submitted_at":"2024-01-24T01:13:55Z","title":"Reducing classical communication costs in multiplexed quantum repeaters using hardware-aware quasi-local policies","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.13168","snapshot_observed_at":"2026-08-11T19:27:05.671689Z","title":"Haldar, P","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.06938","last_updated":"2024-12-09T19:26:49Z","snapshot_observed_at":"2026-08-12T18:41:53.352365Z","submitted_at":"2024-12-09T19:26:49Z","title":"Optimising entanglement distribution policies under classical communication constraints assisted by reinforcement learning","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-11T19:27:05.671689Z"},"links":{"cited_paper":"/paper/2401.13168","citing_paper":"/paper/2412.06938"},"observation_digest":"sha256:770daf8b01cfa3dae59f9d566d90ef076a2e66a6ffd592df83f958444629adb9","observation_id":"395e895c-0b6e-42c3-b1af-937ca9480215","resolution":{"observed_at":"2026-08-11T19:27:05.671689Z","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-11T19:27:05.676499Z","title":null,"venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2412.06938","last_updated":"2024-12-09T19:26:49Z","snapshot_observed_at":"2026-08-12T18:41:53.352365Z","submitted_at":"2024-12-09T19:26:49Z","title":"Optimising entanglement distribution policies under classical communication constraints assisted by reinforcement learning","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-11T19:27:05.676499Z"},"links":{"citing_paper":"/paper/2412.06938"},"observation_digest":"sha256:6999952644c79ecb95c11437ac659c0db783b7d4931222faaeef23ae04e2c7de","observation_id":"af294ff2-3118-4d5e-98bb-5ab355adcf81","resolution":{"observed_at":"2026-08-11T19:27:05.676499Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1712.07567","last_updated":"2018-01-15T12:38:17Z","snapshot_observed_at":"2026-08-14T20:01:37.539266Z","submitted_at":"2017-12-20T16:37:56Z","title":"Deterministic delivery of remote entanglement on a quantum network","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1712.07567","snapshot_observed_at":"2026-08-11T19:27:05.681118Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.06938","last_updated":"2024-12-09T19:26:49Z","snapshot_observed_at":"2026-08-12T18:41:53.352365Z","submitted_at":"2024-12-09T19:26:49Z","title":"Optimising entanglement distribution policies under classical communication constraints assisted by reinforcement learning","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-11T19:27:05.681118Z"},"links":{"cited_paper":"/paper/1712.07567","citing_paper":"/paper/2412.06938"},"observation_digest":"sha256:a05fd15f719d410e91fe3d218c6d7b51f7ee6e34189e59610177de9e77868bd9","observation_id":"a9182efe-061d-466c-bb53-852f848a2959","resolution":{"observed_at":"2026-08-11T19:27:05.681118Z","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-11T19:27:06.448808Z","title":null,"venue":null,"work_id":"05268b75-f689-4786-af7c-234208dc8daf","year":2010},"citing_paper":{"arxiv_id":"2412.06938","last_updated":"2024-12-09T19:26:49Z","snapshot_observed_at":"2026-08-12T18:41:53.352365Z","submitted_at":"2024-12-09T19:26:49Z","title":"Optimising entanglement distribution policies under classical communication constraints assisted by reinforcement learning","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-11T19:27:05.685961Z"},"links":{"citing_paper":"/paper/2412.06938"},"observation_digest":"sha256:81ecb3428f6c5d4647cf50a37799c96b6c77b6625f3f771fdcdb8291148e1091","observation_id":"31339a53-0f06-46ba-b53d-bc326c92dcc2","resolution":{"observed_at":"2026-08-11T19:27:06.452978Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T19:27:06.432513Z","title":"Khatri, On the design and analysis of near-term quan- tum network protocols using Markov decision processes, AVS Quantum Science4, 030501 (2022)","venue":null,"work_id":"e56cbd76-84fa-4ff3-9025-956ee213b3b4","year":2022},"citing_paper":{"arxiv_id":"2412.06938","last_updated":"2024-12-09T19:26:49Z","snapshot_observed_at":"2026-08-12T18:41:53.352365Z","submitted_at":"2024-12-09T19:26:49Z","title":"Optimising entanglement distribution policies under classical communication constraints assisted by reinforcement learning","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-11T19:27:05.690673Z"},"links":{"citing_paper":"/paper/2412.06938"},"observation_digest":"sha256:1e15d8f1df9ad1d6ae646da868535a322c5f0aebc08fa441026a113a9eb8bbe6","observation_id":"83e2ea50-ab16-49f8-a7aa-812e5f0bf295","resolution":{"observed_at":"2026-08-11T19:27:06.438119Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T19:27:06.416825Z","title":"Shchukin, F","venue":null,"work_id":"7441e61b-17de-4292-9512-ae286a310446","year":2019},"citing_paper":{"arxiv_id":"2412.06938","last_updated":"2024-12-09T19:26:49Z","snapshot_observed_at":"2026-08-12T18:41:53.352365Z","submitted_at":"2024-12-09T19:26:49Z","title":"Optimising entanglement distribution policies under classical communication constraints assisted by reinforcement learning","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-11T19:27:05.695489Z"},"links":{"citing_paper":"/paper/2412.06938"},"observation_digest":"sha256:95cfc551b47e5b3a33c2ca835b8a4b8633ccfbd63f9e1448e4050f66c6efafe1","observation_id":"b0720a9f-9e60-4992-b717-de7200a31e66","resolution":{"observed_at":"2026-08-11T19:27:06.421521Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T19:27:06.402009Z","title":null,"venue":null,"work_id":"034f7bfa-00a0-4653-b2f9-b231f592eff3","year":2020},"citing_paper":{"arxiv_id":"2412.06938","last_updated":"2024-12-09T19:26:49Z","snapshot_observed_at":"2026-08-12T18:41:53.352365Z","submitted_at":"2024-12-09T19:26:49Z","title":"Optimising entanglement distribution policies under classical communication constraints assisted by reinforcement learning","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-11T19:27:05.700198Z"},"links":{"citing_paper":"/paper/2412.06938"},"observation_digest":"sha256:2870e91d77d071ec0a6e53f4db11624920ae775ca18e6d3fb4b42621195aa0c0","observation_id":"b05f6202-0fb2-426a-a269-5a55680bd84a","resolution":{"observed_at":"2026-08-11T19:27:06.406561Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.00777","last_updated":"2024-04-01T00:19:12Z","snapshot_observed_at":"2026-08-13T12:34:03.746687Z","submitted_at":"2023-03-01T19:05:32Z","title":"Fast and reliable entanglement distribution with quantum repeaters: principles for improving protocols using reinforcement learning","version":4},"cited_work":{"arxiv_id":"2303.00777","doi":null,"metadata_source":"pith","pith_arxiv_id":"2303.00777","snapshot_observed_at":"2026-08-11T19:27:06.022529Z","title":"Fast and reliable entanglement distribution with quantum repeaters: principles for improving protocols using reinforcement learning","venue":"quant-ph","work_id":"3fa0e746-99d1-462e-a30f-265608d6042b","year":2023},"citing_paper":{"arxiv_id":"2412.06938","last_updated":"2024-12-09T19:26:49Z","snapshot_observed_at":"2026-08-12T18:41:53.352365Z","submitted_at":"2024-12-09T19:26:49Z","title":"Optimising entanglement distribution policies under classical communication constraints assisted by reinforcement learning","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-11T19:27:05.705119Z"},"links":{"cited_paper":"/paper/2303.00777","citing_paper":"/paper/2412.06938"},"observation_digest":"sha256:d14100d57d30f335e9b519f2b31540cc20980514e6aba2ce40cba429f68e86b2","observation_id":"dafda167-5c79-4f27-a275-896d2c994869","resolution":{"observed_at":"2026-08-11T19:27:06.029878Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T19:27:06.387223Z","title":"Coopmans,Tools for the Design of Quantum Repeater Networks, Ph.D","venue":null,"work_id":"66a79036-b93e-4ec2-aaaf-b3d41019d8c8","year":2021},"citing_paper":{"arxiv_id":"2412.06938","last_updated":"2024-12-09T19:26:49Z","snapshot_observed_at":"2026-08-12T18:41:53.352365Z","submitted_at":"2024-12-09T19:26:49Z","title":"Optimising entanglement distribution policies under classical communication constraints assisted by reinforcement learning","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-11T19:27:05.710598Z"},"links":{"citing_paper":"/paper/2412.06938"},"observation_digest":"sha256:5cd7c916d6d7c92e8111d04a74a39d43bc60b75395f1e4b7a939888c6a8b26b7","observation_id":"e8da3414-440c-4df3-b02b-1cdcd296b7c1","resolution":{"observed_at":"2026-08-11T19:27:06.392319Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T19:27:06.372285Z","title":"Raffin, A","venue":null,"work_id":"e71f228a-a79f-4820-b031-890d7b8d0358","year":2021},"citing_paper":{"arxiv_id":"2412.06938","last_updated":"2024-12-09T19:26:49Z","snapshot_observed_at":"2026-08-12T18:41:53.352365Z","submitted_at":"2024-12-09T19:26:49Z","title":"Optimising entanglement distribution policies under classical communication constraints assisted by reinforcement learning","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-11T19:27:05.715490Z"},"links":{"citing_paper":"/paper/2412.06938"},"observation_digest":"sha256:d53e5ce22d64af173998ffba5c1ba7b82e0922aee6a29c243d877de4401a9ca2","observation_id":"e9f6b940-b5cc-48d4-a900-d81f9839cf3a","resolution":{"observed_at":"2026-08-11T19:27:06.376916Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T19:27:06.356979Z","title":null,"venue":null,"work_id":"10030d7e-c987-4d96-bb03-224af7f96681","year":2022},"citing_paper":{"arxiv_id":"2412.06938","last_updated":"2024-12-09T19:26:49Z","snapshot_observed_at":"2026-08-12T18:41:53.352365Z","submitted_at":"2024-12-09T19:26:49Z","title":"Optimising entanglement distribution policies under classical communication constraints assisted by reinforcement learning","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-11T19:27:05.720224Z"},"links":{"citing_paper":"/paper/2412.06938"},"observation_digest":"sha256:a09481a528132bd4a399d197589050ac2136261ceb885187eae41f18c969de3a","observation_id":"7ca5914e-d9b1-4824-87e8-0f3618f8538a","resolution":{"observed_at":"2026-08-11T19:27:06.362007Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2103.01955","last_updated":"2022-11-04T06:16:11Z","snapshot_observed_at":"2026-08-13T20:05:27.284758Z","submitted_at":"2021-03-02T18:59:56Z","title":"The Surprising Effectiveness of PPO in Cooperative, Multi-Agent Games","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.01955","snapshot_observed_at":"2026-08-11T19:27:05.725101Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.06938","last_updated":"2024-12-09T19:26:49Z","snapshot_observed_at":"2026-08-12T18:41:53.352365Z","submitted_at":"2024-12-09T19:26:49Z","title":"Optimising entanglement distribution policies under classical communication constraints assisted by reinforcement learning","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-11T19:27:05.725101Z"},"links":{"cited_paper":"/paper/2103.01955","citing_paper":"/paper/2412.06938"},"observation_digest":"sha256:457040cedebbb39a6f50e583e213de6f62310b8aa0bf72d3d21e6fc7bbbc8ac7","observation_id":"6d472b6d-696d-4f2b-a6d8-5fb768e73ff7","resolution":{"observed_at":"2026-08-11T19:27:05.725101Z","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-11T19:27:06.340520Z","title":"Zhu and X","venue":null,"work_id":"00bcd980-f887-40b5-9cbe-fe259742af71","year":2023},"citing_paper":{"arxiv_id":"2412.06938","last_updated":"2024-12-09T19:26:49Z","snapshot_observed_at":"2026-08-12T18:41:53.352365Z","submitted_at":"2024-12-09T19:26:49Z","title":"Optimising entanglement distribution policies under classical communication constraints assisted by reinforcement learning","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-11T19:27:05.730142Z"},"links":{"citing_paper":"/paper/2412.06938"},"observation_digest":"sha256:47b43fb8f5429762659095a0f3fdbf14d94874aab9f9f149341d2b30679bead3","observation_id":"72f7a569-1b5a-415b-ba27-6f86aa677efd","resolution":{"observed_at":"2026-08-11T19:27:06.345857Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T19:27:05.735043Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.06938","last_updated":"2024-12-09T19:26:49Z","snapshot_observed_at":"2026-08-12T18:41:53.352365Z","submitted_at":"2024-12-09T19:26:49Z","title":"Optimising entanglement distribution policies under classical communication constraints assisted by reinforcement learning","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-11T19:27:05.735043Z"},"links":{"citing_paper":"/paper/2412.06938"},"observation_digest":"sha256:b89626e89f59f911897f02b9cd0a99960cc04c0026382679b9201fd120fd01fe","observation_id":"1c35b7be-de54-4542-965d-3f2abf76d8c8","resolution":{"observed_at":"2026-08-11T19:27:05.735043Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.13609","last_updated":"2025-05-23T15:10:37Z","snapshot_observed_at":"2026-08-15T01:12:01.335621Z","submitted_at":"2024-05-22T13:01:37Z","title":"Tackling Decision Processes with Non-Cumulative Objectives using Reinforcement Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.13609","snapshot_observed_at":"2026-08-11T19:27:05.739836Z","title":"Nägele, J","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.06938","last_updated":"2024-12-09T19:26:49Z","snapshot_observed_at":"2026-08-12T18:41:53.352365Z","submitted_at":"2024-12-09T19:26:49Z","title":"Optimising entanglement distribution policies under classical communication constraints assisted by reinforcement learning","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-11T19:27:05.739836Z"},"links":{"cited_paper":"/paper/2405.13609","citing_paper":"/paper/2412.06938"},"observation_digest":"sha256:845378bb4cbaf0a7ac5e240c3c45e3d928464d4843cba5c18e4a8abd02f43754","observation_id":"6949d95d-f2ee-49b2-a8dc-0335436384d1","resolution":{"observed_at":"2026-08-11T19:27:05.739836Z","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-11T19:27:06.324836Z","title":"Nägele and F","venue":null,"work_id":"350b98df-069f-4ef5-a2db-af85d997ed46","year":2024},"citing_paper":{"arxiv_id":"2412.06938","last_updated":"2024-12-09T19:26:49Z","snapshot_observed_at":"2026-08-12T18:41:53.352365Z","submitted_at":"2024-12-09T19:26:49Z","title":"Optimising entanglement distribution policies under classical communication constraints assisted by reinforcement learning","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-11T19:27:05.744740Z"},"links":{"citing_paper":"/paper/2412.06938"},"observation_digest":"sha256:f54d7b62af835e26c5a2f2e28c0b6fcd817dc5b60d051a8eace3237af6d37871","observation_id":"31381f03-6aa6-405c-be7a-ab004c55327b","resolution":{"observed_at":"2026-08-11T19:27:06.329759Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T19:27:06.309581Z","title":null,"venue":null,"work_id":"73c37370-514f-4559-a481-7e470e163f1d","year":2011},"citing_paper":{"arxiv_id":"2412.06938","last_updated":"2024-12-09T19:26:49Z","snapshot_observed_at":"2026-08-12T18:41:53.352365Z","submitted_at":"2024-12-09T19:26:49Z","title":"Optimising entanglement distribution policies under classical communication constraints assisted by reinforcement learning","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-11T19:27:05.749564Z"},"links":{"citing_paper":"/paper/2412.06938"},"observation_digest":"sha256:94e9a74cbedd692d9cff24e4cafd8e0b4e34a7930a8cce014ab522e70cc651a5","observation_id":"e6fd5bfb-048c-4a7d-bfca-353e5f860d53","resolution":{"observed_at":"2026-08-11T19:27:06.314361Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T19:27:06.293623Z","title":"Buşoniu, R","venue":null,"work_id":"0350dcb7-14ff-4e59-be89-40dc46468cac","year":2010},"citing_paper":{"arxiv_id":"2412.06938","last_updated":"2024-12-09T19:26:49Z","snapshot_observed_at":"2026-08-12T18:41:53.352365Z","submitted_at":"2024-12-09T19:26:49Z","title":"Optimising entanglement distribution policies under classical communication constraints assisted by reinforcement learning","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-11T19:27:05.754742Z"},"links":{"citing_paper":"/paper/2412.06938"},"observation_digest":"sha256:febc879ec52e313b78f582e861126a0c0b1d98d744fc74191a32324e8b11bb2b","observation_id":"66f2117f-dcf8-4c2e-ab27-c2c91c4faf08","resolution":{"observed_at":"2026-08-11T19:27:06.298403Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T19:27:06.278154Z","title":"Zhang, Z","venue":null,"work_id":"356e0319-09a6-4d33-a4cc-b3564c3cd35b","year":2021},"citing_paper":{"arxiv_id":"2412.06938","last_updated":"2024-12-09T19:26:49Z","snapshot_observed_at":"2026-08-12T18:41:53.352365Z","submitted_at":"2024-12-09T19:26:49Z","title":"Optimising entanglement distribution policies under classical communication constraints assisted by reinforcement learning","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-11T19:27:05.760192Z"},"links":{"citing_paper":"/paper/2412.06938"},"observation_digest":"sha256:a607865ea0d65d9c36d5d8c70478bb29526abd7ac265dfb8c016a3eeb19067e6","observation_id":"628cf244-8513-4432-9059-0dd5cb631c04","resolution":{"observed_at":"2026-08-11T19:27:06.282639Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T19:27:05.765232Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.06938","last_updated":"2024-12-09T19:26:49Z","snapshot_observed_at":"2026-08-12T18:41:53.352365Z","submitted_at":"2024-12-09T19:26:49Z","title":"Optimising entanglement distribution policies under classical communication constraints assisted by reinforcement learning","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-11T19:27:05.765232Z"},"links":{"citing_paper":"/paper/2412.06938"},"observation_digest":"sha256:2cc13c18e95a8faf7d3ac83bf14612431357754c66525a35ce0efd3a17eb3817","observation_id":"1d167c58-8946-495d-806b-267325a99b11","resolution":{"observed_at":"2026-08-11T19:27:05.765232Z","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-11T19:27:06.263230Z","title":"Shahbeigi, D","venue":null,"work_id":"fde75847-7ca7-4b4d-a79d-e9526ced2661","year":2021},"citing_paper":{"arxiv_id":"2412.06938","last_updated":"2024-12-09T19:26:49Z","snapshot_observed_at":"2026-08-12T18:41:53.352365Z","submitted_at":"2024-12-09T19:26:49Z","title":"Optimising entanglement distribution policies under classical communication constraints assisted by reinforcement learning","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-11T19:27:05.770326Z"},"links":{"citing_paper":"/paper/2412.06938"},"observation_digest":"sha256:f8299503cec9a52c2c834b185299ccb6dbfe85fd265d25678f4a20e8f75463bd","observation_id":"e5294a49-f066-4e36-9dfc-091129829898","resolution":{"observed_at":"2026-08-11T19:27:06.267850Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T19:27:06.245566Z","title":null,"venue":null,"work_id":"501d1536-c51f-472e-b993-8d094df4e823","year":null},"citing_paper":{"arxiv_id":"2412.06938","last_updated":"2024-12-09T19:26:49Z","snapshot_observed_at":"2026-08-12T18:41:53.352365Z","submitted_at":"2024-12-09T19:26:49Z","title":"Optimising entanglement distribution policies under classical communication constraints assisted by reinforcement learning","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-11T19:27:05.775783Z"},"links":{"citing_paper":"/paper/2412.06938"},"observation_digest":"sha256:224cf31aeb03aa2ecbd22aaaf2ce900e7255a54edbfc6722642b352b3510dc82","observation_id":"cd70b097-4e47-45de-93df-a376be3c8efe","resolution":{"observed_at":"2026-08-11T19:27:06.251126Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T19:27:06.227620Z","title":"Here n ∈ N is the number of nodes in the linear network, where each node is labelled by an integer i ∈ [n]","venue":null,"work_id":"4ada7bb8-12e6-483f-8881-45b7df1fe1ca","year":null},"citing_paper":{"arxiv_id":"2412.06938","last_updated":"2024-12-09T19:26:49Z","snapshot_observed_at":"2026-08-12T18:41:53.352365Z","submitted_at":"2024-12-09T19:26:49Z","title":"Optimising entanglement distribution policies under classical communication constraints assisted by reinforcement learning","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-11T19:27:05.780296Z"},"links":{"citing_paper":"/paper/2412.06938"},"observation_digest":"sha256:ee29d61e0970ead666a20953f71c5f0a0b7a1a97621dbb5c9de77cb2a8c5d0ed","observation_id":"dc48dfac-eaaf-4143-b8e7-0ed9d46bae0a","resolution":{"observed_at":"2026-08-11T19:27:06.232811Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T19:27:06.211893Z","title":"When the link gen- eration attempt is applied, it first removes all links con- nected to qubits at segmenti, i.e","venue":null,"work_id":"7c14006a-9feb-43ac-b26c-af9e63c3e338","year":null},"citing_paper":{"arxiv_id":"2412.06938","last_updated":"2024-12-09T19:26:49Z","snapshot_observed_at":"2026-08-12T18:41:53.352365Z","submitted_at":"2024-12-09T19:26:49Z","title":"Optimising entanglement distribution policies under classical communication constraints assisted by reinforcement learning","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-11T19:27:05.784841Z"},"links":{"citing_paper":"/paper/2412.06938"},"observation_digest":"sha256:ceae275d9215dd1d89ab51306c415733d737acfdccacb86d0ca89dcc31a14ee2","observation_id":"d02fe90b-ddd0-40d1-bac2-8c83758ab54e","resolution":{"observed_at":"2026-08-11T19:27:06.216844Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T19:27:06.196257Z","title":"In each even round, it will perform a swap on all of the nodes where two links are present","venue":null,"work_id":"a21c4a44-0ac7-4c02-bcf7-bd6b5b7c72d5","year":null},"citing_paper":{"arxiv_id":"2412.06938","last_updated":"2024-12-09T19:26:49Z","snapshot_observed_at":"2026-08-12T18:41:53.352365Z","submitted_at":"2024-12-09T19:26:49Z","title":"Optimising entanglement distribution policies under classical communication constraints assisted by reinforcement learning","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-11T19:27:05.789912Z"},"links":{"citing_paper":"/paper/2412.06938"},"observation_digest":"sha256:f869be01f9fc9f6dbbb0b2c4f8de1390094d44641fa513154ed4b281ead653ed","observation_id":"5f98ef5a-f381-41ed-9dfd-929e3a7aaf1d","resolution":{"observed_at":"2026-08-11T19:27:06.201280Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T19:27:06.179652Z","title":"This is to ensure that each time after sending out actions, enough time has passed such that all results have been collected back","venue":null,"work_id":"135151a2-5de3-4f9a-ab43-6700bb696bdf","year":null},"citing_paper":{"arxiv_id":"2412.06938","last_updated":"2024-12-09T19:26:49Z","snapshot_observed_at":"2026-08-12T18:41:53.352365Z","submitted_at":"2024-12-09T19:26:49Z","title":"Optimising entanglement distribution policies under classical communication constraints assisted by reinforcement learning","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-11T19:27:05.794036Z"},"links":{"citing_paper":"/paper/2412.06938"},"observation_digest":"sha256:0a77a0f00d83720b9d9f0454c3a8ea85d748afe97e5250be9f08e56ecfb2f1ed","observation_id":"2c5c80d1-b6a7-43df-b409-366d976b790b","resolution":{"observed_at":"2026-08-11T19:27:06.185432Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T19:27:06.164146Z","title":null,"venue":null,"work_id":"e0d427d7-9b05-4344-9a07-0f899cf5e96b","year":null},"citing_paper":{"arxiv_id":"2412.06938","last_updated":"2024-12-09T19:26:49Z","snapshot_observed_at":"2026-08-12T18:41:53.352365Z","submitted_at":"2024-12-09T19:26:49Z","title":"Optimising entanglement distribution policies under classical communication constraints assisted by reinforcement learning","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-11T19:27:05.798866Z"},"links":{"citing_paper":"/paper/2412.06938"},"observation_digest":"sha256:a5fa81b7eabb91366318f92a663f98b836683e91cf4afdb8c69a7b551abb7fb5","observation_id":"9d04a2d5-efe0-4174-9236-add6aa99107f","resolution":{"observed_at":"2026-08-11T19:27:06.168889Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2412.06938","last_updated":"2024-12-09T19:26:49Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-12T18:41:53.352365Z","submitted_at":"2024-12-09T19:26:49Z","title":"Optimising entanglement distribution policies under classical communication constraints assisted by reinforcement learning"},"reference_resolution":{"displayed":54,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":32,"verified_exact":2,"verified_fuzzy":20},"total_outbound_references":54},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 54 of 54 outbound references and 0 inbound Pith citation observations for arXiv:2412.06938."}