{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:HQSCL7KOFCKQEJTR3Q7GGH4OIN","short_pith_number":"pith:HQSCL7KO","canonical_record":{"source":{"id":"2208.02850","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-08-04T19:01:23Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"3f97b22f34472a8a595a5f411f397d346321947610663ececec13880373e2a46","abstract_canon_sha256":"70f403fc3325ca7040aa9dfbed20f6f6f1b4b8e402d5cb2d3e2a422652b77aa1"},"schema_version":"1.0"},"canonical_sha256":"3c2425fd4e2895022671dc3e631f8e436f9fc4f07794579e6dcf356b416b1baa","source":{"kind":"arxiv","id":"2208.02850","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2208.02850","created_at":"2026-07-05T04:46:16Z"},{"alias_kind":"arxiv_version","alias_value":"2208.02850v1","created_at":"2026-07-05T04:46:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.02850","created_at":"2026-07-05T04:46:16Z"},{"alias_kind":"pith_short_12","alias_value":"HQSCL7KOFCKQ","created_at":"2026-07-05T04:46:16Z"},{"alias_kind":"pith_short_16","alias_value":"HQSCL7KOFCKQEJTR","created_at":"2026-07-05T04:46:16Z"},{"alias_kind":"pith_short_8","alias_value":"HQSCL7KO","created_at":"2026-07-05T04:46:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:HQSCL7KOFCKQEJTR3Q7GGH4OIN","target":"record","payload":{"canonical_record":{"source":{"id":"2208.02850","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-08-04T19:01:23Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"3f97b22f34472a8a595a5f411f397d346321947610663ececec13880373e2a46","abstract_canon_sha256":"70f403fc3325ca7040aa9dfbed20f6f6f1b4b8e402d5cb2d3e2a422652b77aa1"},"schema_version":"1.0"},"canonical_sha256":"3c2425fd4e2895022671dc3e631f8e436f9fc4f07794579e6dcf356b416b1baa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:46:16.375065Z","signature_b64":"fI1KQ0eZXTDi0+JtHY5T2DBgQLOdeaSk4ZgFBkxQ5xd5YCuS7sofN+Jtc8tIGy7GTVbl10mYf4NpZ1YKAu5XDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c2425fd4e2895022671dc3e631f8e436f9fc4f07794579e6dcf356b416b1baa","last_reissued_at":"2026-07-05T04:46:16.374601Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:46:16.374601Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2208.02850","source_version":1,"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:46:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"78j9NZCKMr5QUPVOjzL4ABdtseA23fwmWuGGXWy4Ce7b4K/T8cheEXwQGsDge82pC5VibBwWyAKiPrSZMrZVAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T12:44:19.854049Z"},"content_sha256":"db9bc19b6f080ae82af8e05546d6c256eb3176466d60b1251aa1404ce5376b54","schema_version":"1.0","event_id":"sha256:db9bc19b6f080ae82af8e05546d6c256eb3176466d60b1251aa1404ce5376b54"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:HQSCL7KOFCKQEJTR3Q7GGH4OIN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Domination and Cut Problems on Chordal Graphs with Bounded Leafage","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Daniel Marx, Esther Galby, Philipp Schepper, Prafullkumar Tale, Roohani Sharma","submitted_at":"2022-08-04T19:01:23Z","abstract_excerpt":"The leafage of a chordal graph G is the minimum integer l such that G can be realized as an intersection graph of subtrees of a tree with l leaves. We consider structural parameterization by the leafage of classical domination and cut problems on chordal graphs. Fomin, Golovach, and Raymond [ESA 2018, Algorithmica 2020] proved, among other things, that Dominating Set on chordal graphs admits an algorithm running in time $2^{O(l^2)} n^{O(1)}$. We present a conceptually much simpler algorithm that runs in time $2^{O(l)} n^{O(1)}$. We extend our approach to obtain similar results for Connected Do"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.02850","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2208.02850/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:46:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oBsxvsaVCBDUsKxDILZTJF0dzao/jqy5GgU8kMohytvAgq7xAT3iHoy+fJv6xVxd2myv+ggnbSJ0MQI988tMBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T12:44:19.854344Z"},"content_sha256":"6cf9c066fb41effc207dcd3ff758ba092bc46919b97844eb9dcfa42d64eb0a9d","schema_version":"1.0","event_id":"sha256:6cf9c066fb41effc207dcd3ff758ba092bc46919b97844eb9dcfa42d64eb0a9d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HQSCL7KOFCKQEJTR3Q7GGH4OIN/bundle.json","state_url":"https://pith.science/pith/HQSCL7KOFCKQEJTR3Q7GGH4OIN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HQSCL7KOFCKQEJTR3Q7GGH4OIN/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-08-17T12:44:19Z","links":{"resolver":"https://pith.science/pith/HQSCL7KOFCKQEJTR3Q7GGH4OIN","bundle":"https://pith.science/pith/HQSCL7KOFCKQEJTR3Q7GGH4OIN/bundle.json","state":"https://pith.science/pith/HQSCL7KOFCKQEJTR3Q7GGH4OIN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HQSCL7KOFCKQEJTR3Q7GGH4OIN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:HQSCL7KOFCKQEJTR3Q7GGH4OIN","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":"70f403fc3325ca7040aa9dfbed20f6f6f1b4b8e402d5cb2d3e2a422652b77aa1","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-08-04T19:01:23Z","title_canon_sha256":"3f97b22f34472a8a595a5f411f397d346321947610663ececec13880373e2a46"},"schema_version":"1.0","source":{"id":"2208.02850","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2208.02850","created_at":"2026-07-05T04:46:16Z"},{"alias_kind":"arxiv_version","alias_value":"2208.02850v1","created_at":"2026-07-05T04:46:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.02850","created_at":"2026-07-05T04:46:16Z"},{"alias_kind":"pith_short_12","alias_value":"HQSCL7KOFCKQ","created_at":"2026-07-05T04:46:16Z"},{"alias_kind":"pith_short_16","alias_value":"HQSCL7KOFCKQEJTR","created_at":"2026-07-05T04:46:16Z"},{"alias_kind":"pith_short_8","alias_value":"HQSCL7KO","created_at":"2026-07-05T04:46:16Z"}],"graph_snapshots":[{"event_id":"sha256:6cf9c066fb41effc207dcd3ff758ba092bc46919b97844eb9dcfa42d64eb0a9d","target":"graph","created_at":"2026-07-05T04:46:16Z","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/2208.02850/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The leafage of a chordal graph G is the minimum integer l such that G can be realized as an intersection graph of subtrees of a tree with l leaves. We consider structural parameterization by the leafage of classical domination and cut problems on chordal graphs. Fomin, Golovach, and Raymond [ESA 2018, Algorithmica 2020] proved, among other things, that Dominating Set on chordal graphs admits an algorithm running in time $2^{O(l^2)} n^{O(1)}$. We present a conceptually much simpler algorithm that runs in time $2^{O(l)} n^{O(1)}$. We extend our approach to obtain similar results for Connected Do","authors_text":"Daniel Marx, Esther Galby, Philipp Schepper, Prafullkumar Tale, Roohani Sharma","cross_cats":["cs.CC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-08-04T19:01:23Z","title":"Domination and Cut Problems on Chordal Graphs with Bounded Leafage"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.02850","kind":"arxiv","version":1},"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:db9bc19b6f080ae82af8e05546d6c256eb3176466d60b1251aa1404ce5376b54","target":"record","created_at":"2026-07-05T04:46:16Z","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":"70f403fc3325ca7040aa9dfbed20f6f6f1b4b8e402d5cb2d3e2a422652b77aa1","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-08-04T19:01:23Z","title_canon_sha256":"3f97b22f34472a8a595a5f411f397d346321947610663ececec13880373e2a46"},"schema_version":"1.0","source":{"id":"2208.02850","kind":"arxiv","version":1}},"canonical_sha256":"3c2425fd4e2895022671dc3e631f8e436f9fc4f07794579e6dcf356b416b1baa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3c2425fd4e2895022671dc3e631f8e436f9fc4f07794579e6dcf356b416b1baa","first_computed_at":"2026-07-05T04:46:16.374601Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:46:16.374601Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fI1KQ0eZXTDi0+JtHY5T2DBgQLOdeaSk4ZgFBkxQ5xd5YCuS7sofN+Jtc8tIGy7GTVbl10mYf4NpZ1YKAu5XDg==","signature_status":"signed_v1","signed_at":"2026-07-05T04:46:16.375065Z","signed_message":"canonical_sha256_bytes"},"source_id":"2208.02850","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:db9bc19b6f080ae82af8e05546d6c256eb3176466d60b1251aa1404ce5376b54","sha256:6cf9c066fb41effc207dcd3ff758ba092bc46919b97844eb9dcfa42d64eb0a9d"],"state_sha256":"91d547d6bb85fa3ef06fd00c5add3c0a4d45464f8dc8c190b0629d8048b28596"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"01sApgPfXd5V6izYmn5YNTBneMS7e5R0TQCiGRiIx8XV9iGBeKFhAL9Ty7I3LLE1hO+5n6OH4DqBqwfJqO1tCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T12:44:19.856903Z","bundle_sha256":"aa66511dac2fd000ee6db19255f09fae03e8d48f8bf1756fa9df08964fe464c5"}}