{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:B3NGWEU3SQBTXLSWFVQKSIGCXT","short_pith_number":"pith:B3NGWEU3","canonical_record":{"source":{"id":"1606.09596","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-06-30T18:08:40Z","cross_cats_sorted":[],"title_canon_sha256":"4543fbb72d1b6fe5444c6a4fa2261f4d21bda3adeb0a08e0f91f9fc9182ea97d","abstract_canon_sha256":"5b3ef3cc0575bd652ea4227c354fa19071dd532ac6ab60371bc9a8621bd8509b"},"schema_version":"1.0"},"canonical_sha256":"0eda6b129b94033bae562d60a920c2bcfe00d83aa62f4042c433d5d008d479e8","source":{"kind":"arxiv","id":"1606.09596","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.09596","created_at":"2026-05-18T01:11:40Z"},{"alias_kind":"arxiv_version","alias_value":"1606.09596v1","created_at":"2026-05-18T01:11:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.09596","created_at":"2026-05-18T01:11:40Z"},{"alias_kind":"pith_short_12","alias_value":"B3NGWEU3SQBT","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"B3NGWEU3SQBTXLSW","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"B3NGWEU3","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:B3NGWEU3SQBTXLSWFVQKSIGCXT","target":"record","payload":{"canonical_record":{"source":{"id":"1606.09596","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-06-30T18:08:40Z","cross_cats_sorted":[],"title_canon_sha256":"4543fbb72d1b6fe5444c6a4fa2261f4d21bda3adeb0a08e0f91f9fc9182ea97d","abstract_canon_sha256":"5b3ef3cc0575bd652ea4227c354fa19071dd532ac6ab60371bc9a8621bd8509b"},"schema_version":"1.0"},"canonical_sha256":"0eda6b129b94033bae562d60a920c2bcfe00d83aa62f4042c433d5d008d479e8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:40.213545Z","signature_b64":"dIQVthSQsLvswx9HJtA8gcHV4LPEeQRFDgmUWmS971jiE1tjpe4FwNqoAD5O4k1Z2KmwaizxvrIOByUtHk7pAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0eda6b129b94033bae562d60a920c2bcfe00d83aa62f4042c433d5d008d479e8","last_reissued_at":"2026-05-18T01:11:40.213160Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:40.213160Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.09596","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-18T01:11:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bSp0O+m3HjkcstVANPTh0WRLv6xpbIXjkGNW+F6SlzfHArKf33N0AOggh3I1AE0HIjkXT1zzTm3tbkPUujLcAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T08:27:39.919750Z"},"content_sha256":"53295fd1d7f67c95d459e9de59ab16e03320aa51c6fc3351f21954d2a015e771","schema_version":"1.0","event_id":"sha256:53295fd1d7f67c95d459e9de59ab16e03320aa51c6fc3351f21954d2a015e771"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:B3NGWEU3SQBTXLSWFVQKSIGCXT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimizing the Total Movement for Movement to Independence Problem on a Line","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Mehrdad Ghadiri, Sina Yazdanbod","submitted_at":"2016-06-30T18:08:40Z","abstract_excerpt":"Given a positive real value $\\delta$, a set $P$ of points along a line and a distance function $d$, in the movement to independence problem, we wish to move the points to new positions on the line such that for every two points $p_{i},p_{j} \\in P$, we have $d(p_{i},p_{j}) \\geq \\delta$ while minimizing the sum of movements of all points. This measure of the cost for moving the points was previously unsolved in this setting. However for different cost measures there are algorithms of $O(n \\log(n))$ or of $O(n)$. We present an $O(n \\log(n))$ algorithm for the points on a line and thus conclude th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.09596","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-18T01:11:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GlsAq73hAu7NRzh52kYPOvHJ4OSOpMpDMYpBKDSviO4uUsxuiH0xLQ0AQ9VQdWS7cHGh59YKj4a0lZxMaPpGBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T08:27:39.920097Z"},"content_sha256":"0ce680b0a4b228ef7afe8c5bfa725f62c7d745d3738c5ffc58967d5db6bd6678","schema_version":"1.0","event_id":"sha256:0ce680b0a4b228ef7afe8c5bfa725f62c7d745d3738c5ffc58967d5db6bd6678"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B3NGWEU3SQBTXLSWFVQKSIGCXT/bundle.json","state_url":"https://pith.science/pith/B3NGWEU3SQBTXLSWFVQKSIGCXT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B3NGWEU3SQBTXLSWFVQKSIGCXT/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-05T08:27:39Z","links":{"resolver":"https://pith.science/pith/B3NGWEU3SQBTXLSWFVQKSIGCXT","bundle":"https://pith.science/pith/B3NGWEU3SQBTXLSWFVQKSIGCXT/bundle.json","state":"https://pith.science/pith/B3NGWEU3SQBTXLSWFVQKSIGCXT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B3NGWEU3SQBTXLSWFVQKSIGCXT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:B3NGWEU3SQBTXLSWFVQKSIGCXT","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":"5b3ef3cc0575bd652ea4227c354fa19071dd532ac6ab60371bc9a8621bd8509b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-06-30T18:08:40Z","title_canon_sha256":"4543fbb72d1b6fe5444c6a4fa2261f4d21bda3adeb0a08e0f91f9fc9182ea97d"},"schema_version":"1.0","source":{"id":"1606.09596","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.09596","created_at":"2026-05-18T01:11:40Z"},{"alias_kind":"arxiv_version","alias_value":"1606.09596v1","created_at":"2026-05-18T01:11:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.09596","created_at":"2026-05-18T01:11:40Z"},{"alias_kind":"pith_short_12","alias_value":"B3NGWEU3SQBT","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"B3NGWEU3SQBTXLSW","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"B3NGWEU3","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:0ce680b0a4b228ef7afe8c5bfa725f62c7d745d3738c5ffc58967d5db6bd6678","target":"graph","created_at":"2026-05-18T01:11:40Z","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 positive real value $\\delta$, a set $P$ of points along a line and a distance function $d$, in the movement to independence problem, we wish to move the points to new positions on the line such that for every two points $p_{i},p_{j} \\in P$, we have $d(p_{i},p_{j}) \\geq \\delta$ while minimizing the sum of movements of all points. This measure of the cost for moving the points was previously unsolved in this setting. However for different cost measures there are algorithms of $O(n \\log(n))$ or of $O(n)$. We present an $O(n \\log(n))$ algorithm for the points on a line and thus conclude th","authors_text":"Mehrdad Ghadiri, Sina Yazdanbod","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-06-30T18:08:40Z","title":"Minimizing the Total Movement for Movement to Independence Problem on a Line"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.09596","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:53295fd1d7f67c95d459e9de59ab16e03320aa51c6fc3351f21954d2a015e771","target":"record","created_at":"2026-05-18T01:11:40Z","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":"5b3ef3cc0575bd652ea4227c354fa19071dd532ac6ab60371bc9a8621bd8509b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-06-30T18:08:40Z","title_canon_sha256":"4543fbb72d1b6fe5444c6a4fa2261f4d21bda3adeb0a08e0f91f9fc9182ea97d"},"schema_version":"1.0","source":{"id":"1606.09596","kind":"arxiv","version":1}},"canonical_sha256":"0eda6b129b94033bae562d60a920c2bcfe00d83aa62f4042c433d5d008d479e8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0eda6b129b94033bae562d60a920c2bcfe00d83aa62f4042c433d5d008d479e8","first_computed_at":"2026-05-18T01:11:40.213160Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:40.213160Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dIQVthSQsLvswx9HJtA8gcHV4LPEeQRFDgmUWmS971jiE1tjpe4FwNqoAD5O4k1Z2KmwaizxvrIOByUtHk7pAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:40.213545Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.09596","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:53295fd1d7f67c95d459e9de59ab16e03320aa51c6fc3351f21954d2a015e771","sha256:0ce680b0a4b228ef7afe8c5bfa725f62c7d745d3738c5ffc58967d5db6bd6678"],"state_sha256":"a81fd62d31ac9ab1c8ac8b7d95613386834aceb083c539d819e3e765c6779767"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zutKmK+7fpisqUkuLCtR8fKrYowAPmZfLs5XEEBU6dzSW5h4L/JwRYSjNQ9nb5jytMpp0Ebed+s6FMTcuz/FBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T08:27:39.922096Z","bundle_sha256":"3f335d05da6668ee4e6eac3b5e013856c0a3b69f94d4befa6c980770a67bd67d"}}