{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:A4CJQJOYPFJ22XSOEM747G27WO","short_pith_number":"pith:A4CJQJOY","schema_version":"1.0","canonical_sha256":"07049825d87953ad5e4e233fcf9b5fb396a22b5e60c1d8851f619630326a9da4","source":{"kind":"arxiv","id":"2507.03151","version":1},"attestation_state":"computed","paper":{"title":"Complexity of learning matchings and half graphs via edge queries","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CC","authors_text":"Nikhil S. Mande, Swagato Sanyal, Viktor Zamaraev","submitted_at":"2025-07-03T20:13:05Z","abstract_excerpt":"The problem of learning or reconstructing an unknown graph from a known family via partial-information queries arises as a mathematical model in various contexts. The most basic type of access to the graph is via \\emph{edge queries}, where an algorithm may query the presence/absence of an edge between a pair of vertices of its choosing, at unit cost.\n  While more powerful query models have been extensively studied in the context of graph reconstruction, the basic model of edge queries seems to have not attracted as much attention. In this paper we study the edge query complexity of learning a "},"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":"2507.03151","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2025-07-03T20:13:05Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"5eff792052a0e0303b1fcb1c2510fc149167ed9d6a654550a9fdabb0fa423137","abstract_canon_sha256":"8ec43aa0399ec04dd982278b3290c1e55c02a309f9cd1ca3b5e45d20e9da99fa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:31:53.492647Z","signature_b64":"L17AHsYDkA1FE9BB5kttDi1SJrBzJcmyyWGFlNSzak+nD0VaLCC1H9zCpq0+gVjf2KFlZBz/0ZI+CwAaURINAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07049825d87953ad5e4e233fcf9b5fb396a22b5e60c1d8851f619630326a9da4","last_reissued_at":"2026-07-05T11:31:53.491929Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:31:53.491929Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity of learning matchings and half graphs via edge queries","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CC","authors_text":"Nikhil S. Mande, Swagato Sanyal, Viktor Zamaraev","submitted_at":"2025-07-03T20:13:05Z","abstract_excerpt":"The problem of learning or reconstructing an unknown graph from a known family via partial-information queries arises as a mathematical model in various contexts. The most basic type of access to the graph is via \\emph{edge queries}, where an algorithm may query the presence/absence of an edge between a pair of vertices of its choosing, at unit cost.\n  While more powerful query models have been extensively studied in the context of graph reconstruction, the basic model of edge queries seems to have not attracted as much attention. In this paper we study the edge query complexity of learning a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.03151","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/2507.03151/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":"2507.03151","created_at":"2026-07-05T11:31:53.492020+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.03151v1","created_at":"2026-07-05T11:31:53.492020+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.03151","created_at":"2026-07-05T11:31:53.492020+00:00"},{"alias_kind":"pith_short_12","alias_value":"A4CJQJOYPFJ2","created_at":"2026-07-05T11:31:53.492020+00:00"},{"alias_kind":"pith_short_16","alias_value":"A4CJQJOYPFJ22XSO","created_at":"2026-07-05T11:31:53.492020+00:00"},{"alias_kind":"pith_short_8","alias_value":"A4CJQJOY","created_at":"2026-07-05T11:31:53.492020+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/A4CJQJOYPFJ22XSOEM747G27WO","json":"https://pith.science/pith/A4CJQJOYPFJ22XSOEM747G27WO.json","graph_json":"https://pith.science/api/pith-number/A4CJQJOYPFJ22XSOEM747G27WO/graph.json","events_json":"https://pith.science/api/pith-number/A4CJQJOYPFJ22XSOEM747G27WO/events.json","paper":"https://pith.science/paper/A4CJQJOY"},"agent_actions":{"view_html":"https://pith.science/pith/A4CJQJOYPFJ22XSOEM747G27WO","download_json":"https://pith.science/pith/A4CJQJOYPFJ22XSOEM747G27WO.json","view_paper":"https://pith.science/paper/A4CJQJOY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.03151&json=true","fetch_graph":"https://pith.science/api/pith-number/A4CJQJOYPFJ22XSOEM747G27WO/graph.json","fetch_events":"https://pith.science/api/pith-number/A4CJQJOYPFJ22XSOEM747G27WO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A4CJQJOYPFJ22XSOEM747G27WO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A4CJQJOYPFJ22XSOEM747G27WO/action/storage_attestation","attest_author":"https://pith.science/pith/A4CJQJOYPFJ22XSOEM747G27WO/action/author_attestation","sign_citation":"https://pith.science/pith/A4CJQJOYPFJ22XSOEM747G27WO/action/citation_signature","submit_replication":"https://pith.science/pith/A4CJQJOYPFJ22XSOEM747G27WO/action/replication_record"}},"created_at":"2026-07-05T11:31:53.492020+00:00","updated_at":"2026-07-05T11:31:53.492020+00:00"}