{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:OTSMFSJVNYR4QN5ZITRGECTKWQ","short_pith_number":"pith:OTSMFSJV","canonical_record":{"source":{"id":"1207.3755","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-16T18:32:13Z","cross_cats_sorted":[],"title_canon_sha256":"ae4907424f65356af790f60c8c08a2dc111194351511baa3d949c0b9b83e4cb3","abstract_canon_sha256":"f675183cd675f92b1b2d51fb84cc83eee8016140bc6f2e1ba012441f2f18ea11"},"schema_version":"1.0"},"canonical_sha256":"74e4c2c9356e23c837b944e2620a6ab4361aa30390c0b7dc79f1487729ab5996","source":{"kind":"arxiv","id":"1207.3755","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.3755","created_at":"2026-05-18T03:50:59Z"},{"alias_kind":"arxiv_version","alias_value":"1207.3755v1","created_at":"2026-05-18T03:50:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.3755","created_at":"2026-05-18T03:50:59Z"},{"alias_kind":"pith_short_12","alias_value":"OTSMFSJVNYR4","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"OTSMFSJVNYR4QN5Z","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"OTSMFSJV","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:OTSMFSJVNYR4QN5ZITRGECTKWQ","target":"record","payload":{"canonical_record":{"source":{"id":"1207.3755","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-16T18:32:13Z","cross_cats_sorted":[],"title_canon_sha256":"ae4907424f65356af790f60c8c08a2dc111194351511baa3d949c0b9b83e4cb3","abstract_canon_sha256":"f675183cd675f92b1b2d51fb84cc83eee8016140bc6f2e1ba012441f2f18ea11"},"schema_version":"1.0"},"canonical_sha256":"74e4c2c9356e23c837b944e2620a6ab4361aa30390c0b7dc79f1487729ab5996","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:50:59.623406Z","signature_b64":"h+/wLfYEokhNaX4Zm035b4yCnzerEJfsKNL7SjuijzmqsFCpWhLzbgP3NH9JR9n5B2i04sJW2IZSS1lN+x11Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74e4c2c9356e23c837b944e2620a6ab4361aa30390c0b7dc79f1487729ab5996","last_reissued_at":"2026-05-18T03:50:59.622718Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:50:59.622718Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.3755","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:50:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2X9YoLYYpKEP0RrbhddgnwMqL1QZm//WCBmbyvZFkiW7DMXv/GKDgfi16MiIyD2Juv+UIn4UDTK3OfLlgxniCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:26:32.717605Z"},"content_sha256":"6e85ae47be03b077ee2239de4473fbe77f4e3d82cdb1cc8576186caf6bfc6535","schema_version":"1.0","event_id":"sha256:6e85ae47be03b077ee2239de4473fbe77f4e3d82cdb1cc8576186caf6bfc6535"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:OTSMFSJVNYR4QN5ZITRGECTKWQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Some enumerative results related to ascent sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Mark Shattuck, Toufik Mansour","submitted_at":"2012-07-16T18:32:13Z","abstract_excerpt":"An ascent sequence is one consisting of non-negative integers in which the size of each letter is restricted by the number of ascents preceding it in the sequence. Ascent sequences have recently been shown to be related to (2+2)-free posets and a variety of other combinatorial structures. In this paper, we prove in the affirmative some recent conjectures concerning pattern avoidance for ascent sequences. Given a pattern $\\tau$, let $\\mathcal{S}_\\tau(n)$ denote the set of ascent sequences of length $n$ avoiding $\\tau$. Here, we show that the joint distribution of the statistic pair $(\\asc,\\zero"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.3755","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:50:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"65S66aNlZCYwKRg8rfjNKEEVHufp5wJwMH/lRVihcTnwyvbK5cUwmKY2YVH5NnnwazVONsI0w82OnD5feQVRCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:26:32.717946Z"},"content_sha256":"f0cc8d6b29090114f9d471873b137e5d3357c341bce0a20ba16191af2f59fe33","schema_version":"1.0","event_id":"sha256:f0cc8d6b29090114f9d471873b137e5d3357c341bce0a20ba16191af2f59fe33"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OTSMFSJVNYR4QN5ZITRGECTKWQ/bundle.json","state_url":"https://pith.science/pith/OTSMFSJVNYR4QN5ZITRGECTKWQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OTSMFSJVNYR4QN5ZITRGECTKWQ/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-02T02:26:32Z","links":{"resolver":"https://pith.science/pith/OTSMFSJVNYR4QN5ZITRGECTKWQ","bundle":"https://pith.science/pith/OTSMFSJVNYR4QN5ZITRGECTKWQ/bundle.json","state":"https://pith.science/pith/OTSMFSJVNYR4QN5ZITRGECTKWQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OTSMFSJVNYR4QN5ZITRGECTKWQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:OTSMFSJVNYR4QN5ZITRGECTKWQ","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":"f675183cd675f92b1b2d51fb84cc83eee8016140bc6f2e1ba012441f2f18ea11","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-16T18:32:13Z","title_canon_sha256":"ae4907424f65356af790f60c8c08a2dc111194351511baa3d949c0b9b83e4cb3"},"schema_version":"1.0","source":{"id":"1207.3755","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.3755","created_at":"2026-05-18T03:50:59Z"},{"alias_kind":"arxiv_version","alias_value":"1207.3755v1","created_at":"2026-05-18T03:50:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.3755","created_at":"2026-05-18T03:50:59Z"},{"alias_kind":"pith_short_12","alias_value":"OTSMFSJVNYR4","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"OTSMFSJVNYR4QN5Z","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"OTSMFSJV","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:f0cc8d6b29090114f9d471873b137e5d3357c341bce0a20ba16191af2f59fe33","target":"graph","created_at":"2026-05-18T03:50:59Z","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":"An ascent sequence is one consisting of non-negative integers in which the size of each letter is restricted by the number of ascents preceding it in the sequence. Ascent sequences have recently been shown to be related to (2+2)-free posets and a variety of other combinatorial structures. In this paper, we prove in the affirmative some recent conjectures concerning pattern avoidance for ascent sequences. Given a pattern $\\tau$, let $\\mathcal{S}_\\tau(n)$ denote the set of ascent sequences of length $n$ avoiding $\\tau$. Here, we show that the joint distribution of the statistic pair $(\\asc,\\zero","authors_text":"Mark Shattuck, Toufik Mansour","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-16T18:32:13Z","title":"Some enumerative results related to ascent sequences"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.3755","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:6e85ae47be03b077ee2239de4473fbe77f4e3d82cdb1cc8576186caf6bfc6535","target":"record","created_at":"2026-05-18T03:50:59Z","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":"f675183cd675f92b1b2d51fb84cc83eee8016140bc6f2e1ba012441f2f18ea11","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-16T18:32:13Z","title_canon_sha256":"ae4907424f65356af790f60c8c08a2dc111194351511baa3d949c0b9b83e4cb3"},"schema_version":"1.0","source":{"id":"1207.3755","kind":"arxiv","version":1}},"canonical_sha256":"74e4c2c9356e23c837b944e2620a6ab4361aa30390c0b7dc79f1487729ab5996","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"74e4c2c9356e23c837b944e2620a6ab4361aa30390c0b7dc79f1487729ab5996","first_computed_at":"2026-05-18T03:50:59.622718Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:50:59.622718Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"h+/wLfYEokhNaX4Zm035b4yCnzerEJfsKNL7SjuijzmqsFCpWhLzbgP3NH9JR9n5B2i04sJW2IZSS1lN+x11Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T03:50:59.623406Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.3755","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6e85ae47be03b077ee2239de4473fbe77f4e3d82cdb1cc8576186caf6bfc6535","sha256:f0cc8d6b29090114f9d471873b137e5d3357c341bce0a20ba16191af2f59fe33"],"state_sha256":"c920dedf9549be7e298c7939afa497dc973d9d7204facba031fe3d3c79216b79"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UiCHcSHhO68Kq9CMgt5QZTGUu2prfqQu01SDW6quHqkdto5aJCpQ4cLtnTxGuhD/q2ji3FOVef/ZPjqqH/HwAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T02:26:32.719851Z","bundle_sha256":"b74a697b4d4ba2421fdd4793bf69b34708347a48f2e206fc4b13a0953bc60737"}}