{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:I4X75XM2AIQTC6S7THHME5QOSR","short_pith_number":"pith:I4X75XM2","canonical_record":{"source":{"id":"1301.6371","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-27T16:31:22Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"0af761c4b0f24999a3683bbacb49d253ebd3e4b318a3af87297c457f981af7ea","abstract_canon_sha256":"f192b91145b8f8c419e49e793792820a71057bcd468ff30ce0462e145137397e"},"schema_version":"1.0"},"canonical_sha256":"472ffedd9a0221317a5f99cec2760e944423ce3bb73fc1f292669ee9891495ab","source":{"kind":"arxiv","id":"1301.6371","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.6371","created_at":"2026-05-18T03:26:22Z"},{"alias_kind":"arxiv_version","alias_value":"1301.6371v2","created_at":"2026-05-18T03:26:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6371","created_at":"2026-05-18T03:26:22Z"},{"alias_kind":"pith_short_12","alias_value":"I4X75XM2AIQT","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"I4X75XM2AIQTC6S7","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"I4X75XM2","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:I4X75XM2AIQTC6S7THHME5QOSR","target":"record","payload":{"canonical_record":{"source":{"id":"1301.6371","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-27T16:31:22Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"0af761c4b0f24999a3683bbacb49d253ebd3e4b318a3af87297c457f981af7ea","abstract_canon_sha256":"f192b91145b8f8c419e49e793792820a71057bcd468ff30ce0462e145137397e"},"schema_version":"1.0"},"canonical_sha256":"472ffedd9a0221317a5f99cec2760e944423ce3bb73fc1f292669ee9891495ab","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:22.671408Z","signature_b64":"fjoHCucQcyYjQ0QzRuY0o0PK5Horhlh7pShU7A94flyFrjBHLlPszB1HdvqH2cc+O0NXBFWDCzwLKu0arw7rBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"472ffedd9a0221317a5f99cec2760e944423ce3bb73fc1f292669ee9891495ab","last_reissued_at":"2026-05-18T03:26:22.670642Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:22.670642Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.6371","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:26:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tMwwnbACxBW1XeP3ZFdOXF7whPh/uTyF12HWeHHgRQOhOV1E/JsyanyFZGXFoIpy4D/2WuaxP3523lnxhjGaBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:01:51.689799Z"},"content_sha256":"e229aa4b467dd90afbd74d46dec3f016b6ec5853cf09e7af13ea2cfbdd53ccd1","schema_version":"1.0","event_id":"sha256:e229aa4b467dd90afbd74d46dec3f016b6ec5853cf09e7af13ea2cfbdd53ccd1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:I4X75XM2AIQTC6S7THHME5QOSR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Shattering Thresholds for Random Systems of Sets, Words, and Permutations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Anant P. Godbole, Samantha Pinella, Yan Zhuang","submitted_at":"2013-01-27T16:31:22Z","abstract_excerpt":"This paper considers a problem that relates to the theories of covering arrays, permutation patterns, Vapnik-Chervonenkis (VC) classes, and probability thresholds. Specifically, we want to find the number of subsets of [n]:={1,2,....,n} we need to randomly select, in a certain probability space, so as to respectively \"shatter\" all t-subsets of [n]. Moving from subsets to words, we ask for the number of n-letter words on a q-letter alphabet that are needed to shatter all t-subwords of the q^n words of length n. Finally, we explore the number of random permutations of [n] needed to shatter (spec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6371","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:26:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FEZ8TksRsuhKf7ZVIoF6qDludPXLzwphICfB27csAfEDAxWbKStVBAdjyyJFd3+NkTE9TnVAdTq9gRlngciJBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:01:51.690367Z"},"content_sha256":"92f879dab545c1e6f2c4c0f0d36118fa35438e301a5a608edf9e39ac12c54968","schema_version":"1.0","event_id":"sha256:92f879dab545c1e6f2c4c0f0d36118fa35438e301a5a608edf9e39ac12c54968"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I4X75XM2AIQTC6S7THHME5QOSR/bundle.json","state_url":"https://pith.science/pith/I4X75XM2AIQTC6S7THHME5QOSR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I4X75XM2AIQTC6S7THHME5QOSR/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-07T14:01:51Z","links":{"resolver":"https://pith.science/pith/I4X75XM2AIQTC6S7THHME5QOSR","bundle":"https://pith.science/pith/I4X75XM2AIQTC6S7THHME5QOSR/bundle.json","state":"https://pith.science/pith/I4X75XM2AIQTC6S7THHME5QOSR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I4X75XM2AIQTC6S7THHME5QOSR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:I4X75XM2AIQTC6S7THHME5QOSR","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":"f192b91145b8f8c419e49e793792820a71057bcd468ff30ce0462e145137397e","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-27T16:31:22Z","title_canon_sha256":"0af761c4b0f24999a3683bbacb49d253ebd3e4b318a3af87297c457f981af7ea"},"schema_version":"1.0","source":{"id":"1301.6371","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.6371","created_at":"2026-05-18T03:26:22Z"},{"alias_kind":"arxiv_version","alias_value":"1301.6371v2","created_at":"2026-05-18T03:26:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6371","created_at":"2026-05-18T03:26:22Z"},{"alias_kind":"pith_short_12","alias_value":"I4X75XM2AIQT","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"I4X75XM2AIQTC6S7","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"I4X75XM2","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:92f879dab545c1e6f2c4c0f0d36118fa35438e301a5a608edf9e39ac12c54968","target":"graph","created_at":"2026-05-18T03:26:22Z","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":"This paper considers a problem that relates to the theories of covering arrays, permutation patterns, Vapnik-Chervonenkis (VC) classes, and probability thresholds. Specifically, we want to find the number of subsets of [n]:={1,2,....,n} we need to randomly select, in a certain probability space, so as to respectively \"shatter\" all t-subsets of [n]. Moving from subsets to words, we ask for the number of n-letter words on a q-letter alphabet that are needed to shatter all t-subwords of the q^n words of length n. Finally, we explore the number of random permutations of [n] needed to shatter (spec","authors_text":"Anant P. Godbole, Samantha Pinella, Yan Zhuang","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-27T16:31:22Z","title":"Shattering Thresholds for Random Systems of Sets, Words, and Permutations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6371","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:e229aa4b467dd90afbd74d46dec3f016b6ec5853cf09e7af13ea2cfbdd53ccd1","target":"record","created_at":"2026-05-18T03:26:22Z","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":"f192b91145b8f8c419e49e793792820a71057bcd468ff30ce0462e145137397e","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-27T16:31:22Z","title_canon_sha256":"0af761c4b0f24999a3683bbacb49d253ebd3e4b318a3af87297c457f981af7ea"},"schema_version":"1.0","source":{"id":"1301.6371","kind":"arxiv","version":2}},"canonical_sha256":"472ffedd9a0221317a5f99cec2760e944423ce3bb73fc1f292669ee9891495ab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"472ffedd9a0221317a5f99cec2760e944423ce3bb73fc1f292669ee9891495ab","first_computed_at":"2026-05-18T03:26:22.670642Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:26:22.670642Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fjoHCucQcyYjQ0QzRuY0o0PK5Horhlh7pShU7A94flyFrjBHLlPszB1HdvqH2cc+O0NXBFWDCzwLKu0arw7rBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:26:22.671408Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.6371","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e229aa4b467dd90afbd74d46dec3f016b6ec5853cf09e7af13ea2cfbdd53ccd1","sha256:92f879dab545c1e6f2c4c0f0d36118fa35438e301a5a608edf9e39ac12c54968"],"state_sha256":"f461d65647336028827567d3c843e673caa54ac4b8069264283b1ef79c281c6b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GUjhKh3uvWClV5LEHjaSBio30Bat4ahAz7k7Z7XZ42bP4GIHRTNX8WCAK93bhZlo0+iki5nDX+xS1beOz5TyBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T14:01:51.694258Z","bundle_sha256":"cb4c2f538123c082f65a6121e9805e559764b97fe8e6397507f421733f05e5e0"}}