{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:SALIBCB3IWUF27WEPDASHLKUPZ","short_pith_number":"pith:SALIBCB3","schema_version":"1.0","canonical_sha256":"901680883b45a85d7ec478c123ad547e5952a3cd6b2d7c9c1ede0861952ad100","source":{"kind":"arxiv","id":"1209.2404","version":1},"attestation_state":"computed","paper":{"title":"On the Best Upper Bound for Permutations Avoiding A Pattern of a Given Length","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Miklos Bona","submitted_at":"2012-09-11T19:32:47Z","abstract_excerpt":"Numerical evidence suggests that certain permutation patterns of length k are easier to avoid than any other patterns of that same length. We prove that these patterns are avoided by no more than (2.25k^2)^n permutations of length n. In light of this, we conjecture that no pattern of length k is avoided by more than that many permutations of length n."},"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":"1209.2404","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-11T19:32:47Z","cross_cats_sorted":[],"title_canon_sha256":"0fd36a9a73fcb2af774dd295fe5945b58bffdd82182730ef727f609d3887d7d9","abstract_canon_sha256":"43045d30b9d00a6094d6740ebd74d74f8f9a333c4e5d3852298a6f5a2e451ede"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:45:52.018531Z","signature_b64":"xQjT7ppvwLSwuj4V6RvkxRQZ+rLas2pQSgAKfGByzzJPj8YQs5ft0I3sG+fKSxfw1U512hzVTdYHlwEu+9CLDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"901680883b45a85d7ec478c123ad547e5952a3cd6b2d7c9c1ede0861952ad100","last_reissued_at":"2026-05-18T03:45:52.017779Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:45:52.017779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Best Upper Bound for Permutations Avoiding A Pattern of a Given Length","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Miklos Bona","submitted_at":"2012-09-11T19:32:47Z","abstract_excerpt":"Numerical evidence suggests that certain permutation patterns of length k are easier to avoid than any other patterns of that same length. We prove that these patterns are avoided by no more than (2.25k^2)^n permutations of length n. In light of this, we conjecture that no pattern of length k is avoided by more than that many permutations of length n."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.2404","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":"1209.2404","created_at":"2026-05-18T03:45:52.017895+00:00"},{"alias_kind":"arxiv_version","alias_value":"1209.2404v1","created_at":"2026-05-18T03:45:52.017895+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.2404","created_at":"2026-05-18T03:45:52.017895+00:00"},{"alias_kind":"pith_short_12","alias_value":"SALIBCB3IWUF","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_16","alias_value":"SALIBCB3IWUF27WE","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_8","alias_value":"SALIBCB3","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/SALIBCB3IWUF27WEPDASHLKUPZ","json":"https://pith.science/pith/SALIBCB3IWUF27WEPDASHLKUPZ.json","graph_json":"https://pith.science/api/pith-number/SALIBCB3IWUF27WEPDASHLKUPZ/graph.json","events_json":"https://pith.science/api/pith-number/SALIBCB3IWUF27WEPDASHLKUPZ/events.json","paper":"https://pith.science/paper/SALIBCB3"},"agent_actions":{"view_html":"https://pith.science/pith/SALIBCB3IWUF27WEPDASHLKUPZ","download_json":"https://pith.science/pith/SALIBCB3IWUF27WEPDASHLKUPZ.json","view_paper":"https://pith.science/paper/SALIBCB3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1209.2404&json=true","fetch_graph":"https://pith.science/api/pith-number/SALIBCB3IWUF27WEPDASHLKUPZ/graph.json","fetch_events":"https://pith.science/api/pith-number/SALIBCB3IWUF27WEPDASHLKUPZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SALIBCB3IWUF27WEPDASHLKUPZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SALIBCB3IWUF27WEPDASHLKUPZ/action/storage_attestation","attest_author":"https://pith.science/pith/SALIBCB3IWUF27WEPDASHLKUPZ/action/author_attestation","sign_citation":"https://pith.science/pith/SALIBCB3IWUF27WEPDASHLKUPZ/action/citation_signature","submit_replication":"https://pith.science/pith/SALIBCB3IWUF27WEPDASHLKUPZ/action/replication_record"}},"created_at":"2026-05-18T03:45:52.017895+00:00","updated_at":"2026-05-18T03:45:52.017895+00:00"}