{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:SALIBCB3IWUF27WEPDASHLKUPZ","short_pith_number":"pith:SALIBCB3","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"},"canonical_sha256":"901680883b45a85d7ec478c123ad547e5952a3cd6b2d7c9c1ede0861952ad100","source":{"kind":"arxiv","id":"1209.2404","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.2404","created_at":"2026-05-18T03:45:52Z"},{"alias_kind":"arxiv_version","alias_value":"1209.2404v1","created_at":"2026-05-18T03:45:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.2404","created_at":"2026-05-18T03:45:52Z"},{"alias_kind":"pith_short_12","alias_value":"SALIBCB3IWUF","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"SALIBCB3IWUF27WE","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"SALIBCB3","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:SALIBCB3IWUF27WEPDASHLKUPZ","target":"record","payload":{"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"},"canonical_sha256":"901680883b45a85d7ec478c123ad547e5952a3cd6b2d7c9c1ede0861952ad100","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"},"source_kind":"arxiv","source_id":"1209.2404","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:45:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qv55yYMvT6lizHPH6dPX4WdPEcLVGs6NzpA4sZGwga/0n2oOPR2rd3dKQF0rqg8TIHItMXLmlzQc2OuwmCrjBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T14:53:20.571900Z"},"content_sha256":"1d806714627994f24dfd274ad8606132cb0e08ed4eaa602626d71654c4babf6f","schema_version":"1.0","event_id":"sha256:1d806714627994f24dfd274ad8606132cb0e08ed4eaa602626d71654c4babf6f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:SALIBCB3IWUF27WEPDASHLKUPZ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:45:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/CGFEHPtLiyuBAFS2fzzjAGHLdDKaCO8oPzSkLojKGHi5DXIt91KTGyFCkZ6YwkEKtPd8fyh/1Jc7svXJtUmDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T14:53:20.572233Z"},"content_sha256":"b9aac6ef7618c2b8665c033538f5c7a6c61aad1a3483ba58f6715dd4d7e72321","schema_version":"1.0","event_id":"sha256:b9aac6ef7618c2b8665c033538f5c7a6c61aad1a3483ba58f6715dd4d7e72321"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SALIBCB3IWUF27WEPDASHLKUPZ/bundle.json","state_url":"https://pith.science/pith/SALIBCB3IWUF27WEPDASHLKUPZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SALIBCB3IWUF27WEPDASHLKUPZ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-09T14:53:20Z","links":{"resolver":"https://pith.science/pith/SALIBCB3IWUF27WEPDASHLKUPZ","bundle":"https://pith.science/pith/SALIBCB3IWUF27WEPDASHLKUPZ/bundle.json","state":"https://pith.science/pith/SALIBCB3IWUF27WEPDASHLKUPZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SALIBCB3IWUF27WEPDASHLKUPZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:SALIBCB3IWUF27WEPDASHLKUPZ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"43045d30b9d00a6094d6740ebd74d74f8f9a333c4e5d3852298a6f5a2e451ede","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-11T19:32:47Z","title_canon_sha256":"0fd36a9a73fcb2af774dd295fe5945b58bffdd82182730ef727f609d3887d7d9"},"schema_version":"1.0","source":{"id":"1209.2404","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.2404","created_at":"2026-05-18T03:45:52Z"},{"alias_kind":"arxiv_version","alias_value":"1209.2404v1","created_at":"2026-05-18T03:45:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.2404","created_at":"2026-05-18T03:45:52Z"},{"alias_kind":"pith_short_12","alias_value":"SALIBCB3IWUF","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"SALIBCB3IWUF27WE","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"SALIBCB3","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:b9aac6ef7618c2b8665c033538f5c7a6c61aad1a3483ba58f6715dd4d7e72321","target":"graph","created_at":"2026-05-18T03:45:52Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"Miklos Bona","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-11T19:32:47Z","title":"On the Best Upper Bound for Permutations Avoiding A Pattern of a Given Length"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.2404","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:1d806714627994f24dfd274ad8606132cb0e08ed4eaa602626d71654c4babf6f","target":"record","created_at":"2026-05-18T03:45:52Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"43045d30b9d00a6094d6740ebd74d74f8f9a333c4e5d3852298a6f5a2e451ede","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-11T19:32:47Z","title_canon_sha256":"0fd36a9a73fcb2af774dd295fe5945b58bffdd82182730ef727f609d3887d7d9"},"schema_version":"1.0","source":{"id":"1209.2404","kind":"arxiv","version":1}},"canonical_sha256":"901680883b45a85d7ec478c123ad547e5952a3cd6b2d7c9c1ede0861952ad100","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"901680883b45a85d7ec478c123ad547e5952a3cd6b2d7c9c1ede0861952ad100","first_computed_at":"2026-05-18T03:45:52.017779Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:45:52.017779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xQjT7ppvwLSwuj4V6RvkxRQZ+rLas2pQSgAKfGByzzJPj8YQs5ft0I3sG+fKSxfw1U512hzVTdYHlwEu+9CLDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:45:52.018531Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.2404","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1d806714627994f24dfd274ad8606132cb0e08ed4eaa602626d71654c4babf6f","sha256:b9aac6ef7618c2b8665c033538f5c7a6c61aad1a3483ba58f6715dd4d7e72321"],"state_sha256":"b4476e88560ace99af66cc706dd08f93096265edc9fa4a4f392244901463e021"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h2tVmFJ5YHQj0Ma/7R3EBw5AN4fLjCndDDeUDXcPbq49t6wgFLNIiAATG5uomk1700qIFBA/m7z2eT7a/jCMBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T14:53:20.574153Z","bundle_sha256":"1cc9596ba59c7fef4aa4d857172f7dcab9c9d38ef7d07f31bf18beeae7c6e647"}}