{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:XB6MURMZ362IMWMUM35BN27BOE","short_pith_number":"pith:XB6MURMZ","canonical_record":{"source":{"id":"1803.04327","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-12T15:55:49Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"8ea530bdc4cbcef3ccd17977fa38134b2aa13a770557ae58df5016a087db30ba","abstract_canon_sha256":"3dd55e8479be8bf21c1c7b506d3d32aa78468568dca72c9ce82f663a75648e29"},"schema_version":"1.0"},"canonical_sha256":"b87cca4599dfb486599466fa16ebe1712377622e93ddbdfc9b4431c5b2edb453","source":{"kind":"arxiv","id":"1803.04327","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.04327","created_at":"2026-05-18T00:10:02Z"},{"alias_kind":"arxiv_version","alias_value":"1803.04327v3","created_at":"2026-05-18T00:10:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.04327","created_at":"2026-05-18T00:10:02Z"},{"alias_kind":"pith_short_12","alias_value":"XB6MURMZ362I","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XB6MURMZ362IMWMU","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XB6MURMZ","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:XB6MURMZ362IMWMUM35BN27BOE","target":"record","payload":{"canonical_record":{"source":{"id":"1803.04327","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-12T15:55:49Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"8ea530bdc4cbcef3ccd17977fa38134b2aa13a770557ae58df5016a087db30ba","abstract_canon_sha256":"3dd55e8479be8bf21c1c7b506d3d32aa78468568dca72c9ce82f663a75648e29"},"schema_version":"1.0"},"canonical_sha256":"b87cca4599dfb486599466fa16ebe1712377622e93ddbdfc9b4431c5b2edb453","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:02.515605Z","signature_b64":"8vZynmxRBAM5emG4srYN4UiW3GlhjqR2FFPrAuhJrRkrCpsOCjiS6RGX7vNxxSxQYI4ld3Y4CJOfQYvJ7ZbTAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b87cca4599dfb486599466fa16ebe1712377622e93ddbdfc9b4431c5b2edb453","last_reissued_at":"2026-05-18T00:10:02.514872Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:02.514872Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.04327","source_version":3,"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:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0VabclKqpuhSPVgNJl3BdwpZBa4lBh3fE9B7yRmOBktmkxT5inzsJOhUacJI+HmpOsjbls8X4ETB2UFcUhDdBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T23:37:45.338151Z"},"content_sha256":"8057200320b4bd273c57ffc20b41f469543ca302ae70e705a135ac94c7b66446","schema_version":"1.0","event_id":"sha256:8057200320b4bd273c57ffc20b41f469543ca302ae70e705a135ac94c7b66446"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:XB6MURMZ362IMWMUM35BN27BOE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"New Algorithms for Weighted $k$-Domination and Total $k$-Domination Problems in Proper Interval Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Maria In\\'es Lopez Pujato, Martin Milani\\v{c}, Nina Chiarelli, Tatiana Romina Hartinger, Valeria Alejandra Leoni","submitted_at":"2018-03-12T15:55:49Z","abstract_excerpt":"Given a positive integer $k$, a $k$-dominating set in a graph $G$ is a set of vertices such that every vertex not in the set has at least $k$ neighbors in the set. A total $k$-dominating set, also known as a $k$-tuple total dominating set, is a set of vertices such that every vertex of the graph has at least $k$ neighbors in the set. The problems of finding the minimum size of a $k$-dominating, respectively total $k$-dominating set, in a given graph, are referred to as $k$-domination, respectively total $k$-domination. These generalizations of the classical domination and total domination prob"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.04327","kind":"arxiv","version":3},"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:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wm0W+p9GYqTYusTBVaKqwPb7+zFcJhIyBkaZvgDINjao2G8PYzl8anChP5rD8Dd2iLw38N9gRBOv5v5NmNz3Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T23:37:45.338518Z"},"content_sha256":"70fc40b875823f99408cf0afe73a5844031a48964dcbadb715aa0d3a41e47f57","schema_version":"1.0","event_id":"sha256:70fc40b875823f99408cf0afe73a5844031a48964dcbadb715aa0d3a41e47f57"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XB6MURMZ362IMWMUM35BN27BOE/bundle.json","state_url":"https://pith.science/pith/XB6MURMZ362IMWMUM35BN27BOE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XB6MURMZ362IMWMUM35BN27BOE/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-27T23:37:45Z","links":{"resolver":"https://pith.science/pith/XB6MURMZ362IMWMUM35BN27BOE","bundle":"https://pith.science/pith/XB6MURMZ362IMWMUM35BN27BOE/bundle.json","state":"https://pith.science/pith/XB6MURMZ362IMWMUM35BN27BOE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XB6MURMZ362IMWMUM35BN27BOE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:XB6MURMZ362IMWMUM35BN27BOE","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":"3dd55e8479be8bf21c1c7b506d3d32aa78468568dca72c9ce82f663a75648e29","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-12T15:55:49Z","title_canon_sha256":"8ea530bdc4cbcef3ccd17977fa38134b2aa13a770557ae58df5016a087db30ba"},"schema_version":"1.0","source":{"id":"1803.04327","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.04327","created_at":"2026-05-18T00:10:02Z"},{"alias_kind":"arxiv_version","alias_value":"1803.04327v3","created_at":"2026-05-18T00:10:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.04327","created_at":"2026-05-18T00:10:02Z"},{"alias_kind":"pith_short_12","alias_value":"XB6MURMZ362I","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XB6MURMZ362IMWMU","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XB6MURMZ","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:70fc40b875823f99408cf0afe73a5844031a48964dcbadb715aa0d3a41e47f57","target":"graph","created_at":"2026-05-18T00:10:02Z","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":"Given a positive integer $k$, a $k$-dominating set in a graph $G$ is a set of vertices such that every vertex not in the set has at least $k$ neighbors in the set. A total $k$-dominating set, also known as a $k$-tuple total dominating set, is a set of vertices such that every vertex of the graph has at least $k$ neighbors in the set. The problems of finding the minimum size of a $k$-dominating, respectively total $k$-dominating set, in a given graph, are referred to as $k$-domination, respectively total $k$-domination. These generalizations of the classical domination and total domination prob","authors_text":"Maria In\\'es Lopez Pujato, Martin Milani\\v{c}, Nina Chiarelli, Tatiana Romina Hartinger, Valeria Alejandra Leoni","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-12T15:55:49Z","title":"New Algorithms for Weighted $k$-Domination and Total $k$-Domination Problems in Proper Interval Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.04327","kind":"arxiv","version":3},"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:8057200320b4bd273c57ffc20b41f469543ca302ae70e705a135ac94c7b66446","target":"record","created_at":"2026-05-18T00:10:02Z","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":"3dd55e8479be8bf21c1c7b506d3d32aa78468568dca72c9ce82f663a75648e29","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-12T15:55:49Z","title_canon_sha256":"8ea530bdc4cbcef3ccd17977fa38134b2aa13a770557ae58df5016a087db30ba"},"schema_version":"1.0","source":{"id":"1803.04327","kind":"arxiv","version":3}},"canonical_sha256":"b87cca4599dfb486599466fa16ebe1712377622e93ddbdfc9b4431c5b2edb453","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b87cca4599dfb486599466fa16ebe1712377622e93ddbdfc9b4431c5b2edb453","first_computed_at":"2026-05-18T00:10:02.514872Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:02.514872Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8vZynmxRBAM5emG4srYN4UiW3GlhjqR2FFPrAuhJrRkrCpsOCjiS6RGX7vNxxSxQYI4ld3Y4CJOfQYvJ7ZbTAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:02.515605Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.04327","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8057200320b4bd273c57ffc20b41f469543ca302ae70e705a135ac94c7b66446","sha256:70fc40b875823f99408cf0afe73a5844031a48964dcbadb715aa0d3a41e47f57"],"state_sha256":"b952c591cc3c20f2e95ce8f097f55847dc4f2eedd5ff4ece41d5ee59549c988c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UVQKxu9oP2rK8eYQkLGIHJ5jMzhr4qwBwPcP3BoikEUmTOsTr7AxKA24IpPiE8mvLLFF/iLcsLVitDq4bH3bCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T23:37:45.340415Z","bundle_sha256":"3cd1c927887b8e6f61d357fa30b57f1b5e230c2bc86db0d5dc07a1d2cc150f6b"}}