{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4VB3U7I5AI5YCKLVI73Z6OP67C","short_pith_number":"pith:4VB3U7I5","canonical_record":{"source":{"id":"1705.09643","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-26T16:33:45Z","cross_cats_sorted":[],"title_canon_sha256":"6876855802da84788ac5b0693494353ceeb8f29ca8ccc05c53006d94562b85c9","abstract_canon_sha256":"09d1a89127c49742b8e10019610ddf4853cab533a1c42db7df0942c4bb7b928a"},"schema_version":"1.0"},"canonical_sha256":"e543ba7d1d023b81297547f79f39fef88b44cfb3ea520405b3fae7974bcd92f7","source":{"kind":"arxiv","id":"1705.09643","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.09643","created_at":"2026-05-18T00:43:38Z"},{"alias_kind":"arxiv_version","alias_value":"1705.09643v1","created_at":"2026-05-18T00:43:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09643","created_at":"2026-05-18T00:43:38Z"},{"alias_kind":"pith_short_12","alias_value":"4VB3U7I5AI5Y","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4VB3U7I5AI5YCKLV","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4VB3U7I5","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4VB3U7I5AI5YCKLVI73Z6OP67C","target":"record","payload":{"canonical_record":{"source":{"id":"1705.09643","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-26T16:33:45Z","cross_cats_sorted":[],"title_canon_sha256":"6876855802da84788ac5b0693494353ceeb8f29ca8ccc05c53006d94562b85c9","abstract_canon_sha256":"09d1a89127c49742b8e10019610ddf4853cab533a1c42db7df0942c4bb7b928a"},"schema_version":"1.0"},"canonical_sha256":"e543ba7d1d023b81297547f79f39fef88b44cfb3ea520405b3fae7974bcd92f7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:38.186745Z","signature_b64":"kuZk/lAgE004iyzYUC5dY0T2HL4Plpd/NAFEeMDi/IRROyqR29yiRlYDKLrjIIcIMANqm6L7qIwF00qXQpSWCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e543ba7d1d023b81297547f79f39fef88b44cfb3ea520405b3fae7974bcd92f7","last_reissued_at":"2026-05-18T00:43:38.186295Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:38.186295Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.09643","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-18T00:43:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y3roAf5rwdVymUbBNJ2xoRKqFs/9vgf3F4Gm4/ttT1oUtjH+ONL6Kckm3RCNslQe+Dyo6c3JYIqxy8KBmOEmBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T07:25:30.871057Z"},"content_sha256":"c3851a6440b5da5fbbfbba9c799babb3f4312f24bb01abbfc6653101d4104cab","schema_version":"1.0","event_id":"sha256:c3851a6440b5da5fbbfbba9c799babb3f4312f24bb01abbfc6653101d4104cab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4VB3U7I5AI5YCKLVI73Z6OP67C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A greedy approximation algorithm for the minimum (2,2)-connected dominating set problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Asish Mukhopadhyay, Md. Zamilur Rahman, Yash P. Aneja","submitted_at":"2017-05-26T16:33:45Z","abstract_excerpt":"Using a connected dominating set (CDS) to serve as the virtual backbone of a wireless sensor network (WSN) is an effective way to save energy and reduce the impact of broadcasting storms. Since nodes may fail due to accidental damage or energy depletion, it is desirable that the virtual backbone is fault tolerant. This could be modeled as a k-connected, m-fold dominating set ((k,m)-CDS). Given a virtual undirected network G=(V,E), a subset C\\subset V is a (k,m)-CDS of G if (i) G[C], the subgraph of G induced by C is k-connected, and (ii) each node in V\\C has at least m neighbors in C. We prese"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09643","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":""},"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:43:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0Fi8QKJ1PY+rlOvlMr2HLuSm+RfEJLj2r8Uz2f7k/Raxsk1UqjPfVT4W8W061AEBjKhzK6W2dOAVzEkX9tANAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T07:25:30.871410Z"},"content_sha256":"12ae78c14731f51b207cf6db782e2b5a8d3f8deb460c9897a5679efd7e203176","schema_version":"1.0","event_id":"sha256:12ae78c14731f51b207cf6db782e2b5a8d3f8deb460c9897a5679efd7e203176"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4VB3U7I5AI5YCKLVI73Z6OP67C/bundle.json","state_url":"https://pith.science/pith/4VB3U7I5AI5YCKLVI73Z6OP67C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4VB3U7I5AI5YCKLVI73Z6OP67C/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-30T07:25:30Z","links":{"resolver":"https://pith.science/pith/4VB3U7I5AI5YCKLVI73Z6OP67C","bundle":"https://pith.science/pith/4VB3U7I5AI5YCKLVI73Z6OP67C/bundle.json","state":"https://pith.science/pith/4VB3U7I5AI5YCKLVI73Z6OP67C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4VB3U7I5AI5YCKLVI73Z6OP67C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4VB3U7I5AI5YCKLVI73Z6OP67C","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":"09d1a89127c49742b8e10019610ddf4853cab533a1c42db7df0942c4bb7b928a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-26T16:33:45Z","title_canon_sha256":"6876855802da84788ac5b0693494353ceeb8f29ca8ccc05c53006d94562b85c9"},"schema_version":"1.0","source":{"id":"1705.09643","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.09643","created_at":"2026-05-18T00:43:38Z"},{"alias_kind":"arxiv_version","alias_value":"1705.09643v1","created_at":"2026-05-18T00:43:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09643","created_at":"2026-05-18T00:43:38Z"},{"alias_kind":"pith_short_12","alias_value":"4VB3U7I5AI5Y","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4VB3U7I5AI5YCKLV","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4VB3U7I5","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:12ae78c14731f51b207cf6db782e2b5a8d3f8deb460c9897a5679efd7e203176","target":"graph","created_at":"2026-05-18T00:43:38Z","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":"Using a connected dominating set (CDS) to serve as the virtual backbone of a wireless sensor network (WSN) is an effective way to save energy and reduce the impact of broadcasting storms. Since nodes may fail due to accidental damage or energy depletion, it is desirable that the virtual backbone is fault tolerant. This could be modeled as a k-connected, m-fold dominating set ((k,m)-CDS). Given a virtual undirected network G=(V,E), a subset C\\subset V is a (k,m)-CDS of G if (i) G[C], the subgraph of G induced by C is k-connected, and (ii) each node in V\\C has at least m neighbors in C. We prese","authors_text":"Asish Mukhopadhyay, Md. Zamilur Rahman, Yash P. Aneja","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-26T16:33:45Z","title":"A greedy approximation algorithm for the minimum (2,2)-connected dominating set problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09643","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:c3851a6440b5da5fbbfbba9c799babb3f4312f24bb01abbfc6653101d4104cab","target":"record","created_at":"2026-05-18T00:43:38Z","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":"09d1a89127c49742b8e10019610ddf4853cab533a1c42db7df0942c4bb7b928a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-26T16:33:45Z","title_canon_sha256":"6876855802da84788ac5b0693494353ceeb8f29ca8ccc05c53006d94562b85c9"},"schema_version":"1.0","source":{"id":"1705.09643","kind":"arxiv","version":1}},"canonical_sha256":"e543ba7d1d023b81297547f79f39fef88b44cfb3ea520405b3fae7974bcd92f7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e543ba7d1d023b81297547f79f39fef88b44cfb3ea520405b3fae7974bcd92f7","first_computed_at":"2026-05-18T00:43:38.186295Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:38.186295Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kuZk/lAgE004iyzYUC5dY0T2HL4Plpd/NAFEeMDi/IRROyqR29yiRlYDKLrjIIcIMANqm6L7qIwF00qXQpSWCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:38.186745Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.09643","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c3851a6440b5da5fbbfbba9c799babb3f4312f24bb01abbfc6653101d4104cab","sha256:12ae78c14731f51b207cf6db782e2b5a8d3f8deb460c9897a5679efd7e203176"],"state_sha256":"42e3975b05183cb2fa96a436be45c168ca143a1aad5ad790cdcee601f1d5283b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QfFCF+9MX2cXgP8sNLHeNuriS6Fh1Hm1dZHGEg1dCqJgDHet61BIupg2OeXY6LY0q+pqp9OoyEr6RvHBK9AcCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T07:25:30.874214Z","bundle_sha256":"bf4864a7a4b59894031f61061833b194517fbaa0b951360ee977fed0d10624bd"}}