{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:CPRUU7ZB4L3POLJ65HPM3DYCLK","short_pith_number":"pith:CPRUU7ZB","schema_version":"1.0","canonical_sha256":"13e34a7f21e2f6f72d3ee9decd8f025a84044655a9979e26137b7cfbb55c43ea","source":{"kind":"arxiv","id":"2105.12407","version":2},"attestation_state":"computed","paper":{"title":"Recognition of Linear and Star Variants of Leaf Powers is in P","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Benjamin Bergougnoux, Jan Arne Telle, Martin Vatshelle, Svein H{\\o}gemo","submitted_at":"2021-05-26T09:02:09Z","abstract_excerpt":"A $k$-leaf power of a tree $T$ is a graph $G$ whose vertices are the leaves of $T$ and whose edges connect pairs of leaves whose distance in $T$ is at most $k$. A graph is a leaf power if it is a $k$-leaf power for some $k$. Over 20 years ago, Nishimura et al. [J. Algorithms, 2002] asked if recognition of leaf powers was in P. Recently, Lafond [SODA 2022] showed an XP algorithm when parameterized by $k$, while leaving the main question open. In this paper, we explore this question from the perspective of two alternative models of leaf powers, showing that both a linear and a star variant of le"},"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":"2105.12407","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-05-26T09:02:09Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"f9386ad00aac0ddda8db5ee3d418ee66d80be6a51607d434888f14f8b602dd96","abstract_canon_sha256":"31bb3f8285d965afc5ea7416e81dde8960f4192c7d3bd16cba2706fa72e5c2f6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:03:11.529282Z","signature_b64":"eWZBzjFMu2B/jJGSlXQzWi5ZaD0WwI8+vD6SoXN3OQNcFqGw8pFm1rKqGD45c08/DQ/VNa3qYGRm7tSlyzbpAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"13e34a7f21e2f6f72d3ee9decd8f025a84044655a9979e26137b7cfbb55c43ea","last_reissued_at":"2026-07-05T04:03:11.528870Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:03:11.528870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Recognition of Linear and Star Variants of Leaf Powers is in P","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Benjamin Bergougnoux, Jan Arne Telle, Martin Vatshelle, Svein H{\\o}gemo","submitted_at":"2021-05-26T09:02:09Z","abstract_excerpt":"A $k$-leaf power of a tree $T$ is a graph $G$ whose vertices are the leaves of $T$ and whose edges connect pairs of leaves whose distance in $T$ is at most $k$. A graph is a leaf power if it is a $k$-leaf power for some $k$. Over 20 years ago, Nishimura et al. [J. Algorithms, 2002] asked if recognition of leaf powers was in P. Recently, Lafond [SODA 2022] showed an XP algorithm when parameterized by $k$, while leaving the main question open. In this paper, we explore this question from the perspective of two alternative models of leaf powers, showing that both a linear and a star variant of le"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.12407","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2105.12407/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2105.12407","created_at":"2026-07-05T04:03:11.528926+00:00"},{"alias_kind":"arxiv_version","alias_value":"2105.12407v2","created_at":"2026-07-05T04:03:11.528926+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.12407","created_at":"2026-07-05T04:03:11.528926+00:00"},{"alias_kind":"pith_short_12","alias_value":"CPRUU7ZB4L3P","created_at":"2026-07-05T04:03:11.528926+00:00"},{"alias_kind":"pith_short_16","alias_value":"CPRUU7ZB4L3POLJ6","created_at":"2026-07-05T04:03:11.528926+00:00"},{"alias_kind":"pith_short_8","alias_value":"CPRUU7ZB","created_at":"2026-07-05T04:03:11.528926+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/CPRUU7ZB4L3POLJ65HPM3DYCLK","json":"https://pith.science/pith/CPRUU7ZB4L3POLJ65HPM3DYCLK.json","graph_json":"https://pith.science/api/pith-number/CPRUU7ZB4L3POLJ65HPM3DYCLK/graph.json","events_json":"https://pith.science/api/pith-number/CPRUU7ZB4L3POLJ65HPM3DYCLK/events.json","paper":"https://pith.science/paper/CPRUU7ZB"},"agent_actions":{"view_html":"https://pith.science/pith/CPRUU7ZB4L3POLJ65HPM3DYCLK","download_json":"https://pith.science/pith/CPRUU7ZB4L3POLJ65HPM3DYCLK.json","view_paper":"https://pith.science/paper/CPRUU7ZB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2105.12407&json=true","fetch_graph":"https://pith.science/api/pith-number/CPRUU7ZB4L3POLJ65HPM3DYCLK/graph.json","fetch_events":"https://pith.science/api/pith-number/CPRUU7ZB4L3POLJ65HPM3DYCLK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CPRUU7ZB4L3POLJ65HPM3DYCLK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CPRUU7ZB4L3POLJ65HPM3DYCLK/action/storage_attestation","attest_author":"https://pith.science/pith/CPRUU7ZB4L3POLJ65HPM3DYCLK/action/author_attestation","sign_citation":"https://pith.science/pith/CPRUU7ZB4L3POLJ65HPM3DYCLK/action/citation_signature","submit_replication":"https://pith.science/pith/CPRUU7ZB4L3POLJ65HPM3DYCLK/action/replication_record"}},"created_at":"2026-07-05T04:03:11.528926+00:00","updated_at":"2026-07-05T04:03:11.528926+00:00"}