{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:2QULLUMVYCC3R47W5IT6JTUBTY","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":"7d4c12d0d288b8e5354570411b31d14d3dfda07981425f0399f7191ebb6aa877","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-20T00:00:46Z","title_canon_sha256":"de13bb1c9aa938a3625bbc8361cb8c429bf3e366d2b1820218edac95a0214285"},"schema_version":"1.0","source":{"id":"1603.06164","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.06164","created_at":"2026-05-18T01:18:50Z"},{"alias_kind":"arxiv_version","alias_value":"1603.06164v1","created_at":"2026-05-18T01:18:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.06164","created_at":"2026-05-18T01:18:50Z"},{"alias_kind":"pith_short_12","alias_value":"2QULLUMVYCC3","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2QULLUMVYCC3R47W","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2QULLUMV","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:56ea5d137365db2251dd3693b14f4bf181cba994f98a820bceebcb5264f3ef43","target":"graph","created_at":"2026-05-18T01:18:50Z","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"},"paper":{"abstract_excerpt":"We prove that for any positive integers $n$ and $d$ there exists a collection consisting of $f=d\\log n+O(1)$ subsets $A_1, A_2, \\ldots, A_f$ of $[n]$ such that for any two distinct subsets $X$ and $Y$ of $[n]$ whose size is at most $d$ there is an index $i\\in [f]$ for which $| A_i\\cap X|$ and $|A_i\\cap Y|$ have different parity. Here we think of $d$ as fixed whereas $n$ is thought of as tending to infinity, and the base of the logarithm is $2$.\n  Translated into the language of combinatorial search theory, this tells us that \\[\n  d \\log n+O(1) \\] queries suffice to identify up to $d$ marked it","authors_text":"Christian Reiher","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-20T00:00:46Z","title":"The parity search problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.06164","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:6a29f002b34ec53faa798f1f42dd22d10c361f5a702bd918873f779529c8782b","target":"record","created_at":"2026-05-18T01:18:50Z","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":"7d4c12d0d288b8e5354570411b31d14d3dfda07981425f0399f7191ebb6aa877","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-20T00:00:46Z","title_canon_sha256":"de13bb1c9aa938a3625bbc8361cb8c429bf3e366d2b1820218edac95a0214285"},"schema_version":"1.0","source":{"id":"1603.06164","kind":"arxiv","version":1}},"canonical_sha256":"d428b5d195c085b8f3f6ea27e4ce819e1a9ca08c9d22eadd90d416ce954f5fcc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d428b5d195c085b8f3f6ea27e4ce819e1a9ca08c9d22eadd90d416ce954f5fcc","first_computed_at":"2026-05-18T01:18:50.132795Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:50.132795Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6rI/Kr1ixxCXLvWixWDFbcykIo8J9IDFDIjjbce25J8gDu9mCaqJUhWv7gX3URaiR83L/31RNIs0OzGE3i8SCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:50.133372Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.06164","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6a29f002b34ec53faa798f1f42dd22d10c361f5a702bd918873f779529c8782b","sha256:56ea5d137365db2251dd3693b14f4bf181cba994f98a820bceebcb5264f3ef43"],"state_sha256":"0d78b1a1b0c7ca078cc20c88925d0594d707f8e7c468494b2ab421526f6453e3"}