{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:I4X75XM2AIQTC6S7THHME5QOSR","short_pith_number":"pith:I4X75XM2","schema_version":"1.0","canonical_sha256":"472ffedd9a0221317a5f99cec2760e944423ce3bb73fc1f292669ee9891495ab","source":{"kind":"arxiv","id":"1301.6371","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1301.6371","created_at":"2026-05-18T03:26:22.670779+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.6371v2","created_at":"2026-05-18T03:26:22.670779+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6371","created_at":"2026-05-18T03:26:22.670779+00:00"},{"alias_kind":"pith_short_12","alias_value":"I4X75XM2AIQT","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"I4X75XM2AIQTC6S7","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"I4X75XM2","created_at":"2026-05-18T12:27:46.883200+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/I4X75XM2AIQTC6S7THHME5QOSR","json":"https://pith.science/pith/I4X75XM2AIQTC6S7THHME5QOSR.json","graph_json":"https://pith.science/api/pith-number/I4X75XM2AIQTC6S7THHME5QOSR/graph.json","events_json":"https://pith.science/api/pith-number/I4X75XM2AIQTC6S7THHME5QOSR/events.json","paper":"https://pith.science/paper/I4X75XM2"},"agent_actions":{"view_html":"https://pith.science/pith/I4X75XM2AIQTC6S7THHME5QOSR","download_json":"https://pith.science/pith/I4X75XM2AIQTC6S7THHME5QOSR.json","view_paper":"https://pith.science/paper/I4X75XM2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.6371&json=true","fetch_graph":"https://pith.science/api/pith-number/I4X75XM2AIQTC6S7THHME5QOSR/graph.json","fetch_events":"https://pith.science/api/pith-number/I4X75XM2AIQTC6S7THHME5QOSR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I4X75XM2AIQTC6S7THHME5QOSR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I4X75XM2AIQTC6S7THHME5QOSR/action/storage_attestation","attest_author":"https://pith.science/pith/I4X75XM2AIQTC6S7THHME5QOSR/action/author_attestation","sign_citation":"https://pith.science/pith/I4X75XM2AIQTC6S7THHME5QOSR/action/citation_signature","submit_replication":"https://pith.science/pith/I4X75XM2AIQTC6S7THHME5QOSR/action/replication_record"}},"created_at":"2026-05-18T03:26:22.670779+00:00","updated_at":"2026-05-18T03:26:22.670779+00:00"}