{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:JQWJOMCRPL6C35RTG3YZDA43D6","short_pith_number":"pith:JQWJOMCR","schema_version":"1.0","canonical_sha256":"4c2c9730517afc2df63336f191839b1fac2efd4fe682119236a35c270f200403","source":{"kind":"arxiv","id":"1201.4960","version":2},"attestation_state":"computed","paper":{"title":"A recursive construction of t-wise uniform permutations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Hilary Finucane, Ron Peled, Yariv Yaari","submitted_at":"2012-01-24T12:16:59Z","abstract_excerpt":"We present a recursive construction of a (2t + 1)-wise uniform set of permutations on 2n objects using a (2t + 1) - (2n, n, \\cdot) combinatorial design, a t-wise uniform set of permutations on n objects and a (2t+1)-wise uniform set of permutations on n objects. Using the complete design in this procedure gives a t-wise uniform set of permutations on n objects whose size is at most t^2n, the first non-trivial construction of an infinite family of t-wise uniform sets for t \\geq 4. If a non-trivial design with suitable parameters is found, it will imply a corresponding improvement in the constru"},"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":"1201.4960","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-01-24T12:16:59Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"86407a18d2896d0d5240bedc387c178c16ad08260cf8918f952cb64333200b8b","abstract_canon_sha256":"34714a3883d214bd5bcb116aa5e2d081699e3fbea579fecd5ae08c212d67695b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:55.570183Z","signature_b64":"hPTNAYXil9rrF3pIiJUNV3G7W4p/Az8jPZrJIgnMDtlw6p7kHTT1+qSMue3K/yh+EQKWMQz4pdoxyEd1mASrAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c2c9730517afc2df63336f191839b1fac2efd4fe682119236a35c270f200403","last_reissued_at":"2026-05-18T00:48:55.569499Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:55.569499Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A recursive construction of t-wise uniform permutations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Hilary Finucane, Ron Peled, Yariv Yaari","submitted_at":"2012-01-24T12:16:59Z","abstract_excerpt":"We present a recursive construction of a (2t + 1)-wise uniform set of permutations on 2n objects using a (2t + 1) - (2n, n, \\cdot) combinatorial design, a t-wise uniform set of permutations on n objects and a (2t+1)-wise uniform set of permutations on n objects. Using the complete design in this procedure gives a t-wise uniform set of permutations on n objects whose size is at most t^2n, the first non-trivial construction of an infinite family of t-wise uniform sets for t \\geq 4. If a non-trivial design with suitable parameters is found, it will imply a corresponding improvement in the constru"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.4960","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":"1201.4960","created_at":"2026-05-18T00:48:55.569614+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.4960v2","created_at":"2026-05-18T00:48:55.569614+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.4960","created_at":"2026-05-18T00:48:55.569614+00:00"},{"alias_kind":"pith_short_12","alias_value":"JQWJOMCRPL6C","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_16","alias_value":"JQWJOMCRPL6C35RT","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_8","alias_value":"JQWJOMCR","created_at":"2026-05-18T12:27:11.947152+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/JQWJOMCRPL6C35RTG3YZDA43D6","json":"https://pith.science/pith/JQWJOMCRPL6C35RTG3YZDA43D6.json","graph_json":"https://pith.science/api/pith-number/JQWJOMCRPL6C35RTG3YZDA43D6/graph.json","events_json":"https://pith.science/api/pith-number/JQWJOMCRPL6C35RTG3YZDA43D6/events.json","paper":"https://pith.science/paper/JQWJOMCR"},"agent_actions":{"view_html":"https://pith.science/pith/JQWJOMCRPL6C35RTG3YZDA43D6","download_json":"https://pith.science/pith/JQWJOMCRPL6C35RTG3YZDA43D6.json","view_paper":"https://pith.science/paper/JQWJOMCR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.4960&json=true","fetch_graph":"https://pith.science/api/pith-number/JQWJOMCRPL6C35RTG3YZDA43D6/graph.json","fetch_events":"https://pith.science/api/pith-number/JQWJOMCRPL6C35RTG3YZDA43D6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JQWJOMCRPL6C35RTG3YZDA43D6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JQWJOMCRPL6C35RTG3YZDA43D6/action/storage_attestation","attest_author":"https://pith.science/pith/JQWJOMCRPL6C35RTG3YZDA43D6/action/author_attestation","sign_citation":"https://pith.science/pith/JQWJOMCRPL6C35RTG3YZDA43D6/action/citation_signature","submit_replication":"https://pith.science/pith/JQWJOMCRPL6C35RTG3YZDA43D6/action/replication_record"}},"created_at":"2026-05-18T00:48:55.569614+00:00","updated_at":"2026-05-18T00:48:55.569614+00:00"}