{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:HHKTFU4XETSYROPMIYPB2KGUUZ","short_pith_number":"pith:HHKTFU4X","canonical_record":{"source":{"id":"1812.00689","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-12-03T11:55:22Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"9c5131950fde34a3e2cf24b01bb2fa75176d693a6c19160e9502c0e8265ac290","abstract_canon_sha256":"d10e08c16cac1d78016e0049fd4642b866bd202d6f448526321271f7a1c70ea3"},"schema_version":"1.0"},"canonical_sha256":"39d532d39724e588b9ec461e1d28d4a64f2f295ddc6d887c110b257f405b85cc","source":{"kind":"arxiv","id":"1812.00689","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.00689","created_at":"2026-05-17T23:59:19Z"},{"alias_kind":"arxiv_version","alias_value":"1812.00689v1","created_at":"2026-05-17T23:59:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.00689","created_at":"2026-05-17T23:59:19Z"},{"alias_kind":"pith_short_12","alias_value":"HHKTFU4XETSY","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HHKTFU4XETSYROPM","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HHKTFU4X","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:HHKTFU4XETSYROPMIYPB2KGUUZ","target":"record","payload":{"canonical_record":{"source":{"id":"1812.00689","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-12-03T11:55:22Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"9c5131950fde34a3e2cf24b01bb2fa75176d693a6c19160e9502c0e8265ac290","abstract_canon_sha256":"d10e08c16cac1d78016e0049fd4642b866bd202d6f448526321271f7a1c70ea3"},"schema_version":"1.0"},"canonical_sha256":"39d532d39724e588b9ec461e1d28d4a64f2f295ddc6d887c110b257f405b85cc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:19.257895Z","signature_b64":"qkBNVSbpwjCREUPFICndhPu05LVpUOVXVjT9TLDwrWB1p5LaD9RdsNwGJp3iqjH96mYvO8vjE9ejJrY/mv1GAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"39d532d39724e588b9ec461e1d28d4a64f2f295ddc6d887c110b257f405b85cc","last_reissued_at":"2026-05-17T23:59:19.257532Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:19.257532Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.00689","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-05-17T23:59:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fW31JCzaG42NO/PU0PsxVjYT+ia4bII5MuDC3iBvcYwUIv1gLVFLF2BhJckcU+HuZXMrGd5kir/HRsDphAG4Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T18:33:08.006008Z"},"content_sha256":"11d98f692cccb5574760453c4a4adf7ab113ce6bee48da1ad0670cf41e7584d4","schema_version":"1.0","event_id":"sha256:11d98f692cccb5574760453c4a4adf7ab113ce6bee48da1ad0670cf41e7584d4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:HHKTFU4XETSYROPMIYPB2KGUUZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Total 2-domination of proper interval graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Francisco J. Soulignac","submitted_at":"2018-12-03T11:55:22Z","abstract_excerpt":"A set of vertices $W$ of a graph $G$ is a total $k$-dominating set when every vertex of $G$ has at least $k$ neighbors in $W$. In a recent article, Chiarelli et al.\\ (Improved Algorithms for $k$-Domination and Total $k$-Domination in Proper Interval Graphs, Lecture Notes in Comput.\\ Sci.\\ 10856, 290--302, 2018) prove that a total $k$-dominating set can be computed in $O(n^{3k})$ time when $G$ is a proper interval graph with $n$ vertices and $m$ edges. In this note we reduce the time complexity to $O(m)$ for $k=2$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.00689","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":""},"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-17T23:59:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H2e8HjjPAPfkgBzLVVSvKN6HarlVWfEHYODlCYdzFSqhBtQ0TCbSXmZJRQAllbTZnZybkxw/XjwDyvws64BtAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T18:33:08.006622Z"},"content_sha256":"222f3b5d30eb470e01086627f5a5d81cbad735825ce26dad184262bf1fe4f623","schema_version":"1.0","event_id":"sha256:222f3b5d30eb470e01086627f5a5d81cbad735825ce26dad184262bf1fe4f623"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HHKTFU4XETSYROPMIYPB2KGUUZ/bundle.json","state_url":"https://pith.science/pith/HHKTFU4XETSYROPMIYPB2KGUUZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HHKTFU4XETSYROPMIYPB2KGUUZ/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-06T18:33:08Z","links":{"resolver":"https://pith.science/pith/HHKTFU4XETSYROPMIYPB2KGUUZ","bundle":"https://pith.science/pith/HHKTFU4XETSYROPMIYPB2KGUUZ/bundle.json","state":"https://pith.science/pith/HHKTFU4XETSYROPMIYPB2KGUUZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HHKTFU4XETSYROPMIYPB2KGUUZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:HHKTFU4XETSYROPMIYPB2KGUUZ","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":"d10e08c16cac1d78016e0049fd4642b866bd202d6f448526321271f7a1c70ea3","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-12-03T11:55:22Z","title_canon_sha256":"9c5131950fde34a3e2cf24b01bb2fa75176d693a6c19160e9502c0e8265ac290"},"schema_version":"1.0","source":{"id":"1812.00689","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.00689","created_at":"2026-05-17T23:59:19Z"},{"alias_kind":"arxiv_version","alias_value":"1812.00689v1","created_at":"2026-05-17T23:59:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.00689","created_at":"2026-05-17T23:59:19Z"},{"alias_kind":"pith_short_12","alias_value":"HHKTFU4XETSY","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HHKTFU4XETSYROPM","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HHKTFU4X","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:222f3b5d30eb470e01086627f5a5d81cbad735825ce26dad184262bf1fe4f623","target":"graph","created_at":"2026-05-17T23:59:19Z","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":"A set of vertices $W$ of a graph $G$ is a total $k$-dominating set when every vertex of $G$ has at least $k$ neighbors in $W$. In a recent article, Chiarelli et al.\\ (Improved Algorithms for $k$-Domination and Total $k$-Domination in Proper Interval Graphs, Lecture Notes in Comput.\\ Sci.\\ 10856, 290--302, 2018) prove that a total $k$-dominating set can be computed in $O(n^{3k})$ time when $G$ is a proper interval graph with $n$ vertices and $m$ edges. In this note we reduce the time complexity to $O(m)$ for $k=2$.","authors_text":"Francisco J. Soulignac","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-12-03T11:55:22Z","title":"Total 2-domination of proper interval graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.00689","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:11d98f692cccb5574760453c4a4adf7ab113ce6bee48da1ad0670cf41e7584d4","target":"record","created_at":"2026-05-17T23:59:19Z","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":"d10e08c16cac1d78016e0049fd4642b866bd202d6f448526321271f7a1c70ea3","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-12-03T11:55:22Z","title_canon_sha256":"9c5131950fde34a3e2cf24b01bb2fa75176d693a6c19160e9502c0e8265ac290"},"schema_version":"1.0","source":{"id":"1812.00689","kind":"arxiv","version":1}},"canonical_sha256":"39d532d39724e588b9ec461e1d28d4a64f2f295ddc6d887c110b257f405b85cc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"39d532d39724e588b9ec461e1d28d4a64f2f295ddc6d887c110b257f405b85cc","first_computed_at":"2026-05-17T23:59:19.257532Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:19.257532Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qkBNVSbpwjCREUPFICndhPu05LVpUOVXVjT9TLDwrWB1p5LaD9RdsNwGJp3iqjH96mYvO8vjE9ejJrY/mv1GAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:19.257895Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.00689","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:11d98f692cccb5574760453c4a4adf7ab113ce6bee48da1ad0670cf41e7584d4","sha256:222f3b5d30eb470e01086627f5a5d81cbad735825ce26dad184262bf1fe4f623"],"state_sha256":"ce31e5aecef49f641476a0810074756ee3a61b083555b38b74cc3c2ef12649d4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qT3AX9hELnxefl4LarmWuqDVAsbaiapRYNMDHzp/FqzHmisiZb1sCjGbwnYUDSCUqc7MVHr08AI+wzynqvdLCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T18:33:08.009987Z","bundle_sha256":"e19b8613c6201114253b51b8b825dbf946ad0505bd2f9ff6a7d7230ea642cac1"}}