{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:CTDCNP5SVGLKUASU3FAJ4YLUTQ","short_pith_number":"pith:CTDCNP5S","canonical_record":{"source":{"id":"1712.01942","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-05T21:53:30Z","cross_cats_sorted":[],"title_canon_sha256":"80aa5cb28ce6f0999d8105fb373c6b86ec74632e66df469f14141faa8492280d","abstract_canon_sha256":"f48e92ca18bc1aff8cf81ba33b97b802ceb06149bd6dada2bec9cb20b42fefd3"},"schema_version":"1.0"},"canonical_sha256":"14c626bfb2a996aa0254d9409e61749c2016e75496e76f461fef40f9c785ddc7","source":{"kind":"arxiv","id":"1712.01942","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.01942","created_at":"2026-05-18T00:14:34Z"},{"alias_kind":"arxiv_version","alias_value":"1712.01942v1","created_at":"2026-05-18T00:14:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.01942","created_at":"2026-05-18T00:14:34Z"},{"alias_kind":"pith_short_12","alias_value":"CTDCNP5SVGLK","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CTDCNP5SVGLKUASU","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CTDCNP5S","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:CTDCNP5SVGLKUASU3FAJ4YLUTQ","target":"record","payload":{"canonical_record":{"source":{"id":"1712.01942","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-05T21:53:30Z","cross_cats_sorted":[],"title_canon_sha256":"80aa5cb28ce6f0999d8105fb373c6b86ec74632e66df469f14141faa8492280d","abstract_canon_sha256":"f48e92ca18bc1aff8cf81ba33b97b802ceb06149bd6dada2bec9cb20b42fefd3"},"schema_version":"1.0"},"canonical_sha256":"14c626bfb2a996aa0254d9409e61749c2016e75496e76f461fef40f9c785ddc7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:34.283086Z","signature_b64":"T697jBxrxHWJeZYQuz2YkTK8J/y3Ac9wrihglS51ajqGjHY9wZgnz9UxEFg6YhoMnKbLGSSidggjuDCr9xw8AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"14c626bfb2a996aa0254d9409e61749c2016e75496e76f461fef40f9c785ddc7","last_reissued_at":"2026-05-18T00:14:34.282517Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:34.282517Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.01942","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-18T00:14:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"91uN40HdrUaF+nFE6CJ95ClPOEH9ihonkiGyEC/pKBiDu2J0SlZ4FKUyrevbZKAr9de3lhvDLETriBZJdi/1Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T02:42:53.823116Z"},"content_sha256":"8451ec415af1189bc0eaae18e04399800111f25a66ba5f7ac06c572f86686301","schema_version":"1.0","event_id":"sha256:8451ec415af1189bc0eaae18e04399800111f25a66ba5f7ac06c572f86686301"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:CTDCNP5SVGLKUASU3FAJ4YLUTQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Leaf realization problem, caterpillar graphs and prefix normal words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alain Goupil, Alexandre Blondin Mass\\'e, \\'Elise Vandomme, \\'Emile Nadeau, Julien de Carufel, M\\'elodie Lapointe","submitted_at":"2017-12-05T21:53:30Z","abstract_excerpt":"Given a simple graph $G$ with $n$ vertices and a natural number $i \\leq n$, let $L_G(i)$ be the maximum number of leaves that can be realized by an induced subtree $T$ of $G$ with $i$ vertices. We introduce a problem that we call the \\emph{leaf realization problem}, which consists in deciding whether, for a given sequence of $n+1$ natural numbers $(\\ell_0, \\ell_1, \\ldots, \\ell_n)$, there exists a simple graph $G$ with $n$ vertices such that $\\ell_i = L_G(i)$ for $i = 0, 1, \\ldots, n$. We present basic observations on the structure of these sequences for general graphs and trees. In the particu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.01942","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-18T00:14:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GKgoPWan54DTCGAmn7u3vATXh1uDdVng5tZ7Av9qTNu7t7aletXs05VlsjTh/MXOd0F26KU/ifdXiS9zM/9dCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T02:42:53.823785Z"},"content_sha256":"8203a510ebf044493b4adf85d0defe5f829a30f57e5ddb8f417d154c814b1092","schema_version":"1.0","event_id":"sha256:8203a510ebf044493b4adf85d0defe5f829a30f57e5ddb8f417d154c814b1092"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CTDCNP5SVGLKUASU3FAJ4YLUTQ/bundle.json","state_url":"https://pith.science/pith/CTDCNP5SVGLKUASU3FAJ4YLUTQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CTDCNP5SVGLKUASU3FAJ4YLUTQ/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-06T02:42:53Z","links":{"resolver":"https://pith.science/pith/CTDCNP5SVGLKUASU3FAJ4YLUTQ","bundle":"https://pith.science/pith/CTDCNP5SVGLKUASU3FAJ4YLUTQ/bundle.json","state":"https://pith.science/pith/CTDCNP5SVGLKUASU3FAJ4YLUTQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CTDCNP5SVGLKUASU3FAJ4YLUTQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:CTDCNP5SVGLKUASU3FAJ4YLUTQ","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":"f48e92ca18bc1aff8cf81ba33b97b802ceb06149bd6dada2bec9cb20b42fefd3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-05T21:53:30Z","title_canon_sha256":"80aa5cb28ce6f0999d8105fb373c6b86ec74632e66df469f14141faa8492280d"},"schema_version":"1.0","source":{"id":"1712.01942","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.01942","created_at":"2026-05-18T00:14:34Z"},{"alias_kind":"arxiv_version","alias_value":"1712.01942v1","created_at":"2026-05-18T00:14:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.01942","created_at":"2026-05-18T00:14:34Z"},{"alias_kind":"pith_short_12","alias_value":"CTDCNP5SVGLK","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CTDCNP5SVGLKUASU","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CTDCNP5S","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:8203a510ebf044493b4adf85d0defe5f829a30f57e5ddb8f417d154c814b1092","target":"graph","created_at":"2026-05-18T00:14:34Z","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":"Given a simple graph $G$ with $n$ vertices and a natural number $i \\leq n$, let $L_G(i)$ be the maximum number of leaves that can be realized by an induced subtree $T$ of $G$ with $i$ vertices. We introduce a problem that we call the \\emph{leaf realization problem}, which consists in deciding whether, for a given sequence of $n+1$ natural numbers $(\\ell_0, \\ell_1, \\ldots, \\ell_n)$, there exists a simple graph $G$ with $n$ vertices such that $\\ell_i = L_G(i)$ for $i = 0, 1, \\ldots, n$. We present basic observations on the structure of these sequences for general graphs and trees. In the particu","authors_text":"Alain Goupil, Alexandre Blondin Mass\\'e, \\'Elise Vandomme, \\'Emile Nadeau, Julien de Carufel, M\\'elodie Lapointe","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-05T21:53:30Z","title":"Leaf realization problem, caterpillar graphs and prefix normal words"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.01942","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:8451ec415af1189bc0eaae18e04399800111f25a66ba5f7ac06c572f86686301","target":"record","created_at":"2026-05-18T00:14:34Z","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":"f48e92ca18bc1aff8cf81ba33b97b802ceb06149bd6dada2bec9cb20b42fefd3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-05T21:53:30Z","title_canon_sha256":"80aa5cb28ce6f0999d8105fb373c6b86ec74632e66df469f14141faa8492280d"},"schema_version":"1.0","source":{"id":"1712.01942","kind":"arxiv","version":1}},"canonical_sha256":"14c626bfb2a996aa0254d9409e61749c2016e75496e76f461fef40f9c785ddc7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"14c626bfb2a996aa0254d9409e61749c2016e75496e76f461fef40f9c785ddc7","first_computed_at":"2026-05-18T00:14:34.282517Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:34.282517Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"T697jBxrxHWJeZYQuz2YkTK8J/y3Ac9wrihglS51ajqGjHY9wZgnz9UxEFg6YhoMnKbLGSSidggjuDCr9xw8AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:34.283086Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.01942","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8451ec415af1189bc0eaae18e04399800111f25a66ba5f7ac06c572f86686301","sha256:8203a510ebf044493b4adf85d0defe5f829a30f57e5ddb8f417d154c814b1092"],"state_sha256":"dd3344cd208f2196bc94edab7181e4dd6adda8f7b3fffeb8cd4e32f8e1c76325"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FeKCAhDYw38NEl86mox7AvdQN8/wNx3kW8kDtppWNAj84qt/XidgxDafcdFu1/g3WmQgDkRmXLMgIJDJ7NMgAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T02:42:53.827302Z","bundle_sha256":"fc7990327b4f04679945f5e095ce178e9af737affb08fd2c56a7bc4f8eb5a0a7"}}