{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:DLGB23OERDNL7KOUMMKM3HUANV","short_pith_number":"pith:DLGB23OE","schema_version":"1.0","canonical_sha256":"1acc1d6dc488dabfa9d46314cd9e806d63392dd6a049792c82a8e5a5aac97a23","source":{"kind":"arxiv","id":"1509.05572","version":4},"attestation_state":"computed","paper":{"title":"Randomised enumeration of small witnesses using a decision oracle","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Kitty Meeks","submitted_at":"2015-09-18T10:20:24Z","abstract_excerpt":"Many combinatorial problems involve determining whether a universe of $n$ elements contains a witness consisting of $k$ elements which have some specified property. In this paper we investigate the relationship between the decision and enumeration versions of such problems: efficient methods are known for transforming a decision algorithm into a search procedure that finds a single witness, but even finding a second witness is not so straightforward in general. We show that, if the decision version of the problem can be solved in time $f(k) \\cdot poly(n)$, there is a randomised algorithm which"},"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":"1509.05572","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-18T10:20:24Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"f239a70d36695eb62c5cfbd251f140a3d99abdfbe13a2dff952cece070e9d337","abstract_canon_sha256":"53a075241da4d1253c916b9d71b7605f5d4aab34c365e4f9d20bbf125063244e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:47.183101Z","signature_b64":"3EUo8eT/jsWijpWb8YuzRhkwQ8+XnziZXkXQb0tHDo4i2HIkpFP68cTODQyWMLkrWpJNaoJ7NnE5DGImb0e1CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1acc1d6dc488dabfa9d46314cd9e806d63392dd6a049792c82a8e5a5aac97a23","last_reissued_at":"2026-05-18T00:26:47.182611Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:47.182611Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Randomised enumeration of small witnesses using a decision oracle","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Kitty Meeks","submitted_at":"2015-09-18T10:20:24Z","abstract_excerpt":"Many combinatorial problems involve determining whether a universe of $n$ elements contains a witness consisting of $k$ elements which have some specified property. In this paper we investigate the relationship between the decision and enumeration versions of such problems: efficient methods are known for transforming a decision algorithm into a search procedure that finds a single witness, but even finding a second witness is not so straightforward in general. We show that, if the decision version of the problem can be solved in time $f(k) \\cdot poly(n)$, there is a randomised algorithm which"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.05572","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1509.05572","created_at":"2026-05-18T00:26:47.182688+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.05572v4","created_at":"2026-05-18T00:26:47.182688+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05572","created_at":"2026-05-18T00:26:47.182688+00:00"},{"alias_kind":"pith_short_12","alias_value":"DLGB23OERDNL","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"DLGB23OERDNL7KOU","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"DLGB23OE","created_at":"2026-05-18T12:29:17.054201+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/DLGB23OERDNL7KOUMMKM3HUANV","json":"https://pith.science/pith/DLGB23OERDNL7KOUMMKM3HUANV.json","graph_json":"https://pith.science/api/pith-number/DLGB23OERDNL7KOUMMKM3HUANV/graph.json","events_json":"https://pith.science/api/pith-number/DLGB23OERDNL7KOUMMKM3HUANV/events.json","paper":"https://pith.science/paper/DLGB23OE"},"agent_actions":{"view_html":"https://pith.science/pith/DLGB23OERDNL7KOUMMKM3HUANV","download_json":"https://pith.science/pith/DLGB23OERDNL7KOUMMKM3HUANV.json","view_paper":"https://pith.science/paper/DLGB23OE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.05572&json=true","fetch_graph":"https://pith.science/api/pith-number/DLGB23OERDNL7KOUMMKM3HUANV/graph.json","fetch_events":"https://pith.science/api/pith-number/DLGB23OERDNL7KOUMMKM3HUANV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DLGB23OERDNL7KOUMMKM3HUANV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DLGB23OERDNL7KOUMMKM3HUANV/action/storage_attestation","attest_author":"https://pith.science/pith/DLGB23OERDNL7KOUMMKM3HUANV/action/author_attestation","sign_citation":"https://pith.science/pith/DLGB23OERDNL7KOUMMKM3HUANV/action/citation_signature","submit_replication":"https://pith.science/pith/DLGB23OERDNL7KOUMMKM3HUANV/action/replication_record"}},"created_at":"2026-05-18T00:26:47.182688+00:00","updated_at":"2026-05-18T00:26:47.182688+00:00"}