{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:AE3MTDL77ASX2AZL553ZNNVTOY","short_pith_number":"pith:AE3MTDL7","schema_version":"1.0","canonical_sha256":"0136c98d7ff8257d032bef7796b6b37612242838dbcc276e7c03522c72a6c136","source":{"kind":"arxiv","id":"2506.08405","version":1},"attestation_state":"computed","paper":{"title":"Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"cs.DS","authors_text":"Arya Mazumdar, Barna Saha, Hadley Black, Yinzhan Xu","submitted_at":"2025-06-10T03:22:49Z","abstract_excerpt":"The graph reconstruction problem has been extensively studied under various query models. In this paper, we propose a new query model regarding the number of connected components, which is one of the most basic and fundamental graph parameters. Formally, we consider the problem of reconstructing an $n$-node $m$-edge graph with oracle queries of the following form: provided with a subset of vertices, the oracle returns the number of connected components in the induced subgraph. We show $\\Theta(\\frac{m \\log n}{\\log m})$ queries in expectation are both sufficient and necessary to adaptively recon"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2506.08405","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-06-10T03:22:49Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"0ea27db0b6193251c527b61acb957958dd574a470afad602ba9230a91a81ef89","abstract_canon_sha256":"2804d28deb6c39a34cfd66b3e194bb0afbafb738e3b5864390db14a2a565cdd6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:25:12.122115Z","signature_b64":"lBz/LIe0l45ygt6mYDoszMc0bTrB4o9d6INN2lPJE+N5buomZ3Hj2Q+jXiBMHuQ6UVEOoN0CKvFRToAkCBI/Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0136c98d7ff8257d032bef7796b6b37612242838dbcc276e7c03522c72a6c136","last_reissued_at":"2026-07-05T11:25:12.121648Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:25:12.121648Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"cs.DS","authors_text":"Arya Mazumdar, Barna Saha, Hadley Black, Yinzhan Xu","submitted_at":"2025-06-10T03:22:49Z","abstract_excerpt":"The graph reconstruction problem has been extensively studied under various query models. In this paper, we propose a new query model regarding the number of connected components, which is one of the most basic and fundamental graph parameters. Formally, we consider the problem of reconstructing an $n$-node $m$-edge graph with oracle queries of the following form: provided with a subset of vertices, the oracle returns the number of connected components in the induced subgraph. We show $\\Theta(\\frac{m \\log n}{\\log m})$ queries in expectation are both sufficient and necessary to adaptively recon"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.08405","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.08405/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2506.08405","created_at":"2026-07-05T11:25:12.121708+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.08405v1","created_at":"2026-07-05T11:25:12.121708+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.08405","created_at":"2026-07-05T11:25:12.121708+00:00"},{"alias_kind":"pith_short_12","alias_value":"AE3MTDL77ASX","created_at":"2026-07-05T11:25:12.121708+00:00"},{"alias_kind":"pith_short_16","alias_value":"AE3MTDL77ASX2AZL","created_at":"2026-07-05T11:25:12.121708+00:00"},{"alias_kind":"pith_short_8","alias_value":"AE3MTDL7","created_at":"2026-07-05T11:25:12.121708+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AE3MTDL77ASX2AZL553ZNNVTOY","json":"https://pith.science/pith/AE3MTDL77ASX2AZL553ZNNVTOY.json","graph_json":"https://pith.science/api/pith-number/AE3MTDL77ASX2AZL553ZNNVTOY/graph.json","events_json":"https://pith.science/api/pith-number/AE3MTDL77ASX2AZL553ZNNVTOY/events.json","paper":"https://pith.science/paper/AE3MTDL7"},"agent_actions":{"view_html":"https://pith.science/pith/AE3MTDL77ASX2AZL553ZNNVTOY","download_json":"https://pith.science/pith/AE3MTDL77ASX2AZL553ZNNVTOY.json","view_paper":"https://pith.science/paper/AE3MTDL7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.08405&json=true","fetch_graph":"https://pith.science/api/pith-number/AE3MTDL77ASX2AZL553ZNNVTOY/graph.json","fetch_events":"https://pith.science/api/pith-number/AE3MTDL77ASX2AZL553ZNNVTOY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AE3MTDL77ASX2AZL553ZNNVTOY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AE3MTDL77ASX2AZL553ZNNVTOY/action/storage_attestation","attest_author":"https://pith.science/pith/AE3MTDL77ASX2AZL553ZNNVTOY/action/author_attestation","sign_citation":"https://pith.science/pith/AE3MTDL77ASX2AZL553ZNNVTOY/action/citation_signature","submit_replication":"https://pith.science/pith/AE3MTDL77ASX2AZL553ZNNVTOY/action/replication_record"}},"created_at":"2026-07-05T11:25:12.121708+00:00","updated_at":"2026-07-05T11:25:12.121708+00:00"}