{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:N4NZ3VNCJTF22CC37XTNSL6RNZ","short_pith_number":"pith:N4NZ3VNC","schema_version":"1.0","canonical_sha256":"6f1b9dd5a24ccbad085bfde6d92fd16e6711573a30b0015b9933c7e61898c32e","source":{"kind":"arxiv","id":"1402.1425","version":1},"attestation_state":"computed","paper":{"title":"Towards a Characterization of Leaf Powers by Clique Arrangements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Christian Rosenke, Ragnar Nevries","submitted_at":"2014-02-06T17:35:18Z","abstract_excerpt":"The class ${\\cal L}_k$ of $k$-leaf powers consists of graphs $G=(V,E)$ that have a $k$-leaf root, that is, a tree $T$ with leaf set $V$, where $xy \\in E$, if and only if the $T$-distance between $x$ and $y$ is at most $k$. Structure and linear time recognition algorithms have been found for $2$-, $3$-, $4$-, and, to some extent, $5$-leaf powers, and it is known that the union of all $k$-leaf powers, that is, the graph class ${\\cal L} = \\bigcup_{k=2}^\\infty {\\cal L}_k$, forms a proper subclass of strongly chordal graphs. Despite from that, no essential progress has been made lately. In this pap"},"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":"1402.1425","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-02-06T17:35:18Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"ae15f1c3c04290c9ae8f6cdf0f7e836c7414ad3877542bf6fef0f36c79da9162","abstract_canon_sha256":"32b6c04aafb0ba72d266a861dbc9ae44a74a0edc7688a3edddf9bac4a47af05c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:59:49.200012Z","signature_b64":"AbSszRmyAlqRJX6LwC7RDSm6IhxTudkV5OfTXWbN1NxUQ6XIiobQlWWJmqeUXDEeIalI8EAUNNqba+Kk8fZfAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f1b9dd5a24ccbad085bfde6d92fd16e6711573a30b0015b9933c7e61898c32e","last_reissued_at":"2026-05-18T02:59:49.199082Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:59:49.199082Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards a Characterization of Leaf Powers by Clique Arrangements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Christian Rosenke, Ragnar Nevries","submitted_at":"2014-02-06T17:35:18Z","abstract_excerpt":"The class ${\\cal L}_k$ of $k$-leaf powers consists of graphs $G=(V,E)$ that have a $k$-leaf root, that is, a tree $T$ with leaf set $V$, where $xy \\in E$, if and only if the $T$-distance between $x$ and $y$ is at most $k$. Structure and linear time recognition algorithms have been found for $2$-, $3$-, $4$-, and, to some extent, $5$-leaf powers, and it is known that the union of all $k$-leaf powers, that is, the graph class ${\\cal L} = \\bigcup_{k=2}^\\infty {\\cal L}_k$, forms a proper subclass of strongly chordal graphs. Despite from that, no essential progress has been made lately. In this pap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.1425","kind":"arxiv","version":1},"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":"1402.1425","created_at":"2026-05-18T02:59:49.199229+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.1425v1","created_at":"2026-05-18T02:59:49.199229+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.1425","created_at":"2026-05-18T02:59:49.199229+00:00"},{"alias_kind":"pith_short_12","alias_value":"N4NZ3VNCJTF2","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"N4NZ3VNCJTF22CC3","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"N4NZ3VNC","created_at":"2026-05-18T12:28:41.024544+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/N4NZ3VNCJTF22CC37XTNSL6RNZ","json":"https://pith.science/pith/N4NZ3VNCJTF22CC37XTNSL6RNZ.json","graph_json":"https://pith.science/api/pith-number/N4NZ3VNCJTF22CC37XTNSL6RNZ/graph.json","events_json":"https://pith.science/api/pith-number/N4NZ3VNCJTF22CC37XTNSL6RNZ/events.json","paper":"https://pith.science/paper/N4NZ3VNC"},"agent_actions":{"view_html":"https://pith.science/pith/N4NZ3VNCJTF22CC37XTNSL6RNZ","download_json":"https://pith.science/pith/N4NZ3VNCJTF22CC37XTNSL6RNZ.json","view_paper":"https://pith.science/paper/N4NZ3VNC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.1425&json=true","fetch_graph":"https://pith.science/api/pith-number/N4NZ3VNCJTF22CC37XTNSL6RNZ/graph.json","fetch_events":"https://pith.science/api/pith-number/N4NZ3VNCJTF22CC37XTNSL6RNZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N4NZ3VNCJTF22CC37XTNSL6RNZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N4NZ3VNCJTF22CC37XTNSL6RNZ/action/storage_attestation","attest_author":"https://pith.science/pith/N4NZ3VNCJTF22CC37XTNSL6RNZ/action/author_attestation","sign_citation":"https://pith.science/pith/N4NZ3VNCJTF22CC37XTNSL6RNZ/action/citation_signature","submit_replication":"https://pith.science/pith/N4NZ3VNCJTF22CC37XTNSL6RNZ/action/replication_record"}},"created_at":"2026-05-18T02:59:49.199229+00:00","updated_at":"2026-05-18T02:59:49.199229+00:00"}