{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:VQOSJ3KB52ZG64NB6KF73YFOFR","short_pith_number":"pith:VQOSJ3KB","canonical_record":{"source":{"id":"1111.0492","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-02T13:35:24Z","cross_cats_sorted":["cs.CC","math.PR"],"title_canon_sha256":"34dbfd56333a39eeafeca93846ef32f922a0c5ad0d88d18c85d7ee1ff1f5bb52","abstract_canon_sha256":"136e40c8f898600bc5e51a7d22e30f8e26d5242f8caaef7526f4a1a0f1d614d3"},"schema_version":"1.0"},"canonical_sha256":"ac1d24ed41eeb26f71a1f28bfde0ae2c42d332519c7509098d6ef6dcf6c5b186","source":{"kind":"arxiv","id":"1111.0492","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.0492","created_at":"2026-05-18T00:48:55Z"},{"alias_kind":"arxiv_version","alias_value":"1111.0492v1","created_at":"2026-05-18T00:48:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.0492","created_at":"2026-05-18T00:48:55Z"},{"alias_kind":"pith_short_12","alias_value":"VQOSJ3KB52ZG","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"VQOSJ3KB52ZG64NB","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"VQOSJ3KB","created_at":"2026-05-18T12:26:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:VQOSJ3KB52ZG64NB6KF73YFOFR","target":"record","payload":{"canonical_record":{"source":{"id":"1111.0492","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-02T13:35:24Z","cross_cats_sorted":["cs.CC","math.PR"],"title_canon_sha256":"34dbfd56333a39eeafeca93846ef32f922a0c5ad0d88d18c85d7ee1ff1f5bb52","abstract_canon_sha256":"136e40c8f898600bc5e51a7d22e30f8e26d5242f8caaef7526f4a1a0f1d614d3"},"schema_version":"1.0"},"canonical_sha256":"ac1d24ed41eeb26f71a1f28bfde0ae2c42d332519c7509098d6ef6dcf6c5b186","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:55.579657Z","signature_b64":"SX1ps62VhbDn4LNBVXyk5IhClouPQaPY6cVJFVKIEHG5X11k+Z6JFKrA5vhtkpjyWHBzfahklO8WuPwTZsziCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac1d24ed41eeb26f71a1f28bfde0ae2c42d332519c7509098d6ef6dcf6c5b186","last_reissued_at":"2026-05-18T00:48:55.578871Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:55.578871Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1111.0492","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-18T00:48:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kSEs2GE85itsVlej+oGbjacFWNdIx76C3apSfcPaAFXCQWsd1U3JP6bO0bmdVSCUjoQeKp1334aFQxtsLNp2Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:25:39.597190Z"},"content_sha256":"f3f783fd14f222c7ba9b2dcf707b8f0173311502ccf7e24411188f2f641ababe","schema_version":"1.0","event_id":"sha256:f3f783fd14f222c7ba9b2dcf707b8f0173311502ccf7e24411188f2f641ababe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:VQOSJ3KB52ZG64NB6KF73YFOFR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Probabilistic existence of rigid combinatorial structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.PR"],"primary_cat":"math.CO","authors_text":"Greg Kuperberg, Ron Peled, Shachar Lovett","submitted_at":"2011-11-02T13:35:24Z","abstract_excerpt":"We show the existence of rigid combinatorial objects which previously were not known to exist. Specifically, for a wide range of the underlying parameters, we show the existence of non-trivial orthogonal arrays, $t$-designs, and $t$-wise permutations. In all cases, the sizes of the objects are optimal up to polynomial overhead. The proof of existence is probabilistic. We show that a randomly chosen such object has the required properties with positive yet tiny probability. The main technical ingredient is a special local central limit theorem for suitable lattice random walks with finitely man"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.0492","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-18T00:48:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o299tjHETEf8998ezjxmQ2HHjjfXhbbttI5BaNMUOzkRZ1pvXwTYpy2J6MiikNCtJRucV5ahDkfeGh6tKOHxDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:25:39.597549Z"},"content_sha256":"054b6c1267e290761ba33641c5485587302215c31242b4ac93ca5ad6bd28d697","schema_version":"1.0","event_id":"sha256:054b6c1267e290761ba33641c5485587302215c31242b4ac93ca5ad6bd28d697"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VQOSJ3KB52ZG64NB6KF73YFOFR/bundle.json","state_url":"https://pith.science/pith/VQOSJ3KB52ZG64NB6KF73YFOFR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VQOSJ3KB52ZG64NB6KF73YFOFR/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-01T10:25:39Z","links":{"resolver":"https://pith.science/pith/VQOSJ3KB52ZG64NB6KF73YFOFR","bundle":"https://pith.science/pith/VQOSJ3KB52ZG64NB6KF73YFOFR/bundle.json","state":"https://pith.science/pith/VQOSJ3KB52ZG64NB6KF73YFOFR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VQOSJ3KB52ZG64NB6KF73YFOFR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:VQOSJ3KB52ZG64NB6KF73YFOFR","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":"136e40c8f898600bc5e51a7d22e30f8e26d5242f8caaef7526f4a1a0f1d614d3","cross_cats_sorted":["cs.CC","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-02T13:35:24Z","title_canon_sha256":"34dbfd56333a39eeafeca93846ef32f922a0c5ad0d88d18c85d7ee1ff1f5bb52"},"schema_version":"1.0","source":{"id":"1111.0492","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.0492","created_at":"2026-05-18T00:48:55Z"},{"alias_kind":"arxiv_version","alias_value":"1111.0492v1","created_at":"2026-05-18T00:48:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.0492","created_at":"2026-05-18T00:48:55Z"},{"alias_kind":"pith_short_12","alias_value":"VQOSJ3KB52ZG","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"VQOSJ3KB52ZG64NB","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"VQOSJ3KB","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:054b6c1267e290761ba33641c5485587302215c31242b4ac93ca5ad6bd28d697","target":"graph","created_at":"2026-05-18T00:48:55Z","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 show the existence of rigid combinatorial objects which previously were not known to exist. Specifically, for a wide range of the underlying parameters, we show the existence of non-trivial orthogonal arrays, $t$-designs, and $t$-wise permutations. In all cases, the sizes of the objects are optimal up to polynomial overhead. The proof of existence is probabilistic. We show that a randomly chosen such object has the required properties with positive yet tiny probability. The main technical ingredient is a special local central limit theorem for suitable lattice random walks with finitely man","authors_text":"Greg Kuperberg, Ron Peled, Shachar Lovett","cross_cats":["cs.CC","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-02T13:35:24Z","title":"Probabilistic existence of rigid combinatorial structures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.0492","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:f3f783fd14f222c7ba9b2dcf707b8f0173311502ccf7e24411188f2f641ababe","target":"record","created_at":"2026-05-18T00:48:55Z","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":"136e40c8f898600bc5e51a7d22e30f8e26d5242f8caaef7526f4a1a0f1d614d3","cross_cats_sorted":["cs.CC","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-02T13:35:24Z","title_canon_sha256":"34dbfd56333a39eeafeca93846ef32f922a0c5ad0d88d18c85d7ee1ff1f5bb52"},"schema_version":"1.0","source":{"id":"1111.0492","kind":"arxiv","version":1}},"canonical_sha256":"ac1d24ed41eeb26f71a1f28bfde0ae2c42d332519c7509098d6ef6dcf6c5b186","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ac1d24ed41eeb26f71a1f28bfde0ae2c42d332519c7509098d6ef6dcf6c5b186","first_computed_at":"2026-05-18T00:48:55.578871Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:55.578871Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SX1ps62VhbDn4LNBVXyk5IhClouPQaPY6cVJFVKIEHG5X11k+Z6JFKrA5vhtkpjyWHBzfahklO8WuPwTZsziCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:55.579657Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.0492","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f3f783fd14f222c7ba9b2dcf707b8f0173311502ccf7e24411188f2f641ababe","sha256:054b6c1267e290761ba33641c5485587302215c31242b4ac93ca5ad6bd28d697"],"state_sha256":"5256766c76e304b138c99d54d3766c1a620d6ee4400294e91e6b851c95f5b144"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UWlhFZgy0eP5nhNLqtnxxewCoOVgMtJTAkTA4Zo2gvDAbFsKUqOtlZzmzS+2fiz9Sjc8ZEMLmkDqlf372UozBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T10:25:39.599536Z","bundle_sha256":"48db6e29cfa75eb464254d4ee31c00a76bb5b17f737a08dfd4cbaa537e34f76c"}}