{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:EQSU7INLVNHEDZWNAMYA73IS3O","short_pith_number":"pith:EQSU7INL","canonical_record":{"source":{"id":"1507.02130","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-07-08T12:50:50Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"bb00a538e2b6330524d7b27f3c775cf9b73206e3558ef614af4008d356256493","abstract_canon_sha256":"bccd5ab85f175fddfa5ac1bdc9ce1774b6cd63772ae374a76c83a8051b76ea7f"},"schema_version":"1.0"},"canonical_sha256":"24254fa1abab4e41e6cd03300fed12db8ede060da95f84c917276ec537a8e671","source":{"kind":"arxiv","id":"1507.02130","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.02130","created_at":"2026-05-18T00:45:30Z"},{"alias_kind":"arxiv_version","alias_value":"1507.02130v2","created_at":"2026-05-18T00:45:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02130","created_at":"2026-05-18T00:45:30Z"},{"alias_kind":"pith_short_12","alias_value":"EQSU7INLVNHE","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EQSU7INLVNHEDZWN","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EQSU7INL","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:EQSU7INLVNHEDZWNAMYA73IS3O","target":"record","payload":{"canonical_record":{"source":{"id":"1507.02130","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-07-08T12:50:50Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"bb00a538e2b6330524d7b27f3c775cf9b73206e3558ef614af4008d356256493","abstract_canon_sha256":"bccd5ab85f175fddfa5ac1bdc9ce1774b6cd63772ae374a76c83a8051b76ea7f"},"schema_version":"1.0"},"canonical_sha256":"24254fa1abab4e41e6cd03300fed12db8ede060da95f84c917276ec537a8e671","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:30.703463Z","signature_b64":"DMI0ayAsN1fPrMiA4O4L812hoW+ZU5Z44MG0rZziq6eTWxqVXxsSHaQ7zyq1d2Ap67oEHPJTpB2c93XfNcWDAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24254fa1abab4e41e6cd03300fed12db8ede060da95f84c917276ec537a8e671","last_reissued_at":"2026-05-18T00:45:30.702958Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:30.702958Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.02130","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:45:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"puZ2QQNJaL8BSae8SOP4T+hW90txsasZGBIy6LHSXvW52Mq/MLujbeJQ1O3fxDRCtYa4YHMtx55sJHApmCaZCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T04:11:44.931253Z"},"content_sha256":"f18da7e7cd18df803312a93a5c748cd0697f905e743f3248cc4ba038caf3e131","schema_version":"1.0","event_id":"sha256:f18da7e7cd18df803312a93a5c748cd0697f905e743f3248cc4ba038caf3e131"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:EQSU7INLVNHEDZWNAMYA73IS3O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On interference among moving sensors and related problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CG","authors_text":"Andr\\'e van Renssen, Jean-Lou De Carufel, Marcel Roeloffzen, Matias Korman, Matya Katz, Shakhar Smorodinsky","submitted_at":"2015-07-08T12:50:50Z","abstract_excerpt":"We show that for any set of $n$ points moving along \"simple\" trajectories (i.e., each coordinate is described with a polynomial of bounded degree) in $\\Re^d$ and any parameter $2 \\le k \\le n$, one can select a fixed non-empty subset of the points of size $O(k \\log k)$, such that the Voronoi diagram of this subset is \"balanced\" at any given time (i.e., it contains $O(n/k)$ points per cell). We also show that the bound $O(k \\log k)$ is near optimal even for the one dimensional case in which points move linearly in time. As applications, we show that one can assign communication radii to the sens"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.02130","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:45:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jyuKAxoj3xq9xmRF32IgKp1Hfhji/eUu78LkSe+umF80kHavV0VCjiZVUNcjXk7MoILl3EtWoR7b+hkXQIvwCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T04:11:44.931641Z"},"content_sha256":"7b7df87105ef2a34f2ec267a374a20192c91ef0c164d1414d1300890d5f0b1a6","schema_version":"1.0","event_id":"sha256:7b7df87105ef2a34f2ec267a374a20192c91ef0c164d1414d1300890d5f0b1a6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EQSU7INLVNHEDZWNAMYA73IS3O/bundle.json","state_url":"https://pith.science/pith/EQSU7INLVNHEDZWNAMYA73IS3O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EQSU7INLVNHEDZWNAMYA73IS3O/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-28T04:11:44Z","links":{"resolver":"https://pith.science/pith/EQSU7INLVNHEDZWNAMYA73IS3O","bundle":"https://pith.science/pith/EQSU7INLVNHEDZWNAMYA73IS3O/bundle.json","state":"https://pith.science/pith/EQSU7INLVNHEDZWNAMYA73IS3O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EQSU7INLVNHEDZWNAMYA73IS3O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:EQSU7INLVNHEDZWNAMYA73IS3O","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":"bccd5ab85f175fddfa5ac1bdc9ce1774b6cd63772ae374a76c83a8051b76ea7f","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-07-08T12:50:50Z","title_canon_sha256":"bb00a538e2b6330524d7b27f3c775cf9b73206e3558ef614af4008d356256493"},"schema_version":"1.0","source":{"id":"1507.02130","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.02130","created_at":"2026-05-18T00:45:30Z"},{"alias_kind":"arxiv_version","alias_value":"1507.02130v2","created_at":"2026-05-18T00:45:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02130","created_at":"2026-05-18T00:45:30Z"},{"alias_kind":"pith_short_12","alias_value":"EQSU7INLVNHE","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EQSU7INLVNHEDZWN","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EQSU7INL","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:7b7df87105ef2a34f2ec267a374a20192c91ef0c164d1414d1300890d5f0b1a6","target":"graph","created_at":"2026-05-18T00:45:30Z","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":"We show that for any set of $n$ points moving along \"simple\" trajectories (i.e., each coordinate is described with a polynomial of bounded degree) in $\\Re^d$ and any parameter $2 \\le k \\le n$, one can select a fixed non-empty subset of the points of size $O(k \\log k)$, such that the Voronoi diagram of this subset is \"balanced\" at any given time (i.e., it contains $O(n/k)$ points per cell). We also show that the bound $O(k \\log k)$ is near optimal even for the one dimensional case in which points move linearly in time. As applications, we show that one can assign communication radii to the sens","authors_text":"Andr\\'e van Renssen, Jean-Lou De Carufel, Marcel Roeloffzen, Matias Korman, Matya Katz, Shakhar Smorodinsky","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-07-08T12:50:50Z","title":"On interference among moving sensors and related problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.02130","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:f18da7e7cd18df803312a93a5c748cd0697f905e743f3248cc4ba038caf3e131","target":"record","created_at":"2026-05-18T00:45:30Z","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":"bccd5ab85f175fddfa5ac1bdc9ce1774b6cd63772ae374a76c83a8051b76ea7f","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-07-08T12:50:50Z","title_canon_sha256":"bb00a538e2b6330524d7b27f3c775cf9b73206e3558ef614af4008d356256493"},"schema_version":"1.0","source":{"id":"1507.02130","kind":"arxiv","version":2}},"canonical_sha256":"24254fa1abab4e41e6cd03300fed12db8ede060da95f84c917276ec537a8e671","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"24254fa1abab4e41e6cd03300fed12db8ede060da95f84c917276ec537a8e671","first_computed_at":"2026-05-18T00:45:30.702958Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:30.702958Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DMI0ayAsN1fPrMiA4O4L812hoW+ZU5Z44MG0rZziq6eTWxqVXxsSHaQ7zyq1d2Ap67oEHPJTpB2c93XfNcWDAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:30.703463Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.02130","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f18da7e7cd18df803312a93a5c748cd0697f905e743f3248cc4ba038caf3e131","sha256:7b7df87105ef2a34f2ec267a374a20192c91ef0c164d1414d1300890d5f0b1a6"],"state_sha256":"de8b31fa602fe80451e7361c6dad5dbb1c8c54d7f01d92e2b1265e72d2c30d53"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Drx+KOtCwIQWuq0qeQGnkh56Bg6FNRJ8gCexYfmqaIwHtlL29R9H2Bo7pwGLabSotXYO52IPhOzHlKyQQ8E0Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T04:11:44.933576Z","bundle_sha256":"a6fd3e535333ed46f041e23237ded202732ef9ef4aa00927c28680194000a46c"}}