{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:3PKRNBPWPDPML2QMCWHNLULEIQ","short_pith_number":"pith:3PKRNBPW","canonical_record":{"source":{"id":"1411.4587","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-17T18:59:09Z","cross_cats_sorted":[],"title_canon_sha256":"2dcdacb7327d62a4286742f005fc2ca07d9b8487d66a4f5d6baa5ac3f5d70d27","abstract_canon_sha256":"ce22d5cc3ad9ad9733d4f6fe7c1dd363eda7f500c7c3734f9d81c1dbfd3ad841"},"schema_version":"1.0"},"canonical_sha256":"dbd51685f678dec5ea0c158ed5d164443c6f918abd3bb84cc80bb789d7660559","source":{"kind":"arxiv","id":"1411.4587","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.4587","created_at":"2026-05-18T02:35:45Z"},{"alias_kind":"arxiv_version","alias_value":"1411.4587v1","created_at":"2026-05-18T02:35:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.4587","created_at":"2026-05-18T02:35:45Z"},{"alias_kind":"pith_short_12","alias_value":"3PKRNBPWPDPM","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3PKRNBPWPDPML2QM","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3PKRNBPW","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:3PKRNBPWPDPML2QMCWHNLULEIQ","target":"record","payload":{"canonical_record":{"source":{"id":"1411.4587","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-17T18:59:09Z","cross_cats_sorted":[],"title_canon_sha256":"2dcdacb7327d62a4286742f005fc2ca07d9b8487d66a4f5d6baa5ac3f5d70d27","abstract_canon_sha256":"ce22d5cc3ad9ad9733d4f6fe7c1dd363eda7f500c7c3734f9d81c1dbfd3ad841"},"schema_version":"1.0"},"canonical_sha256":"dbd51685f678dec5ea0c158ed5d164443c6f918abd3bb84cc80bb789d7660559","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:35:45.394715Z","signature_b64":"42TlZdF17qzrXkviOnPIwNoilpox2WXtcYvZdNHBfBxBkSMcecWijmTMO++3Cwnnj2wUGnhgh905K21bwOluAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dbd51685f678dec5ea0c158ed5d164443c6f918abd3bb84cc80bb789d7660559","last_reissued_at":"2026-05-18T02:35:45.394267Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:35:45.394267Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.4587","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-18T02:35:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DX9qDQnDEo/bI1sbT+7MrLgqn+4i6mKMbp9us4TmZjipABKmi12K1UVGhhQ+sYYbKJUKz/qy02WxwR+F2U3QDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:35:20.873019Z"},"content_sha256":"c433d2395119de13c3db048dd3b45b9a9965a4d8ef37eb1ed7059d5e82bfa162","schema_version":"1.0","event_id":"sha256:c433d2395119de13c3db048dd3b45b9a9965a4d8ef37eb1ed7059d5e82bfa162"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:3PKRNBPWPDPML2QMCWHNLULEIQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Combinatorial families of multilabelled increasing trees and hook-length formulas","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alois Panholzer, Markus Kuba","submitted_at":"2014-11-17T18:59:09Z","abstract_excerpt":"In this work we introduce and study various generalizations of the notion of increasingly labelled trees, where the label of a child node is always larger than the label of its parent node, to multilabelled tree families, where the nodes in the tree can get multiple labels. For all tree classes we show characterizations of suitable generating functions for the tree enumeration sequence via differential equations. Furthermore, for several combinatorial classes of multilabelled increasing tree families we present explicit enumeration results. We also present multilabelled increasing tree familie"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.4587","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-18T02:35:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WBvEHMY1z1FOKTsRPCF2CDm3ZPAbyLQV43389/REBZQHZxoIculq/UVlnK3K4+ptNyVwImZpzMNReQHMbIPKDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:35:20.873375Z"},"content_sha256":"e066d289096c2ef46393baca1fa8cc40bfb641c246f398e2fb9f9ceff3bb9516","schema_version":"1.0","event_id":"sha256:e066d289096c2ef46393baca1fa8cc40bfb641c246f398e2fb9f9ceff3bb9516"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3PKRNBPWPDPML2QMCWHNLULEIQ/bundle.json","state_url":"https://pith.science/pith/3PKRNBPWPDPML2QMCWHNLULEIQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3PKRNBPWPDPML2QMCWHNLULEIQ/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-03T05:35:20Z","links":{"resolver":"https://pith.science/pith/3PKRNBPWPDPML2QMCWHNLULEIQ","bundle":"https://pith.science/pith/3PKRNBPWPDPML2QMCWHNLULEIQ/bundle.json","state":"https://pith.science/pith/3PKRNBPWPDPML2QMCWHNLULEIQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3PKRNBPWPDPML2QMCWHNLULEIQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:3PKRNBPWPDPML2QMCWHNLULEIQ","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":"ce22d5cc3ad9ad9733d4f6fe7c1dd363eda7f500c7c3734f9d81c1dbfd3ad841","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-17T18:59:09Z","title_canon_sha256":"2dcdacb7327d62a4286742f005fc2ca07d9b8487d66a4f5d6baa5ac3f5d70d27"},"schema_version":"1.0","source":{"id":"1411.4587","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.4587","created_at":"2026-05-18T02:35:45Z"},{"alias_kind":"arxiv_version","alias_value":"1411.4587v1","created_at":"2026-05-18T02:35:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.4587","created_at":"2026-05-18T02:35:45Z"},{"alias_kind":"pith_short_12","alias_value":"3PKRNBPWPDPM","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3PKRNBPWPDPML2QM","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3PKRNBPW","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:e066d289096c2ef46393baca1fa8cc40bfb641c246f398e2fb9f9ceff3bb9516","target":"graph","created_at":"2026-05-18T02:35:45Z","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":"In this work we introduce and study various generalizations of the notion of increasingly labelled trees, where the label of a child node is always larger than the label of its parent node, to multilabelled tree families, where the nodes in the tree can get multiple labels. For all tree classes we show characterizations of suitable generating functions for the tree enumeration sequence via differential equations. Furthermore, for several combinatorial classes of multilabelled increasing tree families we present explicit enumeration results. We also present multilabelled increasing tree familie","authors_text":"Alois Panholzer, Markus Kuba","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-17T18:59:09Z","title":"Combinatorial families of multilabelled increasing trees and hook-length formulas"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.4587","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:c433d2395119de13c3db048dd3b45b9a9965a4d8ef37eb1ed7059d5e82bfa162","target":"record","created_at":"2026-05-18T02:35:45Z","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":"ce22d5cc3ad9ad9733d4f6fe7c1dd363eda7f500c7c3734f9d81c1dbfd3ad841","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-17T18:59:09Z","title_canon_sha256":"2dcdacb7327d62a4286742f005fc2ca07d9b8487d66a4f5d6baa5ac3f5d70d27"},"schema_version":"1.0","source":{"id":"1411.4587","kind":"arxiv","version":1}},"canonical_sha256":"dbd51685f678dec5ea0c158ed5d164443c6f918abd3bb84cc80bb789d7660559","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dbd51685f678dec5ea0c158ed5d164443c6f918abd3bb84cc80bb789d7660559","first_computed_at":"2026-05-18T02:35:45.394267Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:35:45.394267Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"42TlZdF17qzrXkviOnPIwNoilpox2WXtcYvZdNHBfBxBkSMcecWijmTMO++3Cwnnj2wUGnhgh905K21bwOluAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:35:45.394715Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.4587","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c433d2395119de13c3db048dd3b45b9a9965a4d8ef37eb1ed7059d5e82bfa162","sha256:e066d289096c2ef46393baca1fa8cc40bfb641c246f398e2fb9f9ceff3bb9516"],"state_sha256":"e5c9d08abcb09dcf3d397bd257852f80e91c5bb082620eaa145c734973cfea36"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eMjKJOOuRaPn6jKvDTeNTJpwTK/LUmAcnbyCcalScDZw814qjiJaeH9Ap4XZdpC4mz53QTYBeDxGWTgEku+lDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T05:35:20.875304Z","bundle_sha256":"8869e264109caddfb3a8060f4840a06fe6c3cd141e6a718748292683c4e9f2a5"}}