{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:6VMQ3G5FD6S3TSFRU7NVQCMD2D","short_pith_number":"pith:6VMQ3G5F","canonical_record":{"source":{"id":"1311.7492","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-29T09:09:45Z","cross_cats_sorted":[],"title_canon_sha256":"92002cd716402c0a91516e4753fe8feb252532ac3d9f79f9a2e18d31a3d3de59","abstract_canon_sha256":"76c16566e2de9516d702d15067865783afd61e8c1247c0dd8446802a792b8077"},"schema_version":"1.0"},"canonical_sha256":"f5590d9ba51fa5b9c8b1a7db580983d0c1775f6ee732230b5d754bf5d6c08e5d","source":{"kind":"arxiv","id":"1311.7492","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.7492","created_at":"2026-07-05T04:06:38Z"},{"alias_kind":"arxiv_version","alias_value":"1311.7492v1","created_at":"2026-07-05T04:06:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.7492","created_at":"2026-07-05T04:06:38Z"},{"alias_kind":"pith_short_12","alias_value":"6VMQ3G5FD6S3","created_at":"2026-07-05T04:06:38Z"},{"alias_kind":"pith_short_16","alias_value":"6VMQ3G5FD6S3TSFR","created_at":"2026-07-05T04:06:38Z"},{"alias_kind":"pith_short_8","alias_value":"6VMQ3G5F","created_at":"2026-07-05T04:06:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:6VMQ3G5FD6S3TSFRU7NVQCMD2D","target":"record","payload":{"canonical_record":{"source":{"id":"1311.7492","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-29T09:09:45Z","cross_cats_sorted":[],"title_canon_sha256":"92002cd716402c0a91516e4753fe8feb252532ac3d9f79f9a2e18d31a3d3de59","abstract_canon_sha256":"76c16566e2de9516d702d15067865783afd61e8c1247c0dd8446802a792b8077"},"schema_version":"1.0"},"canonical_sha256":"f5590d9ba51fa5b9c8b1a7db580983d0c1775f6ee732230b5d754bf5d6c08e5d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:06:38.793634Z","signature_b64":"7Pc8HjUsr9ro5xHmhFrnwdsG3X7typt6r4wiKEHya3UDNirhMP8zMQNvBwXgnwPgiqFIbGE2zsBr50HkPZr6DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f5590d9ba51fa5b9c8b1a7db580983d0c1775f6ee732230b5d754bf5d6c08e5d","last_reissued_at":"2026-07-05T04:06:38.793265Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:06:38.793265Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.7492","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":"STYlylpzmRDXYT5WAINsCsG4LJGJpy8tWP1NTP9prBY30LR3LvdBG8u3CPdF1L7eRzLLGZIDMzhPD4Y6JR1mCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T07:00:08.586891Z"},"content_sha256":"9aa1d278b7b2fdc56426cb5fe4884674387528b3638b3f3374e450f3b62cc44e","schema_version":"1.0","event_id":"sha256:9aa1d278b7b2fdc56426cb5fe4884674387528b3638b3f3374e450f3b62cc44e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:6VMQ3G5FD6S3TSFRU7NVQCMD2D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A refined enumeration of $p$-ary 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":"2013-11-29T09:09:45Z","abstract_excerpt":"Let $\\mathcal{T}^{(p)}_n$ be the set of $p$-ary labeled trees on $\\{1,2,\\dots,n\\}$. A maximal decreasing subtree of an $p$-ary labeled tree is defined by the maximal $p$-ary subtree from the root with all edges being decreasing. In this paper, we study a new refinement $\\mathcal{T}^{(p)}_{n,k}$ of $\\mathcal{T}^{(p)}_n$, which is the set of $p$-ary labeled trees whose maximal decreasing subtree has $k$ vertices."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.7492","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/1311.7492/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":"7KBpWxFFyuKR1vS+3GaRUzqBAiF0qzqFV4gCrtPiCyDY/UR3+PxLbUsUS6OgmoMfCmYjxseQKqpQJKZIM0/YCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T07:00:08.587545Z"},"content_sha256":"b57266a4cb9387b03c256b84c742ded0198ac835830c2a8b3597eb2239298def","schema_version":"1.0","event_id":"sha256:b57266a4cb9387b03c256b84c742ded0198ac835830c2a8b3597eb2239298def"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6VMQ3G5FD6S3TSFRU7NVQCMD2D/bundle.json","state_url":"https://pith.science/pith/6VMQ3G5FD6S3TSFRU7NVQCMD2D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6VMQ3G5FD6S3TSFRU7NVQCMD2D/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-08T07:00:08Z","links":{"resolver":"https://pith.science/pith/6VMQ3G5FD6S3TSFRU7NVQCMD2D","bundle":"https://pith.science/pith/6VMQ3G5FD6S3TSFRU7NVQCMD2D/bundle.json","state":"https://pith.science/pith/6VMQ3G5FD6S3TSFRU7NVQCMD2D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6VMQ3G5FD6S3TSFRU7NVQCMD2D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:6VMQ3G5FD6S3TSFRU7NVQCMD2D","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":"76c16566e2de9516d702d15067865783afd61e8c1247c0dd8446802a792b8077","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-29T09:09:45Z","title_canon_sha256":"92002cd716402c0a91516e4753fe8feb252532ac3d9f79f9a2e18d31a3d3de59"},"schema_version":"1.0","source":{"id":"1311.7492","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.7492","created_at":"2026-07-05T04:06:38Z"},{"alias_kind":"arxiv_version","alias_value":"1311.7492v1","created_at":"2026-07-05T04:06:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.7492","created_at":"2026-07-05T04:06:38Z"},{"alias_kind":"pith_short_12","alias_value":"6VMQ3G5FD6S3","created_at":"2026-07-05T04:06:38Z"},{"alias_kind":"pith_short_16","alias_value":"6VMQ3G5FD6S3TSFR","created_at":"2026-07-05T04:06:38Z"},{"alias_kind":"pith_short_8","alias_value":"6VMQ3G5F","created_at":"2026-07-05T04:06:38Z"}],"graph_snapshots":[{"event_id":"sha256:b57266a4cb9387b03c256b84c742ded0198ac835830c2a8b3597eb2239298def","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/1311.7492/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $\\mathcal{T}^{(p)}_n$ be the set of $p$-ary labeled trees on $\\{1,2,\\dots,n\\}$. A maximal decreasing subtree of an $p$-ary labeled tree is defined by the maximal $p$-ary subtree from the root with all edges being decreasing. In this paper, we study a new refinement $\\mathcal{T}^{(p)}_{n,k}$ of $\\mathcal{T}^{(p)}_n$, which is the set of $p$-ary labeled trees whose maximal decreasing subtree has $k$ 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":"2013-11-29T09:09:45Z","title":"A refined enumeration of $p$-ary labeled trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.7492","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:9aa1d278b7b2fdc56426cb5fe4884674387528b3638b3f3374e450f3b62cc44e","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":"76c16566e2de9516d702d15067865783afd61e8c1247c0dd8446802a792b8077","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-29T09:09:45Z","title_canon_sha256":"92002cd716402c0a91516e4753fe8feb252532ac3d9f79f9a2e18d31a3d3de59"},"schema_version":"1.0","source":{"id":"1311.7492","kind":"arxiv","version":1}},"canonical_sha256":"f5590d9ba51fa5b9c8b1a7db580983d0c1775f6ee732230b5d754bf5d6c08e5d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f5590d9ba51fa5b9c8b1a7db580983d0c1775f6ee732230b5d754bf5d6c08e5d","first_computed_at":"2026-07-05T04:06:38.793265Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:06:38.793265Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7Pc8HjUsr9ro5xHmhFrnwdsG3X7typt6r4wiKEHya3UDNirhMP8zMQNvBwXgnwPgiqFIbGE2zsBr50HkPZr6DA==","signature_status":"signed_v1","signed_at":"2026-07-05T04:06:38.793634Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.7492","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9aa1d278b7b2fdc56426cb5fe4884674387528b3638b3f3374e450f3b62cc44e","sha256:b57266a4cb9387b03c256b84c742ded0198ac835830c2a8b3597eb2239298def"],"state_sha256":"143b0e2df4f7218540c37348334ebc561d3dcb09152f5c70e746ebc926e32c1e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v9+xuMGSOHH1yeZP+kP1Ii4st4nfh9v5Ff76WkF51sKIBcUZyX/+yRVD3FBl5C2GGWv1jU6+WwlydXgrM92uAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-08T07:00:08.591312Z","bundle_sha256":"3bbc04981a7199a4fca671ede3953702d814fe8585082b50d4590b41ff574390"}}