{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:5NI6FYKHEY4W6INZH7DTT3LDRE","short_pith_number":"pith:5NI6FYKH","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"},"canonical_sha256":"eb51e2e14726396f21b93fc739ed6389241258e59604cd9c31840098c051a54e","source":{"kind":"arxiv","id":"1401.7594","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.7594","created_at":"2026-05-18T03:00:40Z"},{"alias_kind":"arxiv_version","alias_value":"1401.7594v1","created_at":"2026-05-18T03:00:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.7594","created_at":"2026-05-18T03:00:40Z"},{"alias_kind":"pith_short_12","alias_value":"5NI6FYKHEY4W","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"5NI6FYKHEY4W6INZ","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"5NI6FYKH","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:5NI6FYKHEY4W6INZH7DTT3LDRE","target":"record","payload":{"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"},"canonical_sha256":"eb51e2e14726396f21b93fc739ed6389241258e59604cd9c31840098c051a54e","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"},"source_kind":"arxiv","source_id":"1401.7594","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-18T03:00:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hm9q9jwv4LW7xLrLax9dp5IV9d3SP9vfKMMAU31jr0gdZJ7PmKIUZp89N0XdGbSig/2I6aGgkbH0fKqJ3D6iAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T11:27:41.385246Z"},"content_sha256":"7177d6c23328e52954758fa6a1c54cb3fb8f9e214457dca3091fb63d71045bc6","schema_version":"1.0","event_id":"sha256:7177d6c23328e52954758fa6a1c54cb3fb8f9e214457dca3091fb63d71045bc6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:5NI6FYKHEY4W6INZH7DTT3LDRE","target":"graph","payload":{"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"},"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-18T03:00:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vze3MdAzMHs77XUuBgaKljSOCNrKgcqjd1q5kV/0BMd3ZASoqpMlj6BEf3qQoqVbuW/rd1PDhTQuBvUjtMQVAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T11:27:41.385590Z"},"content_sha256":"683e61d05ebe72eddd95e458ccdc53ea33d2e2ff62c342209135104bf530c774","schema_version":"1.0","event_id":"sha256:683e61d05ebe72eddd95e458ccdc53ea33d2e2ff62c342209135104bf530c774"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5NI6FYKHEY4W6INZH7DTT3LDRE/bundle.json","state_url":"https://pith.science/pith/5NI6FYKHEY4W6INZH7DTT3LDRE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5NI6FYKHEY4W6INZH7DTT3LDRE/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-03T11:27:41Z","links":{"resolver":"https://pith.science/pith/5NI6FYKHEY4W6INZH7DTT3LDRE","bundle":"https://pith.science/pith/5NI6FYKHEY4W6INZH7DTT3LDRE/bundle.json","state":"https://pith.science/pith/5NI6FYKHEY4W6INZH7DTT3LDRE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5NI6FYKHEY4W6INZH7DTT3LDRE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:5NI6FYKHEY4W6INZH7DTT3LDRE","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":"1e212fee77a52d0713c8d78eecd558f714c2085bf16fcaf5a737ccf9c67dfab9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-29T17:23:13Z","title_canon_sha256":"e5f6699af491c1c0a215779e14c88c6b0f81fd546c40726ce83b6f554baab960"},"schema_version":"1.0","source":{"id":"1401.7594","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.7594","created_at":"2026-05-18T03:00:40Z"},{"alias_kind":"arxiv_version","alias_value":"1401.7594v1","created_at":"2026-05-18T03:00:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.7594","created_at":"2026-05-18T03:00:40Z"},{"alias_kind":"pith_short_12","alias_value":"5NI6FYKHEY4W","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"5NI6FYKHEY4W6INZ","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"5NI6FYKH","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:683e61d05ebe72eddd95e458ccdc53ea33d2e2ff62c342209135104bf530c774","target":"graph","created_at":"2026-05-18T03:00:40Z","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$, 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","authors_text":"Ching-Chi Lin, Hai-Lun Tu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-29T17:23:13Z","title":"Linear-Time Algorithms for the Paired-Domination Problem in Interval Graphs and Circular-Arc Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.7594","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:7177d6c23328e52954758fa6a1c54cb3fb8f9e214457dca3091fb63d71045bc6","target":"record","created_at":"2026-05-18T03:00:40Z","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":"1e212fee77a52d0713c8d78eecd558f714c2085bf16fcaf5a737ccf9c67dfab9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-29T17:23:13Z","title_canon_sha256":"e5f6699af491c1c0a215779e14c88c6b0f81fd546c40726ce83b6f554baab960"},"schema_version":"1.0","source":{"id":"1401.7594","kind":"arxiv","version":1}},"canonical_sha256":"eb51e2e14726396f21b93fc739ed6389241258e59604cd9c31840098c051a54e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eb51e2e14726396f21b93fc739ed6389241258e59604cd9c31840098c051a54e","first_computed_at":"2026-05-18T03:00:40.324379Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:00:40.324379Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rfzbChIQXr+Vey/6qZiDgDCuG6KjSFYoUAUgFSLkse3GdhvnDqscnbvqvOMqcwf62ccvFJ0yy8flxpu6nrhZCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:00:40.324926Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.7594","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7177d6c23328e52954758fa6a1c54cb3fb8f9e214457dca3091fb63d71045bc6","sha256:683e61d05ebe72eddd95e458ccdc53ea33d2e2ff62c342209135104bf530c774"],"state_sha256":"33dc308038eb1b7d12ea37c32b9cf9548f048bac0b0585c80a9fb0ac9083192d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SPAiEYWJeKNUJqKgwYLvkkuTP/i757e4rxeIvZSjR07vfRr+6a3oaJpZ8PwMFeP6HcmYZC9SWjx3o+g2vouQAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T11:27:41.387628Z","bundle_sha256":"78fcb4608a7b7264483cd95a663224a363bf4c3188a612c5d7ff323dfbf0af7b"}}