{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:5NI6FYKHEY4W6INZH7DTT3LDRE","short_pith_number":"pith:5NI6FYKH","schema_version":"1.0","canonical_sha256":"eb51e2e14726396f21b93fc739ed6389241258e59604cd9c31840098c051a54e","source":{"kind":"arxiv","id":"1401.7594","version":1},"attestation_state":"computed","paper":{"title":"Linear-Time Algorithms for the Paired-Domination Problem in Interval Graphs and Circular-Arc Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ching-Chi Lin, Hai-Lun Tu","submitted_at":"2014-01-29T17:23:13Z","abstract_excerpt":"In a graph $G$, 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 a graph $G$ is called a paired-dominating set if the induced subgraph $G[S]$ contains a perfect matching. The paired-domination problem involves finding a smallest paired-dominating set of $G$. Given an intersection model of an interval graph $G$ with sorted endpoints, Cheng et al. designed an $O(m+n)$-time algorithm for interval graphs and an $O(m(m+n))$-time algorithm for circular-arc graphs. In this paper, to solve the pai"},"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":"1401.7594","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-29T17:23:13Z","cross_cats_sorted":[],"title_canon_sha256":"e5f6699af491c1c0a215779e14c88c6b0f81fd546c40726ce83b6f554baab960","abstract_canon_sha256":"1e212fee77a52d0713c8d78eecd558f714c2085bf16fcaf5a737ccf9c67dfab9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:00:40.324926Z","signature_b64":"rfzbChIQXr+Vey/6qZiDgDCuG6KjSFYoUAUgFSLkse3GdhvnDqscnbvqvOMqcwf62ccvFJ0yy8flxpu6nrhZCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb51e2e14726396f21b93fc739ed6389241258e59604cd9c31840098c051a54e","last_reissued_at":"2026-05-18T03:00:40.324379Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:00:40.324379Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear-Time Algorithms for the Paired-Domination Problem in Interval Graphs and Circular-Arc Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ching-Chi Lin, Hai-Lun Tu","submitted_at":"2014-01-29T17:23:13Z","abstract_excerpt":"In a graph $G$, 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 a graph $G$ is called a paired-dominating set if the induced subgraph $G[S]$ contains a perfect matching. The paired-domination problem involves finding a smallest paired-dominating set of $G$. Given an intersection model of an interval graph $G$ with sorted endpoints, Cheng et al. designed an $O(m+n)$-time algorithm for interval graphs and an $O(m(m+n))$-time algorithm for circular-arc graphs. In this paper, to solve the pai"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.7594","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":"1401.7594","created_at":"2026-05-18T03:00:40.324459+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.7594v1","created_at":"2026-05-18T03:00:40.324459+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.7594","created_at":"2026-05-18T03:00:40.324459+00:00"},{"alias_kind":"pith_short_12","alias_value":"5NI6FYKHEY4W","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"5NI6FYKHEY4W6INZ","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"5NI6FYKH","created_at":"2026-05-18T12:28:14.216126+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/5NI6FYKHEY4W6INZH7DTT3LDRE","json":"https://pith.science/pith/5NI6FYKHEY4W6INZH7DTT3LDRE.json","graph_json":"https://pith.science/api/pith-number/5NI6FYKHEY4W6INZH7DTT3LDRE/graph.json","events_json":"https://pith.science/api/pith-number/5NI6FYKHEY4W6INZH7DTT3LDRE/events.json","paper":"https://pith.science/paper/5NI6FYKH"},"agent_actions":{"view_html":"https://pith.science/pith/5NI6FYKHEY4W6INZH7DTT3LDRE","download_json":"https://pith.science/pith/5NI6FYKHEY4W6INZH7DTT3LDRE.json","view_paper":"https://pith.science/paper/5NI6FYKH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.7594&json=true","fetch_graph":"https://pith.science/api/pith-number/5NI6FYKHEY4W6INZH7DTT3LDRE/graph.json","fetch_events":"https://pith.science/api/pith-number/5NI6FYKHEY4W6INZH7DTT3LDRE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5NI6FYKHEY4W6INZH7DTT3LDRE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5NI6FYKHEY4W6INZH7DTT3LDRE/action/storage_attestation","attest_author":"https://pith.science/pith/5NI6FYKHEY4W6INZH7DTT3LDRE/action/author_attestation","sign_citation":"https://pith.science/pith/5NI6FYKHEY4W6INZH7DTT3LDRE/action/citation_signature","submit_replication":"https://pith.science/pith/5NI6FYKHEY4W6INZH7DTT3LDRE/action/replication_record"}},"created_at":"2026-05-18T03:00:40.324459+00:00","updated_at":"2026-05-18T03:00:40.324459+00:00"}