{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:3WWYGERWENTOSHANLQSCBBNJ5Y","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":"14964f4ef2e3fd96d7d25b71375f0f65d2aa3f72f221e11f156a78b8d34e7604","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-04-13T15:04:52Z","title_canon_sha256":"8e8a2bef51aed87a5faa8ca90f7f8357dbf13bd970e34f355213db26ec4f48a7"},"schema_version":"1.0","source":{"id":"1104.2524","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.2524","created_at":"2026-05-18T01:31:04Z"},{"alias_kind":"arxiv_version","alias_value":"1104.2524v2","created_at":"2026-05-18T01:31:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.2524","created_at":"2026-05-18T01:31:04Z"},{"alias_kind":"pith_short_12","alias_value":"3WWYGERWENTO","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"3WWYGERWENTOSHAN","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"3WWYGERW","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:c3065d5382d969a4b0ab9c8ca0e76417d387b64d68a2b5b44c6065b09966d9b1","target":"graph","created_at":"2026-05-18T01:31:04Z","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":"Every chordal graph $G$ can be represented as the intersection graph of a collection of subtrees of a host tree, a so-called {\\em tree model} of $G$. The leafage $\\ell(G)$ of a connected chordal graph $G$ is the minimum number of leaves of the host tree of a tree model of $G$. The vertex leafage $\\vl(G)$ is the smallest number $k$ such that there exists a tree model of $G$ in which every subtree has at most $k$ leaves. The leafage is a polynomially computable parameter by the result of \\cite{esa}. In this contribution, we study the vertex leafage.\n  We prove for every fixed $k\\geq 3$ that deci","authors_text":"Juraj Stacho, Steven Chaplick","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-04-13T15:04:52Z","title":"The vertex leafage of chordal graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.2524","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:2edecf9bd599a4c941b7fb185b91f49f6ca0dcf6da6741ecf0dc18027dab83ec","target":"record","created_at":"2026-05-18T01:31:04Z","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":"14964f4ef2e3fd96d7d25b71375f0f65d2aa3f72f221e11f156a78b8d34e7604","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-04-13T15:04:52Z","title_canon_sha256":"8e8a2bef51aed87a5faa8ca90f7f8357dbf13bd970e34f355213db26ec4f48a7"},"schema_version":"1.0","source":{"id":"1104.2524","kind":"arxiv","version":2}},"canonical_sha256":"ddad8312362366e91c0d5c242085a9ee2fbf0a4e9bf60902057246923438c482","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ddad8312362366e91c0d5c242085a9ee2fbf0a4e9bf60902057246923438c482","first_computed_at":"2026-05-18T01:31:04.211668Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:31:04.211668Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s1Q9hLlxlKEy6NREi+0QmIN1u9i+2e16GCnUkcjdl0HJ/j6+Z/v0Svdo1m22JD51zueGzNCMiFIyZgrxob3TBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:31:04.212278Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.2524","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2edecf9bd599a4c941b7fb185b91f49f6ca0dcf6da6741ecf0dc18027dab83ec","sha256:c3065d5382d969a4b0ab9c8ca0e76417d387b64d68a2b5b44c6065b09966d9b1"],"state_sha256":"b504d4f63b017730aa133b904577c84dd0349eb6d02081615a4c1362f7b061e1"}