{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:Y4SDUGZGNTSWDOVQYMHDFA376V","short_pith_number":"pith:Y4SDUGZG","canonical_record":{"source":{"id":"1304.2112","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-04-08T06:35:33Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"011535bef5791c7f5fcd16900399459e79dacb2704d126fc09f0b89a7ace07f6","abstract_canon_sha256":"974edcb7f7ed93c59339d24e1b8214239479f22eac1ee03be022d7b4cdda3d15"},"schema_version":"1.0"},"canonical_sha256":"c7243a1b266ce561bab0c30e32837ff559cea070ac218db366f5c9a12fee7db2","source":{"kind":"arxiv","id":"1304.2112","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.2112","created_at":"2026-05-18T03:28:43Z"},{"alias_kind":"arxiv_version","alias_value":"1304.2112v1","created_at":"2026-05-18T03:28:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.2112","created_at":"2026-05-18T03:28:43Z"},{"alias_kind":"pith_short_12","alias_value":"Y4SDUGZGNTSW","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"Y4SDUGZGNTSWDOVQ","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"Y4SDUGZG","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:Y4SDUGZGNTSWDOVQYMHDFA376V","target":"record","payload":{"canonical_record":{"source":{"id":"1304.2112","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-04-08T06:35:33Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"011535bef5791c7f5fcd16900399459e79dacb2704d126fc09f0b89a7ace07f6","abstract_canon_sha256":"974edcb7f7ed93c59339d24e1b8214239479f22eac1ee03be022d7b4cdda3d15"},"schema_version":"1.0"},"canonical_sha256":"c7243a1b266ce561bab0c30e32837ff559cea070ac218db366f5c9a12fee7db2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:28:43.989551Z","signature_b64":"Q2JpYGoQ2oziJSfyQoNBphVEWGf6ScvTEaCBUGpfQkRYPFyeo0akR4qAZuq4laZ2YS6jzJlv7CK/y9nOIjH8CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c7243a1b266ce561bab0c30e32837ff559cea070ac218db366f5c9a12fee7db2","last_reissued_at":"2026-05-18T03:28:43.988766Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:28:43.988766Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.2112","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-18T03:28:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ERw8hrDC2z9/KnIP9PS13o0xWFYjzKW48jMeyqxELSMYRO6JwEP9rofMFkv7NbUB2LELMS8rakTWhmzSQynCBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T04:25:22.048703Z"},"content_sha256":"bfb9f218eb50ab5f8c8f61e08b9356216d7d9a54d638d2139065378a3531d44f","schema_version":"1.0","event_id":"sha256:bfb9f218eb50ab5f8c8f61e08b9356216d7d9a54d638d2139065378a3531d44f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:Y4SDUGZGNTSWDOVQYMHDFA376V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Probabilistic Algorithm for Reducing Broadcast Redundancy in Ad Hoc Wireless Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.NI","authors_text":"A. M. Moshiur Rahman, Md. Nazrul Islam, M.M.A. Hashem","submitted_at":"2013-04-08T06:35:33Z","abstract_excerpt":"In a wired network, a packet can be transmitted to a specified destination only, no broadcasting required. But in ad hoc wireless network a packet transmitted by a node can reach all neighbors due to broadcasting. This broadcasting introduces unnecessary retransmissions of same message. Therefore, the total number of transmissions (forward nodes) is generally used as the cost criterion for broadcasting. The problem of finding the minimum number of forward nodes is NP-complete. In this paper, the goal is to reduce the number of forward nodes which will reduce redundant transmission as a result."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.2112","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-18T03:28:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cZmaUKg0FDEGVk6IaOAUHCiICUrRPo788GmC27QL3V1PMPmyz+W6Xvzg4kO2kPwxFoLYuWlkj8BjL1ne/pLUDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T04:25:22.049051Z"},"content_sha256":"9ea834638888d7950435ee024998469e896b93385c0736127975bbb7d950127f","schema_version":"1.0","event_id":"sha256:9ea834638888d7950435ee024998469e896b93385c0736127975bbb7d950127f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y4SDUGZGNTSWDOVQYMHDFA376V/bundle.json","state_url":"https://pith.science/pith/Y4SDUGZGNTSWDOVQYMHDFA376V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y4SDUGZGNTSWDOVQYMHDFA376V/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-07-01T04:25:22Z","links":{"resolver":"https://pith.science/pith/Y4SDUGZGNTSWDOVQYMHDFA376V","bundle":"https://pith.science/pith/Y4SDUGZGNTSWDOVQYMHDFA376V/bundle.json","state":"https://pith.science/pith/Y4SDUGZGNTSWDOVQYMHDFA376V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y4SDUGZGNTSWDOVQYMHDFA376V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:Y4SDUGZGNTSWDOVQYMHDFA376V","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":"974edcb7f7ed93c59339d24e1b8214239479f22eac1ee03be022d7b4cdda3d15","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-04-08T06:35:33Z","title_canon_sha256":"011535bef5791c7f5fcd16900399459e79dacb2704d126fc09f0b89a7ace07f6"},"schema_version":"1.0","source":{"id":"1304.2112","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.2112","created_at":"2026-05-18T03:28:43Z"},{"alias_kind":"arxiv_version","alias_value":"1304.2112v1","created_at":"2026-05-18T03:28:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.2112","created_at":"2026-05-18T03:28:43Z"},{"alias_kind":"pith_short_12","alias_value":"Y4SDUGZGNTSW","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"Y4SDUGZGNTSWDOVQ","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"Y4SDUGZG","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:9ea834638888d7950435ee024998469e896b93385c0736127975bbb7d950127f","target":"graph","created_at":"2026-05-18T03:28:43Z","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":"In a wired network, a packet can be transmitted to a specified destination only, no broadcasting required. But in ad hoc wireless network a packet transmitted by a node can reach all neighbors due to broadcasting. This broadcasting introduces unnecessary retransmissions of same message. Therefore, the total number of transmissions (forward nodes) is generally used as the cost criterion for broadcasting. The problem of finding the minimum number of forward nodes is NP-complete. In this paper, the goal is to reduce the number of forward nodes which will reduce redundant transmission as a result.","authors_text":"A. M. Moshiur Rahman, Md. Nazrul Islam, M.M.A. Hashem","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-04-08T06:35:33Z","title":"A Probabilistic Algorithm for Reducing Broadcast Redundancy in Ad Hoc Wireless Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.2112","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:bfb9f218eb50ab5f8c8f61e08b9356216d7d9a54d638d2139065378a3531d44f","target":"record","created_at":"2026-05-18T03:28:43Z","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":"974edcb7f7ed93c59339d24e1b8214239479f22eac1ee03be022d7b4cdda3d15","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-04-08T06:35:33Z","title_canon_sha256":"011535bef5791c7f5fcd16900399459e79dacb2704d126fc09f0b89a7ace07f6"},"schema_version":"1.0","source":{"id":"1304.2112","kind":"arxiv","version":1}},"canonical_sha256":"c7243a1b266ce561bab0c30e32837ff559cea070ac218db366f5c9a12fee7db2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c7243a1b266ce561bab0c30e32837ff559cea070ac218db366f5c9a12fee7db2","first_computed_at":"2026-05-18T03:28:43.988766Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:28:43.988766Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Q2JpYGoQ2oziJSfyQoNBphVEWGf6ScvTEaCBUGpfQkRYPFyeo0akR4qAZuq4laZ2YS6jzJlv7CK/y9nOIjH8CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:28:43.989551Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.2112","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bfb9f218eb50ab5f8c8f61e08b9356216d7d9a54d638d2139065378a3531d44f","sha256:9ea834638888d7950435ee024998469e896b93385c0736127975bbb7d950127f"],"state_sha256":"1ff43e0d43faa985c9ca81aed40e4a2a112d53a9c2743ffaaa4566250184916b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hh///eIYHazheZqS8ZXyxIbTdLKZpcRoa9Rhx64uaE8C1Pw7EbfrQrNRQswX4wKHEC5FZq5+vFopZtpXus1mBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T04:25:22.050965Z","bundle_sha256":"aac124393157467ec23052e8b04562b78aa244a30e183c461acd6e6a0e5889f7"}}