{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:MVUUD5OCBZ5SJRIWE46RK3RGUS","short_pith_number":"pith:MVUUD5OC","schema_version":"1.0","canonical_sha256":"656941f5c20e7b24c516273d156e26a49111de5617c7ea14e23e98f07c6846f2","source":{"kind":"arxiv","id":"1203.5433","version":1},"attestation_state":"computed","paper":{"title":"Covering n-Permutations with (n+1)-Permutations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anant Godbole, Bill Kay, Kathryn Hawley, Taylor Allison","submitted_at":"2012-03-24T17:31:31Z","abstract_excerpt":"Let S_n be the set of all permutations on [n]:={1,2,....,n}. We denote by kappa_n the smallest cardinality of a subset A of S_{n+1} that \"covers\" S_n, in the sense that each pi in S_n may be found as an order-isomorphic subsequence of some pi' in A. What are general upper bounds on kappa_n? If we randomly select nu_n elements of S_{n+1}, when does the probability that they cover S_n transition from 0 to 1? Can we provide a fine-magnification analysis that provides the \"probability of coverage\" when nu_n is around the level given by the phase transition? In this paper we answer these questions "},"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":"1203.5433","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-24T17:31:31Z","cross_cats_sorted":[],"title_canon_sha256":"c2dc1b2c590126dde1297ea5d3f10934e54b2698c24866144103d694f7e00846","abstract_canon_sha256":"64c81d7d9ede4a729dce915557ce1c685a9b7ad69b653dde7fa12b5f076e50b2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:59:15.113795Z","signature_b64":"O4lWPkf31YqLiAW6gjiZ2nUnTL6DuLpEkVjKCj3EjMNLh0115y510Vsq+G0pmrS3hLaWmVBGS2xAVBxdEEyNDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"656941f5c20e7b24c516273d156e26a49111de5617c7ea14e23e98f07c6846f2","last_reissued_at":"2026-05-18T03:59:15.113191Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:59:15.113191Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Covering n-Permutations with (n+1)-Permutations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anant Godbole, Bill Kay, Kathryn Hawley, Taylor Allison","submitted_at":"2012-03-24T17:31:31Z","abstract_excerpt":"Let S_n be the set of all permutations on [n]:={1,2,....,n}. We denote by kappa_n the smallest cardinality of a subset A of S_{n+1} that \"covers\" S_n, in the sense that each pi in S_n may be found as an order-isomorphic subsequence of some pi' in A. What are general upper bounds on kappa_n? If we randomly select nu_n elements of S_{n+1}, when does the probability that they cover S_n transition from 0 to 1? Can we provide a fine-magnification analysis that provides the \"probability of coverage\" when nu_n is around the level given by the phase transition? In this paper we answer these questions "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.5433","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1203.5433","created_at":"2026-05-18T03:59:15.113297+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.5433v1","created_at":"2026-05-18T03:59:15.113297+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.5433","created_at":"2026-05-18T03:59:15.113297+00:00"},{"alias_kind":"pith_short_12","alias_value":"MVUUD5OCBZ5S","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"MVUUD5OCBZ5SJRIW","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"MVUUD5OC","created_at":"2026-05-18T12:27:14.488303+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/MVUUD5OCBZ5SJRIWE46RK3RGUS","json":"https://pith.science/pith/MVUUD5OCBZ5SJRIWE46RK3RGUS.json","graph_json":"https://pith.science/api/pith-number/MVUUD5OCBZ5SJRIWE46RK3RGUS/graph.json","events_json":"https://pith.science/api/pith-number/MVUUD5OCBZ5SJRIWE46RK3RGUS/events.json","paper":"https://pith.science/paper/MVUUD5OC"},"agent_actions":{"view_html":"https://pith.science/pith/MVUUD5OCBZ5SJRIWE46RK3RGUS","download_json":"https://pith.science/pith/MVUUD5OCBZ5SJRIWE46RK3RGUS.json","view_paper":"https://pith.science/paper/MVUUD5OC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.5433&json=true","fetch_graph":"https://pith.science/api/pith-number/MVUUD5OCBZ5SJRIWE46RK3RGUS/graph.json","fetch_events":"https://pith.science/api/pith-number/MVUUD5OCBZ5SJRIWE46RK3RGUS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MVUUD5OCBZ5SJRIWE46RK3RGUS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MVUUD5OCBZ5SJRIWE46RK3RGUS/action/storage_attestation","attest_author":"https://pith.science/pith/MVUUD5OCBZ5SJRIWE46RK3RGUS/action/author_attestation","sign_citation":"https://pith.science/pith/MVUUD5OCBZ5SJRIWE46RK3RGUS/action/citation_signature","submit_replication":"https://pith.science/pith/MVUUD5OCBZ5SJRIWE46RK3RGUS/action/replication_record"}},"created_at":"2026-05-18T03:59:15.113297+00:00","updated_at":"2026-05-18T03:59:15.113297+00:00"}