{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:N4DREIKO6Z3TZZVXLWP4WELZ4L","short_pith_number":"pith:N4DREIKO","canonical_record":{"source":{"id":"1404.6890","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-28T07:51:54Z","cross_cats_sorted":[],"title_canon_sha256":"099f4b6e2c985baec3a9add323d82aafd99daef7e6f85c82c32e0cad39777b80","abstract_canon_sha256":"f3bac9dffcf65256b42c33abc5cfe30d5483ab35ee474963387af474ac6f02b4"},"schema_version":"1.0"},"canonical_sha256":"6f0712214ef6773ce6b75d9fcb1179e2d9b22d87943377135aaee2f3fec569d8","source":{"kind":"arxiv","id":"1404.6890","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.6890","created_at":"2026-05-18T00:52:04Z"},{"alias_kind":"arxiv_version","alias_value":"1404.6890v2","created_at":"2026-05-18T00:52:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.6890","created_at":"2026-05-18T00:52:04Z"},{"alias_kind":"pith_short_12","alias_value":"N4DREIKO6Z3T","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"N4DREIKO6Z3TZZVX","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"N4DREIKO","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:N4DREIKO6Z3TZZVXLWP4WELZ4L","target":"record","payload":{"canonical_record":{"source":{"id":"1404.6890","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-28T07:51:54Z","cross_cats_sorted":[],"title_canon_sha256":"099f4b6e2c985baec3a9add323d82aafd99daef7e6f85c82c32e0cad39777b80","abstract_canon_sha256":"f3bac9dffcf65256b42c33abc5cfe30d5483ab35ee474963387af474ac6f02b4"},"schema_version":"1.0"},"canonical_sha256":"6f0712214ef6773ce6b75d9fcb1179e2d9b22d87943377135aaee2f3fec569d8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:04.452996Z","signature_b64":"K7M5wrn/eyRaygyPX9LgsLoaonvhs3teGQQaQ9pVdJQd1n1pRlGSmO5BnR4qut+Ca8yNr/hdB50IaY4DCf95CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f0712214ef6773ce6b75d9fcb1179e2d9b22d87943377135aaee2f3fec569d8","last_reissued_at":"2026-05-18T00:52:04.452431Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:04.452431Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.6890","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-18T00:52:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+f3VKPZVW0vCM8etAN7AnMSL53viaMUyFKSAxBl+pPaRpLqh6HMUWmQh6UUZh1/PGJFu1MEjlsUCt1tDt9WWCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T03:43:21.712521Z"},"content_sha256":"1473264ac93733b3c12bfe321fbce654566c3d2fa0529425c5c2be0781d707aa","schema_version":"1.0","event_id":"sha256:1473264ac93733b3c12bfe321fbce654566c3d2fa0529425c5c2be0781d707aa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:N4DREIKO6Z3TZZVXLWP4WELZ4L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Analysis of d-Hop Dominating Set Problem for Directed Graph with Indegree Bounded by One","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Arunabha Sen, Arun Das, Joydeep Banerjee","submitted_at":"2014-04-28T07:51:54Z","abstract_excerpt":"Efficient communication between nodes in ad-hoc networks can be established through repeated cluster formations with designated \\textit{cluster-heads}. In this context minimum d-hop dominating set problem was introduced for cluster formation in ad-hoc networks and is proved to be NP-complete. Hence, an exact solution to this problem for certain subclass of graphs (representing an ad-hoc network) can be beneficial. In this short paper we perform computational complexity analysis of minimum d-hop dominating set problem for directed graphs with in-degree bounded by $1$. The optimum solution of th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.6890","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-18T00:52:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u6ymQ+qugYa90qE8vgLAq9b9wvf/Xsui2W0aIqtGYCUc+oqa7gqs6Q/DUYICANrt3w2/q/uZOGWmCC9/mS6wBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T03:43:21.712864Z"},"content_sha256":"67d4ae3d2c9ee535e5bbb5a600b243e975d0b1f1f6d6c4df4d332cd2bd91fa4c","schema_version":"1.0","event_id":"sha256:67d4ae3d2c9ee535e5bbb5a600b243e975d0b1f1f6d6c4df4d332cd2bd91fa4c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N4DREIKO6Z3TZZVXLWP4WELZ4L/bundle.json","state_url":"https://pith.science/pith/N4DREIKO6Z3TZZVXLWP4WELZ4L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N4DREIKO6Z3TZZVXLWP4WELZ4L/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-22T03:43:21Z","links":{"resolver":"https://pith.science/pith/N4DREIKO6Z3TZZVXLWP4WELZ4L","bundle":"https://pith.science/pith/N4DREIKO6Z3TZZVXLWP4WELZ4L/bundle.json","state":"https://pith.science/pith/N4DREIKO6Z3TZZVXLWP4WELZ4L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N4DREIKO6Z3TZZVXLWP4WELZ4L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:N4DREIKO6Z3TZZVXLWP4WELZ4L","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":"f3bac9dffcf65256b42c33abc5cfe30d5483ab35ee474963387af474ac6f02b4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-28T07:51:54Z","title_canon_sha256":"099f4b6e2c985baec3a9add323d82aafd99daef7e6f85c82c32e0cad39777b80"},"schema_version":"1.0","source":{"id":"1404.6890","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.6890","created_at":"2026-05-18T00:52:04Z"},{"alias_kind":"arxiv_version","alias_value":"1404.6890v2","created_at":"2026-05-18T00:52:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.6890","created_at":"2026-05-18T00:52:04Z"},{"alias_kind":"pith_short_12","alias_value":"N4DREIKO6Z3T","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"N4DREIKO6Z3TZZVX","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"N4DREIKO","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:67d4ae3d2c9ee535e5bbb5a600b243e975d0b1f1f6d6c4df4d332cd2bd91fa4c","target":"graph","created_at":"2026-05-18T00:52:04Z","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":"Efficient communication between nodes in ad-hoc networks can be established through repeated cluster formations with designated \\textit{cluster-heads}. In this context minimum d-hop dominating set problem was introduced for cluster formation in ad-hoc networks and is proved to be NP-complete. Hence, an exact solution to this problem for certain subclass of graphs (representing an ad-hoc network) can be beneficial. In this short paper we perform computational complexity analysis of minimum d-hop dominating set problem for directed graphs with in-degree bounded by $1$. The optimum solution of th","authors_text":"Arunabha Sen, Arun Das, Joydeep Banerjee","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-28T07:51:54Z","title":"Analysis of d-Hop Dominating Set Problem for Directed Graph with Indegree Bounded by One"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.6890","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:1473264ac93733b3c12bfe321fbce654566c3d2fa0529425c5c2be0781d707aa","target":"record","created_at":"2026-05-18T00:52:04Z","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":"f3bac9dffcf65256b42c33abc5cfe30d5483ab35ee474963387af474ac6f02b4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-28T07:51:54Z","title_canon_sha256":"099f4b6e2c985baec3a9add323d82aafd99daef7e6f85c82c32e0cad39777b80"},"schema_version":"1.0","source":{"id":"1404.6890","kind":"arxiv","version":2}},"canonical_sha256":"6f0712214ef6773ce6b75d9fcb1179e2d9b22d87943377135aaee2f3fec569d8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6f0712214ef6773ce6b75d9fcb1179e2d9b22d87943377135aaee2f3fec569d8","first_computed_at":"2026-05-18T00:52:04.452431Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:04.452431Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"K7M5wrn/eyRaygyPX9LgsLoaonvhs3teGQQaQ9pVdJQd1n1pRlGSmO5BnR4qut+Ca8yNr/hdB50IaY4DCf95CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:04.452996Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.6890","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1473264ac93733b3c12bfe321fbce654566c3d2fa0529425c5c2be0781d707aa","sha256:67d4ae3d2c9ee535e5bbb5a600b243e975d0b1f1f6d6c4df4d332cd2bd91fa4c"],"state_sha256":"bbe1463a435db708477190fad32b2207336bee12c00b4fc2e907b67115b1c91e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z2OGJJmFabNAEiqZWwHvmMuyVfXAZqc3/oLEKZBLlp+egSLyBifxuYbjttv+oguWDabgt6osoodIgQgc7u1yAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T03:43:21.714769Z","bundle_sha256":"23b43f33559868ae9d78f36bedd4a0913356c5589ce816b8f1e1bfc0093de443"}}