{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:F5QJ3OWRAHHNL36FDBRUCCXPY6","short_pith_number":"pith:F5QJ3OWR","schema_version":"1.0","canonical_sha256":"2f609dbad101ced5efc51863410aefc796a77acd980bd4b5270c80ee2fb0bf40","source":{"kind":"arxiv","id":"2605.20970","version":1},"attestation_state":"computed","paper":{"title":"On the Complexity of Hop Domination and 2-Step Domination in Graph Classes","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Sandip Das, Sk Samim Islam, Sweta Das","submitted_at":"2026-05-20T09:57:50Z","abstract_excerpt":"The domination problem is a well-studied problem in graph theory. In this paper, we study two natural variants: the hop domination problem and the $2$-step domination problem. Let $G$ be a graph with vertex set $V$ and edge set $E$. For a graph $G$, a subset $S \\subseteq V(G)$ is called an \\emph{hop dominating set} if every vertex not in $S$ lies at distance of exactly $2$ from at least one vertex in $S$. For $v\\in V(G)$, let $N(v,2)$ denote the set of vertices in $V(G)$ that are at distance exactly $2$ from $v$. For a graph $G$, a subset $S \\subseteq V(G)$ is called an \\emph{$2$-step dominati"},"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":"2605.20970","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DM","submitted_at":"2026-05-20T09:57:50Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"b6a7a1769afc07904beeb0075b18d25da2f2f7ae121517fd373e0b4c99ca0efc","abstract_canon_sha256":"1834b1c1ad071ff32ca6982c6d117c34cfcdb3b09fc2741265e55ee6f8d01201"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-21T01:05:30.453729Z","signature_b64":"FKwVINPhbODitTfhxtkX3908o2MbPQIKpgr6E/s7y7BiDE5N8hIbLxZK4Kvspf5Bb3rWZeWEjO8ujcPaJqciDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f609dbad101ced5efc51863410aefc796a77acd980bd4b5270c80ee2fb0bf40","last_reissued_at":"2026-05-21T01:05:30.453003Z","signature_status":"signed_v1","first_computed_at":"2026-05-21T01:05:30.453003Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Complexity of Hop Domination and 2-Step Domination in Graph Classes","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Sandip Das, Sk Samim Islam, Sweta Das","submitted_at":"2026-05-20T09:57:50Z","abstract_excerpt":"The domination problem is a well-studied problem in graph theory. In this paper, we study two natural variants: the hop domination problem and the $2$-step domination problem. Let $G$ be a graph with vertex set $V$ and edge set $E$. For a graph $G$, a subset $S \\subseteq V(G)$ is called an \\emph{hop dominating set} if every vertex not in $S$ lies at distance of exactly $2$ from at least one vertex in $S$. For $v\\in V(G)$, let $N(v,2)$ denote the set of vertices in $V(G)$ that are at distance exactly $2$ from $v$. For a graph $G$, a subset $S \\subseteq V(G)$ is called an \\emph{$2$-step dominati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.20970","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.20970/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2605.20970","created_at":"2026-05-21T01:05:30.453108+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.20970v1","created_at":"2026-05-21T01:05:30.453108+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.20970","created_at":"2026-05-21T01:05:30.453108+00:00"},{"alias_kind":"pith_short_12","alias_value":"F5QJ3OWRAHHN","created_at":"2026-05-21T01:05:30.453108+00:00"},{"alias_kind":"pith_short_16","alias_value":"F5QJ3OWRAHHNL36F","created_at":"2026-05-21T01:05:30.453108+00:00"},{"alias_kind":"pith_short_8","alias_value":"F5QJ3OWR","created_at":"2026-05-21T01:05:30.453108+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/F5QJ3OWRAHHNL36FDBRUCCXPY6","json":"https://pith.science/pith/F5QJ3OWRAHHNL36FDBRUCCXPY6.json","graph_json":"https://pith.science/api/pith-number/F5QJ3OWRAHHNL36FDBRUCCXPY6/graph.json","events_json":"https://pith.science/api/pith-number/F5QJ3OWRAHHNL36FDBRUCCXPY6/events.json","paper":"https://pith.science/paper/F5QJ3OWR"},"agent_actions":{"view_html":"https://pith.science/pith/F5QJ3OWRAHHNL36FDBRUCCXPY6","download_json":"https://pith.science/pith/F5QJ3OWRAHHNL36FDBRUCCXPY6.json","view_paper":"https://pith.science/paper/F5QJ3OWR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.20970&json=true","fetch_graph":"https://pith.science/api/pith-number/F5QJ3OWRAHHNL36FDBRUCCXPY6/graph.json","fetch_events":"https://pith.science/api/pith-number/F5QJ3OWRAHHNL36FDBRUCCXPY6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F5QJ3OWRAHHNL36FDBRUCCXPY6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F5QJ3OWRAHHNL36FDBRUCCXPY6/action/storage_attestation","attest_author":"https://pith.science/pith/F5QJ3OWRAHHNL36FDBRUCCXPY6/action/author_attestation","sign_citation":"https://pith.science/pith/F5QJ3OWRAHHNL36FDBRUCCXPY6/action/citation_signature","submit_replication":"https://pith.science/pith/F5QJ3OWRAHHNL36FDBRUCCXPY6/action/replication_record"}},"created_at":"2026-05-21T01:05:30.453108+00:00","updated_at":"2026-05-21T01:05:30.453108+00:00"}