{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:F5QJ3OWRAHHNL36FDBRUCCXPY6","short_pith_number":"pith:F5QJ3OWR","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"},"canonical_sha256":"2f609dbad101ced5efc51863410aefc796a77acd980bd4b5270c80ee2fb0bf40","source":{"kind":"arxiv","id":"2605.20970","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.20970","created_at":"2026-05-21T01:05:30Z"},{"alias_kind":"arxiv_version","alias_value":"2605.20970v1","created_at":"2026-05-21T01:05:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.20970","created_at":"2026-05-21T01:05:30Z"},{"alias_kind":"pith_short_12","alias_value":"F5QJ3OWRAHHN","created_at":"2026-05-21T01:05:30Z"},{"alias_kind":"pith_short_16","alias_value":"F5QJ3OWRAHHNL36F","created_at":"2026-05-21T01:05:30Z"},{"alias_kind":"pith_short_8","alias_value":"F5QJ3OWR","created_at":"2026-05-21T01:05:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:F5QJ3OWRAHHNL36FDBRUCCXPY6","target":"record","payload":{"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"},"canonical_sha256":"2f609dbad101ced5efc51863410aefc796a77acd980bd4b5270c80ee2fb0bf40","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"},"source_kind":"arxiv","source_id":"2605.20970","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-21T01:05:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4Xh4qvwSTgXz6vLSoICc688DN6o3MSz+uOybCdWu6PPbrcJXttMd6RPHMDSYYSE5IgPOoHKR4Xyr0b2ZqkHDDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T06:28:27.677815Z"},"content_sha256":"0e731a6d84c2e6ce8fe43e73140074997f63a21fa45c7bb997ec48de60e5146e","schema_version":"1.0","event_id":"sha256:0e731a6d84c2e6ce8fe43e73140074997f63a21fa45c7bb997ec48de60e5146e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:F5QJ3OWRAHHNL36FDBRUCCXPY6","target":"graph","payload":{"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"},"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-21T01:05:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PpQ6wD+p0V01zSjqQFMYvX2Fs4jz8GoyNNyoIKE5mnGtWA/f48esibPwhY3Ks+C7WP62eS6fajZqbT4hSz26CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T06:28:27.678410Z"},"content_sha256":"046a5e6553093c8b239a44f837df9824b68ab2639985283c71c40bcc1a0885f6","schema_version":"1.0","event_id":"sha256:046a5e6553093c8b239a44f837df9824b68ab2639985283c71c40bcc1a0885f6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F5QJ3OWRAHHNL36FDBRUCCXPY6/bundle.json","state_url":"https://pith.science/pith/F5QJ3OWRAHHNL36FDBRUCCXPY6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F5QJ3OWRAHHNL36FDBRUCCXPY6/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-05-23T06:28:27Z","links":{"resolver":"https://pith.science/pith/F5QJ3OWRAHHNL36FDBRUCCXPY6","bundle":"https://pith.science/pith/F5QJ3OWRAHHNL36FDBRUCCXPY6/bundle.json","state":"https://pith.science/pith/F5QJ3OWRAHHNL36FDBRUCCXPY6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F5QJ3OWRAHHNL36FDBRUCCXPY6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:F5QJ3OWRAHHNL36FDBRUCCXPY6","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":"1834b1c1ad071ff32ca6982c6d117c34cfcdb3b09fc2741265e55ee6f8d01201","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DM","submitted_at":"2026-05-20T09:57:50Z","title_canon_sha256":"b6a7a1769afc07904beeb0075b18d25da2f2f7ae121517fd373e0b4c99ca0efc"},"schema_version":"1.0","source":{"id":"2605.20970","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.20970","created_at":"2026-05-21T01:05:30Z"},{"alias_kind":"arxiv_version","alias_value":"2605.20970v1","created_at":"2026-05-21T01:05:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.20970","created_at":"2026-05-21T01:05:30Z"},{"alias_kind":"pith_short_12","alias_value":"F5QJ3OWRAHHN","created_at":"2026-05-21T01:05:30Z"},{"alias_kind":"pith_short_16","alias_value":"F5QJ3OWRAHHNL36F","created_at":"2026-05-21T01:05:30Z"},{"alias_kind":"pith_short_8","alias_value":"F5QJ3OWR","created_at":"2026-05-21T01:05:30Z"}],"graph_snapshots":[{"event_id":"sha256:046a5e6553093c8b239a44f837df9824b68ab2639985283c71c40bcc1a0885f6","target":"graph","created_at":"2026-05-21T01:05:30Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2605.20970/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Sandip Das, Sk Samim Islam, Sweta Das","cross_cats":["math.CO"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DM","submitted_at":"2026-05-20T09:57:50Z","title":"On the Complexity of Hop Domination and 2-Step Domination in Graph Classes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.20970","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:0e731a6d84c2e6ce8fe43e73140074997f63a21fa45c7bb997ec48de60e5146e","target":"record","created_at":"2026-05-21T01:05:30Z","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":"1834b1c1ad071ff32ca6982c6d117c34cfcdb3b09fc2741265e55ee6f8d01201","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DM","submitted_at":"2026-05-20T09:57:50Z","title_canon_sha256":"b6a7a1769afc07904beeb0075b18d25da2f2f7ae121517fd373e0b4c99ca0efc"},"schema_version":"1.0","source":{"id":"2605.20970","kind":"arxiv","version":1}},"canonical_sha256":"2f609dbad101ced5efc51863410aefc796a77acd980bd4b5270c80ee2fb0bf40","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2f609dbad101ced5efc51863410aefc796a77acd980bd4b5270c80ee2fb0bf40","first_computed_at":"2026-05-21T01:05:30.453003Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-21T01:05:30.453003Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FKwVINPhbODitTfhxtkX3908o2MbPQIKpgr6E/s7y7BiDE5N8hIbLxZK4Kvspf5Bb3rWZeWEjO8ujcPaJqciDg==","signature_status":"signed_v1","signed_at":"2026-05-21T01:05:30.453729Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.20970","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0e731a6d84c2e6ce8fe43e73140074997f63a21fa45c7bb997ec48de60e5146e","sha256:046a5e6553093c8b239a44f837df9824b68ab2639985283c71c40bcc1a0885f6"],"state_sha256":"67e8640d211a999a5400293ab67bc3d2540b76cfe58cf244e1d10a72c0566bf8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lsEtPYR9vdsdaU32cIYa6u0MpsqDMCqFNKq5XprXO1U8pmQWkUxwfNUOGugfGiONQqFZFfkM2JZLDGEGqpkEAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T06:28:27.681708Z","bundle_sha256":"ba6ded4e82137d566dbebb400ff6cb69ea13617e59c8521d277148848b3a9411"}}