{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ZT7OM7EOQ7JQYVZAFR72KW5AK6","short_pith_number":"pith:ZT7OM7EO","canonical_record":{"source":{"id":"1406.7753","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-06-30T14:24:10Z","cross_cats_sorted":[],"title_canon_sha256":"51163338ca9f6f7a166c96871476415727e1669c4e17ddfc43438466ae0e6e00","abstract_canon_sha256":"7562881aff58747c7f75e3f04c104ab0f481e52cc9dce78d550ba786f1e64ba6"},"schema_version":"1.0"},"canonical_sha256":"ccfee67c8e87d30c57202c7fa55ba0579da6ad39bdf374be61d88a275d9976cd","source":{"kind":"arxiv","id":"1406.7753","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.7753","created_at":"2026-05-18T02:48:44Z"},{"alias_kind":"arxiv_version","alias_value":"1406.7753v1","created_at":"2026-05-18T02:48:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.7753","created_at":"2026-05-18T02:48:44Z"},{"alias_kind":"pith_short_12","alias_value":"ZT7OM7EOQ7JQ","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZT7OM7EOQ7JQYVZA","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZT7OM7EO","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ZT7OM7EOQ7JQYVZAFR72KW5AK6","target":"record","payload":{"canonical_record":{"source":{"id":"1406.7753","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-06-30T14:24:10Z","cross_cats_sorted":[],"title_canon_sha256":"51163338ca9f6f7a166c96871476415727e1669c4e17ddfc43438466ae0e6e00","abstract_canon_sha256":"7562881aff58747c7f75e3f04c104ab0f481e52cc9dce78d550ba786f1e64ba6"},"schema_version":"1.0"},"canonical_sha256":"ccfee67c8e87d30c57202c7fa55ba0579da6ad39bdf374be61d88a275d9976cd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:44.271054Z","signature_b64":"KlxChSBoBmx01an2YzoKe222L8xyd5YP0kV1nZH59DZOjINyN+LeAg7fNjg8XafJ8GdSg0CFyzY7tOYv3hpxAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ccfee67c8e87d30c57202c7fa55ba0579da6ad39bdf374be61d88a275d9976cd","last_reissued_at":"2026-05-18T02:48:44.270276Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:44.270276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.7753","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-18T02:48:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VWy/h8AWxT4miOGjcazwLuAQEUTvML2MGgdCFPi8KMp6LiOpKIsmU4547gpW2NrOTiTBBj6UP7FmXueVHfd0Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T17:18:19.617942Z"},"content_sha256":"d6d1dde982486f9eaed1babeab97388bffd829c9702b92d1ff5131edb5630eb7","schema_version":"1.0","event_id":"sha256:d6d1dde982486f9eaed1babeab97388bffd829c9702b92d1ff5131edb5630eb7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ZT7OM7EOQ7JQYVZAFR72KW5AK6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Interference Minimization in Asymmetric Sensor Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Dustin Eversmann, Kevin Buchin, Michael Hoffmann, Wolfgang Mulzer, Yves Brise","submitted_at":"2014-06-30T14:24:10Z","abstract_excerpt":"A fundamental problem in wireless sensor networks is to connect a given set of sensors while minimizing the \\emph{receiver interference}. This is modeled as follows: each sensor node corresponds to a point in $\\mathbb{R}^d$ and each \\emph{transmission range} corresponds to a ball. The receiver interference of a sensor node is defined as the number of transmission ranges it lies in. Our goal is to choose transmission radii that minimize the maximum interference while maintaining a strongly connected asymmetric communication graph.\n  For the two-dimensional case, we show that it is NP-complete t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.7753","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-18T02:48:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9+2dSnk/RvzY6QZMaQaLpq5VNZ7rNSGnyG0cOoxZZKPFbfq0bT6ADNAMtCcaRNc3fbDF1PLwrc6lyZpOXbgcBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T17:18:19.618678Z"},"content_sha256":"f6f60d0aa868a390f128aa3f01a9953dc20ae6424a4efb91c6f0ee1a2e49e9b5","schema_version":"1.0","event_id":"sha256:f6f60d0aa868a390f128aa3f01a9953dc20ae6424a4efb91c6f0ee1a2e49e9b5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZT7OM7EOQ7JQYVZAFR72KW5AK6/bundle.json","state_url":"https://pith.science/pith/ZT7OM7EOQ7JQYVZAFR72KW5AK6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZT7OM7EOQ7JQYVZAFR72KW5AK6/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-23T17:18:19Z","links":{"resolver":"https://pith.science/pith/ZT7OM7EOQ7JQYVZAFR72KW5AK6","bundle":"https://pith.science/pith/ZT7OM7EOQ7JQYVZAFR72KW5AK6/bundle.json","state":"https://pith.science/pith/ZT7OM7EOQ7JQYVZAFR72KW5AK6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZT7OM7EOQ7JQYVZAFR72KW5AK6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ZT7OM7EOQ7JQYVZAFR72KW5AK6","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":"7562881aff58747c7f75e3f04c104ab0f481e52cc9dce78d550ba786f1e64ba6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-06-30T14:24:10Z","title_canon_sha256":"51163338ca9f6f7a166c96871476415727e1669c4e17ddfc43438466ae0e6e00"},"schema_version":"1.0","source":{"id":"1406.7753","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.7753","created_at":"2026-05-18T02:48:44Z"},{"alias_kind":"arxiv_version","alias_value":"1406.7753v1","created_at":"2026-05-18T02:48:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.7753","created_at":"2026-05-18T02:48:44Z"},{"alias_kind":"pith_short_12","alias_value":"ZT7OM7EOQ7JQ","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZT7OM7EOQ7JQYVZA","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZT7OM7EO","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:f6f60d0aa868a390f128aa3f01a9953dc20ae6424a4efb91c6f0ee1a2e49e9b5","target":"graph","created_at":"2026-05-18T02:48:44Z","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":"A fundamental problem in wireless sensor networks is to connect a given set of sensors while minimizing the \\emph{receiver interference}. This is modeled as follows: each sensor node corresponds to a point in $\\mathbb{R}^d$ and each \\emph{transmission range} corresponds to a ball. The receiver interference of a sensor node is defined as the number of transmission ranges it lies in. Our goal is to choose transmission radii that minimize the maximum interference while maintaining a strongly connected asymmetric communication graph.\n  For the two-dimensional case, we show that it is NP-complete t","authors_text":"Dustin Eversmann, Kevin Buchin, Michael Hoffmann, Wolfgang Mulzer, Yves Brise","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-06-30T14:24:10Z","title":"Interference Minimization in Asymmetric Sensor Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.7753","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:d6d1dde982486f9eaed1babeab97388bffd829c9702b92d1ff5131edb5630eb7","target":"record","created_at":"2026-05-18T02:48:44Z","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":"7562881aff58747c7f75e3f04c104ab0f481e52cc9dce78d550ba786f1e64ba6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-06-30T14:24:10Z","title_canon_sha256":"51163338ca9f6f7a166c96871476415727e1669c4e17ddfc43438466ae0e6e00"},"schema_version":"1.0","source":{"id":"1406.7753","kind":"arxiv","version":1}},"canonical_sha256":"ccfee67c8e87d30c57202c7fa55ba0579da6ad39bdf374be61d88a275d9976cd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ccfee67c8e87d30c57202c7fa55ba0579da6ad39bdf374be61d88a275d9976cd","first_computed_at":"2026-05-18T02:48:44.270276Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:48:44.270276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KlxChSBoBmx01an2YzoKe222L8xyd5YP0kV1nZH59DZOjINyN+LeAg7fNjg8XafJ8GdSg0CFyzY7tOYv3hpxAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:48:44.271054Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.7753","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d6d1dde982486f9eaed1babeab97388bffd829c9702b92d1ff5131edb5630eb7","sha256:f6f60d0aa868a390f128aa3f01a9953dc20ae6424a4efb91c6f0ee1a2e49e9b5"],"state_sha256":"04fea28b1f7ce1a18b12427425d43897f59e49c56d46f6b9b9b6276b008da43b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"68HsqZ9agnLizBrHf5OuQ8dsXQ5SUkR1xVFCXhZT6zZilIAVG4oEsOd+W37/omwLeBCjhUj1aMbBhSfoxtx1AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T17:18:19.621891Z","bundle_sha256":"5b2056e5a9c37b4f50e039a02c64887edb4d4dcd9dc1c6655c607db8a15de67b"}}