{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:UFSUOGNXBCQGTN3PM47JU3BK5Q","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":"0e500af11384bf793b8b416e821fbbf48e5c19e16f194f7af87e370c7bfeecbc","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-28T05:29:51Z","title_canon_sha256":"ab354da1fc58f0701f0a59b5b92fe7b7c2d55c7688917acffeebcec1e2f73c54"},"schema_version":"1.0","source":{"id":"1709.09808","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.09808","created_at":"2026-05-18T00:11:18Z"},{"alias_kind":"arxiv_version","alias_value":"1709.09808v3","created_at":"2026-05-18T00:11:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.09808","created_at":"2026-05-18T00:11:18Z"},{"alias_kind":"pith_short_12","alias_value":"UFSUOGNXBCQG","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"UFSUOGNXBCQGTN3P","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"UFSUOGNX","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:ae68e1eda563449efcf680ff58a1d5eafcf44ea3eaf1e0967172d4b263ab7216","target":"graph","created_at":"2026-05-18T00:11:18Z","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":"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","authors_text":"Alain Goupil, Alexandre Blondin Mass\\'e, \\'Elise Vandomme, \\'Emile Nadeau, Julien de Carufel, M\\'elodie Lapointe","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-28T05:29:51Z","title":"Fully leafed induced subtrees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.09808","kind":"arxiv","version":3},"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:77f6749deb447c95cd4525d97a12e2c249d1f26236ba7b53073f43012f9b95db","target":"record","created_at":"2026-05-18T00:11:18Z","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":"0e500af11384bf793b8b416e821fbbf48e5c19e16f194f7af87e370c7bfeecbc","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-28T05:29:51Z","title_canon_sha256":"ab354da1fc58f0701f0a59b5b92fe7b7c2d55c7688917acffeebcec1e2f73c54"},"schema_version":"1.0","source":{"id":"1709.09808","kind":"arxiv","version":3}},"canonical_sha256":"a1654719b708a069b76f673e9a6c2aec32e9e35c54636144d27cccca7098fc7b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a1654719b708a069b76f673e9a6c2aec32e9e35c54636144d27cccca7098fc7b","first_computed_at":"2026-05-18T00:11:18.600305Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:18.600305Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OwR0kPyv2MUfLF3j9A118bORaX5y2YqxsA17q2DwvUIMnZpXAfkIfqlb4x5W4gtW7PPFaOIO5SiezFCVrA7UAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:18.601082Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.09808","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:77f6749deb447c95cd4525d97a12e2c249d1f26236ba7b53073f43012f9b95db","sha256:ae68e1eda563449efcf680ff58a1d5eafcf44ea3eaf1e0967172d4b263ab7216"],"state_sha256":"45c2796e75c66a1239e23f3b28b8650e132c33fa4f6f72445f7eac55e01f07ef"}