{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:S6U4MN4L4X5HBRBUYHXOY74WXF","short_pith_number":"pith:S6U4MN4L","schema_version":"1.0","canonical_sha256":"97a9c6378be5fa70c434c1eeec7f96b9678ea552887c57fb7feed4d57eb658d4","source":{"kind":"arxiv","id":"1605.00372","version":1},"attestation_state":"computed","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 $"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1605.00372","created_at":"2026-05-18T01:15:56.002720+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.00372v1","created_at":"2026-05-18T01:15:56.002720+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.00372","created_at":"2026-05-18T01:15:56.002720+00:00"},{"alias_kind":"pith_short_12","alias_value":"S6U4MN4L4X5H","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"S6U4MN4L4X5HBRBU","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"S6U4MN4L","created_at":"2026-05-18T12:30:44.179134+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/S6U4MN4L4X5HBRBUYHXOY74WXF","json":"https://pith.science/pith/S6U4MN4L4X5HBRBUYHXOY74WXF.json","graph_json":"https://pith.science/api/pith-number/S6U4MN4L4X5HBRBUYHXOY74WXF/graph.json","events_json":"https://pith.science/api/pith-number/S6U4MN4L4X5HBRBUYHXOY74WXF/events.json","paper":"https://pith.science/paper/S6U4MN4L"},"agent_actions":{"view_html":"https://pith.science/pith/S6U4MN4L4X5HBRBUYHXOY74WXF","download_json":"https://pith.science/pith/S6U4MN4L4X5HBRBUYHXOY74WXF.json","view_paper":"https://pith.science/paper/S6U4MN4L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.00372&json=true","fetch_graph":"https://pith.science/api/pith-number/S6U4MN4L4X5HBRBUYHXOY74WXF/graph.json","fetch_events":"https://pith.science/api/pith-number/S6U4MN4L4X5HBRBUYHXOY74WXF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S6U4MN4L4X5HBRBUYHXOY74WXF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S6U4MN4L4X5HBRBUYHXOY74WXF/action/storage_attestation","attest_author":"https://pith.science/pith/S6U4MN4L4X5HBRBUYHXOY74WXF/action/author_attestation","sign_citation":"https://pith.science/pith/S6U4MN4L4X5HBRBUYHXOY74WXF/action/citation_signature","submit_replication":"https://pith.science/pith/S6U4MN4L4X5HBRBUYHXOY74WXF/action/replication_record"}},"created_at":"2026-05-18T01:15:56.002720+00:00","updated_at":"2026-05-18T01:15:56.002720+00:00"}