{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:NQNJ577UYMF6BP6DOGYCGS7W62","short_pith_number":"pith:NQNJ577U","canonical_record":{"source":{"id":"1211.7110","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-29T22:38:57Z","cross_cats_sorted":["cs.DM","cs.DS","cs.MS"],"title_canon_sha256":"1d12aaba961d95321e2410ff223e64b85058da8397f376d957dbfea1b4c142b4","abstract_canon_sha256":"745906cf3e74abf9d69ca9ba25fef678520fed9e539e51cc577f6c91f69eaa8a"},"schema_version":"1.0"},"canonical_sha256":"6c1a9efff4c30be0bfc371b0234bf6f6870dab1e414008d3cd1168b8fdbcd1d7","source":{"kind":"arxiv","id":"1211.7110","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.7110","created_at":"2026-05-18T03:39:41Z"},{"alias_kind":"arxiv_version","alias_value":"1211.7110v1","created_at":"2026-05-18T03:39:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.7110","created_at":"2026-05-18T03:39:41Z"},{"alias_kind":"pith_short_12","alias_value":"NQNJ577UYMF6","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"NQNJ577UYMF6BP6D","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"NQNJ577U","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:NQNJ577UYMF6BP6DOGYCGS7W62","target":"record","payload":{"canonical_record":{"source":{"id":"1211.7110","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-29T22:38:57Z","cross_cats_sorted":["cs.DM","cs.DS","cs.MS"],"title_canon_sha256":"1d12aaba961d95321e2410ff223e64b85058da8397f376d957dbfea1b4c142b4","abstract_canon_sha256":"745906cf3e74abf9d69ca9ba25fef678520fed9e539e51cc577f6c91f69eaa8a"},"schema_version":"1.0"},"canonical_sha256":"6c1a9efff4c30be0bfc371b0234bf6f6870dab1e414008d3cd1168b8fdbcd1d7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:39:41.024881Z","signature_b64":"JdM5bUmyvH54OqKFmHYYzw4dbqhb2BdVuiE1UsxUytKu3jvd3IEfRtrplnitKtoY9o0iT1fbeXmeNxc77T37BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c1a9efff4c30be0bfc371b0234bf6f6870dab1e414008d3cd1168b8fdbcd1d7","last_reissued_at":"2026-05-18T03:39:41.024265Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:39:41.024265Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.7110","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:39:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ys/gqXMLbwaSS2Tz4VlNhZE2x+CP9GyWnhsOdrvVwzoPbPJYDT6DSAptjpXR/rHDvG+jzIGbPKFtpdXVcSraBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T08:56:13.251069Z"},"content_sha256":"950db46be8a8a0f279c28a5663f8767326a15f31a98137879968ac9da9988134","schema_version":"1.0","event_id":"sha256:950db46be8a8a0f279c28a5663f8767326a15f31a98137879968ac9da9988134"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:NQNJ577UYMF6BP6DOGYCGS7W62","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algorithms for discovering and proving theorems about permutation patterns","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS","cs.MS"],"primary_cat":"math.CO","authors_text":"Henning Ulfarsson, Hjalti Magnusson","submitted_at":"2012-11-29T22:38:57Z","abstract_excerpt":"We present an algorithm, called BiSC, that describes the patterns avoided by a given set of permutations. It automatically conjectures the statements of known theorems such as the descriptions of stack-sortable (Knuth 1975) and West-2-stack-sortable permutations (West 1990), smooth (Lakshmibai and Sandhya 1990) and forest-like permutations (Bousquet-Melou and Butler 2007), and simsun permutations (Branden and Claesson 2011). The algorithm has also been used to discover new theorems and conjectures related to Young tableaux, Wilf-equivalences and sorting devices. We further give algorithms to p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.7110","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:39:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iq7CHNxadVVblM+6/XNEkHJ2WxJrGBxbhpSlKMozbqXf/H5GjMCnY5EZTturdXfBwQsXNYRCD4n+AS6kXxIYDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T08:56:13.251429Z"},"content_sha256":"1c276e639415fb06069f72c1b5a53335746e85bc7aa8cdf0b44aa98e2ca00338","schema_version":"1.0","event_id":"sha256:1c276e639415fb06069f72c1b5a53335746e85bc7aa8cdf0b44aa98e2ca00338"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NQNJ577UYMF6BP6DOGYCGS7W62/bundle.json","state_url":"https://pith.science/pith/NQNJ577UYMF6BP6DOGYCGS7W62/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NQNJ577UYMF6BP6DOGYCGS7W62/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-24T08:56:13Z","links":{"resolver":"https://pith.science/pith/NQNJ577UYMF6BP6DOGYCGS7W62","bundle":"https://pith.science/pith/NQNJ577UYMF6BP6DOGYCGS7W62/bundle.json","state":"https://pith.science/pith/NQNJ577UYMF6BP6DOGYCGS7W62/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NQNJ577UYMF6BP6DOGYCGS7W62/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:NQNJ577UYMF6BP6DOGYCGS7W62","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":"745906cf3e74abf9d69ca9ba25fef678520fed9e539e51cc577f6c91f69eaa8a","cross_cats_sorted":["cs.DM","cs.DS","cs.MS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-29T22:38:57Z","title_canon_sha256":"1d12aaba961d95321e2410ff223e64b85058da8397f376d957dbfea1b4c142b4"},"schema_version":"1.0","source":{"id":"1211.7110","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.7110","created_at":"2026-05-18T03:39:41Z"},{"alias_kind":"arxiv_version","alias_value":"1211.7110v1","created_at":"2026-05-18T03:39:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.7110","created_at":"2026-05-18T03:39:41Z"},{"alias_kind":"pith_short_12","alias_value":"NQNJ577UYMF6","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"NQNJ577UYMF6BP6D","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"NQNJ577U","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:1c276e639415fb06069f72c1b5a53335746e85bc7aa8cdf0b44aa98e2ca00338","target":"graph","created_at":"2026-05-18T03:39:41Z","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":"We present an algorithm, called BiSC, that describes the patterns avoided by a given set of permutations. It automatically conjectures the statements of known theorems such as the descriptions of stack-sortable (Knuth 1975) and West-2-stack-sortable permutations (West 1990), smooth (Lakshmibai and Sandhya 1990) and forest-like permutations (Bousquet-Melou and Butler 2007), and simsun permutations (Branden and Claesson 2011). The algorithm has also been used to discover new theorems and conjectures related to Young tableaux, Wilf-equivalences and sorting devices. We further give algorithms to p","authors_text":"Henning Ulfarsson, Hjalti Magnusson","cross_cats":["cs.DM","cs.DS","cs.MS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-29T22:38:57Z","title":"Algorithms for discovering and proving theorems about permutation patterns"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.7110","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:950db46be8a8a0f279c28a5663f8767326a15f31a98137879968ac9da9988134","target":"record","created_at":"2026-05-18T03:39:41Z","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":"745906cf3e74abf9d69ca9ba25fef678520fed9e539e51cc577f6c91f69eaa8a","cross_cats_sorted":["cs.DM","cs.DS","cs.MS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-29T22:38:57Z","title_canon_sha256":"1d12aaba961d95321e2410ff223e64b85058da8397f376d957dbfea1b4c142b4"},"schema_version":"1.0","source":{"id":"1211.7110","kind":"arxiv","version":1}},"canonical_sha256":"6c1a9efff4c30be0bfc371b0234bf6f6870dab1e414008d3cd1168b8fdbcd1d7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c1a9efff4c30be0bfc371b0234bf6f6870dab1e414008d3cd1168b8fdbcd1d7","first_computed_at":"2026-05-18T03:39:41.024265Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:39:41.024265Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JdM5bUmyvH54OqKFmHYYzw4dbqhb2BdVuiE1UsxUytKu3jvd3IEfRtrplnitKtoY9o0iT1fbeXmeNxc77T37BA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:39:41.024881Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.7110","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:950db46be8a8a0f279c28a5663f8767326a15f31a98137879968ac9da9988134","sha256:1c276e639415fb06069f72c1b5a53335746e85bc7aa8cdf0b44aa98e2ca00338"],"state_sha256":"4affbe7174f7d68484a2e849721811114bb1042925381a5e2137fad9b3e2da63"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A18aWr63GOaYgrEi9YATrfU75Qyi7EnDs+6jkBb+KFARsmKPT9PcCJFPWJj/hDdAD7YvWKt8VGHQbLC6oXL2Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T08:56:13.253344Z","bundle_sha256":"854294f4df09b4f2d50c5aaa1dd42c14d8386bc22a120d0639ad1c12c6cefe09"}}