{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:UFSUOGNXBCQGTN3PM47JU3BK5Q","short_pith_number":"pith:UFSUOGNX","schema_version":"1.0","canonical_sha256":"a1654719b708a069b76f673e9a6c2aec32e9e35c54636144d27cccca7098fc7b","source":{"kind":"arxiv","id":"1709.09808","version":3},"attestation_state":"computed","paper":{"title":"Fully leafed induced subtrees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Alain Goupil, Alexandre Blondin Mass\\'e, \\'Elise Vandomme, \\'Emile Nadeau, Julien de Carufel, M\\'elodie Lapointe","submitted_at":"2017-09-28T05:29:51Z","abstract_excerpt":"Let $G$ be a simple graph on $n$ vertices. We consider the problem LIS of deciding whether there exists an induced subtree with exactly $i \\leq n$ vertices and $\\ell$ leaves in $G$. We study the associated optimization problem, that consists in computing the maximal number of leaves, denoted by $L_G(i)$, realized by an induced subtree with $i$ vertices, for $0 \\le i \\le n$. We begin by proving that the LIS problem is NP-complete in general and then we compute the values of the map $L_G$ for some classical families of graphs and in particular for the $d$-dimensional hypercubic graphs $Q_d$, for"},"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":"1709.09808","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-28T05:29:51Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"ab354da1fc58f0701f0a59b5b92fe7b7c2d55c7688917acffeebcec1e2f73c54","abstract_canon_sha256":"0e500af11384bf793b8b416e821fbbf48e5c19e16f194f7af87e370c7bfeecbc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:18.601082Z","signature_b64":"OwR0kPyv2MUfLF3j9A118bORaX5y2YqxsA17q2DwvUIMnZpXAfkIfqlb4x5W4gtW7PPFaOIO5SiezFCVrA7UAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a1654719b708a069b76f673e9a6c2aec32e9e35c54636144d27cccca7098fc7b","last_reissued_at":"2026-05-18T00:11:18.600305Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:18.600305Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fully leafed induced subtrees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Alain Goupil, Alexandre Blondin Mass\\'e, \\'Elise Vandomme, \\'Emile Nadeau, Julien de Carufel, M\\'elodie Lapointe","submitted_at":"2017-09-28T05:29:51Z","abstract_excerpt":"Let $G$ be a simple graph on $n$ vertices. We consider the problem LIS of deciding whether there exists an induced subtree with exactly $i \\leq n$ vertices and $\\ell$ leaves in $G$. We study the associated optimization problem, that consists in computing the maximal number of leaves, denoted by $L_G(i)$, realized by an induced subtree with $i$ vertices, for $0 \\le i \\le n$. We begin by proving that the LIS problem is NP-complete in general and then we compute the values of the map $L_G$ for some classical families of graphs and in particular for the $d$-dimensional hypercubic graphs $Q_d$, for"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.09808","kind":"arxiv","version":3},"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":"1709.09808","created_at":"2026-05-18T00:11:18.600450+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.09808v3","created_at":"2026-05-18T00:11:18.600450+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.09808","created_at":"2026-05-18T00:11:18.600450+00:00"},{"alias_kind":"pith_short_12","alias_value":"UFSUOGNXBCQG","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"UFSUOGNXBCQGTN3P","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"UFSUOGNX","created_at":"2026-05-18T12:31:46.661854+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/UFSUOGNXBCQGTN3PM47JU3BK5Q","json":"https://pith.science/pith/UFSUOGNXBCQGTN3PM47JU3BK5Q.json","graph_json":"https://pith.science/api/pith-number/UFSUOGNXBCQGTN3PM47JU3BK5Q/graph.json","events_json":"https://pith.science/api/pith-number/UFSUOGNXBCQGTN3PM47JU3BK5Q/events.json","paper":"https://pith.science/paper/UFSUOGNX"},"agent_actions":{"view_html":"https://pith.science/pith/UFSUOGNXBCQGTN3PM47JU3BK5Q","download_json":"https://pith.science/pith/UFSUOGNXBCQGTN3PM47JU3BK5Q.json","view_paper":"https://pith.science/paper/UFSUOGNX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.09808&json=true","fetch_graph":"https://pith.science/api/pith-number/UFSUOGNXBCQGTN3PM47JU3BK5Q/graph.json","fetch_events":"https://pith.science/api/pith-number/UFSUOGNXBCQGTN3PM47JU3BK5Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UFSUOGNXBCQGTN3PM47JU3BK5Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UFSUOGNXBCQGTN3PM47JU3BK5Q/action/storage_attestation","attest_author":"https://pith.science/pith/UFSUOGNXBCQGTN3PM47JU3BK5Q/action/author_attestation","sign_citation":"https://pith.science/pith/UFSUOGNXBCQGTN3PM47JU3BK5Q/action/citation_signature","submit_replication":"https://pith.science/pith/UFSUOGNXBCQGTN3PM47JU3BK5Q/action/replication_record"}},"created_at":"2026-05-18T00:11:18.600450+00:00","updated_at":"2026-05-18T00:11:18.600450+00:00"}