{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:BFZ56KAECFFKXDAITWK2R6XAXO","short_pith_number":"pith:BFZ56KAE","canonical_record":{"source":{"id":"1406.4100","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-16T19:03:39Z","cross_cats_sorted":[],"title_canon_sha256":"01a54fad131af5f06fdbc8d4b78428deb862a56f79ec046f6cca77f373993b07","abstract_canon_sha256":"ef9d603536b455ac1e730c78a2c46a04644db5626fd8ac880e1febd97490ae93"},"schema_version":"1.0"},"canonical_sha256":"0973df2804114aab8c089d95a8fae0bb83807f541acad283faa8593b42982ef1","source":{"kind":"arxiv","id":"1406.4100","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.4100","created_at":"2026-05-18T02:27:05Z"},{"alias_kind":"arxiv_version","alias_value":"1406.4100v2","created_at":"2026-05-18T02:27:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.4100","created_at":"2026-05-18T02:27:05Z"},{"alias_kind":"pith_short_12","alias_value":"BFZ56KAECFFK","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"BFZ56KAECFFKXDAI","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"BFZ56KAE","created_at":"2026-05-18T12:28:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:BFZ56KAECFFKXDAITWK2R6XAXO","target":"record","payload":{"canonical_record":{"source":{"id":"1406.4100","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-16T19:03:39Z","cross_cats_sorted":[],"title_canon_sha256":"01a54fad131af5f06fdbc8d4b78428deb862a56f79ec046f6cca77f373993b07","abstract_canon_sha256":"ef9d603536b455ac1e730c78a2c46a04644db5626fd8ac880e1febd97490ae93"},"schema_version":"1.0"},"canonical_sha256":"0973df2804114aab8c089d95a8fae0bb83807f541acad283faa8593b42982ef1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:05.406767Z","signature_b64":"FE8bshraLfohZkEAyM0SfnwPhL38TvNeLDR8YWrSFmrPL/za9e3SsdmWDZPbUNLMLedGOlFChEc0wCvzP0YFBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0973df2804114aab8c089d95a8fae0bb83807f541acad283faa8593b42982ef1","last_reissued_at":"2026-05-18T02:27:05.406375Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:05.406375Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.4100","source_version":2,"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-18T02:27:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xfp/g1ZZi33zrjUZv3kzI6f3T9R0OIRm0MiKxLx7AewPKVOm4DYnzbMBPwv0BAT9fzUX9c9It4lGup18NsXeBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T12:51:37.436760Z"},"content_sha256":"65170c02e64fce5ef9e61854ea58779f756c0efded48532e1143e21b125a40de","schema_version":"1.0","event_id":"sha256:65170c02e64fce5ef9e61854ea58779f756c0efded48532e1143e21b125a40de"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:BFZ56KAECFFKXDAITWK2R6XAXO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Ascent sequences avoiding pairs of patterns","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrew M. Baxter, Lara K. Pudwell","submitted_at":"2014-06-16T19:03:39Z","abstract_excerpt":"Ascent sequences were introduced by Bousquet-Melou et al. in connection with (2+2)-avoiding posets and their pattern avoidance properties were first considered by Duncan and Steingrimsson. In this paper, we consider ascent sequences of length $n$ avoiding two patterns of length 3, and we determine an exact enumeration for 16 different pairs of patterns. Methods include simple recurrences, bijections to other combinatorial objects (including Dyck paths and pattern-avoiding permutations), and generating trees. We also provide an analogue of the Erdos-Szekeres Theorem to prove that any sufficient"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.4100","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"},"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-18T02:27:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bo4z4EV9MBEVV6tdTQvzV/hXRk40xayu44bJoLoo7sziHZxxiRLEeg5RvagsUzAl6xWiI2kdxX1G3lM/dPXxAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T12:51:37.437202Z"},"content_sha256":"dbb451b9105cfa5890a74823ce772e536866be4314505c9183e13e508ffd9555","schema_version":"1.0","event_id":"sha256:dbb451b9105cfa5890a74823ce772e536866be4314505c9183e13e508ffd9555"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BFZ56KAECFFKXDAITWK2R6XAXO/bundle.json","state_url":"https://pith.science/pith/BFZ56KAECFFKXDAITWK2R6XAXO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BFZ56KAECFFKXDAITWK2R6XAXO/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-11T12:51:37Z","links":{"resolver":"https://pith.science/pith/BFZ56KAECFFKXDAITWK2R6XAXO","bundle":"https://pith.science/pith/BFZ56KAECFFKXDAITWK2R6XAXO/bundle.json","state":"https://pith.science/pith/BFZ56KAECFFKXDAITWK2R6XAXO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BFZ56KAECFFKXDAITWK2R6XAXO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:BFZ56KAECFFKXDAITWK2R6XAXO","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":"ef9d603536b455ac1e730c78a2c46a04644db5626fd8ac880e1febd97490ae93","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-16T19:03:39Z","title_canon_sha256":"01a54fad131af5f06fdbc8d4b78428deb862a56f79ec046f6cca77f373993b07"},"schema_version":"1.0","source":{"id":"1406.4100","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.4100","created_at":"2026-05-18T02:27:05Z"},{"alias_kind":"arxiv_version","alias_value":"1406.4100v2","created_at":"2026-05-18T02:27:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.4100","created_at":"2026-05-18T02:27:05Z"},{"alias_kind":"pith_short_12","alias_value":"BFZ56KAECFFK","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"BFZ56KAECFFKXDAI","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"BFZ56KAE","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:dbb451b9105cfa5890a74823ce772e536866be4314505c9183e13e508ffd9555","target":"graph","created_at":"2026-05-18T02:27:05Z","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":"Ascent sequences were introduced by Bousquet-Melou et al. in connection with (2+2)-avoiding posets and their pattern avoidance properties were first considered by Duncan and Steingrimsson. In this paper, we consider ascent sequences of length $n$ avoiding two patterns of length 3, and we determine an exact enumeration for 16 different pairs of patterns. Methods include simple recurrences, bijections to other combinatorial objects (including Dyck paths and pattern-avoiding permutations), and generating trees. We also provide an analogue of the Erdos-Szekeres Theorem to prove that any sufficient","authors_text":"Andrew M. Baxter, Lara K. Pudwell","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-16T19:03:39Z","title":"Ascent sequences avoiding pairs of patterns"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.4100","kind":"arxiv","version":2},"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:65170c02e64fce5ef9e61854ea58779f756c0efded48532e1143e21b125a40de","target":"record","created_at":"2026-05-18T02:27:05Z","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":"ef9d603536b455ac1e730c78a2c46a04644db5626fd8ac880e1febd97490ae93","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-16T19:03:39Z","title_canon_sha256":"01a54fad131af5f06fdbc8d4b78428deb862a56f79ec046f6cca77f373993b07"},"schema_version":"1.0","source":{"id":"1406.4100","kind":"arxiv","version":2}},"canonical_sha256":"0973df2804114aab8c089d95a8fae0bb83807f541acad283faa8593b42982ef1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0973df2804114aab8c089d95a8fae0bb83807f541acad283faa8593b42982ef1","first_computed_at":"2026-05-18T02:27:05.406375Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:27:05.406375Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FE8bshraLfohZkEAyM0SfnwPhL38TvNeLDR8YWrSFmrPL/za9e3SsdmWDZPbUNLMLedGOlFChEc0wCvzP0YFBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:27:05.406767Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.4100","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:65170c02e64fce5ef9e61854ea58779f756c0efded48532e1143e21b125a40de","sha256:dbb451b9105cfa5890a74823ce772e536866be4314505c9183e13e508ffd9555"],"state_sha256":"3b5ecf647f0bc6a7c06bf98d26cb62e19b1079f24678b03c200266e6146d58da"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GM1bY8fyd3gzrqQkcWIbuhhqIl5PYdgYVDS8gs28AvYB0SYGUqPAPkvmrhS1DU4G4UC5wTwbtaVRiC072CYrAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T12:51:37.439528Z","bundle_sha256":"ce2c23ffc2b79318aa32ce6a5b098ad6c77f8511633c7aebaa6d09020d582f72"}}