{"as_of":"2026-08-13T22:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:80e6d82a89bbb5203156f8f59ff15cbce3dc482f5cdd4c146f5af7fdbcc9bfdd","coverage":[{"denominator":21,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":21,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T00:02:13.135853Z","state":"measured"},{"denominator":21,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":21,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+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/2608.05775/citation-record","integrity":"/paper/2608.05775/integrity","json":"/paper/2608.05775/citation-record.json","paper":"/paper/2608.05775"},"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-08T00:02:13.417344Z","title":"Allerstorfer, H","venue":null,"work_id":"70dc88cd-5f22-4ae8-b338-54ee6349b64e","year":2024},"citing_paper":{"arxiv_id":"2608.05775","last_updated":"2026-08-06T09:09:44Z","snapshot_observed_at":"2026-08-12T06:07:16.263228Z","submitted_at":"2026-08-06T09:09:44Z","title":"Robust logarithmic lower bound on shared-resource cost for $f$-routing","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-08T00:02:13.058864Z"},"links":{"citing_paper":"/paper/2608.05775"},"observation_digest":"sha256:e03dfcc81ada4b3434a4b7e4d254cb5679ff4f3bf63c57a94757e636279acc0d","observation_id":"e7932ec2-f920-4979-9a58-da27422a048c","resolution":{"observed_at":"2026-08-08T00:02:13.421257Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.18648","last_updated":"2026-08-05T15:52:18Z","snapshot_observed_at":"2026-08-13T07:14:42.873053Z","submitted_at":"2024-02-28T19:00:10Z","title":"Linear gate bounds against natural functions for position-verification","version":5},"cited_work":{"arxiv_id":"2402.18648","doi":null,"metadata_source":"pith","pith_arxiv_id":"2402.18648","snapshot_observed_at":"2026-08-08T00:02:13.204564Z","title":"Linear gate bounds against natural functions for position-verification","venue":"quant-ph","work_id":"da7632a9-3bb2-4ac0-9b8b-943a0c9053e2","year":2024},"citing_paper":{"arxiv_id":"2608.05775","last_updated":"2026-08-06T09:09:44Z","snapshot_observed_at":"2026-08-12T06:07:16.263228Z","submitted_at":"2026-08-06T09:09:44Z","title":"Robust logarithmic lower bound on shared-resource cost for $f$-routing","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-08T00:02:13.063345Z"},"links":{"cited_paper":"/paper/2402.18648","citing_paper":"/paper/2608.05775"},"observation_digest":"sha256:19a0cd2378cb19f5e11a79d0f8fe630b1386ec78a98e409d945784ebbc6778a9","observation_id":"34c33434-7710-4464-9200-1e807b836fce","resolution":{"observed_at":"2026-08-08T00:02:13.210970Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-08T00:02:13.406615Z","title":null,"venue":null,"work_id":"d3091988-9f0c-4e9a-99e3-32df1a0f0aae","year":2025},"citing_paper":{"arxiv_id":"2608.05775","last_updated":"2026-08-06T09:09:44Z","snapshot_observed_at":"2026-08-12T06:07:16.263228Z","submitted_at":"2026-08-06T09:09:44Z","title":"Robust logarithmic lower bound on shared-resource cost for $f$-routing","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-08T00:02:13.068499Z"},"links":{"citing_paper":"/paper/2608.05775"},"observation_digest":"sha256:1d4b5dfa2e5e625c3f17ce3733f3385679bcabbf2a75d4eea1bdd3f6d2d74cb5","observation_id":"125df53d-01bc-4200-a2be-1fe406b570bc","resolution":{"observed_at":"2026-08-08T00:02:13.410225Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-08T00:02:13.395424Z","title":null,"venue":null,"work_id":"5eb4e879-ee6c-4998-ad7a-f9a6bb9dcf60","year":2025},"citing_paper":{"arxiv_id":"2608.05775","last_updated":"2026-08-06T09:09:44Z","snapshot_observed_at":"2026-08-12T06:07:16.263228Z","submitted_at":"2026-08-06T09:09:44Z","title":"Robust logarithmic lower bound on shared-resource cost for $f$-routing","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-08T00:02:13.072576Z"},"links":{"citing_paper":"/paper/2608.05775"},"observation_digest":"sha256:9668f3f37c1ac2b661387d256a1c19a0036d63e2a403a098fff79254d78c253f","observation_id":"0a5dee94-7f56-48c9-bf9b-6305034f08c7","resolution":{"observed_at":"2026-08-08T00:02:13.399176Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-08T00:02:13.383276Z","title":"Bluhm, M","venue":null,"work_id":"66a921e7-72bc-4a97-b6c8-b1737da2f88d","year":2022},"citing_paper":{"arxiv_id":"2608.05775","last_updated":"2026-08-06T09:09:44Z","snapshot_observed_at":"2026-08-12T06:07:16.263228Z","submitted_at":"2026-08-06T09:09:44Z","title":"Robust logarithmic lower bound on shared-resource cost for $f$-routing","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-08T00:02:13.075997Z"},"links":{"citing_paper":"/paper/2608.05775"},"observation_digest":"sha256:29ee798597e3d4471932d1864b8f09754af76deee2bec0d6c98bbfcfeac21c45","observation_id":"13786f55-dc58-4590-8b2a-a672e461d6e8","resolution":{"observed_at":"2026-08-08T00:02:13.387331Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-08T00:02:13.370516Z","title":"Bluhm, S","venue":null,"work_id":"78f945fe-dbf5-4227-85ce-acc62df84b75","year":2026},"citing_paper":{"arxiv_id":"2608.05775","last_updated":"2026-08-06T09:09:44Z","snapshot_observed_at":"2026-08-12T06:07:16.263228Z","submitted_at":"2026-08-06T09:09:44Z","title":"Robust logarithmic lower bound on shared-resource cost for $f$-routing","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-08T00:02:13.079655Z"},"links":{"citing_paper":"/paper/2608.05775"},"observation_digest":"sha256:cbbca5b4a6554f2318081555999701638da5d90c3ed11cf7a7aee77b78dc2fea","observation_id":"5fa9a0b2-fdb2-4d9e-baba-1dfe4c8bce29","resolution":{"observed_at":"2026-08-08T00:02:13.374498Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-08T00:02:13.355685Z","title":"Boyd and L","venue":null,"work_id":"9758b66c-13da-45a8-b765-0a37e3f97242","year":2004},"citing_paper":{"arxiv_id":"2608.05775","last_updated":"2026-08-06T09:09:44Z","snapshot_observed_at":"2026-08-12T06:07:16.263228Z","submitted_at":"2026-08-06T09:09:44Z","title":"Robust logarithmic lower bound on shared-resource cost for $f$-routing","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-08T00:02:13.083468Z"},"links":{"citing_paper":"/paper/2608.05775"},"observation_digest":"sha256:692b093dc2c360523be1669ddea7c25199be8bdd6398e3b5a78b980aee256a38","observation_id":"207c420b-6182-4142-9ae7-ca8720df51ff","resolution":{"observed_at":"2026-08-08T00:02:13.359928Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2602.00255","last_updated":"2026-04-29T19:37:07Z","snapshot_observed_at":"2026-08-08T12:14:25.852012Z","submitted_at":"2026-01-30T19:19:12Z","title":"Lower bounds on non-local computation from controllable correlation","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2602.00255","snapshot_observed_at":"2026-08-08T00:02:13.086766Z","title":"Cleve and A","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.05775","last_updated":"2026-08-06T09:09:44Z","snapshot_observed_at":"2026-08-12T06:07:16.263228Z","submitted_at":"2026-08-06T09:09:44Z","title":"Robust logarithmic lower bound on shared-resource cost for $f$-routing","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-08T00:02:13.086766Z"},"links":{"cited_paper":"/paper/2602.00255","citing_paper":"/paper/2608.05775"},"observation_digest":"sha256:5298c3f8c7fd14542025ba8060a30fcafd57f481dd15c49d5fa9605f56fc8038","observation_id":"cdd50fe1-147b-4e17-91a7-095fdf3eb93a","resolution":{"observed_at":"2026-08-08T00:02:13.086766Z","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-08T00:02:13.342627Z","title":null,"venue":null,"work_id":"67939552-e4c6-40e6-889e-f7630bb8ee56","year":1956},"citing_paper":{"arxiv_id":"2608.05775","last_updated":"2026-08-06T09:09:44Z","snapshot_observed_at":"2026-08-12T06:07:16.263228Z","submitted_at":"2026-08-06T09:09:44Z","title":"Robust logarithmic lower bound on shared-resource cost for $f$-routing","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-08T00:02:13.091123Z"},"links":{"citing_paper":"/paper/2608.05775"},"observation_digest":"sha256:9798318bb7ff8d70aadfd4bcfc82abac81f51225855be13e005b03c31a6cf523","observation_id":"1e43b681-6188-4280-880a-a39163d47d5e","resolution":{"observed_at":"2026-08-08T00:02:13.346672Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-08T00:02:13.328452Z","title":"Forster, A linear lower bound on the unbounded error probabilistic communication complexity, Journal of Computer and System Sciences 65 (2002), 612--625","venue":null,"work_id":"4ca2702d-c326-4c85-8b48-be9c81131b6b","year":2002},"citing_paper":{"arxiv_id":"2608.05775","last_updated":"2026-08-06T09:09:44Z","snapshot_observed_at":"2026-08-12T06:07:16.263228Z","submitted_at":"2026-08-06T09:09:44Z","title":"Robust logarithmic lower bound on shared-resource cost for $f$-routing","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-08T00:02:13.094745Z"},"links":{"citing_paper":"/paper/2608.05775"},"observation_digest":"sha256:88d90df39fe1441e03cf8113d052d5c3d7e44f03cd81a4b7077b8dd37d4116a3","observation_id":"f72cf247-57d4-4ced-a0dc-d344c0153738","resolution":{"observed_at":"2026-08-08T00:02:13.332475Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-08T00:02:13.317734Z","title":"Girish, A","venue":null,"work_id":"f9b846fe-b20d-4ae0-bf38-de6eb3a1c6ff","year":2026},"citing_paper":{"arxiv_id":"2608.05775","last_updated":"2026-08-06T09:09:44Z","snapshot_observed_at":"2026-08-12T06:07:16.263228Z","submitted_at":"2026-08-06T09:09:44Z","title":"Robust logarithmic lower bound on shared-resource cost for $f$-routing","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-08T00:02:13.098697Z"},"links":{"citing_paper":"/paper/2608.05775"},"observation_digest":"sha256:2a5b5e9aadc35baa28101eb6f491c87f83c71e3a77efef19c7567d5bad0a7230","observation_id":"bb323554-52b5-40aa-8aa4-7057d0260f6f","resolution":{"observed_at":"2026-08-08T00:02:13.321241Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-08T00:02:13.306067Z","title":"Hayashi, Optimal sequence of quantum measurements in the sense of Stein's lemma in quantum hypothesis testing, Journal of Physics A 35 (2002), 10759--10773","venue":null,"work_id":"b434312b-4429-4c3f-ac5b-d0b77bdecee8","year":2002},"citing_paper":{"arxiv_id":"2608.05775","last_updated":"2026-08-06T09:09:44Z","snapshot_observed_at":"2026-08-12T06:07:16.263228Z","submitted_at":"2026-08-06T09:09:44Z","title":"Robust logarithmic lower bound on shared-resource cost for $f$-routing","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-08T00:02:13.102699Z"},"links":{"citing_paper":"/paper/2608.05775"},"observation_digest":"sha256:f2a42e748ff19c82e5fddfd5af976214ec77a9f031edfde724d710f4d058447f","observation_id":"a627d4b3-a4d9-42a3-bf19-fb0c8c0c08d8","resolution":{"observed_at":"2026-08-08T00:02:13.310409Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-08T00:02:13.293610Z","title":"Hiai and D","venue":null,"work_id":"1212b1ae-9250-462a-a3ba-d9dc4c1d860a","year":2014},"citing_paper":{"arxiv_id":"2608.05775","last_updated":"2026-08-06T09:09:44Z","snapshot_observed_at":"2026-08-12T06:07:16.263228Z","submitted_at":"2026-08-06T09:09:44Z","title":"Robust logarithmic lower bound on shared-resource cost for $f$-routing","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-08T00:02:13.106190Z"},"links":{"citing_paper":"/paper/2608.05775"},"observation_digest":"sha256:628ad5ee372fb57b0a79ac271a48796211418f2a22644b3d55da478943c0d5b5","observation_id":"5ca3e877-481e-45d7-bb65-38fed85b3fbc","resolution":{"observed_at":"2026-08-08T00:02:13.296955Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-08T00:02:13.281293Z","title":"Kretschmann, D","venue":null,"work_id":"e342a120-f84a-41e6-8332-30ddd3cd4597","year":2008},"citing_paper":{"arxiv_id":"2608.05775","last_updated":"2026-08-06T09:09:44Z","snapshot_observed_at":"2026-08-12T06:07:16.263228Z","submitted_at":"2026-08-06T09:09:44Z","title":"Robust logarithmic lower bound on shared-resource cost for $f$-routing","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-08T00:02:13.109985Z"},"links":{"citing_paper":"/paper/2608.05775"},"observation_digest":"sha256:fc6b445d8d2dcd241ec856eb62dc02de0fef577989cb65db03f37d7c45a5209e","observation_id":"05f84a9f-39eb-445b-a419-ee8d14d2d597","resolution":{"observed_at":"2026-08-08T00:02:13.285472Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-08T00:02:13.267757Z","title":"Liu, Quantum state testing beyond the polarizing regime and quantum triangular discrimination, Computational Complexity 34 (2025), 11","venue":null,"work_id":"8f4a73a0-4ea5-4a93-bd04-9b0b8bb3fc19","year":2025},"citing_paper":{"arxiv_id":"2608.05775","last_updated":"2026-08-06T09:09:44Z","snapshot_observed_at":"2026-08-12T06:07:16.263228Z","submitted_at":"2026-08-06T09:09:44Z","title":"Robust logarithmic lower bound on shared-resource cost for $f$-routing","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-08T00:02:13.113484Z"},"links":{"citing_paper":"/paper/2608.05775"},"observation_digest":"sha256:1f312be80a980e4f62bccf114b28539cb664c2fdbd1ecc7e67a12def4a85eff7","observation_id":"3cdd9eed-1d3b-4f97-a1f6-8d03ac6d33d9","resolution":{"observed_at":"2026-08-08T00:02:13.272052Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2605.02840","last_updated":"2026-07-19T11:24:15Z","snapshot_observed_at":"2026-08-11T07:32:20.355361Z","submitted_at":"2026-05-04T17:19:12Z","title":"Entanglement cost in non-local quantum computation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2605.02840","snapshot_observed_at":"2026-08-08T00:02:13.116897Z","title":"May, Entanglement cost in non-local quantum computation, arXiv:2605.02840, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.05775","last_updated":"2026-08-06T09:09:44Z","snapshot_observed_at":"2026-08-12T06:07:16.263228Z","submitted_at":"2026-08-06T09:09:44Z","title":"Robust logarithmic lower bound on shared-resource cost for $f$-routing","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-08T00:02:13.116897Z"},"links":{"cited_paper":"/paper/2605.02840","citing_paper":"/paper/2608.05775"},"observation_digest":"sha256:e749627fc3eaf73aae78b76c0fdfa9d99046b149447a460d56ef9881622457df","observation_id":"9c7517a3-b244-4a94-a470-62231ba0acde","resolution":{"observed_at":"2026-08-08T00:02:13.116897Z","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-08T00:02:13.255446Z","title":"Ogawa and M","venue":null,"work_id":"72fdee4b-8f8b-4866-82e5-ad3464f9d69a","year":2004},"citing_paper":{"arxiv_id":"2608.05775","last_updated":"2026-08-06T09:09:44Z","snapshot_observed_at":"2026-08-12T06:07:16.263228Z","submitted_at":"2026-08-06T09:09:44Z","title":"Robust logarithmic lower bound on shared-resource cost for $f$-routing","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-08T00:02:13.120700Z"},"links":{"citing_paper":"/paper/2608.05775"},"observation_digest":"sha256:5903aa50c72fb2835bf33b16d856edb91965fd7ff5aecc9a14c550199e23dc1e","observation_id":"768ccc23-90b3-44e5-a656-efafec6de42b","resolution":{"observed_at":"2026-08-08T00:02:13.259631Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-08T00:02:13.243923Z","title":null,"venue":null,"work_id":"518fa339-6efb-47bd-852f-148318fb1911","year":null},"citing_paper":{"arxiv_id":"2608.05775","last_updated":"2026-08-06T09:09:44Z","snapshot_observed_at":"2026-08-12T06:07:16.263228Z","submitted_at":"2026-08-06T09:09:44Z","title":"Robust logarithmic lower bound on shared-resource cost for $f$-routing","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-08T00:02:13.124296Z"},"links":{"citing_paper":"/paper/2608.05775"},"observation_digest":"sha256:feabc290d397410c732e67ac86228c12b49f476e7eb9d0c81019749febe40ca2","observation_id":"11f91891-2560-4295-9d37-ac6755c482f2","resolution":{"observed_at":"2026-08-08T00:02:13.247576Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-08T00:02:13.231756Z","title":"Saad, Iterative methods for sparse linear systems, second edition, SIAM, 2003","venue":null,"work_id":"9064742c-f2b3-4d49-92ca-18d9a41b5da8","year":2003},"citing_paper":{"arxiv_id":"2608.05775","last_updated":"2026-08-06T09:09:44Z","snapshot_observed_at":"2026-08-12T06:07:16.263228Z","submitted_at":"2026-08-06T09:09:44Z","title":"Robust logarithmic lower bound on shared-resource cost for $f$-routing","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-08T00:02:13.128422Z"},"links":{"citing_paper":"/paper/2608.05775"},"observation_digest":"sha256:cc2950ad2d2620633a943fa93605baddbbf8a0882ffb2f462048f046853b5561","observation_id":"7c68fec6-4fd9-40ca-9d28-853e988f42a5","resolution":{"observed_at":"2026-08-08T00:02:13.235753Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-08T00:02:13.219512Z","title":"Temme, M","venue":null,"work_id":"6ef2c3cc-a7cf-4bd5-9909-acf11c398f78","year":2010},"citing_paper":{"arxiv_id":"2608.05775","last_updated":"2026-08-06T09:09:44Z","snapshot_observed_at":"2026-08-12T06:07:16.263228Z","submitted_at":"2026-08-06T09:09:44Z","title":"Robust logarithmic lower bound on shared-resource cost for $f$-routing","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-08T00:02:13.132114Z"},"links":{"citing_paper":"/paper/2608.05775"},"observation_digest":"sha256:b774f74a2c5be34bff5363be516f71058b18643f5113e2527714ff3753a30884","observation_id":"568ecb9c-6928-45bd-b4b0-fcfab718787f","resolution":{"observed_at":"2026-08-08T00:02:13.223693Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-08T00:02:13.135853Z","title":null,"venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2608.05775","last_updated":"2026-08-06T09:09:44Z","snapshot_observed_at":"2026-08-12T06:07:16.263228Z","submitted_at":"2026-08-06T09:09:44Z","title":"Robust logarithmic lower bound on shared-resource cost for $f$-routing","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-08T00:02:13.135853Z"},"links":{"citing_paper":"/paper/2608.05775"},"observation_digest":"sha256:b6b3032613d2d4ebf747903a1998825ce63dc59a777a44a27f5ca3bec3bb24ec","observation_id":"290261cf-1cef-40af-97a9-0f91ad2e6e2f","resolution":{"observed_at":"2026-08-08T00:02:13.135853Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2608.05775","last_updated":"2026-08-06T09:09:44Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-12T06:07:16.263228Z","submitted_at":"2026-08-06T09:09:44Z","title":"Robust logarithmic lower bound on shared-resource cost for $f$-routing"},"reference_resolution":{"displayed":21,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":7,"verified_exact":1,"verified_fuzzy":13},"total_outbound_references":21},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 21 of 21 outbound references and 0 inbound Pith citation observations for arXiv:2608.05775."}