{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:K5EQRBSNCLO7KKPMD7K3QUSM4V","short_pith_number":"pith:K5EQRBSN","canonical_record":{"source":{"id":"2606.04572","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-06-03T08:04:16Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"0cacf2052a381c06e00ec7b62803dbde75a1ab76071fdae8175afa6cb964f373","abstract_canon_sha256":"ed9b8a129a190e03a8033f68c855b4999951766dd31670c822e938290a19a421"},"schema_version":"1.0"},"canonical_sha256":"574908864d12ddf529ec1fd5b8524ce5530527eeb7694104433ad1af7e6ece84","source":{"kind":"arxiv","id":"2606.04572","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.04572","created_at":"2026-06-04T01:09:18Z"},{"alias_kind":"arxiv_version","alias_value":"2606.04572v1","created_at":"2026-06-04T01:09:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.04572","created_at":"2026-06-04T01:09:18Z"},{"alias_kind":"pith_short_12","alias_value":"K5EQRBSNCLO7","created_at":"2026-06-04T01:09:18Z"},{"alias_kind":"pith_short_16","alias_value":"K5EQRBSNCLO7KKPM","created_at":"2026-06-04T01:09:18Z"},{"alias_kind":"pith_short_8","alias_value":"K5EQRBSN","created_at":"2026-06-04T01:09:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:K5EQRBSNCLO7KKPMD7K3QUSM4V","target":"record","payload":{"canonical_record":{"source":{"id":"2606.04572","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-06-03T08:04:16Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"0cacf2052a381c06e00ec7b62803dbde75a1ab76071fdae8175afa6cb964f373","abstract_canon_sha256":"ed9b8a129a190e03a8033f68c855b4999951766dd31670c822e938290a19a421"},"schema_version":"1.0"},"canonical_sha256":"574908864d12ddf529ec1fd5b8524ce5530527eeb7694104433ad1af7e6ece84","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-04T01:09:18.732635Z","signature_b64":"xG/k46mHqAscg75Ufxjwr/icndGPTBPPXtphJja34Din8klY+ZWEFzYZQGBSYWlyINH1TmnH6iYbYRnnkDCtDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"574908864d12ddf529ec1fd5b8524ce5530527eeb7694104433ad1af7e6ece84","last_reissued_at":"2026-06-04T01:09:18.731777Z","signature_status":"signed_v1","first_computed_at":"2026-06-04T01:09:18.731777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.04572","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-06-04T01:09:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dFIbqj8AxaIau4Gme9U8FuguoEQqTP+leaJbGMvCkHGdC18FrIkeX4FPdrxmOHcOn1yg7fSL+6dl5reqh7SYDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T18:08:07.238211Z"},"content_sha256":"117730f7faf7d55127188c4a818c1e8eeaaa040ed4a1e69ad8c57c440e90cbdf","schema_version":"1.0","event_id":"sha256:117730f7faf7d55127188c4a818c1e8eeaaa040ed4a1e69ad8c57c440e90cbdf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:K5EQRBSNCLO7KKPMD7K3QUSM4V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Independence and Domination on Bounded-Treewidth Graphs: Integer, Rational, and Irrational Distances","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"D\\'aniel Marx, Tim A. Hartmann","submitted_at":"2026-06-03T08:04:16Z","abstract_excerpt":"The distance-d variants of Independent Set and Dominating Set problems have been extensively studied from different algorithmic viewpoints. In particular, the complexity of these problems are well understood on bounded-treewidth graphs [Katsikarelis, Lampis, and Paschos, Discret. Appl. Math 2022][Borradaile and Le, IPEC 2016]: given a tree decomposition of width t, the two problems can be solved in time $d^t \\cdot n^{O(1)}$ and $(2d + 1)t \\cdot n^{O(1)}$, respectively. Furthermore, assuming the Strong Exponential-Time Hypothesis (SETH), the base constants are best possible in these running tim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.04572","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/2606.04572/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-06-04T01:09:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eRxPxBLea7KObeVBpRKFZGQScnmJTlnxrvhKHzzGxJnlctdMceNBWuTP3rSl7K25jqZSOaprCLBI33SCDhopDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T18:08:07.238618Z"},"content_sha256":"bb4e7f6495aedaf68d204bae995a3545f402711c330cff2c26acb386685aa105","schema_version":"1.0","event_id":"sha256:bb4e7f6495aedaf68d204bae995a3545f402711c330cff2c26acb386685aa105"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K5EQRBSNCLO7KKPMD7K3QUSM4V/bundle.json","state_url":"https://pith.science/pith/K5EQRBSNCLO7KKPMD7K3QUSM4V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K5EQRBSNCLO7KKPMD7K3QUSM4V/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-06-21T18:08:07Z","links":{"resolver":"https://pith.science/pith/K5EQRBSNCLO7KKPMD7K3QUSM4V","bundle":"https://pith.science/pith/K5EQRBSNCLO7KKPMD7K3QUSM4V/bundle.json","state":"https://pith.science/pith/K5EQRBSNCLO7KKPMD7K3QUSM4V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K5EQRBSNCLO7KKPMD7K3QUSM4V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:K5EQRBSNCLO7KKPMD7K3QUSM4V","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":"ed9b8a129a190e03a8033f68c855b4999951766dd31670c822e938290a19a421","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-06-03T08:04:16Z","title_canon_sha256":"0cacf2052a381c06e00ec7b62803dbde75a1ab76071fdae8175afa6cb964f373"},"schema_version":"1.0","source":{"id":"2606.04572","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.04572","created_at":"2026-06-04T01:09:18Z"},{"alias_kind":"arxiv_version","alias_value":"2606.04572v1","created_at":"2026-06-04T01:09:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.04572","created_at":"2026-06-04T01:09:18Z"},{"alias_kind":"pith_short_12","alias_value":"K5EQRBSNCLO7","created_at":"2026-06-04T01:09:18Z"},{"alias_kind":"pith_short_16","alias_value":"K5EQRBSNCLO7KKPM","created_at":"2026-06-04T01:09:18Z"},{"alias_kind":"pith_short_8","alias_value":"K5EQRBSN","created_at":"2026-06-04T01:09:18Z"}],"graph_snapshots":[{"event_id":"sha256:bb4e7f6495aedaf68d204bae995a3545f402711c330cff2c26acb386685aa105","target":"graph","created_at":"2026-06-04T01:09:18Z","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/2606.04572/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The distance-d variants of Independent Set and Dominating Set problems have been extensively studied from different algorithmic viewpoints. In particular, the complexity of these problems are well understood on bounded-treewidth graphs [Katsikarelis, Lampis, and Paschos, Discret. Appl. Math 2022][Borradaile and Le, IPEC 2016]: given a tree decomposition of width t, the two problems can be solved in time $d^t \\cdot n^{O(1)}$ and $(2d + 1)t \\cdot n^{O(1)}$, respectively. Furthermore, assuming the Strong Exponential-Time Hypothesis (SETH), the base constants are best possible in these running tim","authors_text":"D\\'aniel Marx, Tim A. Hartmann","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-06-03T08:04:16Z","title":"Independence and Domination on Bounded-Treewidth Graphs: Integer, Rational, and Irrational Distances"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.04572","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:117730f7faf7d55127188c4a818c1e8eeaaa040ed4a1e69ad8c57c440e90cbdf","target":"record","created_at":"2026-06-04T01:09:18Z","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":"ed9b8a129a190e03a8033f68c855b4999951766dd31670c822e938290a19a421","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-06-03T08:04:16Z","title_canon_sha256":"0cacf2052a381c06e00ec7b62803dbde75a1ab76071fdae8175afa6cb964f373"},"schema_version":"1.0","source":{"id":"2606.04572","kind":"arxiv","version":1}},"canonical_sha256":"574908864d12ddf529ec1fd5b8524ce5530527eeb7694104433ad1af7e6ece84","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"574908864d12ddf529ec1fd5b8524ce5530527eeb7694104433ad1af7e6ece84","first_computed_at":"2026-06-04T01:09:18.731777Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-04T01:09:18.731777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xG/k46mHqAscg75Ufxjwr/icndGPTBPPXtphJja34Din8klY+ZWEFzYZQGBSYWlyINH1TmnH6iYbYRnnkDCtDA==","signature_status":"signed_v1","signed_at":"2026-06-04T01:09:18.732635Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.04572","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:117730f7faf7d55127188c4a818c1e8eeaaa040ed4a1e69ad8c57c440e90cbdf","sha256:bb4e7f6495aedaf68d204bae995a3545f402711c330cff2c26acb386685aa105"],"state_sha256":"ccb0f42b1bfd10d8b887423317e6d3b0438fac7292f5468d84d586612ad2e625"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vGuikQFEJJGpqBTneO9TWmaKSMxH37Tnve4BsQtYuAUlD2MVC7dXwvgRfp3JO25nbKkJdAX4Lc4O22wQ8ipeBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T18:08:07.240752Z","bundle_sha256":"4f19c437375de254bb7239bfe58ae340fd2814af32f3c4911b6aad1985c14eac"}}