{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:AWH36OBGUKTKRMP2OKZ4GGVYOO","short_pith_number":"pith:AWH36OBG","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"},"canonical_sha256":"058fbf3826a2a6a8b1fa72b3c31ab873b967f9d5ecb12b841250a0cc5ee56c20","source":{"kind":"arxiv","id":"1508.05504","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.05504","created_at":"2026-05-18T01:34:53Z"},{"alias_kind":"arxiv_version","alias_value":"1508.05504v1","created_at":"2026-05-18T01:34:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.05504","created_at":"2026-05-18T01:34:53Z"},{"alias_kind":"pith_short_12","alias_value":"AWH36OBGUKTK","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"AWH36OBGUKTKRMP2","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"AWH36OBG","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:AWH36OBGUKTKRMP2OKZ4GGVYOO","target":"record","payload":{"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"},"canonical_sha256":"058fbf3826a2a6a8b1fa72b3c31ab873b967f9d5ecb12b841250a0cc5ee56c20","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"},"source_kind":"arxiv","source_id":"1508.05504","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:34:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XQLv2tsoavJnZgiwDnhGy9APOcezAX4sDJpNhE1Hf4dx14WMClOEXCCTTSdj5frJ2Y5dmQ1KwHKV4gy6FKyXBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T14:48:22.846838Z"},"content_sha256":"96c1f334c80b615e3cdb72e0ac240acfb71e9741baf3ffcdbae35d9846cf2906","schema_version":"1.0","event_id":"sha256:96c1f334c80b615e3cdb72e0ac240acfb71e9741baf3ffcdbae35d9846cf2906"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:AWH36OBGUKTKRMP2OKZ4GGVYOO","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:34:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ak/2FSA8P5MbYCvDub0fyUDAkTKsVgNGrvaIlfsOSn2r3+404p4yu/U0vqwsnz1W+H+UqAdzqRHjDdIxu/VwAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T14:48:22.847223Z"},"content_sha256":"0700ed51aa6b584ae5792f25560a8d65f45f59153ba08594f390fc14d0915f3f","schema_version":"1.0","event_id":"sha256:0700ed51aa6b584ae5792f25560a8d65f45f59153ba08594f390fc14d0915f3f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AWH36OBGUKTKRMP2OKZ4GGVYOO/bundle.json","state_url":"https://pith.science/pith/AWH36OBGUKTKRMP2OKZ4GGVYOO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AWH36OBGUKTKRMP2OKZ4GGVYOO/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-06T14:48:22Z","links":{"resolver":"https://pith.science/pith/AWH36OBGUKTKRMP2OKZ4GGVYOO","bundle":"https://pith.science/pith/AWH36OBGUKTKRMP2OKZ4GGVYOO/bundle.json","state":"https://pith.science/pith/AWH36OBGUKTKRMP2OKZ4GGVYOO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AWH36OBGUKTKRMP2OKZ4GGVYOO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:AWH36OBGUKTKRMP2OKZ4GGVYOO","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":"e7e4f0f17b5be0b29649a46c2431ec32dc5374711b362673ee2848a775f01e83","cross_cats_sorted":["math.MG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-22T12:51:22Z","title_canon_sha256":"0d5aa67eed23302f6e53ea36cf3310fb423fc57b7e3230a354f14a735711ed35"},"schema_version":"1.0","source":{"id":"1508.05504","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.05504","created_at":"2026-05-18T01:34:53Z"},{"alias_kind":"arxiv_version","alias_value":"1508.05504v1","created_at":"2026-05-18T01:34:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.05504","created_at":"2026-05-18T01:34:53Z"},{"alias_kind":"pith_short_12","alias_value":"AWH36OBGUKTK","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"AWH36OBGUKTKRMP2","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"AWH36OBG","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:0700ed51aa6b584ae5792f25560a8d65f45f59153ba08594f390fc14d0915f3f","target":"graph","created_at":"2026-05-18T01:34:53Z","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":"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 ","authors_text":"G\\'abor Tardos, G\\'eza T\\'oth, J\\'anos Pach, M\\'arton Nasz\\'odi, Zsolt L\\'angi","cross_cats":["math.MG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-22T12:51:22Z","title":"Separation with restricted families of sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.05504","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:96c1f334c80b615e3cdb72e0ac240acfb71e9741baf3ffcdbae35d9846cf2906","target":"record","created_at":"2026-05-18T01:34:53Z","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":"e7e4f0f17b5be0b29649a46c2431ec32dc5374711b362673ee2848a775f01e83","cross_cats_sorted":["math.MG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-22T12:51:22Z","title_canon_sha256":"0d5aa67eed23302f6e53ea36cf3310fb423fc57b7e3230a354f14a735711ed35"},"schema_version":"1.0","source":{"id":"1508.05504","kind":"arxiv","version":1}},"canonical_sha256":"058fbf3826a2a6a8b1fa72b3c31ab873b967f9d5ecb12b841250a0cc5ee56c20","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"058fbf3826a2a6a8b1fa72b3c31ab873b967f9d5ecb12b841250a0cc5ee56c20","first_computed_at":"2026-05-18T01:34:53.758749Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:34:53.758749Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SzmD6SD6AP+crKz4jfc8Y4ZjIOErDOomPhnY4ULU8onW+F0+C2jVSInldYXrDLi4Chddl9RwmqeZHA31A6nJBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:34:53.759508Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.05504","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:96c1f334c80b615e3cdb72e0ac240acfb71e9741baf3ffcdbae35d9846cf2906","sha256:0700ed51aa6b584ae5792f25560a8d65f45f59153ba08594f390fc14d0915f3f"],"state_sha256":"b4cdc08255455a8aaf769c65dbda067cfe6a1d69047a22c009cf2a9493d3d631"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"chwml8WCHEREOTNt+5q1lLxDTsJkB2pu/hy30tLmBqPniwTO05A3gomH5nR1R2rOI7tQmtZF8V10sxhvvw2XCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T14:48:22.850034Z","bundle_sha256":"7fb60aa32d73baefec0adc60de49118b856db1771a2428328cf520e088551dc5"}}