{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:RF5YDI7RD6SN6NN6MLL53SFI37","short_pith_number":"pith:RF5YDI7R","schema_version":"1.0","canonical_sha256":"897b81a3f11fa4df35be62d7ddc8a8dffe556d935810e9c315d62d68e2ad74e1","source":{"kind":"arxiv","id":"1206.0966","version":2},"attestation_state":"computed","paper":{"title":"Permutations all of whose patterns of a given length are distinct","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Peter Hegarty","submitted_at":"2012-06-05T15:43:49Z","abstract_excerpt":"For each integer k >= 2, let F(k) denote the largest n for which there exists a permutation \\sigma \\in S_n, all of whose patterns of length k are distinct. We prove that F(k) = k + \\lfloor \\sqrt{2k-3} \\rfloor + e_k, where e_k \\in {-1,0} for every k. Suggestions for further investigations along these lines are discussed."},"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":"1206.0966","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-06-05T15:43:49Z","cross_cats_sorted":[],"title_canon_sha256":"6d2f5e88ce7cd898d7f13dac239719bdcb4c31f96d013d79d1a6e28cab628f42","abstract_canon_sha256":"5997333ee5a8d06c058d017dc4917cd2ef06f2f976e52f82efc2f4bbd842ee36"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:53:54.016910Z","signature_b64":"KPpsRz+GdoF6MAHXW5HvKTzXBCA7jzX/Dpt55TFosB+GmWYiw6rUVcu5hS3TXoUlEICP0miQnwIjYtgGT9h2AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"897b81a3f11fa4df35be62d7ddc8a8dffe556d935810e9c315d62d68e2ad74e1","last_reissued_at":"2026-05-18T03:53:54.016097Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:53:54.016097Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Permutations all of whose patterns of a given length are distinct","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Peter Hegarty","submitted_at":"2012-06-05T15:43:49Z","abstract_excerpt":"For each integer k >= 2, let F(k) denote the largest n for which there exists a permutation \\sigma \\in S_n, all of whose patterns of length k are distinct. We prove that F(k) = k + \\lfloor \\sqrt{2k-3} \\rfloor + e_k, where e_k \\in {-1,0} for every k. Suggestions for further investigations along these lines are discussed."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.0966","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":"1206.0966","created_at":"2026-05-18T03:53:54.016217+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.0966v2","created_at":"2026-05-18T03:53:54.016217+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.0966","created_at":"2026-05-18T03:53:54.016217+00:00"},{"alias_kind":"pith_short_12","alias_value":"RF5YDI7RD6SN","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_16","alias_value":"RF5YDI7RD6SN6NN6","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_8","alias_value":"RF5YDI7R","created_at":"2026-05-18T12:27:20.899486+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/RF5YDI7RD6SN6NN6MLL53SFI37","json":"https://pith.science/pith/RF5YDI7RD6SN6NN6MLL53SFI37.json","graph_json":"https://pith.science/api/pith-number/RF5YDI7RD6SN6NN6MLL53SFI37/graph.json","events_json":"https://pith.science/api/pith-number/RF5YDI7RD6SN6NN6MLL53SFI37/events.json","paper":"https://pith.science/paper/RF5YDI7R"},"agent_actions":{"view_html":"https://pith.science/pith/RF5YDI7RD6SN6NN6MLL53SFI37","download_json":"https://pith.science/pith/RF5YDI7RD6SN6NN6MLL53SFI37.json","view_paper":"https://pith.science/paper/RF5YDI7R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.0966&json=true","fetch_graph":"https://pith.science/api/pith-number/RF5YDI7RD6SN6NN6MLL53SFI37/graph.json","fetch_events":"https://pith.science/api/pith-number/RF5YDI7RD6SN6NN6MLL53SFI37/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RF5YDI7RD6SN6NN6MLL53SFI37/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RF5YDI7RD6SN6NN6MLL53SFI37/action/storage_attestation","attest_author":"https://pith.science/pith/RF5YDI7RD6SN6NN6MLL53SFI37/action/author_attestation","sign_citation":"https://pith.science/pith/RF5YDI7RD6SN6NN6MLL53SFI37/action/citation_signature","submit_replication":"https://pith.science/pith/RF5YDI7RD6SN6NN6MLL53SFI37/action/replication_record"}},"created_at":"2026-05-18T03:53:54.016217+00:00","updated_at":"2026-05-18T03:53:54.016217+00:00"}