{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:AWH36OBGUKTKRMP2OKZ4GGVYOO","short_pith_number":"pith:AWH36OBG","schema_version":"1.0","canonical_sha256":"058fbf3826a2a6a8b1fa72b3c31ab873b967f9d5ecb12b841250a0cc5ee56c20","source":{"kind":"arxiv","id":"1508.05504","version":1},"attestation_state":"computed","paper":{"title":"Separation with restricted families of sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MG"],"primary_cat":"math.CO","authors_text":"G\\'abor Tardos, G\\'eza T\\'oth, J\\'anos Pach, M\\'arton Nasz\\'odi, Zsolt L\\'angi","submitted_at":"2015-08-22T12:51:22Z","abstract_excerpt":"Given a finite $n$-element set $X$, a family of subsets ${\\mathcal F}\\subset 2^X$ is said to separate $X$ if any two elements of $X$ are separated by at least one member of $\\mathcal F$. It is shown that if $|\\mathcal F|>2^{n-1}$, then one can select $\\lceil\\log n\\rceil+1$ members of $\\mathcal F$ that separate $X$. If $|\\mathcal F|\\ge \\alpha 2^n$ for some $0<\\alpha<1/2$, then $\\log n+O(\\log\\frac1{\\alpha}\\log\\log\\frac1{\\alpha})$ members of $\\mathcal F$ are always sufficient to separate all pairs of elements of $X$ that are separated by some member of $\\mathcal F$. This result is generalized to "},"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":"1508.05504","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-22T12:51:22Z","cross_cats_sorted":["math.MG"],"title_canon_sha256":"0d5aa67eed23302f6e53ea36cf3310fb423fc57b7e3230a354f14a735711ed35","abstract_canon_sha256":"e7e4f0f17b5be0b29649a46c2431ec32dc5374711b362673ee2848a775f01e83"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:53.759508Z","signature_b64":"SzmD6SD6AP+crKz4jfc8Y4ZjIOErDOomPhnY4ULU8onW+F0+C2jVSInldYXrDLi4Chddl9RwmqeZHA31A6nJBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"058fbf3826a2a6a8b1fa72b3c31ab873b967f9d5ecb12b841250a0cc5ee56c20","last_reissued_at":"2026-05-18T01:34:53.758749Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:53.758749Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Separation with restricted families of sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MG"],"primary_cat":"math.CO","authors_text":"G\\'abor Tardos, G\\'eza T\\'oth, J\\'anos Pach, M\\'arton Nasz\\'odi, Zsolt L\\'angi","submitted_at":"2015-08-22T12:51:22Z","abstract_excerpt":"Given a finite $n$-element set $X$, a family of subsets ${\\mathcal F}\\subset 2^X$ is said to separate $X$ if any two elements of $X$ are separated by at least one member of $\\mathcal F$. It is shown that if $|\\mathcal F|>2^{n-1}$, then one can select $\\lceil\\log n\\rceil+1$ members of $\\mathcal F$ that separate $X$. If $|\\mathcal F|\\ge \\alpha 2^n$ for some $0<\\alpha<1/2$, then $\\log n+O(\\log\\frac1{\\alpha}\\log\\log\\frac1{\\alpha})$ members of $\\mathcal F$ are always sufficient to separate all pairs of elements of $X$ that are separated by some member of $\\mathcal F$. This result is generalized to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.05504","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":""},"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":"1508.05504","created_at":"2026-05-18T01:34:53.758878+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.05504v1","created_at":"2026-05-18T01:34:53.758878+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.05504","created_at":"2026-05-18T01:34:53.758878+00:00"},{"alias_kind":"pith_short_12","alias_value":"AWH36OBGUKTK","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"AWH36OBGUKTKRMP2","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"AWH36OBG","created_at":"2026-05-18T12:29:10.953037+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/AWH36OBGUKTKRMP2OKZ4GGVYOO","json":"https://pith.science/pith/AWH36OBGUKTKRMP2OKZ4GGVYOO.json","graph_json":"https://pith.science/api/pith-number/AWH36OBGUKTKRMP2OKZ4GGVYOO/graph.json","events_json":"https://pith.science/api/pith-number/AWH36OBGUKTKRMP2OKZ4GGVYOO/events.json","paper":"https://pith.science/paper/AWH36OBG"},"agent_actions":{"view_html":"https://pith.science/pith/AWH36OBGUKTKRMP2OKZ4GGVYOO","download_json":"https://pith.science/pith/AWH36OBGUKTKRMP2OKZ4GGVYOO.json","view_paper":"https://pith.science/paper/AWH36OBG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.05504&json=true","fetch_graph":"https://pith.science/api/pith-number/AWH36OBGUKTKRMP2OKZ4GGVYOO/graph.json","fetch_events":"https://pith.science/api/pith-number/AWH36OBGUKTKRMP2OKZ4GGVYOO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AWH36OBGUKTKRMP2OKZ4GGVYOO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AWH36OBGUKTKRMP2OKZ4GGVYOO/action/storage_attestation","attest_author":"https://pith.science/pith/AWH36OBGUKTKRMP2OKZ4GGVYOO/action/author_attestation","sign_citation":"https://pith.science/pith/AWH36OBGUKTKRMP2OKZ4GGVYOO/action/citation_signature","submit_replication":"https://pith.science/pith/AWH36OBGUKTKRMP2OKZ4GGVYOO/action/replication_record"}},"created_at":"2026-05-18T01:34:53.758878+00:00","updated_at":"2026-05-18T01:34:53.758878+00:00"}