{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:FCJOKEV6JA2WDNQD426H4UPG7F","short_pith_number":"pith:FCJOKEV6","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"},"canonical_sha256":"2892e512be483561b603e6bc7e51e6f97a234c054fc3fe7f8ccded114af4d38d","source":{"kind":"arxiv","id":"0902.1121","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0902.1121","created_at":"2026-05-18T01:59:59Z"},{"alias_kind":"arxiv_version","alias_value":"0902.1121v1","created_at":"2026-05-18T01:59:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0902.1121","created_at":"2026-05-18T01:59:59Z"},{"alias_kind":"pith_short_12","alias_value":"FCJOKEV6JA2W","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"FCJOKEV6JA2WDNQD","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"FCJOKEV6","created_at":"2026-05-18T12:25:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:FCJOKEV6JA2WDNQD426H4UPG7F","target":"record","payload":{"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"},"canonical_sha256":"2892e512be483561b603e6bc7e51e6f97a234c054fc3fe7f8ccded114af4d38d","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"},"source_kind":"arxiv","source_id":"0902.1121","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:59:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sa5WFRlmpnK5Hv6/c5KuR6slTy+PVwsZITKgJZ+/DirGXp5v6otBf2dp8RfNRDo/x1WtDZVdRlAPGJpIh2oXCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T16:51:55.030649Z"},"content_sha256":"d6dff0f1fd4c4a655859a88b1b403359f6ffadff3fcb6686a0467b944cd4fdc2","schema_version":"1.0","event_id":"sha256:d6dff0f1fd4c4a655859a88b1b403359f6ffadff3fcb6686a0467b944cd4fdc2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:FCJOKEV6JA2WDNQD426H4UPG7F","target":"graph","payload":{"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"},"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:59:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dTNR7FUJuphGkdWGMT46OzrZ6iONWfLQPyf2qLVPkoPFBBjoLVFkW+HyXhISlK8OXgupWAgsgd4AfMJoW4sFCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T16:51:55.031151Z"},"content_sha256":"9aa6d3ccc5dd46236438767cce95756a20bc5e903a273750ff99b09c60e26af5","schema_version":"1.0","event_id":"sha256:9aa6d3ccc5dd46236438767cce95756a20bc5e903a273750ff99b09c60e26af5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FCJOKEV6JA2WDNQD426H4UPG7F/bundle.json","state_url":"https://pith.science/pith/FCJOKEV6JA2WDNQD426H4UPG7F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FCJOKEV6JA2WDNQD426H4UPG7F/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-25T16:51:55Z","links":{"resolver":"https://pith.science/pith/FCJOKEV6JA2WDNQD426H4UPG7F","bundle":"https://pith.science/pith/FCJOKEV6JA2WDNQD426H4UPG7F/bundle.json","state":"https://pith.science/pith/FCJOKEV6JA2WDNQD426H4UPG7F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FCJOKEV6JA2WDNQD426H4UPG7F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:FCJOKEV6JA2WDNQD426H4UPG7F","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":"7ae0dec702552f0734ba1f23dda8ea6c0fd3ae9a57c1d9f71e3e0489a3b06347","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-02-06T19:10:29Z","title_canon_sha256":"860748417b3473f2f91b91d255d82d93100549fa1573094c521814a446d05634"},"schema_version":"1.0","source":{"id":"0902.1121","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0902.1121","created_at":"2026-05-18T01:59:59Z"},{"alias_kind":"arxiv_version","alias_value":"0902.1121v1","created_at":"2026-05-18T01:59:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0902.1121","created_at":"2026-05-18T01:59:59Z"},{"alias_kind":"pith_short_12","alias_value":"FCJOKEV6JA2W","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"FCJOKEV6JA2WDNQD","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"FCJOKEV6","created_at":"2026-05-18T12:25:59Z"}],"graph_snapshots":[{"event_id":"sha256:9aa6d3ccc5dd46236438767cce95756a20bc5e903a273750ff99b09c60e26af5","target":"graph","created_at":"2026-05-18T01:59:59Z","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":"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","authors_text":"Chih-Chia Yao, Ruo-Wei Hung","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-02-06T19:10:29Z","title":"A Linear-Time Algorithm for the Maximum Matched-Paired-Domination Problem in Cographs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0902.1121","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:d6dff0f1fd4c4a655859a88b1b403359f6ffadff3fcb6686a0467b944cd4fdc2","target":"record","created_at":"2026-05-18T01:59:59Z","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":"7ae0dec702552f0734ba1f23dda8ea6c0fd3ae9a57c1d9f71e3e0489a3b06347","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-02-06T19:10:29Z","title_canon_sha256":"860748417b3473f2f91b91d255d82d93100549fa1573094c521814a446d05634"},"schema_version":"1.0","source":{"id":"0902.1121","kind":"arxiv","version":1}},"canonical_sha256":"2892e512be483561b603e6bc7e51e6f97a234c054fc3fe7f8ccded114af4d38d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2892e512be483561b603e6bc7e51e6f97a234c054fc3fe7f8ccded114af4d38d","first_computed_at":"2026-05-18T01:59:59.399146Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:59:59.399146Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DenKjb8dD2fSeoE6tWcVv1H2SYWzTL5cHhwNYRopgm9XiPgl938BnZqbnxNhULAV75KtTTIvySiIYm3wCq/JDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:59:59.399600Z","signed_message":"canonical_sha256_bytes"},"source_id":"0902.1121","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d6dff0f1fd4c4a655859a88b1b403359f6ffadff3fcb6686a0467b944cd4fdc2","sha256:9aa6d3ccc5dd46236438767cce95756a20bc5e903a273750ff99b09c60e26af5"],"state_sha256":"868666a9707c2ef93af4cf2e58424f2dfb1b32e63d3a5987f3a7ff9f1ef2b191"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QCtKQ3v2BU2Jhf37xiScfyOoK/GLTr2L9+GY728ZL7De6PKlDrX9wjlum2IzbgwnSWpYniL7S0/VuzzS3dDxDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T16:51:55.033107Z","bundle_sha256":"f9b692437686ddcfc86a03266a6bddfb5640dded774833042a0dc4627b907bf5"}}