{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:CPRUU7ZB4L3POLJ65HPM3DYCLK","short_pith_number":"pith:CPRUU7ZB","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"},"canonical_sha256":"13e34a7f21e2f6f72d3ee9decd8f025a84044655a9979e26137b7cfbb55c43ea","source":{"kind":"arxiv","id":"2105.12407","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2105.12407","created_at":"2026-07-05T04:03:11Z"},{"alias_kind":"arxiv_version","alias_value":"2105.12407v2","created_at":"2026-07-05T04:03:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.12407","created_at":"2026-07-05T04:03:11Z"},{"alias_kind":"pith_short_12","alias_value":"CPRUU7ZB4L3P","created_at":"2026-07-05T04:03:11Z"},{"alias_kind":"pith_short_16","alias_value":"CPRUU7ZB4L3POLJ6","created_at":"2026-07-05T04:03:11Z"},{"alias_kind":"pith_short_8","alias_value":"CPRUU7ZB","created_at":"2026-07-05T04:03:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:CPRUU7ZB4L3POLJ65HPM3DYCLK","target":"record","payload":{"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"},"canonical_sha256":"13e34a7f21e2f6f72d3ee9decd8f025a84044655a9979e26137b7cfbb55c43ea","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"},"source_kind":"arxiv","source_id":"2105.12407","source_version":2,"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-07-05T04:03:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZhLQuPd6G3yjmKhmNFnuqrfwqFq5LojpclLeXnzg5UqVkATaiwZYtA/UW3SJdjJ2EsZZDxwYymoglPGNdLMvCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T04:53:48.620644Z"},"content_sha256":"6568dd2753e525326155f646b7bb312c491afce7dadc1492e2c78881f996a572","schema_version":"1.0","event_id":"sha256:6568dd2753e525326155f646b7bb312c491afce7dadc1492e2c78881f996a572"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:CPRUU7ZB4L3POLJ65HPM3DYCLK","target":"graph","payload":{"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"},"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-07-05T04:03:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I7tu1o4UrzW8Nh4h69ANrrS8k/n1A7L9vWjPf7C66Tdj3jOaV2moddBw33c2JEA6WUfUDPlxX7yRcBAj3fZ0CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T04:53:48.621048Z"},"content_sha256":"b0366106820e292076d9d62d7c8cf0ac2216bd2b5d83c1404e1a6510130d4ba3","schema_version":"1.0","event_id":"sha256:b0366106820e292076d9d62d7c8cf0ac2216bd2b5d83c1404e1a6510130d4ba3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CPRUU7ZB4L3POLJ65HPM3DYCLK/bundle.json","state_url":"https://pith.science/pith/CPRUU7ZB4L3POLJ65HPM3DYCLK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CPRUU7ZB4L3POLJ65HPM3DYCLK/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-07-09T04:53:48Z","links":{"resolver":"https://pith.science/pith/CPRUU7ZB4L3POLJ65HPM3DYCLK","bundle":"https://pith.science/pith/CPRUU7ZB4L3POLJ65HPM3DYCLK/bundle.json","state":"https://pith.science/pith/CPRUU7ZB4L3POLJ65HPM3DYCLK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CPRUU7ZB4L3POLJ65HPM3DYCLK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:CPRUU7ZB4L3POLJ65HPM3DYCLK","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":"31bb3f8285d965afc5ea7416e81dde8960f4192c7d3bd16cba2706fa72e5c2f6","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-05-26T09:02:09Z","title_canon_sha256":"f9386ad00aac0ddda8db5ee3d418ee66d80be6a51607d434888f14f8b602dd96"},"schema_version":"1.0","source":{"id":"2105.12407","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2105.12407","created_at":"2026-07-05T04:03:11Z"},{"alias_kind":"arxiv_version","alias_value":"2105.12407v2","created_at":"2026-07-05T04:03:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.12407","created_at":"2026-07-05T04:03:11Z"},{"alias_kind":"pith_short_12","alias_value":"CPRUU7ZB4L3P","created_at":"2026-07-05T04:03:11Z"},{"alias_kind":"pith_short_16","alias_value":"CPRUU7ZB4L3POLJ6","created_at":"2026-07-05T04:03:11Z"},{"alias_kind":"pith_short_8","alias_value":"CPRUU7ZB","created_at":"2026-07-05T04:03:11Z"}],"graph_snapshots":[{"event_id":"sha256:b0366106820e292076d9d62d7c8cf0ac2216bd2b5d83c1404e1a6510130d4ba3","target":"graph","created_at":"2026-07-05T04:03:11Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2105.12407/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Benjamin Bergougnoux, Jan Arne Telle, Martin Vatshelle, Svein H{\\o}gemo","cross_cats":["math.CO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-05-26T09:02:09Z","title":"Recognition of Linear and Star Variants of Leaf Powers is in P"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.12407","kind":"arxiv","version":2},"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:6568dd2753e525326155f646b7bb312c491afce7dadc1492e2c78881f996a572","target":"record","created_at":"2026-07-05T04:03:11Z","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":"31bb3f8285d965afc5ea7416e81dde8960f4192c7d3bd16cba2706fa72e5c2f6","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-05-26T09:02:09Z","title_canon_sha256":"f9386ad00aac0ddda8db5ee3d418ee66d80be6a51607d434888f14f8b602dd96"},"schema_version":"1.0","source":{"id":"2105.12407","kind":"arxiv","version":2}},"canonical_sha256":"13e34a7f21e2f6f72d3ee9decd8f025a84044655a9979e26137b7cfbb55c43ea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"13e34a7f21e2f6f72d3ee9decd8f025a84044655a9979e26137b7cfbb55c43ea","first_computed_at":"2026-07-05T04:03:11.528870Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:03:11.528870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eWZBzjFMu2B/jJGSlXQzWi5ZaD0WwI8+vD6SoXN3OQNcFqGw8pFm1rKqGD45c08/DQ/VNa3qYGRm7tSlyzbpAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T04:03:11.529282Z","signed_message":"canonical_sha256_bytes"},"source_id":"2105.12407","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6568dd2753e525326155f646b7bb312c491afce7dadc1492e2c78881f996a572","sha256:b0366106820e292076d9d62d7c8cf0ac2216bd2b5d83c1404e1a6510130d4ba3"],"state_sha256":"aaabaa01a769ea172802acd8285bb49a91b1ec610704bd273762f0cff94b3194"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GVOiN4GWnacDiKzYLrVfZOUzkGkdvAjARLQKfR4V9YFauwpbz+/Jcgx5nJJbQdVp9fN9aR5JBMVVc4PnBjE1Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-09T04:53:48.623162Z","bundle_sha256":"98288ce2ae7468bae85f2f7023db4963a9848f9dc3565c6904d769f256061482"}}