{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:UFSUOGNXBCQGTN3PM47JU3BK5Q","short_pith_number":"pith:UFSUOGNX","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"},"canonical_sha256":"a1654719b708a069b76f673e9a6c2aec32e9e35c54636144d27cccca7098fc7b","source":{"kind":"arxiv","id":"1709.09808","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:UFSUOGNXBCQGTN3PM47JU3BK5Q","target":"record","payload":{"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"},"canonical_sha256":"a1654719b708a069b76f673e9a6c2aec32e9e35c54636144d27cccca7098fc7b","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"},"source_kind":"arxiv","source_id":"1709.09808","source_version":3,"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:11:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rv9O+EK7qZQExzCDwVyUSsw9dpG4zt9x5PKVt9q7slwleckyZI6IKQOxe8nAfdqXYsUUND04LrqRRSxV1GnOAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T18:32:30.152328Z"},"content_sha256":"77f6749deb447c95cd4525d97a12e2c249d1f26236ba7b53073f43012f9b95db","schema_version":"1.0","event_id":"sha256:77f6749deb447c95cd4525d97a12e2c249d1f26236ba7b53073f43012f9b95db"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:UFSUOGNXBCQGTN3PM47JU3BK5Q","target":"graph","payload":{"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"},"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:11:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fy+NVBM45OSuCXdUT1Uuly9FVEU/uG+yJgpfes4J1NCEZbKB1U8b3LoDGl3RnarQZirmON7GR/okBV0x3WlVCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T18:32:30.152924Z"},"content_sha256":"ae68e1eda563449efcf680ff58a1d5eafcf44ea3eaf1e0967172d4b263ab7216","schema_version":"1.0","event_id":"sha256:ae68e1eda563449efcf680ff58a1d5eafcf44ea3eaf1e0967172d4b263ab7216"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UFSUOGNXBCQGTN3PM47JU3BK5Q/bundle.json","state_url":"https://pith.science/pith/UFSUOGNXBCQGTN3PM47JU3BK5Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UFSUOGNXBCQGTN3PM47JU3BK5Q/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-05T18:32:30Z","links":{"resolver":"https://pith.science/pith/UFSUOGNXBCQGTN3PM47JU3BK5Q","bundle":"https://pith.science/pith/UFSUOGNXBCQGTN3PM47JU3BK5Q/bundle.json","state":"https://pith.science/pith/UFSUOGNXBCQGTN3PM47JU3BK5Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UFSUOGNXBCQGTN3PM47JU3BK5Q/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"osd/Ga6G6hrXilqeZZh2rfA+XyiwYmYWCukC5e7YNgppcFffSkmNHnO42W51k/x56RLkPRi376VxxalwgTucBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T18:32:30.155807Z","bundle_sha256":"d175d2fce576efed5ec3a9d3734d914c5f9433ffac630a2db5c35dd1bc271176"}}