{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:IH5NISI6ZNJ5BY3VXXOADZ6TRC","short_pith_number":"pith:IH5NISI6","canonical_record":{"source":{"id":"1206.2849","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-06-13T15:47:01Z","cross_cats_sorted":[],"title_canon_sha256":"4db21b0c866aeab155c51ef141685b8fe59e1ea38484c99a86be219bdff14c60","abstract_canon_sha256":"a69131b5e6e449009da421f557b55e21a50bc08321b8e03c3642f382bab0d9cf"},"schema_version":"1.0"},"canonical_sha256":"41fad4491ecb53d0e375bddc01e7d388b5565aae94d44c36421d3f878d1fde03","source":{"kind":"arxiv","id":"1206.2849","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.2849","created_at":"2026-05-18T03:53:04Z"},{"alias_kind":"arxiv_version","alias_value":"1206.2849v2","created_at":"2026-05-18T03:53:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.2849","created_at":"2026-05-18T03:53:04Z"},{"alias_kind":"pith_short_12","alias_value":"IH5NISI6ZNJ5","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"IH5NISI6ZNJ5BY3V","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"IH5NISI6","created_at":"2026-05-18T12:27:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:IH5NISI6ZNJ5BY3VXXOADZ6TRC","target":"record","payload":{"canonical_record":{"source":{"id":"1206.2849","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-06-13T15:47:01Z","cross_cats_sorted":[],"title_canon_sha256":"4db21b0c866aeab155c51ef141685b8fe59e1ea38484c99a86be219bdff14c60","abstract_canon_sha256":"a69131b5e6e449009da421f557b55e21a50bc08321b8e03c3642f382bab0d9cf"},"schema_version":"1.0"},"canonical_sha256":"41fad4491ecb53d0e375bddc01e7d388b5565aae94d44c36421d3f878d1fde03","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:53:04.757986Z","signature_b64":"beN7VYyKDRiPG5uEAA5JM5RaPbH+Aj3n9vkkMeWvdgW0jwgFC0H+J6Laqak4hw1cu1z4RYyDoWZGpfavwRDaCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41fad4491ecb53d0e375bddc01e7d388b5565aae94d44c36421d3f878d1fde03","last_reissued_at":"2026-05-18T03:53:04.757409Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:53:04.757409Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.2849","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-18T03:53:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LokkuLRshVVI/Gbv30kf1sDgUHxn86sxfHc3gvRLeXSYMVEeFd+rdXl+oiNG9A0d9PlBWbia0fm8BJjqaj24AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T04:40:06.846663Z"},"content_sha256":"4334fbc597f0975c0292854b1a078d70d72fd26bc691c6ce4bacc76110da427e","schema_version":"1.0","event_id":"sha256:4334fbc597f0975c0292854b1a078d70d72fd26bc691c6ce4bacc76110da427e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:IH5NISI6ZNJ5BY3VXXOADZ6TRC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On 021-Avoiding Ascent Sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alvin Y. L. Dai, Bruce E. Sagan, Theodore Dokos, Tim Dwyer, William Y. C. Chen","submitted_at":"2012-06-13T15:47:01Z","abstract_excerpt":"Ascent sequences were introduced by Bousquet-M\\'{e}lou, Claesson, Dukes and Kitaev in their study of $(\\bf{2+2})$-free posets. An ascent sequence of length $n$ is a nonnegative integer sequence $x=x_{1}x_{2}... x_{n}$ such that $x_{1}=0$ and $x_{i}\\leq \\asc(x_{1}x_{2}...x_{i-1})+1$ for all $1<i\\leq n$, where $\\asc(x_{1}x_{2}...x_{i-1})$ is the number of ascents in the sequence $x_{1}x_{2}... x_{i-1}$. We let $\\cA_n$ stand for the set of such sequences and use $\\cA_n(p)$ for the subset of sequences avoiding a pattern $p$. Similarly, we let $S_{n}(\\tau)$ be the set of $\\tau$-avoiding permutation"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.2849","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-18T03:53:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LXLEPtpRnsEOCIRA0stIAxlfaUgRVHmnO47uQHZlHLmx424yMZN+APIs6EKgExMv1JCuNYd4VaSMVKS+QaI5CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T04:40:06.847292Z"},"content_sha256":"b2923ba5386e07fd836c2821b0b190bd9b42a78c4d5f47dcb93bdedbccaf1176","schema_version":"1.0","event_id":"sha256:b2923ba5386e07fd836c2821b0b190bd9b42a78c4d5f47dcb93bdedbccaf1176"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IH5NISI6ZNJ5BY3VXXOADZ6TRC/bundle.json","state_url":"https://pith.science/pith/IH5NISI6ZNJ5BY3VXXOADZ6TRC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IH5NISI6ZNJ5BY3VXXOADZ6TRC/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-08T04:40:06Z","links":{"resolver":"https://pith.science/pith/IH5NISI6ZNJ5BY3VXXOADZ6TRC","bundle":"https://pith.science/pith/IH5NISI6ZNJ5BY3VXXOADZ6TRC/bundle.json","state":"https://pith.science/pith/IH5NISI6ZNJ5BY3VXXOADZ6TRC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IH5NISI6ZNJ5BY3VXXOADZ6TRC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:IH5NISI6ZNJ5BY3VXXOADZ6TRC","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":"a69131b5e6e449009da421f557b55e21a50bc08321b8e03c3642f382bab0d9cf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-06-13T15:47:01Z","title_canon_sha256":"4db21b0c866aeab155c51ef141685b8fe59e1ea38484c99a86be219bdff14c60"},"schema_version":"1.0","source":{"id":"1206.2849","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.2849","created_at":"2026-05-18T03:53:04Z"},{"alias_kind":"arxiv_version","alias_value":"1206.2849v2","created_at":"2026-05-18T03:53:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.2849","created_at":"2026-05-18T03:53:04Z"},{"alias_kind":"pith_short_12","alias_value":"IH5NISI6ZNJ5","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"IH5NISI6ZNJ5BY3V","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"IH5NISI6","created_at":"2026-05-18T12:27:09Z"}],"graph_snapshots":[{"event_id":"sha256:b2923ba5386e07fd836c2821b0b190bd9b42a78c4d5f47dcb93bdedbccaf1176","target":"graph","created_at":"2026-05-18T03:53:04Z","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-M\\'{e}lou, Claesson, Dukes and Kitaev in their study of $(\\bf{2+2})$-free posets. An ascent sequence of length $n$ is a nonnegative integer sequence $x=x_{1}x_{2}... x_{n}$ such that $x_{1}=0$ and $x_{i}\\leq \\asc(x_{1}x_{2}...x_{i-1})+1$ for all $1<i\\leq n$, where $\\asc(x_{1}x_{2}...x_{i-1})$ is the number of ascents in the sequence $x_{1}x_{2}... x_{i-1}$. We let $\\cA_n$ stand for the set of such sequences and use $\\cA_n(p)$ for the subset of sequences avoiding a pattern $p$. Similarly, we let $S_{n}(\\tau)$ be the set of $\\tau$-avoiding permutation","authors_text":"Alvin Y. L. Dai, Bruce E. Sagan, Theodore Dokos, Tim Dwyer, William Y. C. Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-06-13T15:47:01Z","title":"On 021-Avoiding Ascent Sequences"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.2849","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:4334fbc597f0975c0292854b1a078d70d72fd26bc691c6ce4bacc76110da427e","target":"record","created_at":"2026-05-18T03:53:04Z","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":"a69131b5e6e449009da421f557b55e21a50bc08321b8e03c3642f382bab0d9cf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-06-13T15:47:01Z","title_canon_sha256":"4db21b0c866aeab155c51ef141685b8fe59e1ea38484c99a86be219bdff14c60"},"schema_version":"1.0","source":{"id":"1206.2849","kind":"arxiv","version":2}},"canonical_sha256":"41fad4491ecb53d0e375bddc01e7d388b5565aae94d44c36421d3f878d1fde03","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"41fad4491ecb53d0e375bddc01e7d388b5565aae94d44c36421d3f878d1fde03","first_computed_at":"2026-05-18T03:53:04.757409Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:53:04.757409Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"beN7VYyKDRiPG5uEAA5JM5RaPbH+Aj3n9vkkMeWvdgW0jwgFC0H+J6Laqak4hw1cu1z4RYyDoWZGpfavwRDaCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:53:04.757986Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.2849","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4334fbc597f0975c0292854b1a078d70d72fd26bc691c6ce4bacc76110da427e","sha256:b2923ba5386e07fd836c2821b0b190bd9b42a78c4d5f47dcb93bdedbccaf1176"],"state_sha256":"faeac487fbdc1d337a62dfc45776c59cddc3d71ea7cd356a104858057b40460c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dvrSdnfdua5hzaSUvbKhjZbMaYPfSZ+4Ct3R0J989nW4u6lfR1gmBUlQcc26phfK4dMgg27jtm+2jglVfa/cBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T04:40:06.850774Z","bundle_sha256":"4c83ef694566da30fad42bdcf985c02db43f4a9110edc0351fb3ae921041dfdc"}}