{"as_of":"2026-08-19T14:13:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:41b1a32aef8185556a985cb5adec72335471d5bb6a63b11601993a360f92cd97","coverage":[{"denominator":29,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":29,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T16:40:43.963374Z","state":"measured"},{"denominator":30,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":30,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T22:45:05.851348Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2509.05002","last_updated":"2025-09-12T13:10:22Z","snapshot_observed_at":"2026-08-15T16:22:16.986204Z","submitted_at":"2025-09-05T10:51:18Z","title":"Graph Reconstruction with a Connected Components Oracle","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2509.05002","snapshot_observed_at":"2026-08-02T22:45:05.851348Z","title":"https://arxiv.org/abs/2509.05002 David A","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.16137","last_updated":"2026-06-20T12:00:41Z","snapshot_observed_at":"2026-08-12T19:31:54.594977Z","submitted_at":"2026-02-18T02:01:31Z","title":"Experimental Assortments for Choice Estimation and Nest Identification","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-02T22:45:05.851348Z"},"links":{"cited_paper":"/paper/2509.05002","citing_paper":"/paper/2602.16137"},"observation_digest":"sha256:1a695d8456d63e3ed60156de7520bc388f811b13598469855f172117c1275346","observation_id":"40f860a8-aa78-4f1f-9bc6-17ad80248ce0","resolution":{"observed_at":"2026-08-02T22:45:05.851348Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2509.05002/citation-record","integrity":"/paper/2509.05002/integrity","json":"/paper/2509.05002/citation-record.json","paper":"/paper/2509.05002"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:40:43.841714Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.05002","last_updated":"2025-09-12T13:10:22Z","snapshot_observed_at":"2026-08-15T16:22:16.986204Z","submitted_at":"2025-09-05T10:51:18Z","title":"Graph Reconstruction with a Connected Components Oracle","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-15T16:40:43.841714Z"},"links":{"citing_paper":"/paper/2509.05002"},"observation_digest":"sha256:03366155bfabb68839d92833948709ab7952ff83f6f81c326aef685d2e6e34a5","observation_id":"aba0c41a-3134-41d3-8231-03161a87c8c6","resolution":{"observed_at":"2026-08-15T16:40:43.841714Z","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-15T16:40:44.352060Z","title":"Graph reconstruction with a betweenness oracle","venue":null,"work_id":"860f3493-40e7-402b-82d6-37d899650376","year":2016},"citing_paper":{"arxiv_id":"2509.05002","last_updated":"2025-09-12T13:10:22Z","snapshot_observed_at":"2026-08-15T16:22:16.986204Z","submitted_at":"2025-09-05T10:51:18Z","title":"Graph Reconstruction with a Connected Components Oracle","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-15T16:40:43.847046Z"},"links":{"citing_paper":"/paper/2509.05002"},"observation_digest":"sha256:2ebf93cb2ebfbc07f2fcb0aa7626a24b29dc5a3025ff5d0977a3bf475faa5d26","observation_id":"e2d85b2a-6d77-447c-9215-27c133eed306","resolution":{"observed_at":"2026-08-15T16:40:44.356418Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T16:40:43.851571Z","title":"Learning a hidden subgraph","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2509.05002","last_updated":"2025-09-12T13:10:22Z","snapshot_observed_at":"2026-08-15T16:22:16.986204Z","submitted_at":"2025-09-05T10:51:18Z","title":"Graph Reconstruction with a Connected Components Oracle","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-15T16:40:43.851571Z"},"links":{"citing_paper":"/paper/2509.05002"},"observation_digest":"sha256:003080dafb43a312b0da296fc1223fb7ce948946f659c4646a7625b776774830","observation_id":"4779cf84-ca5c-4c5b-83a0-9be807e92629","resolution":{"observed_at":"2026-08-15T16:40:43.851571Z","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-15T16:40:43.855854Z","title":"Learning a hidden matching","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2509.05002","last_updated":"2025-09-12T13:10:22Z","snapshot_observed_at":"2026-08-15T16:22:16.986204Z","submitted_at":"2025-09-05T10:51:18Z","title":"Graph Reconstruction with a Connected Components Oracle","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-15T16:40:43.855854Z"},"links":{"citing_paper":"/paper/2509.05002"},"observation_digest":"sha256:e924e09e4a02bc347b04b4f68b70235b51f6e14f7426f1aa6316c9365b554165","observation_id":"2ea35028-9da2-4a9c-9c6f-0965125f433c","resolution":{"observed_at":"2026-08-15T16:40:43.855854Z","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-15T16:40:44.320508Z","title":"Color-coding","venue":null,"work_id":"88924608-7f54-423b-948c-add6d42c1633","year":1995},"citing_paper":{"arxiv_id":"2509.05002","last_updated":"2025-09-12T13:10:22Z","snapshot_observed_at":"2026-08-15T16:22:16.986204Z","submitted_at":"2025-09-05T10:51:18Z","title":"Graph Reconstruction with a Connected Components Oracle","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-15T16:40:43.860603Z"},"links":{"citing_paper":"/paper/2509.05002"},"observation_digest":"sha256:f2243f1dcf359c03e3260b357be649a9890d1f38078cce21cf7284dea53eff2b","observation_id":"7c6c8c9d-1bd5-4722-8bfa-c0539c616065","resolution":{"observed_at":"2026-08-15T16:40:44.324945Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T16:40:44.307124Z","title":"Learning a hidden graph using O ( n) queries per edge","venue":null,"work_id":"ce31d451-672b-4acc-942d-d2325ca21b00","year":2008},"citing_paper":{"arxiv_id":"2509.05002","last_updated":"2025-09-12T13:10:22Z","snapshot_observed_at":"2026-08-15T16:22:16.986204Z","submitted_at":"2025-09-05T10:51:18Z","title":"Graph Reconstruction with a Connected Components Oracle","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-15T16:40:43.864916Z"},"links":{"citing_paper":"/paper/2509.05002"},"observation_digest":"sha256:eb4310045c285f1c60f1b2c5650cb28576481c26f72f439725883ae225e4fc8b","observation_id":"202a454c-4dcc-483b-b3e7-898b563741ab","resolution":{"observed_at":"2026-08-15T16:40:44.311365Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T16:40:43.869762Z","title":"Shankar Ram","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2509.05002","last_updated":"2025-09-12T13:10:22Z","snapshot_observed_at":"2026-08-15T16:22:16.986204Z","submitted_at":"2025-09-05T10:51:18Z","title":"Graph Reconstruction with a Connected Components Oracle","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-15T16:40:43.869762Z"},"links":{"citing_paper":"/paper/2509.05002"},"observation_digest":"sha256:ff98790cfbc0eb6642a6d8413daf3ad5fd6b13150349f00b032ef611348cf479","observation_id":"928a0d27-0aeb-480b-ad78-2245ab8ac07a","resolution":{"observed_at":"2026-08-15T16:40:43.869762Z","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-15T16:40:44.284540Z","title":"An optimal procedure for gap closing in whole genome shotgun sequencing","venue":null,"work_id":"736ba691-8313-4811-9da9-d531b4ec7d08","year":2001},"citing_paper":{"arxiv_id":"2509.05002","last_updated":"2025-09-12T13:10:22Z","snapshot_observed_at":"2026-08-15T16:22:16.986204Z","submitted_at":"2025-09-05T10:51:18Z","title":"Graph Reconstruction with a Connected Components Oracle","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-15T16:40:43.874025Z"},"links":{"citing_paper":"/paper/2509.05002"},"observation_digest":"sha256:8e5057bdb757eaa6f4aeefdf67debb2efe1151229de4d53b53ccf694474d25a1","observation_id":"5e1b8faa-4b74-4666-83fe-f596e26da5de","resolution":{"observed_at":"2026-08-15T16:40:44.289661Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T16:40:44.270129Z","title":"Optimal graph reconstruction by counting connected components in induced subgraphs","venue":null,"work_id":"488f6bd6-128e-488f-8ff7-34af0e6d36f9","year":2025},"citing_paper":{"arxiv_id":"2509.05002","last_updated":"2025-09-12T13:10:22Z","snapshot_observed_at":"2026-08-15T16:22:16.986204Z","submitted_at":"2025-09-05T10:51:18Z","title":"Graph Reconstruction with a Connected Components Oracle","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-15T16:40:43.878461Z"},"links":{"citing_paper":"/paper/2509.05002"},"observation_digest":"sha256:39c5bd7c4ae509ac19b985debe7cadb12f4fb30eaa83d2fdf0bc013a567d2669","observation_id":"b94faae0-2218-424a-ad7c-5b66effa956b","resolution":{"observed_at":"2026-08-15T16:40:44.274639Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T16:40:44.256583Z","title":"Combinatorial search on graphs motivated by bioinformatics applications: A brief survey","venue":null,"work_id":"d901827f-ea4b-4843-bcbf-98a103ff4020","year":2005},"citing_paper":{"arxiv_id":"2509.05002","last_updated":"2025-09-12T13:10:22Z","snapshot_observed_at":"2026-08-15T16:22:16.986204Z","submitted_at":"2025-09-05T10:51:18Z","title":"Graph Reconstruction with a Connected Components Oracle","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-15T16:40:43.882746Z"},"links":{"citing_paper":"/paper/2509.05002"},"observation_digest":"sha256:23f64ff565667aad997d60749e15b6dbd29870c3f6417388f9602545d23b640c","observation_id":"d1e86a7e-add6-47c3-bbfd-94c47c2ab705","resolution":{"observed_at":"2026-08-15T16:40:44.260988Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T16:40:44.241056Z","title":null,"venue":null,"work_id":"7eb6d4cb-9dbe-44d0-9a9c-56d064fd3ec7","year":1968},"citing_paper":{"arxiv_id":"2509.05002","last_updated":"2025-09-12T13:10:22Z","snapshot_observed_at":"2026-08-15T16:22:16.986204Z","submitted_at":"2025-09-05T10:51:18Z","title":"Graph Reconstruction with a Connected Components Oracle","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-15T16:40:43.887165Z"},"links":{"citing_paper":"/paper/2509.05002"},"observation_digest":"sha256:6cdd2bb9b8440322c51aae997ebcbba709668d444cabb791deff1c10360b1ad7","observation_id":"68743b40-bf12-4292-92ab-3b3d5eab2d26","resolution":{"observed_at":"2026-08-15T16:40:44.246217Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T16:40:43.891421Z","title":"Fomin, Lukasz Kowalik, Daniel Lokshtanov, D \\' a niel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2509.05002","last_updated":"2025-09-12T13:10:22Z","snapshot_observed_at":"2026-08-15T16:22:16.986204Z","submitted_at":"2025-09-05T10:51:18Z","title":"Graph Reconstruction with a Connected Components Oracle","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-15T16:40:43.891421Z"},"links":{"citing_paper":"/paper/2509.05002"},"observation_digest":"sha256:7d0df7c04da81026a6b09c9ab393366424cef63609a03a8d5432c04f899b66bc","observation_id":"e6eb4cf0-fe9c-4240-ab0f-e112cbfcff04","resolution":{"observed_at":"2026-08-15T16:40:43.891421Z","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-15T16:40:43.895902Z","title":"Reconstructing a hamiltonian cycle by querying the graph: Application to DNA physical mapping","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2509.05002","last_updated":"2025-09-12T13:10:22Z","snapshot_observed_at":"2026-08-15T16:22:16.986204Z","submitted_at":"2025-09-05T10:51:18Z","title":"Graph Reconstruction with a Connected Components Oracle","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-15T16:40:43.895902Z"},"links":{"citing_paper":"/paper/2509.05002"},"observation_digest":"sha256:92cd373280a4e8230811178b97977d5499014cbcf6de53d4565d15b522a21937","observation_id":"a96fea6f-9962-4a25-b785-cc0d272598e3","resolution":{"observed_at":"2026-08-15T16:40:43.895902Z","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-15T16:40:43.900009Z","title":"Optimal reconstruction of graphs under the additive model","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2509.05002","last_updated":"2025-09-12T13:10:22Z","snapshot_observed_at":"2026-08-15T16:22:16.986204Z","submitted_at":"2025-09-05T10:51:18Z","title":"Graph Reconstruction with a Connected Components Oracle","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-15T16:40:43.900009Z"},"links":{"citing_paper":"/paper/2509.05002"},"observation_digest":"sha256:71739c6cdede3bf8e29a95c2bc18ebb49303ed8cd7f5ed971ceefa15669efc4e","observation_id":"391281c8-48ba-4d2b-9aa8-b91ac3739952","resolution":{"observed_at":"2026-08-15T16:40:43.900009Z","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-15T16:40:44.198957Z","title":"Graph reconstruction and verification","venue":null,"work_id":"463a55fd-f9a7-45d6-85f6-bbf5da864511","year":2018},"citing_paper":{"arxiv_id":"2509.05002","last_updated":"2025-09-12T13:10:22Z","snapshot_observed_at":"2026-08-15T16:22:16.986204Z","submitted_at":"2025-09-05T10:51:18Z","title":"Graph Reconstruction with a Connected Components Oracle","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-15T16:40:43.904339Z"},"links":{"citing_paper":"/paper/2509.05002"},"observation_digest":"sha256:3c79c5e5f670e99a4ce5da80e39e5901ec3b6a9de9a943df3741acea7b05c7bd","observation_id":"61f30693-4596-4701-952b-8359d1d044e6","resolution":{"observed_at":"2026-08-15T16:40:44.203659Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T16:40:44.184820Z","title":"Karger and Nathan Srebro","venue":null,"work_id":"ed059195-0728-497e-b524-1e32bcaeed76","year":2001},"citing_paper":{"arxiv_id":"2509.05002","last_updated":"2025-09-12T13:10:22Z","snapshot_observed_at":"2026-08-15T16:22:16.986204Z","submitted_at":"2025-09-05T10:51:18Z","title":"Graph Reconstruction with a Connected Components Oracle","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-15T16:40:43.908626Z"},"links":{"citing_paper":"/paper/2509.05002"},"observation_digest":"sha256:50f6dae8ea3b304a4cdc535ae4873d633994ffa811077b4e56d5a9495f887827","observation_id":"d60a0d80-07be-4fc9-9f56-b900cc11c751","resolution":{"observed_at":"2026-08-15T16:40:44.189248Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T16:40:44.170980Z","title":"Probabilistic Graphical Models - Principles and Techniques","venue":null,"work_id":"211bc81c-4eb7-48ab-82a6-9e7cf1d41508","year":2009},"citing_paper":{"arxiv_id":"2509.05002","last_updated":"2025-09-12T13:10:22Z","snapshot_observed_at":"2026-08-15T16:22:16.986204Z","submitted_at":"2025-09-05T10:51:18Z","title":"Graph Reconstruction with a Connected Components Oracle","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-15T16:40:43.912597Z"},"links":{"citing_paper":"/paper/2509.05002"},"observation_digest":"sha256:a612e3f7d9b5a90529d0aa74b64537380f41c6415b56bfdef8260eb48092ccef","observation_id":"a46be85b-5891-463a-8183-2a94d57d7d40","resolution":{"observed_at":"2026-08-15T16:40:44.175557Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T16:40:44.156184Z","title":"Graph reconstruction via MIS queries","venue":null,"work_id":"87ac7d43-c5f1-401b-9a87-4c8134529857","year":2025},"citing_paper":{"arxiv_id":"2509.05002","last_updated":"2025-09-12T13:10:22Z","snapshot_observed_at":"2026-08-15T16:22:16.986204Z","submitted_at":"2025-09-05T10:51:18Z","title":"Graph Reconstruction with a Connected Components Oracle","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-15T16:40:43.917004Z"},"links":{"citing_paper":"/paper/2509.05002"},"observation_digest":"sha256:e125bd32add9b92f114134d02bc028f035c4fe4e2937b9d6195414cbab00d06e","observation_id":"003e3f62-2a3a-455b-a91f-b3cfdddde72f","resolution":{"observed_at":"2026-08-15T16:40:44.160689Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T16:40:44.140650Z","title":"Fomin, and Pekka Parviainen","venue":null,"work_id":"2e27227c-0778-4c90-a366-43377253cd28","year":2024},"citing_paper":{"arxiv_id":"2509.05002","last_updated":"2025-09-12T13:10:22Z","snapshot_observed_at":"2026-08-15T16:22:16.986204Z","submitted_at":"2025-09-05T10:51:18Z","title":"Graph Reconstruction with a Connected Components Oracle","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-15T16:40:43.921303Z"},"links":{"citing_paper":"/paper/2509.05002"},"observation_digest":"sha256:dc750c556ed63419ac32891335430c739cba567e39314204d6bd456dd9e23a55","observation_id":"df2ccd26-dc7d-4f2f-b86d-673a50248947","resolution":{"observed_at":"2026-08-15T16:40:44.146245Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T16:40:44.126674Z","title":"Lick and Arthur T","venue":null,"work_id":"4cd3faad-b14f-4da4-89b0-b2d5949f4c85","year":1970},"citing_paper":{"arxiv_id":"2509.05002","last_updated":"2025-09-12T13:10:22Z","snapshot_observed_at":"2026-08-15T16:22:16.986204Z","submitted_at":"2025-09-05T10:51:18Z","title":"Graph Reconstruction with a Connected Components Oracle","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-15T16:40:43.925325Z"},"links":{"citing_paper":"/paper/2509.05002"},"observation_digest":"sha256:294f0c5e469ed7eb3ac19098507c13fce7e3b6d71f018cc30b02ea936f0c6ccb","observation_id":"c39b9cc7-eb91-4647-9b90-72dd6d841877","resolution":{"observed_at":"2026-08-15T16:40:44.131246Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T16:40:44.111918Z","title":"A simple algorithm for graph reconstruction","venue":null,"work_id":"b2406f0c-bc4e-4bd2-88b5-9a11feb85143","year":2023},"citing_paper":{"arxiv_id":"2509.05002","last_updated":"2025-09-12T13:10:22Z","snapshot_observed_at":"2026-08-15T16:22:16.986204Z","submitted_at":"2025-09-05T10:51:18Z","title":"Graph Reconstruction with a Connected Components Oracle","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-15T16:40:43.930055Z"},"links":{"citing_paper":"/paper/2509.05002"},"observation_digest":"sha256:d7aacf59ffce061cd17a09ccb78f09220554bd7189cf6dca218d52d9714c76a5","observation_id":"42f62ca6-191a-4bfd-b2cb-a8d6cafc320e","resolution":{"observed_at":"2026-08-15T16:40:44.117258Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T16:40:44.098288Z","title":null,"venue":null,"work_id":"b2a29cf2-dfee-4bd9-a9f5-8fcd3f786867","year":2025},"citing_paper":{"arxiv_id":"2509.05002","last_updated":"2025-09-12T13:10:22Z","snapshot_observed_at":"2026-08-15T16:22:16.986204Z","submitted_at":"2025-09-05T10:51:18Z","title":"Graph Reconstruction with a Connected Components Oracle","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-15T16:40:43.934364Z"},"links":{"citing_paper":"/paper/2509.05002"},"observation_digest":"sha256:9cfe8725afecdb0f7dccd3b30af92ba44fcf41ac481bf4622a87a8820450946c","observation_id":"9cca458a-46e7-4c4c-85b8-1911f57a8395","resolution":{"observed_at":"2026-08-15T16:40:44.102778Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T16:40:44.083838Z","title":"Explicit nonadaptive combinatorial group testing schemes","venue":null,"work_id":"9bd06c04-f236-4336-be91-14b0c123cfcb","year":2011},"citing_paper":{"arxiv_id":"2509.05002","last_updated":"2025-09-12T13:10:22Z","snapshot_observed_at":"2026-08-15T16:22:16.986204Z","submitted_at":"2025-09-05T10:51:18Z","title":"Graph Reconstruction with a Connected Components Oracle","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-15T16:40:43.938614Z"},"links":{"citing_paper":"/paper/2509.05002"},"observation_digest":"sha256:23df3f1a99e6fd62a760f243e02e60d13723d328699bf67ecf09c5032b73bdd8","observation_id":"baf12565-8c59-4e64-94c1-d4aa7bc9d0a4","resolution":{"observed_at":"2026-08-15T16:40:44.088629Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T16:40:44.068370Z","title":"Learning and verifying graphs using queries with a focus on edge counting","venue":null,"work_id":"9d64dbb2-8c16-4eef-bd3e-283822eac847","year":2007},"citing_paper":{"arxiv_id":"2509.05002","last_updated":"2025-09-12T13:10:22Z","snapshot_observed_at":"2026-08-15T16:22:16.986204Z","submitted_at":"2025-09-05T10:51:18Z","title":"Graph Reconstruction with a Connected Components Oracle","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-15T16:40:43.942605Z"},"links":{"citing_paper":"/paper/2509.05002"},"observation_digest":"sha256:81cc3433a806f95d65914dea94ce25061b1039ff3490821e20fb632c567f62a2","observation_id":"7b837ffa-919f-420a-a658-d5698318bdbd","resolution":{"observed_at":"2026-08-15T16:40:44.073312Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T16:40:44.052947Z","title":"Reconstruction and verification of chordal graphs with a distance oracle","venue":null,"work_id":"002a2dd6-56c1-4b6f-a94f-5f299ff13f9a","year":2021},"citing_paper":{"arxiv_id":"2509.05002","last_updated":"2025-09-12T13:10:22Z","snapshot_observed_at":"2026-08-15T16:22:16.986204Z","submitted_at":"2025-09-05T10:51:18Z","title":"Graph Reconstruction with a Connected Components Oracle","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-15T16:40:43.946782Z"},"links":{"citing_paper":"/paper/2509.05002"},"observation_digest":"sha256:4132ad0567c24ee1b30ce4948b529675da02bbc6c79141aa07d3f216015eb428","observation_id":"4add2c8e-6355-43a8-a17e-d38a4a182a80","resolution":{"observed_at":"2026-08-15T16:40:44.057603Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T16:40:44.038209Z","title":"A divide-and-conquer approach for reconstruction of \\ C_ 5 \\ -free graphs via betweenness queries","venue":null,"work_id":"83c1aaee-0020-4799-b104-7d3beab0671d","year":2022},"citing_paper":{"arxiv_id":"2509.05002","last_updated":"2025-09-12T13:10:22Z","snapshot_observed_at":"2026-08-15T16:22:16.986204Z","submitted_at":"2025-09-05T10:51:18Z","title":"Graph Reconstruction with a Connected Components Oracle","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-15T16:40:43.950995Z"},"links":{"citing_paper":"/paper/2509.05002"},"observation_digest":"sha256:cce59e86e97b4b16086460b79b2ff3959af18961449113148308ab3040478f1f","observation_id":"27dae435-c517-49e5-8ef8-dafd2a7e5cab","resolution":{"observed_at":"2026-08-15T16:40:44.043203Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T16:40:44.023841Z","title":null,"venue":null,"work_id":"ff1e97fa-a3e3-432b-86f3-fbdff4951539","year":1974},"citing_paper":{"arxiv_id":"2509.05002","last_updated":"2025-09-12T13:10:22Z","snapshot_observed_at":"2026-08-15T16:22:16.986204Z","submitted_at":"2025-09-05T10:51:18Z","title":"Graph Reconstruction with a Connected Components Oracle","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-15T16:40:43.954964Z"},"links":{"citing_paper":"/paper/2509.05002"},"observation_digest":"sha256:0caccb65694224d2cfcee1dbee65528361b805a56817490cded53e257fbe46dc","observation_id":"5dca4ed2-4987-4fa5-ac75-a9b883a50234","resolution":{"observed_at":"2026-08-15T16:40:44.028545Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T16:40:44.009181Z","title":null,"venue":null,"work_id":"d17e4513-b065-423a-a45a-84f52026a2b7","year":2010},"citing_paper":{"arxiv_id":"2509.05002","last_updated":"2025-09-12T13:10:22Z","snapshot_observed_at":"2026-08-15T16:22:16.986204Z","submitted_at":"2025-09-05T10:51:18Z","title":"Graph Reconstruction with a Connected Components Oracle","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-15T16:40:43.959082Z"},"links":{"citing_paper":"/paper/2509.05002"},"observation_digest":"sha256:01786e3cbc4b242baca46fcc45de7282482d95c6bef14e2e80823d7256a89648","observation_id":"be9e8c5c-a6eb-412b-ab89-d92a666dde07","resolution":{"observed_at":"2026-08-15T16:40:44.013800Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T16:40:43.992680Z","title":"The chromatic number of oriented graphs","venue":null,"work_id":"447ccda3-f270-4985-8d7a-43fbba286132","year":1997},"citing_paper":{"arxiv_id":"2509.05002","last_updated":"2025-09-12T13:10:22Z","snapshot_observed_at":"2026-08-15T16:22:16.986204Z","submitted_at":"2025-09-05T10:51:18Z","title":"Graph Reconstruction with a Connected Components Oracle","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-15T16:40:43.963374Z"},"links":{"citing_paper":"/paper/2509.05002"},"observation_digest":"sha256:3f0d5e6bab05d788c636b025f7f1da4d90385370abe434ff00835e84aa4f56c7","observation_id":"911b8673-9b64-40bb-a089-30fe2ce28756","resolution":{"observed_at":"2026-08-15T16:40:43.998820Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2509.05002","last_updated":"2025-09-12T13:10:22Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-15T16:22:16.986204Z","submitted_at":"2025-09-05T10:51:18Z","title":"Graph Reconstruction with a Connected Components Oracle"},"reference_resolution":{"displayed":29,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":11,"verified_exact":0,"verified_fuzzy":18},"total_outbound_references":29},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 29 of 29 outbound references and 1 inbound Pith citation observation for arXiv:2509.05002."}