{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:KI6ZKGFOP3ZBLX6ONRR6PORNTX","short_pith_number":"pith:KI6ZKGFO","schema_version":"1.0","canonical_sha256":"523d9518ae7ef215dfce6c63e7ba2d9dded0efbf22d3b59d0010fbfa76f14492","source":{"kind":"arxiv","id":"1502.01523","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1502.01523","created_at":"2026-05-18T02:27:00.477998+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.01523v2","created_at":"2026-05-18T02:27:00.477998+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.01523","created_at":"2026-05-18T02:27:00.477998+00:00"},{"alias_kind":"pith_short_12","alias_value":"KI6ZKGFOP3ZB","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"KI6ZKGFOP3ZBLX6O","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"KI6ZKGFO","created_at":"2026-05-18T12:29:27.538025+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/KI6ZKGFOP3ZBLX6ONRR6PORNTX","json":"https://pith.science/pith/KI6ZKGFOP3ZBLX6ONRR6PORNTX.json","graph_json":"https://pith.science/api/pith-number/KI6ZKGFOP3ZBLX6ONRR6PORNTX/graph.json","events_json":"https://pith.science/api/pith-number/KI6ZKGFOP3ZBLX6ONRR6PORNTX/events.json","paper":"https://pith.science/paper/KI6ZKGFO"},"agent_actions":{"view_html":"https://pith.science/pith/KI6ZKGFOP3ZBLX6ONRR6PORNTX","download_json":"https://pith.science/pith/KI6ZKGFOP3ZBLX6ONRR6PORNTX.json","view_paper":"https://pith.science/paper/KI6ZKGFO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.01523&json=true","fetch_graph":"https://pith.science/api/pith-number/KI6ZKGFOP3ZBLX6ONRR6PORNTX/graph.json","fetch_events":"https://pith.science/api/pith-number/KI6ZKGFOP3ZBLX6ONRR6PORNTX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KI6ZKGFOP3ZBLX6ONRR6PORNTX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KI6ZKGFOP3ZBLX6ONRR6PORNTX/action/storage_attestation","attest_author":"https://pith.science/pith/KI6ZKGFOP3ZBLX6ONRR6PORNTX/action/author_attestation","sign_citation":"https://pith.science/pith/KI6ZKGFOP3ZBLX6ONRR6PORNTX/action/citation_signature","submit_replication":"https://pith.science/pith/KI6ZKGFOP3ZBLX6ONRR6PORNTX/action/replication_record"}},"created_at":"2026-05-18T02:27:00.477998+00:00","updated_at":"2026-05-18T02:27:00.477998+00:00"}