{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:LMJZIC46BMCWFKH47ENEETWSZO","short_pith_number":"pith:LMJZIC46","canonical_record":{"source":{"id":"1803.03514","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-03-09T14:01:46Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"efb490e953a256be609b09eed664f5ac4d2ce3f369713ee48e67dc4637f1830c","abstract_canon_sha256":"07af33d1d6e73f5cb72fe4697226d9ccfb1ae61f837bfdb06b872b2168a50c44"},"schema_version":"1.0"},"canonical_sha256":"5b13940b9e0b0562a8fcf91a424ed2cb9b5953c8d546dd0efc7573426c6bfb84","source":{"kind":"arxiv","id":"1803.03514","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.03514","created_at":"2026-05-18T00:10:59Z"},{"alias_kind":"arxiv_version","alias_value":"1803.03514v2","created_at":"2026-05-18T00:10:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.03514","created_at":"2026-05-18T00:10:59Z"},{"alias_kind":"pith_short_12","alias_value":"LMJZIC46BMCW","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LMJZIC46BMCWFKH4","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LMJZIC46","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:LMJZIC46BMCWFKH47ENEETWSZO","target":"record","payload":{"canonical_record":{"source":{"id":"1803.03514","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-03-09T14:01:46Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"efb490e953a256be609b09eed664f5ac4d2ce3f369713ee48e67dc4637f1830c","abstract_canon_sha256":"07af33d1d6e73f5cb72fe4697226d9ccfb1ae61f837bfdb06b872b2168a50c44"},"schema_version":"1.0"},"canonical_sha256":"5b13940b9e0b0562a8fcf91a424ed2cb9b5953c8d546dd0efc7573426c6bfb84","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:59.883107Z","signature_b64":"C5KeRpHXxKan5h/BlzGUH1DB2R6nOZlCE/BeuuNO+UNDMl9BsXJZJHRbSlxsM4dccZgLI5jg/SkbzN3EIVrPCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b13940b9e0b0562a8fcf91a424ed2cb9b5953c8d546dd0efc7573426c6bfb84","last_reissued_at":"2026-05-18T00:10:59.882356Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:59.882356Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.03514","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-05-18T00:10:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XLKEC7OQUYmH3+03Qt5MuAAsZJ0BuOVEE37QGKDySZyRG2hjGIw9drLiWFSTPryfdasBtFsuR07GmfArnZnpAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T14:52:49.561299Z"},"content_sha256":"33d83b2e2f65b165c6d8bc3f79ef67ca691f6197df99ca6367dc451ce8803213","schema_version":"1.0","event_id":"sha256:33d83b2e2f65b165c6d8bc3f79ef67ca691f6197df99ca6367dc451ce8803213"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:LMJZIC46BMCWFKH47ENEETWSZO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generalized distance domination problems and their complexity on graphs of bounded mim-width","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CC","authors_text":"Jan Arne Telle, Lars Jaffke, O-joung Kwon, Torstein J. F. Str{\\o}mme","submitted_at":"2018-03-09T14:01:46Z","abstract_excerpt":"We generalize the family of $(\\sigma, \\rho)$-problems and locally checkable vertex partition problems to their distance versions, which naturally captures well-known problems such as distance-$r$ dominating set and distance-$r$ independent set. We show that these distance problems are XP parameterized by the structural parameter mim-width, and hence polynomial on graph classes where mim-width is bounded and quickly computable, such as $k$-trapezoid graphs, Dilworth $k$-graphs, (circular) permutation graphs, interval graphs and their complements, convex graphs and their complements, $k$-polygon"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.03514","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":""},"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-05-18T00:10:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wq+tdqSvMQ+/cABWLSRNsPSPcxPftXleZSeToNURLoAQK7fcpXkcEl9zD5zb/9gC6KlcYxzEUpyh5So1EY/vCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T14:52:49.561661Z"},"content_sha256":"fb2280b28c99b22f4969340e1e777d851dfdc8e04df63dfbceaa0e4dc5145e18","schema_version":"1.0","event_id":"sha256:fb2280b28c99b22f4969340e1e777d851dfdc8e04df63dfbceaa0e4dc5145e18"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LMJZIC46BMCWFKH47ENEETWSZO/bundle.json","state_url":"https://pith.science/pith/LMJZIC46BMCWFKH47ENEETWSZO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LMJZIC46BMCWFKH47ENEETWSZO/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-23T14:52:49Z","links":{"resolver":"https://pith.science/pith/LMJZIC46BMCWFKH47ENEETWSZO","bundle":"https://pith.science/pith/LMJZIC46BMCWFKH47ENEETWSZO/bundle.json","state":"https://pith.science/pith/LMJZIC46BMCWFKH47ENEETWSZO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LMJZIC46BMCWFKH47ENEETWSZO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:LMJZIC46BMCWFKH47ENEETWSZO","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":"07af33d1d6e73f5cb72fe4697226d9ccfb1ae61f837bfdb06b872b2168a50c44","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-03-09T14:01:46Z","title_canon_sha256":"efb490e953a256be609b09eed664f5ac4d2ce3f369713ee48e67dc4637f1830c"},"schema_version":"1.0","source":{"id":"1803.03514","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.03514","created_at":"2026-05-18T00:10:59Z"},{"alias_kind":"arxiv_version","alias_value":"1803.03514v2","created_at":"2026-05-18T00:10:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.03514","created_at":"2026-05-18T00:10:59Z"},{"alias_kind":"pith_short_12","alias_value":"LMJZIC46BMCW","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LMJZIC46BMCWFKH4","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LMJZIC46","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:fb2280b28c99b22f4969340e1e777d851dfdc8e04df63dfbceaa0e4dc5145e18","target":"graph","created_at":"2026-05-18T00:10:59Z","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":"We generalize the family of $(\\sigma, \\rho)$-problems and locally checkable vertex partition problems to their distance versions, which naturally captures well-known problems such as distance-$r$ dominating set and distance-$r$ independent set. We show that these distance problems are XP parameterized by the structural parameter mim-width, and hence polynomial on graph classes where mim-width is bounded and quickly computable, such as $k$-trapezoid graphs, Dilworth $k$-graphs, (circular) permutation graphs, interval graphs and their complements, convex graphs and their complements, $k$-polygon","authors_text":"Jan Arne Telle, Lars Jaffke, O-joung Kwon, Torstein J. F. Str{\\o}mme","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-03-09T14:01:46Z","title":"Generalized distance domination problems and their complexity on graphs of bounded mim-width"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.03514","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:33d83b2e2f65b165c6d8bc3f79ef67ca691f6197df99ca6367dc451ce8803213","target":"record","created_at":"2026-05-18T00:10:59Z","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":"07af33d1d6e73f5cb72fe4697226d9ccfb1ae61f837bfdb06b872b2168a50c44","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-03-09T14:01:46Z","title_canon_sha256":"efb490e953a256be609b09eed664f5ac4d2ce3f369713ee48e67dc4637f1830c"},"schema_version":"1.0","source":{"id":"1803.03514","kind":"arxiv","version":2}},"canonical_sha256":"5b13940b9e0b0562a8fcf91a424ed2cb9b5953c8d546dd0efc7573426c6bfb84","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5b13940b9e0b0562a8fcf91a424ed2cb9b5953c8d546dd0efc7573426c6bfb84","first_computed_at":"2026-05-18T00:10:59.882356Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:59.882356Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"C5KeRpHXxKan5h/BlzGUH1DB2R6nOZlCE/BeuuNO+UNDMl9BsXJZJHRbSlxsM4dccZgLI5jg/SkbzN3EIVrPCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:59.883107Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.03514","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:33d83b2e2f65b165c6d8bc3f79ef67ca691f6197df99ca6367dc451ce8803213","sha256:fb2280b28c99b22f4969340e1e777d851dfdc8e04df63dfbceaa0e4dc5145e18"],"state_sha256":"b4b4debcc23d43536563f4bfa9fce5136942bc046b2d95cd181ed730300e5ed8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nES+tncAug71y+w5Wx7rPBxAKowln9yK7G53bUYw8ih9S0FJjV/CzttjiSM38Z/z6uXnto6BjZl7AvJQ3JFXAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T14:52:49.563609Z","bundle_sha256":"1128af61ca9f2d7b06fcfa30e6b97b1889c7398cf24189e7429cef64ce321709"}}