{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:TSEMSTW2YP2R57CBU7OBRBJG3W","short_pith_number":"pith:TSEMSTW2","canonical_record":{"source":{"id":"1207.5708","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-07-24T14:24:48Z","cross_cats_sorted":[],"title_canon_sha256":"97ef1334d39cd16f0b225fbdaa590a96bbdc154a64813ee071b2be695f581af6","abstract_canon_sha256":"4f66ea2f3ddd07afbddf70e86f9d7c56542ba1200f4897744d89b6eb4e20b97b"},"schema_version":"1.0"},"canonical_sha256":"9c88c94edac3f51efc41a7dc188526ddb8dead369230ee0108386eddfba979b4","source":{"kind":"arxiv","id":"1207.5708","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.5708","created_at":"2026-05-18T03:50:11Z"},{"alias_kind":"arxiv_version","alias_value":"1207.5708v1","created_at":"2026-05-18T03:50:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.5708","created_at":"2026-05-18T03:50:11Z"},{"alias_kind":"pith_short_12","alias_value":"TSEMSTW2YP2R","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"TSEMSTW2YP2R57CB","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"TSEMSTW2","created_at":"2026-05-18T12:27:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:TSEMSTW2YP2R57CBU7OBRBJG3W","target":"record","payload":{"canonical_record":{"source":{"id":"1207.5708","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-07-24T14:24:48Z","cross_cats_sorted":[],"title_canon_sha256":"97ef1334d39cd16f0b225fbdaa590a96bbdc154a64813ee071b2be695f581af6","abstract_canon_sha256":"4f66ea2f3ddd07afbddf70e86f9d7c56542ba1200f4897744d89b6eb4e20b97b"},"schema_version":"1.0"},"canonical_sha256":"9c88c94edac3f51efc41a7dc188526ddb8dead369230ee0108386eddfba979b4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:50:11.578662Z","signature_b64":"ue/RjktnaWOtKQ0K1QKMtCvE3kwVM9IoWeYLS5UvbHnaPNHvCr3jEsBIPRwtW11JGqsa/ialY6U6t81CBsm5Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c88c94edac3f51efc41a7dc188526ddb8dead369230ee0108386eddfba979b4","last_reissued_at":"2026-05-18T03:50:11.577966Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:50:11.577966Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.5708","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:50:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"51jup/l2l5RB9DlSrSTLpa3rkJIfvs3PW8/1T98QsbwRou1SF0NTornff47R3OlLFee+yfnyS8S9UrTu9kPBBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T17:30:17.518756Z"},"content_sha256":"bcc3b3a771d58d591f7bd6a2f47b47d275e8571ddaae51721d2bee285001cf00","schema_version":"1.0","event_id":"sha256:bcc3b3a771d58d591f7bd6a2f47b47d275e8571ddaae51721d2bee285001cf00"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:TSEMSTW2YP2R57CBU7OBRBJG3W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Interference in Wireless Sensor Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Gautam K. Das, Pragya Agrawal","submitted_at":"2012-07-24T14:24:48Z","abstract_excerpt":"Given a set ${\\cal V}$ of $n$ sensor node distributed on a 2-dimensional plane and a source node $s \\in {\\cal V}$, the {\\it interference problem} deals with assigning transmission range to each $v \\in {\\cal V}$ such that the members in ${\\cal V}$ maintain connectivity predicate ${\\cal P}$, and the maximum/total interference is minimum. We propose algorithm for both {\\it minimizing maximum interference} and {\\it minimizing total interference} of the networks. For minimizing maximum interference we present optimum solution with running time $O(({\\cal P}_n + n^2) \\log n)$ for connectivity predica"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.5708","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:50:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hIO9Zzoop3uPjb8Xb/uxxqCquK53LyCrbUQJFCkG8JQYmt7fQodAHYHeyE9Od8ErQ/R9NV2g+59nrvrnZ1MdCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T17:30:17.519323Z"},"content_sha256":"28d1fa9fc1403c7b635e7609bc4daa935f6ec7827608bd0be9881622a704f47b","schema_version":"1.0","event_id":"sha256:28d1fa9fc1403c7b635e7609bc4daa935f6ec7827608bd0be9881622a704f47b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TSEMSTW2YP2R57CBU7OBRBJG3W/bundle.json","state_url":"https://pith.science/pith/TSEMSTW2YP2R57CBU7OBRBJG3W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TSEMSTW2YP2R57CBU7OBRBJG3W/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-08-21T17:30:17Z","links":{"resolver":"https://pith.science/pith/TSEMSTW2YP2R57CBU7OBRBJG3W","bundle":"https://pith.science/pith/TSEMSTW2YP2R57CBU7OBRBJG3W/bundle.json","state":"https://pith.science/pith/TSEMSTW2YP2R57CBU7OBRBJG3W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TSEMSTW2YP2R57CBU7OBRBJG3W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:TSEMSTW2YP2R57CBU7OBRBJG3W","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":"4f66ea2f3ddd07afbddf70e86f9d7c56542ba1200f4897744d89b6eb4e20b97b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-07-24T14:24:48Z","title_canon_sha256":"97ef1334d39cd16f0b225fbdaa590a96bbdc154a64813ee071b2be695f581af6"},"schema_version":"1.0","source":{"id":"1207.5708","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.5708","created_at":"2026-05-18T03:50:11Z"},{"alias_kind":"arxiv_version","alias_value":"1207.5708v1","created_at":"2026-05-18T03:50:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.5708","created_at":"2026-05-18T03:50:11Z"},{"alias_kind":"pith_short_12","alias_value":"TSEMSTW2YP2R","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"TSEMSTW2YP2R57CB","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"TSEMSTW2","created_at":"2026-05-18T12:27:23Z"}],"graph_snapshots":[{"event_id":"sha256:28d1fa9fc1403c7b635e7609bc4daa935f6ec7827608bd0be9881622a704f47b","target":"graph","created_at":"2026-05-18T03:50:11Z","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":"Given a set ${\\cal V}$ of $n$ sensor node distributed on a 2-dimensional plane and a source node $s \\in {\\cal V}$, the {\\it interference problem} deals with assigning transmission range to each $v \\in {\\cal V}$ such that the members in ${\\cal V}$ maintain connectivity predicate ${\\cal P}$, and the maximum/total interference is minimum. We propose algorithm for both {\\it minimizing maximum interference} and {\\it minimizing total interference} of the networks. For minimizing maximum interference we present optimum solution with running time $O(({\\cal P}_n + n^2) \\log n)$ for connectivity predica","authors_text":"Gautam K. Das, Pragya Agrawal","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-07-24T14:24:48Z","title":"Improved Interference in Wireless Sensor Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.5708","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:bcc3b3a771d58d591f7bd6a2f47b47d275e8571ddaae51721d2bee285001cf00","target":"record","created_at":"2026-05-18T03:50:11Z","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":"4f66ea2f3ddd07afbddf70e86f9d7c56542ba1200f4897744d89b6eb4e20b97b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-07-24T14:24:48Z","title_canon_sha256":"97ef1334d39cd16f0b225fbdaa590a96bbdc154a64813ee071b2be695f581af6"},"schema_version":"1.0","source":{"id":"1207.5708","kind":"arxiv","version":1}},"canonical_sha256":"9c88c94edac3f51efc41a7dc188526ddb8dead369230ee0108386eddfba979b4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9c88c94edac3f51efc41a7dc188526ddb8dead369230ee0108386eddfba979b4","first_computed_at":"2026-05-18T03:50:11.577966Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:50:11.577966Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ue/RjktnaWOtKQ0K1QKMtCvE3kwVM9IoWeYLS5UvbHnaPNHvCr3jEsBIPRwtW11JGqsa/ialY6U6t81CBsm5Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T03:50:11.578662Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.5708","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bcc3b3a771d58d591f7bd6a2f47b47d275e8571ddaae51721d2bee285001cf00","sha256:28d1fa9fc1403c7b635e7609bc4daa935f6ec7827608bd0be9881622a704f47b"],"state_sha256":"371d559b78d1432f2680d1443e9d1c0d5413e8c578e01a1958460c4712754670"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AAlhl9+kOhhG6r10yu88MZg4fXERzJ4eLluFLCcZf5Qv9MR5xwBtFj4imQFLaR/JTyKvKhtMpg2uVAei72h/CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T17:30:17.525859Z","bundle_sha256":"52c4970d8135077f000739470677f91c859d64dafe7a2c88492b1c98ac09f89a"}}