{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:N65UWGSQEPHAPMRDBVEFVE3OVK","short_pith_number":"pith:N65UWGSQ","canonical_record":{"source":{"id":"1207.3291","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-13T16:11:39Z","cross_cats_sorted":[],"title_canon_sha256":"c28ca372d45172fe05d792a3487aef61595e5e26a0e99ca5e61e991ba46b7041","abstract_canon_sha256":"82998b762c89d126e75274c00f724cedb405a0a50ea7d1eb4d470f68947ceb0b"},"schema_version":"1.0"},"canonical_sha256":"6fbb4b1a5023ce07b2230d485a936eaab2ef151b878be28888cbb52b83a486a4","source":{"kind":"arxiv","id":"1207.3291","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.3291","created_at":"2026-07-05T04:06:38Z"},{"alias_kind":"arxiv_version","alias_value":"1207.3291v1","created_at":"2026-07-05T04:06:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.3291","created_at":"2026-07-05T04:06:38Z"},{"alias_kind":"pith_short_12","alias_value":"N65UWGSQEPHA","created_at":"2026-07-05T04:06:38Z"},{"alias_kind":"pith_short_16","alias_value":"N65UWGSQEPHAPMRD","created_at":"2026-07-05T04:06:38Z"},{"alias_kind":"pith_short_8","alias_value":"N65UWGSQ","created_at":"2026-07-05T04:06:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:N65UWGSQEPHAPMRDBVEFVE3OVK","target":"record","payload":{"canonical_record":{"source":{"id":"1207.3291","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-13T16:11:39Z","cross_cats_sorted":[],"title_canon_sha256":"c28ca372d45172fe05d792a3487aef61595e5e26a0e99ca5e61e991ba46b7041","abstract_canon_sha256":"82998b762c89d126e75274c00f724cedb405a0a50ea7d1eb4d470f68947ceb0b"},"schema_version":"1.0"},"canonical_sha256":"6fbb4b1a5023ce07b2230d485a936eaab2ef151b878be28888cbb52b83a486a4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:06:38.740252Z","signature_b64":"2Uli0pQ40Z2Qh8kxNQJnSjD+Qp7SrSi4waREHjIvYvMO8Vn/rY1LvTJY4bNaPfTuz5lkjv+2ZFgK8RY8BSNcAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6fbb4b1a5023ce07b2230d485a936eaab2ef151b878be28888cbb52b83a486a4","last_reissued_at":"2026-07-05T04:06:38.739851Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:06:38.739851Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.3291","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-07-05T04:06:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hlOVw7hxtrHOUA5KTqdoCe5S8A6kza/Xik+YeFbf3UOIWSWBxz1BQLMOzQkeY3kJdEKXWDcJu2cyrNxcysthDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-11T15:10:24.257544Z"},"content_sha256":"722688fcb4a68f49a7413de150ec998fa551dc689f656679385af8afc02f6a3b","schema_version":"1.0","event_id":"sha256:722688fcb4a68f49a7413de150ec998fa551dc689f656679385af8afc02f6a3b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:N65UWGSQEPHAPMRDBVEFVE3OVK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A refinement for ordered labeled trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Heesung Shin, Seunghyun Seo","submitted_at":"2012-07-13T16:11:39Z","abstract_excerpt":"Let $\\mathcal{O}_n$ be the set of ordered labeled trees on ${0,...,n}$. A maximal decreasing subtree of an ordered labeled tree is defined by the maximal ordered subtree from the root with all edges being decreasing. In this paper, we study a new refinement $\\mathcal{O}_{n,k}$ of $\\mathcal{O}_n$, which is the set of ordered labeled trees whose maximal decreasing subtree has $k+1$ vertices."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.3291","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1207.3291/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T04:06:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jggh0TOSc4UIl8ls4vb35csbYnuJrL2y1726Y8HWx/wLu5HqTnnY1vctti7vU1MUR8GUzoKgxIBEnoHWKx+3CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-11T15:10:24.258181Z"},"content_sha256":"dd194a47b1e690614e5da67e6c826ff3e4165d6043ef6db05f8d8d444d029904","schema_version":"1.0","event_id":"sha256:dd194a47b1e690614e5da67e6c826ff3e4165d6043ef6db05f8d8d444d029904"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N65UWGSQEPHAPMRDBVEFVE3OVK/bundle.json","state_url":"https://pith.science/pith/N65UWGSQEPHAPMRDBVEFVE3OVK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N65UWGSQEPHAPMRDBVEFVE3OVK/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-07-11T15:10:24Z","links":{"resolver":"https://pith.science/pith/N65UWGSQEPHAPMRDBVEFVE3OVK","bundle":"https://pith.science/pith/N65UWGSQEPHAPMRDBVEFVE3OVK/bundle.json","state":"https://pith.science/pith/N65UWGSQEPHAPMRDBVEFVE3OVK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N65UWGSQEPHAPMRDBVEFVE3OVK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:N65UWGSQEPHAPMRDBVEFVE3OVK","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":"82998b762c89d126e75274c00f724cedb405a0a50ea7d1eb4d470f68947ceb0b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-13T16:11:39Z","title_canon_sha256":"c28ca372d45172fe05d792a3487aef61595e5e26a0e99ca5e61e991ba46b7041"},"schema_version":"1.0","source":{"id":"1207.3291","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.3291","created_at":"2026-07-05T04:06:38Z"},{"alias_kind":"arxiv_version","alias_value":"1207.3291v1","created_at":"2026-07-05T04:06:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.3291","created_at":"2026-07-05T04:06:38Z"},{"alias_kind":"pith_short_12","alias_value":"N65UWGSQEPHA","created_at":"2026-07-05T04:06:38Z"},{"alias_kind":"pith_short_16","alias_value":"N65UWGSQEPHAPMRD","created_at":"2026-07-05T04:06:38Z"},{"alias_kind":"pith_short_8","alias_value":"N65UWGSQ","created_at":"2026-07-05T04:06:38Z"}],"graph_snapshots":[{"event_id":"sha256:dd194a47b1e690614e5da67e6c826ff3e4165d6043ef6db05f8d8d444d029904","target":"graph","created_at":"2026-07-05T04:06:38Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1207.3291/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $\\mathcal{O}_n$ be the set of ordered labeled trees on ${0,...,n}$. A maximal decreasing subtree of an ordered labeled tree is defined by the maximal ordered subtree from the root with all edges being decreasing. In this paper, we study a new refinement $\\mathcal{O}_{n,k}$ of $\\mathcal{O}_n$, which is the set of ordered labeled trees whose maximal decreasing subtree has $k+1$ vertices.","authors_text":"Heesung Shin, Seunghyun Seo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-13T16:11:39Z","title":"A refinement for ordered labeled trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.3291","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:722688fcb4a68f49a7413de150ec998fa551dc689f656679385af8afc02f6a3b","target":"record","created_at":"2026-07-05T04:06:38Z","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":"82998b762c89d126e75274c00f724cedb405a0a50ea7d1eb4d470f68947ceb0b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-13T16:11:39Z","title_canon_sha256":"c28ca372d45172fe05d792a3487aef61595e5e26a0e99ca5e61e991ba46b7041"},"schema_version":"1.0","source":{"id":"1207.3291","kind":"arxiv","version":1}},"canonical_sha256":"6fbb4b1a5023ce07b2230d485a936eaab2ef151b878be28888cbb52b83a486a4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6fbb4b1a5023ce07b2230d485a936eaab2ef151b878be28888cbb52b83a486a4","first_computed_at":"2026-07-05T04:06:38.739851Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:06:38.739851Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2Uli0pQ40Z2Qh8kxNQJnSjD+Qp7SrSi4waREHjIvYvMO8Vn/rY1LvTJY4bNaPfTuz5lkjv+2ZFgK8RY8BSNcAw==","signature_status":"signed_v1","signed_at":"2026-07-05T04:06:38.740252Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.3291","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:722688fcb4a68f49a7413de150ec998fa551dc689f656679385af8afc02f6a3b","sha256:dd194a47b1e690614e5da67e6c826ff3e4165d6043ef6db05f8d8d444d029904"],"state_sha256":"270f450797b0fdb1ee8826a71318c4c2cb618df54d91771377a926dc48ea9a92"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ucCelXAAZuygMABxM9VnKaq1INjG2w5kJE7CKtWh/RhERhE0DU1DofTKsAWLJh7pBp5FsM6hFxm9jLaFvcNFCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-11T15:10:24.262010Z","bundle_sha256":"bd58c8b8701d9237552d88709f85982be5b61c82cd600cbc1b7b71ec5fa0994b"}}