{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:KI6ZKGFOP3ZBLX6ONRR6PORNTX","short_pith_number":"pith:KI6ZKGFO","canonical_record":{"source":{"id":"1502.01523","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-02-05T12:46:53Z","cross_cats_sorted":[],"title_canon_sha256":"aba9ce935322477f84f5c3e682537320dfb71fbcf0f9e7a904c3d388eb94955c","abstract_canon_sha256":"ae64f56ab2fad607f410db9a32fb8387425c485b60bc3d7b976065e95b81cf48"},"schema_version":"1.0"},"canonical_sha256":"523d9518ae7ef215dfce6c63e7ba2d9dded0efbf22d3b59d0010fbfa76f14492","source":{"kind":"arxiv","id":"1502.01523","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.01523","created_at":"2026-05-18T02:27:00Z"},{"alias_kind":"arxiv_version","alias_value":"1502.01523v2","created_at":"2026-05-18T02:27:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.01523","created_at":"2026-05-18T02:27:00Z"},{"alias_kind":"pith_short_12","alias_value":"KI6ZKGFOP3ZB","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"KI6ZKGFOP3ZBLX6O","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"KI6ZKGFO","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:KI6ZKGFOP3ZBLX6ONRR6PORNTX","target":"record","payload":{"canonical_record":{"source":{"id":"1502.01523","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-02-05T12:46:53Z","cross_cats_sorted":[],"title_canon_sha256":"aba9ce935322477f84f5c3e682537320dfb71fbcf0f9e7a904c3d388eb94955c","abstract_canon_sha256":"ae64f56ab2fad607f410db9a32fb8387425c485b60bc3d7b976065e95b81cf48"},"schema_version":"1.0"},"canonical_sha256":"523d9518ae7ef215dfce6c63e7ba2d9dded0efbf22d3b59d0010fbfa76f14492","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:00.478306Z","signature_b64":"SqHnpILxol/W/lH3/IYhlieUucxprchnumu8a+ENJ1Xn343kBPVHpP0tZm4i6LBWaoNgKAJa39H0XImV9F+gDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"523d9518ae7ef215dfce6c63e7ba2d9dded0efbf22d3b59d0010fbfa76f14492","last_reissued_at":"2026-05-18T02:27:00.477945Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:00.477945Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.01523","source_version":2,"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-18T02:27:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DoZDqfocnMiwYoFK3w/V67DYWnyMI5NsbjfQ4hLgjdmvEq6S2bydRkUPU/qUSZD5asHHojw/Yxif1xXL6WFhBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T06:24:49.482200Z"},"content_sha256":"44a91c079175a2f04cbea856108a4dc67d9526b8da252539c32a32d8d5167393","schema_version":"1.0","event_id":"sha256:44a91c079175a2f04cbea856108a4dc67d9526b8da252539c32a32d8d5167393"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:KI6ZKGFOP3ZBLX6ONRR6PORNTX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient and Perfect domination on circular-arc graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Jayme L. Szwarcfiter, Michel J. Mizrahi, Min Chih Lin","submitted_at":"2015-02-05T12:46:53Z","abstract_excerpt":"Given a graph $G = (V,E)$, a \\emph{perfect dominating set} is a subset of vertices $V' \\subseteq V(G)$ such that each vertex $v \\in V(G)\\setminus V'$ is dominated by exactly one vertex $v' \\in V'$. An \\emph{efficient dominating set} is a perfect dominating set $V'$ where $V'$ is also an independent set. These problems are usually posed in terms of edges instead of vertices. Both problems, either for the vertex or edge variant, remains NP-Hard, even when restricted to certain graphs families. We study both variants of the problems for the circular-arc graphs, and show efficient algorithms for a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.01523","kind":"arxiv","version":2},"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-18T02:27:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kXnc+a4itDrZsGRe5qc0oAgba+iB1U00vWln8EBjRA8ekcP7+rTQjTbk+yzZHHCX/z3/XPXXvyUJ4ITIq4+iCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T06:24:49.482547Z"},"content_sha256":"23f1c4de5e15c7438a74ec6453d0f6552ca7e175453db2132c62d7df22fbe064","schema_version":"1.0","event_id":"sha256:23f1c4de5e15c7438a74ec6453d0f6552ca7e175453db2132c62d7df22fbe064"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KI6ZKGFOP3ZBLX6ONRR6PORNTX/bundle.json","state_url":"https://pith.science/pith/KI6ZKGFOP3ZBLX6ONRR6PORNTX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KI6ZKGFOP3ZBLX6ONRR6PORNTX/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-27T06:24:49Z","links":{"resolver":"https://pith.science/pith/KI6ZKGFOP3ZBLX6ONRR6PORNTX","bundle":"https://pith.science/pith/KI6ZKGFOP3ZBLX6ONRR6PORNTX/bundle.json","state":"https://pith.science/pith/KI6ZKGFOP3ZBLX6ONRR6PORNTX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KI6ZKGFOP3ZBLX6ONRR6PORNTX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:KI6ZKGFOP3ZBLX6ONRR6PORNTX","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":"ae64f56ab2fad607f410db9a32fb8387425c485b60bc3d7b976065e95b81cf48","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-02-05T12:46:53Z","title_canon_sha256":"aba9ce935322477f84f5c3e682537320dfb71fbcf0f9e7a904c3d388eb94955c"},"schema_version":"1.0","source":{"id":"1502.01523","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.01523","created_at":"2026-05-18T02:27:00Z"},{"alias_kind":"arxiv_version","alias_value":"1502.01523v2","created_at":"2026-05-18T02:27:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.01523","created_at":"2026-05-18T02:27:00Z"},{"alias_kind":"pith_short_12","alias_value":"KI6ZKGFOP3ZB","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"KI6ZKGFOP3ZBLX6O","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"KI6ZKGFO","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:23f1c4de5e15c7438a74ec6453d0f6552ca7e175453db2132c62d7df22fbe064","target":"graph","created_at":"2026-05-18T02:27:00Z","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":"Given a graph $G = (V,E)$, a \\emph{perfect dominating set} is a subset of vertices $V' \\subseteq V(G)$ such that each vertex $v \\in V(G)\\setminus V'$ is dominated by exactly one vertex $v' \\in V'$. An \\emph{efficient dominating set} is a perfect dominating set $V'$ where $V'$ is also an independent set. These problems are usually posed in terms of edges instead of vertices. Both problems, either for the vertex or edge variant, remains NP-Hard, even when restricted to certain graphs families. We study both variants of the problems for the circular-arc graphs, and show efficient algorithms for a","authors_text":"Jayme L. Szwarcfiter, Michel J. Mizrahi, Min Chih Lin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-02-05T12:46:53Z","title":"Efficient and Perfect domination on circular-arc graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.01523","kind":"arxiv","version":2},"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:44a91c079175a2f04cbea856108a4dc67d9526b8da252539c32a32d8d5167393","target":"record","created_at":"2026-05-18T02:27:00Z","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":"ae64f56ab2fad607f410db9a32fb8387425c485b60bc3d7b976065e95b81cf48","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-02-05T12:46:53Z","title_canon_sha256":"aba9ce935322477f84f5c3e682537320dfb71fbcf0f9e7a904c3d388eb94955c"},"schema_version":"1.0","source":{"id":"1502.01523","kind":"arxiv","version":2}},"canonical_sha256":"523d9518ae7ef215dfce6c63e7ba2d9dded0efbf22d3b59d0010fbfa76f14492","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"523d9518ae7ef215dfce6c63e7ba2d9dded0efbf22d3b59d0010fbfa76f14492","first_computed_at":"2026-05-18T02:27:00.477945Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:27:00.477945Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SqHnpILxol/W/lH3/IYhlieUucxprchnumu8a+ENJ1Xn343kBPVHpP0tZm4i6LBWaoNgKAJa39H0XImV9F+gDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:27:00.478306Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.01523","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:44a91c079175a2f04cbea856108a4dc67d9526b8da252539c32a32d8d5167393","sha256:23f1c4de5e15c7438a74ec6453d0f6552ca7e175453db2132c62d7df22fbe064"],"state_sha256":"25fed4830f5c40360680e01ae1e8552aa8a39c2e165268e91e7a451db1ffb8d1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"czd8DpJ8QXEyBOrmLx5fS1TU/av0n45DR/atiprjKVtqQtToku5vEAxBYN+PuuXwc9qCgMH/bM8z2SoyI6NRBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T06:24:49.484364Z","bundle_sha256":"85093f55984225aabdfdafa378c6f7a235f04b9753615f76189025a070f37c61"}}