{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:CTDCNP5SVGLKUASU3FAJ4YLUTQ","short_pith_number":"pith:CTDCNP5S","schema_version":"1.0","canonical_sha256":"14c626bfb2a996aa0254d9409e61749c2016e75496e76f461fef40f9c785ddc7","source":{"kind":"arxiv","id":"1712.01942","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1712.01942","created_at":"2026-05-18T00:14:34.282591+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.01942v1","created_at":"2026-05-18T00:14:34.282591+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.01942","created_at":"2026-05-18T00:14:34.282591+00:00"},{"alias_kind":"pith_short_12","alias_value":"CTDCNP5SVGLK","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"CTDCNP5SVGLKUASU","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"CTDCNP5S","created_at":"2026-05-18T12:31:10.602751+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CTDCNP5SVGLKUASU3FAJ4YLUTQ","json":"https://pith.science/pith/CTDCNP5SVGLKUASU3FAJ4YLUTQ.json","graph_json":"https://pith.science/api/pith-number/CTDCNP5SVGLKUASU3FAJ4YLUTQ/graph.json","events_json":"https://pith.science/api/pith-number/CTDCNP5SVGLKUASU3FAJ4YLUTQ/events.json","paper":"https://pith.science/paper/CTDCNP5S"},"agent_actions":{"view_html":"https://pith.science/pith/CTDCNP5SVGLKUASU3FAJ4YLUTQ","download_json":"https://pith.science/pith/CTDCNP5SVGLKUASU3FAJ4YLUTQ.json","view_paper":"https://pith.science/paper/CTDCNP5S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.01942&json=true","fetch_graph":"https://pith.science/api/pith-number/CTDCNP5SVGLKUASU3FAJ4YLUTQ/graph.json","fetch_events":"https://pith.science/api/pith-number/CTDCNP5SVGLKUASU3FAJ4YLUTQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CTDCNP5SVGLKUASU3FAJ4YLUTQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CTDCNP5SVGLKUASU3FAJ4YLUTQ/action/storage_attestation","attest_author":"https://pith.science/pith/CTDCNP5SVGLKUASU3FAJ4YLUTQ/action/author_attestation","sign_citation":"https://pith.science/pith/CTDCNP5SVGLKUASU3FAJ4YLUTQ/action/citation_signature","submit_replication":"https://pith.science/pith/CTDCNP5SVGLKUASU3FAJ4YLUTQ/action/replication_record"}},"created_at":"2026-05-18T00:14:34.282591+00:00","updated_at":"2026-05-18T00:14:34.282591+00:00"}