{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:FCJOKEV6JA2WDNQD426H4UPG7F","short_pith_number":"pith:FCJOKEV6","schema_version":"1.0","canonical_sha256":"2892e512be483561b603e6bc7e51e6f97a234c054fc3fe7f8ccded114af4d38d","source":{"kind":"arxiv","id":"0902.1121","version":1},"attestation_state":"computed","paper":{"title":"A Linear-Time Algorithm for the Maximum Matched-Paired-Domination Problem in Cographs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chih-Chia Yao, Ruo-Wei Hung","submitted_at":"2009-02-06T19:10:29Z","abstract_excerpt":"Let $G=(V,E)$ be a graph without isolated vertices. A matching in $G$ is a set of independent edges in $G$. A perfect matching $M$ in $G$ is a matching such that every vertex of $G$ is incident to an edge of $M$. A set $S\\subseteq V$ is a \\textit{paired-dominating set} of $G$ if every vertex in $V-S$ is adjacent to some vertex in $S$ and if the subgraph $G[S]$ induced by $S$ contains at least one perfect matching. The paired-domination problem is to find a paired-dominating set of $G$ with minimum cardinality. A set $MPD\\subseteq E$ is a \\textit{matched-paired-dominating set} of $G$ if $MPD$ i"},"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":"0902.1121","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-02-06T19:10:29Z","cross_cats_sorted":[],"title_canon_sha256":"860748417b3473f2f91b91d255d82d93100549fa1573094c521814a446d05634","abstract_canon_sha256":"7ae0dec702552f0734ba1f23dda8ea6c0fd3ae9a57c1d9f71e3e0489a3b06347"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:59:59.399600Z","signature_b64":"DenKjb8dD2fSeoE6tWcVv1H2SYWzTL5cHhwNYRopgm9XiPgl938BnZqbnxNhULAV75KtTTIvySiIYm3wCq/JDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2892e512be483561b603e6bc7e51e6f97a234c054fc3fe7f8ccded114af4d38d","last_reissued_at":"2026-05-18T01:59:59.399146Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:59:59.399146Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Linear-Time Algorithm for the Maximum Matched-Paired-Domination Problem in Cographs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chih-Chia Yao, Ruo-Wei Hung","submitted_at":"2009-02-06T19:10:29Z","abstract_excerpt":"Let $G=(V,E)$ be a graph without isolated vertices. A matching in $G$ is a set of independent edges in $G$. A perfect matching $M$ in $G$ is a matching such that every vertex of $G$ is incident to an edge of $M$. A set $S\\subseteq V$ is a \\textit{paired-dominating set} of $G$ if every vertex in $V-S$ is adjacent to some vertex in $S$ and if the subgraph $G[S]$ induced by $S$ contains at least one perfect matching. The paired-domination problem is to find a paired-dominating set of $G$ with minimum cardinality. A set $MPD\\subseteq E$ is a \\textit{matched-paired-dominating set} of $G$ if $MPD$ i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0902.1121","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":"0902.1121","created_at":"2026-05-18T01:59:59.399222+00:00"},{"alias_kind":"arxiv_version","alias_value":"0902.1121v1","created_at":"2026-05-18T01:59:59.399222+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0902.1121","created_at":"2026-05-18T01:59:59.399222+00:00"},{"alias_kind":"pith_short_12","alias_value":"FCJOKEV6JA2W","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_16","alias_value":"FCJOKEV6JA2WDNQD","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_8","alias_value":"FCJOKEV6","created_at":"2026-05-18T12:25:59.703012+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/FCJOKEV6JA2WDNQD426H4UPG7F","json":"https://pith.science/pith/FCJOKEV6JA2WDNQD426H4UPG7F.json","graph_json":"https://pith.science/api/pith-number/FCJOKEV6JA2WDNQD426H4UPG7F/graph.json","events_json":"https://pith.science/api/pith-number/FCJOKEV6JA2WDNQD426H4UPG7F/events.json","paper":"https://pith.science/paper/FCJOKEV6"},"agent_actions":{"view_html":"https://pith.science/pith/FCJOKEV6JA2WDNQD426H4UPG7F","download_json":"https://pith.science/pith/FCJOKEV6JA2WDNQD426H4UPG7F.json","view_paper":"https://pith.science/paper/FCJOKEV6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0902.1121&json=true","fetch_graph":"https://pith.science/api/pith-number/FCJOKEV6JA2WDNQD426H4UPG7F/graph.json","fetch_events":"https://pith.science/api/pith-number/FCJOKEV6JA2WDNQD426H4UPG7F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FCJOKEV6JA2WDNQD426H4UPG7F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FCJOKEV6JA2WDNQD426H4UPG7F/action/storage_attestation","attest_author":"https://pith.science/pith/FCJOKEV6JA2WDNQD426H4UPG7F/action/author_attestation","sign_citation":"https://pith.science/pith/FCJOKEV6JA2WDNQD426H4UPG7F/action/citation_signature","submit_replication":"https://pith.science/pith/FCJOKEV6JA2WDNQD426H4UPG7F/action/replication_record"}},"created_at":"2026-05-18T01:59:59.399222+00:00","updated_at":"2026-05-18T01:59:59.399222+00:00"}