{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:S6U4MN4L4X5HBRBUYHXOY74WXF","short_pith_number":"pith:S6U4MN4L","canonical_record":{"source":{"id":"1605.00372","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-02T07:19:17Z","cross_cats_sorted":[],"title_canon_sha256":"620a520f6630e372a498ada64bcf8f99b6717fea4361417f21643117e00148d7","abstract_canon_sha256":"f8d59d08187b783437676c42021a15899c810dbb181123063ce039c85d213d7d"},"schema_version":"1.0"},"canonical_sha256":"97a9c6378be5fa70c434c1eeec7f96b9678ea552887c57fb7feed4d57eb658d4","source":{"kind":"arxiv","id":"1605.00372","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.00372","created_at":"2026-05-18T01:15:56Z"},{"alias_kind":"arxiv_version","alias_value":"1605.00372v1","created_at":"2026-05-18T01:15:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.00372","created_at":"2026-05-18T01:15:56Z"},{"alias_kind":"pith_short_12","alias_value":"S6U4MN4L4X5H","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"S6U4MN4L4X5HBRBU","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"S6U4MN4L","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:S6U4MN4L4X5HBRBUYHXOY74WXF","target":"record","payload":{"canonical_record":{"source":{"id":"1605.00372","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-02T07:19:17Z","cross_cats_sorted":[],"title_canon_sha256":"620a520f6630e372a498ada64bcf8f99b6717fea4361417f21643117e00148d7","abstract_canon_sha256":"f8d59d08187b783437676c42021a15899c810dbb181123063ce039c85d213d7d"},"schema_version":"1.0"},"canonical_sha256":"97a9c6378be5fa70c434c1eeec7f96b9678ea552887c57fb7feed4d57eb658d4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:56.003244Z","signature_b64":"sAG6jdOWmToMgCW1bMhSNhfH079xXG/H88RFqchMj587Ib9gTJmXhmqE5nyFIHXA2U6NlFeJ/7bx6RVX3mheAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"97a9c6378be5fa70c434c1eeec7f96b9678ea552887c57fb7feed4d57eb658d4","last_reissued_at":"2026-05-18T01:15:56.002647Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:56.002647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.00372","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-18T01:15:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fe4QEad2OWEoJLrLuee+gj4L1XhtDwg6pQ4bz2NcAB2AqjlRBKT/Kt8PnUGrRI8zqGKD410JUCaK2htambYGBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T15:21:45.326016Z"},"content_sha256":"7c3ece103183ea0977dd6ea2c88a161298e6355ec11b5db72e1b302baabbe4f6","schema_version":"1.0","event_id":"sha256:7c3ece103183ea0977dd6ea2c88a161298e6355ec11b5db72e1b302baabbe4f6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:S6U4MN4L4X5HBRBUYHXOY74WXF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Linear-Time Algorithm for the Weighted Paired-Domination Problem on Block Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Cheng-Yu Hsieh, Ching-Chi Lin","submitted_at":"2016-05-02T07:19:17Z","abstract_excerpt":"In a graph $G = (V,E)$, a vertex subset $S\\subseteq V(G)$ is said to be a dominating set of $G$ if every vertex not in $S$ is adjacent to a vertex in $S$. A dominating set $S$ of $G$ is called a paired-dominating set of $G$ if the induced subgraph $G[S]$ contains a perfect matching. In this paper, we propose an $O(n+m)$-time algorithm for the weighted paired-domination problem on block graphs using dynamic programming, which strengthens the results in [Theoret. Comput. Sci., 410(47--49):5063--5071, 2009] and [J. Comb. Optim., 19(4):457--470, 2010]. Moreover, the algorithm can be completed in $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.00372","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-18T01:15:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q8foOQmucC2fBmFyudXsR2am6kvTl9kSVCn/9tmUou4CEA71hWgr95+JfzDHRP59VFQmXj+4GMSNiboORxgIBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T15:21:45.326383Z"},"content_sha256":"a35aa026ef3b8b3ffaccedf65dfb806c7999ae5f73092a1cb5c3438bd7c6c0dc","schema_version":"1.0","event_id":"sha256:a35aa026ef3b8b3ffaccedf65dfb806c7999ae5f73092a1cb5c3438bd7c6c0dc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S6U4MN4L4X5HBRBUYHXOY74WXF/bundle.json","state_url":"https://pith.science/pith/S6U4MN4L4X5HBRBUYHXOY74WXF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S6U4MN4L4X5HBRBUYHXOY74WXF/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-07-03T15:21:45Z","links":{"resolver":"https://pith.science/pith/S6U4MN4L4X5HBRBUYHXOY74WXF","bundle":"https://pith.science/pith/S6U4MN4L4X5HBRBUYHXOY74WXF/bundle.json","state":"https://pith.science/pith/S6U4MN4L4X5HBRBUYHXOY74WXF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S6U4MN4L4X5HBRBUYHXOY74WXF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:S6U4MN4L4X5HBRBUYHXOY74WXF","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":"f8d59d08187b783437676c42021a15899c810dbb181123063ce039c85d213d7d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-02T07:19:17Z","title_canon_sha256":"620a520f6630e372a498ada64bcf8f99b6717fea4361417f21643117e00148d7"},"schema_version":"1.0","source":{"id":"1605.00372","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.00372","created_at":"2026-05-18T01:15:56Z"},{"alias_kind":"arxiv_version","alias_value":"1605.00372v1","created_at":"2026-05-18T01:15:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.00372","created_at":"2026-05-18T01:15:56Z"},{"alias_kind":"pith_short_12","alias_value":"S6U4MN4L4X5H","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"S6U4MN4L4X5HBRBU","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"S6U4MN4L","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:a35aa026ef3b8b3ffaccedf65dfb806c7999ae5f73092a1cb5c3438bd7c6c0dc","target":"graph","created_at":"2026-05-18T01:15:56Z","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":"In a graph $G = (V,E)$, a vertex subset $S\\subseteq V(G)$ is said to be a dominating set of $G$ if every vertex not in $S$ is adjacent to a vertex in $S$. A dominating set $S$ of $G$ is called a paired-dominating set of $G$ if the induced subgraph $G[S]$ contains a perfect matching. In this paper, we propose an $O(n+m)$-time algorithm for the weighted paired-domination problem on block graphs using dynamic programming, which strengthens the results in [Theoret. Comput. Sci., 410(47--49):5063--5071, 2009] and [J. Comb. Optim., 19(4):457--470, 2010]. Moreover, the algorithm can be completed in $","authors_text":"Cheng-Yu Hsieh, Ching-Chi Lin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-02T07:19:17Z","title":"A Linear-Time Algorithm for the Weighted Paired-Domination Problem on Block Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.00372","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:7c3ece103183ea0977dd6ea2c88a161298e6355ec11b5db72e1b302baabbe4f6","target":"record","created_at":"2026-05-18T01:15:56Z","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":"f8d59d08187b783437676c42021a15899c810dbb181123063ce039c85d213d7d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-02T07:19:17Z","title_canon_sha256":"620a520f6630e372a498ada64bcf8f99b6717fea4361417f21643117e00148d7"},"schema_version":"1.0","source":{"id":"1605.00372","kind":"arxiv","version":1}},"canonical_sha256":"97a9c6378be5fa70c434c1eeec7f96b9678ea552887c57fb7feed4d57eb658d4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"97a9c6378be5fa70c434c1eeec7f96b9678ea552887c57fb7feed4d57eb658d4","first_computed_at":"2026-05-18T01:15:56.002647Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:56.002647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sAG6jdOWmToMgCW1bMhSNhfH079xXG/H88RFqchMj587Ib9gTJmXhmqE5nyFIHXA2U6NlFeJ/7bx6RVX3mheAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:56.003244Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.00372","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7c3ece103183ea0977dd6ea2c88a161298e6355ec11b5db72e1b302baabbe4f6","sha256:a35aa026ef3b8b3ffaccedf65dfb806c7999ae5f73092a1cb5c3438bd7c6c0dc"],"state_sha256":"a028cc30e489f324d780f6715b9c043ebad638e3c80607609d35b0b47d839475"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K1GqQ9CJ2jV5ep/IMeN/MUQbgDHG9ySSCWxz28Tvrhs+frKIonFpTl/yVbGzgbm0iniJEoYMSY7NsSyXYOhdDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T15:21:45.328421Z","bundle_sha256":"19a6a57723b900d2eede68b221ed5d705d41c9dbce3721c0ab4186cef4f84f30"}}