{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:IIOLABMEMVLYIB2CBP7DIOJRLJ","short_pith_number":"pith:IIOLABME","canonical_record":{"source":{"id":"1109.6147","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-28T09:42:38Z","cross_cats_sorted":["cs.CC","cs.CR","cs.DM","quant-ph"],"title_canon_sha256":"0dd0d196eb223e01ad801893d59a057816d87ef73bb693d80fdb1c24e79af337","abstract_canon_sha256":"bf36f78a0f6d5527507ab656b32747492f888eae3399ade94c55fdb9080543e1"},"schema_version":"1.0"},"canonical_sha256":"421cb0058465578407420bfe3439315a4537e40a21e8850e268719f44feca3cd","source":{"kind":"arxiv","id":"1109.6147","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.6147","created_at":"2026-05-18T03:36:48Z"},{"alias_kind":"arxiv_version","alias_value":"1109.6147v2","created_at":"2026-05-18T03:36:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.6147","created_at":"2026-05-18T03:36:48Z"},{"alias_kind":"pith_short_12","alias_value":"IIOLABMEMVLY","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"IIOLABMEMVLYIB2C","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"IIOLABME","created_at":"2026-05-18T12:26:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:IIOLABMEMVLYIB2CBP7DIOJRLJ","target":"record","payload":{"canonical_record":{"source":{"id":"1109.6147","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-28T09:42:38Z","cross_cats_sorted":["cs.CC","cs.CR","cs.DM","quant-ph"],"title_canon_sha256":"0dd0d196eb223e01ad801893d59a057816d87ef73bb693d80fdb1c24e79af337","abstract_canon_sha256":"bf36f78a0f6d5527507ab656b32747492f888eae3399ade94c55fdb9080543e1"},"schema_version":"1.0"},"canonical_sha256":"421cb0058465578407420bfe3439315a4537e40a21e8850e268719f44feca3cd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:48.238026Z","signature_b64":"5FL2ULuWbytEgs2MTJ/A3oBoCGJO3EqN5quSZzPAiJHiSOQf3YFQwYocccuhSDyL60dHEQDh7eIi97QtwSGPDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"421cb0058465578407420bfe3439315a4537e40a21e8850e268719f44feca3cd","last_reissued_at":"2026-05-18T03:36:48.237120Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:48.237120Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.6147","source_version":2,"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-18T03:36:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y0uHBnkknxTj8gVSKpDWxEJl8GZmxGuA/mvwYTgkdebSeCJOwPICbPa+B4oICEoJSOMaMAXizyFFKtg+8WegBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T06:48:03.385459Z"},"content_sha256":"7fd38a1f581bb610f74c3741cf4e274eebefbc20e3d30a1eaf7497aea046b1ce","schema_version":"1.0","event_id":"sha256:7fd38a1f581bb610f74c3741cf4e274eebefbc20e3d30a1eaf7497aea046b1ce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:IIOLABMEMVLYIB2CBP7DIOJRLJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Explicit combinatorial design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.CR","cs.DM","quant-ph"],"primary_cat":"math.CO","authors_text":"Xiaoqing Tan, Xiongfeng Ma, Zhen Zhang","submitted_at":"2011-09-28T09:42:38Z","abstract_excerpt":"A combinatorial design is a family of sets that are almost disjoint, which is applied in pseudo random number generations and randomness extractions. The parameter, $\\rho$, quantifying the overlap between the sets within the family, is directly related to the length of a random seed needed and the efficiency of an extractor. Nisan and Wigderson proposed an explicit construction of designs in 1994. Later in 2003, Hartman and Raz proved a bound of $\\rho\\le e^2$ for the Nisan-Wigderson construction in a limited parameter regime. In this work, we prove a tighter bound of $\\rho<e$ with the entire p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.6147","kind":"arxiv","version":2},"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-18T03:36:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6WjpL/QrwKD0MimQzaxn+Mx0KYKcKP74v4+hbg9/cfw/umRQt13QrED84gY4plNybqIt1HkGpazUlk2kZDGADg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T06:48:03.385801Z"},"content_sha256":"fa34ae2d581a5fccf255854d68db586c633acdb7cc8c36a286b415abed084b7f","schema_version":"1.0","event_id":"sha256:fa34ae2d581a5fccf255854d68db586c633acdb7cc8c36a286b415abed084b7f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IIOLABMEMVLYIB2CBP7DIOJRLJ/bundle.json","state_url":"https://pith.science/pith/IIOLABMEMVLYIB2CBP7DIOJRLJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IIOLABMEMVLYIB2CBP7DIOJRLJ/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-28T06:48:03Z","links":{"resolver":"https://pith.science/pith/IIOLABMEMVLYIB2CBP7DIOJRLJ","bundle":"https://pith.science/pith/IIOLABMEMVLYIB2CBP7DIOJRLJ/bundle.json","state":"https://pith.science/pith/IIOLABMEMVLYIB2CBP7DIOJRLJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IIOLABMEMVLYIB2CBP7DIOJRLJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:IIOLABMEMVLYIB2CBP7DIOJRLJ","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":"bf36f78a0f6d5527507ab656b32747492f888eae3399ade94c55fdb9080543e1","cross_cats_sorted":["cs.CC","cs.CR","cs.DM","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-28T09:42:38Z","title_canon_sha256":"0dd0d196eb223e01ad801893d59a057816d87ef73bb693d80fdb1c24e79af337"},"schema_version":"1.0","source":{"id":"1109.6147","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.6147","created_at":"2026-05-18T03:36:48Z"},{"alias_kind":"arxiv_version","alias_value":"1109.6147v2","created_at":"2026-05-18T03:36:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.6147","created_at":"2026-05-18T03:36:48Z"},{"alias_kind":"pith_short_12","alias_value":"IIOLABMEMVLY","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"IIOLABMEMVLYIB2C","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"IIOLABME","created_at":"2026-05-18T12:26:30Z"}],"graph_snapshots":[{"event_id":"sha256:fa34ae2d581a5fccf255854d68db586c633acdb7cc8c36a286b415abed084b7f","target":"graph","created_at":"2026-05-18T03:36:48Z","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":"A combinatorial design is a family of sets that are almost disjoint, which is applied in pseudo random number generations and randomness extractions. The parameter, $\\rho$, quantifying the overlap between the sets within the family, is directly related to the length of a random seed needed and the efficiency of an extractor. Nisan and Wigderson proposed an explicit construction of designs in 1994. Later in 2003, Hartman and Raz proved a bound of $\\rho\\le e^2$ for the Nisan-Wigderson construction in a limited parameter regime. In this work, we prove a tighter bound of $\\rho<e$ with the entire p","authors_text":"Xiaoqing Tan, Xiongfeng Ma, Zhen Zhang","cross_cats":["cs.CC","cs.CR","cs.DM","quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-28T09:42:38Z","title":"Explicit combinatorial design"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.6147","kind":"arxiv","version":2},"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:7fd38a1f581bb610f74c3741cf4e274eebefbc20e3d30a1eaf7497aea046b1ce","target":"record","created_at":"2026-05-18T03:36:48Z","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":"bf36f78a0f6d5527507ab656b32747492f888eae3399ade94c55fdb9080543e1","cross_cats_sorted":["cs.CC","cs.CR","cs.DM","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-28T09:42:38Z","title_canon_sha256":"0dd0d196eb223e01ad801893d59a057816d87ef73bb693d80fdb1c24e79af337"},"schema_version":"1.0","source":{"id":"1109.6147","kind":"arxiv","version":2}},"canonical_sha256":"421cb0058465578407420bfe3439315a4537e40a21e8850e268719f44feca3cd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"421cb0058465578407420bfe3439315a4537e40a21e8850e268719f44feca3cd","first_computed_at":"2026-05-18T03:36:48.237120Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:36:48.237120Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5FL2ULuWbytEgs2MTJ/A3oBoCGJO3EqN5quSZzPAiJHiSOQf3YFQwYocccuhSDyL60dHEQDh7eIi97QtwSGPDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:36:48.238026Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.6147","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7fd38a1f581bb610f74c3741cf4e274eebefbc20e3d30a1eaf7497aea046b1ce","sha256:fa34ae2d581a5fccf255854d68db586c633acdb7cc8c36a286b415abed084b7f"],"state_sha256":"5ec24bba08e65ef7722e9f35772ad3fca52c6b94d6a6766707c6f1f571e6d904"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KL7ZHNt8VyND7wd0d95R9gccXhrrMfkNGtgSbH8vVVV9c23LqgZFrqdFPMULxTC4WZVDsdDrq3IJvgEump50Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T06:48:03.387750Z","bundle_sha256":"74af28d9fb6e1de4dcf713fa1a9e5c5dae8caefbf6d18d49e2e78c6ed71a49a9"}}