{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:AE3MTDL77ASX2AZL553ZNNVTOY","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"2804d28deb6c39a34cfd66b3e194bb0afbafb738e3b5864390db14a2a565cdd6","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-06-10T03:22:49Z","title_canon_sha256":"0ea27db0b6193251c527b61acb957958dd574a470afad602ba9230a91a81ef89"},"schema_version":"1.0","source":{"id":"2506.08405","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.08405","created_at":"2026-07-05T11:25:12Z"},{"alias_kind":"arxiv_version","alias_value":"2506.08405v1","created_at":"2026-07-05T11:25:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.08405","created_at":"2026-07-05T11:25:12Z"},{"alias_kind":"pith_short_12","alias_value":"AE3MTDL77ASX","created_at":"2026-07-05T11:25:12Z"},{"alias_kind":"pith_short_16","alias_value":"AE3MTDL77ASX2AZL","created_at":"2026-07-05T11:25:12Z"},{"alias_kind":"pith_short_8","alias_value":"AE3MTDL7","created_at":"2026-07-05T11:25:12Z"}],"graph_snapshots":[{"event_id":"sha256:4afe2dea1f0decb062a9e493a47437905677cfa7bba26e2047e1e87975305f70","target":"graph","created_at":"2026-07-05T11:25:12Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2506.08405/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Arya Mazumdar, Barna Saha, Hadley Black, Yinzhan Xu","cross_cats":["cs.IT","cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-06-10T03:22:49Z","title":"Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.08405","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a5bf30326430f24b3088d7515fb4a694a878849b1d2323868dfbc332b52ff5e1","target":"record","created_at":"2026-07-05T11:25:12Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"2804d28deb6c39a34cfd66b3e194bb0afbafb738e3b5864390db14a2a565cdd6","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-06-10T03:22:49Z","title_canon_sha256":"0ea27db0b6193251c527b61acb957958dd574a470afad602ba9230a91a81ef89"},"schema_version":"1.0","source":{"id":"2506.08405","kind":"arxiv","version":1}},"canonical_sha256":"0136c98d7ff8257d032bef7796b6b37612242838dbcc276e7c03522c72a6c136","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0136c98d7ff8257d032bef7796b6b37612242838dbcc276e7c03522c72a6c136","first_computed_at":"2026-07-05T11:25:12.121648Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:25:12.121648Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lBz/LIe0l45ygt6mYDoszMc0bTrB4o9d6INN2lPJE+N5buomZ3Hj2Q+jXiBMHuQ6UVEOoN0CKvFRToAkCBI/Dw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:25:12.122115Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.08405","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a5bf30326430f24b3088d7515fb4a694a878849b1d2323868dfbc332b52ff5e1","sha256:4afe2dea1f0decb062a9e493a47437905677cfa7bba26e2047e1e87975305f70"],"state_sha256":"f49eba913dddaa0ffe0efec212e74e6e042328761a50c9b25f07e5de8f3cf752"}