{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:66LW5S5QKGACVACJR2ERROEA3T","short_pith_number":"pith:66LW5S5Q","canonical_record":{"source":{"id":"1704.06823","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-04-22T17:29:58Z","cross_cats_sorted":[],"title_canon_sha256":"aed3e77f1fc24b27c4114e8124879a3b237467a6766679a750cdca2ac85e7dab","abstract_canon_sha256":"01fc5ae83f4d408d435d98669635973f3d7afdf1c1287d16f0ca7807c8d2ad38"},"schema_version":"1.0"},"canonical_sha256":"f7976ecbb051802a80498e8918b880dcd8375b7c05048821e795c93a4f78f877","source":{"kind":"arxiv","id":"1704.06823","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.06823","created_at":"2026-05-18T00:45:55Z"},{"alias_kind":"arxiv_version","alias_value":"1704.06823v1","created_at":"2026-05-18T00:45:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.06823","created_at":"2026-05-18T00:45:55Z"},{"alias_kind":"pith_short_12","alias_value":"66LW5S5QKGAC","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"66LW5S5QKGACVACJ","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"66LW5S5Q","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:66LW5S5QKGACVACJR2ERROEA3T","target":"record","payload":{"canonical_record":{"source":{"id":"1704.06823","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-04-22T17:29:58Z","cross_cats_sorted":[],"title_canon_sha256":"aed3e77f1fc24b27c4114e8124879a3b237467a6766679a750cdca2ac85e7dab","abstract_canon_sha256":"01fc5ae83f4d408d435d98669635973f3d7afdf1c1287d16f0ca7807c8d2ad38"},"schema_version":"1.0"},"canonical_sha256":"f7976ecbb051802a80498e8918b880dcd8375b7c05048821e795c93a4f78f877","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:55.662369Z","signature_b64":"reh44Pgmkz1aq9p3fMolIv/LEpVtplD7lHztfD4K5/0joETr36/ty9AXfQTaLkMfK4aFX792/oXMOyifYUOxAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7976ecbb051802a80498e8918b880dcd8375b7c05048821e795c93a4f78f877","last_reissued_at":"2026-05-18T00:45:55.661701Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:55.661701Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.06823","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-18T00:45:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KFCW52D3xnRO/YYYUSFfQdxg4CYk/3JqOgdGTSVGk0kGtqe9ogQ9d+QzQ6m9UCSonfiTLBgh9qybqMcai8EQDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:26:21.191995Z"},"content_sha256":"52bbca54b84b0dc017509fe8df78507ea98adc2f126c9f561c7e9cfeb4438315","schema_version":"1.0","event_id":"sha256:52bbca54b84b0dc017509fe8df78507ea98adc2f126c9f561c7e9cfeb4438315"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:66LW5S5QKGACVACJR2ERROEA3T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Approximations for the Online Dispersion Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Bo Li, Jing Chen, Yingkai Li","submitted_at":"2017-04-22T17:29:58Z","abstract_excerpt":"The dispersion problem has been widely studied in computational geometry and facility location, and is closely related to the packing problem. The goal is to locate n points (e.g., facilities or persons) in a k-dimensional polytope, so that they are far away from each other and from the boundary of the polytope. In many real-world scenarios however, the points arrive and depart at different times, and decisions must be made without knowing future events. Therefore we study, for the first time in the literature, the online dispersion problem in Euclidean space.\n  There are two natural objective"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.06823","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-18T00:45:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1GTr2ZAOWY8OKaM6g+zMoOA1oIbECoWl6F7jFiX0dZUnf0kv3bxKmzwBW6KuMU5sRckPHrK41dgAOFNTl9LICg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:26:21.192360Z"},"content_sha256":"6483db2b8c0ae2b97823fce67d6acba9a0bd74401bb894a316fee74fb1f8522a","schema_version":"1.0","event_id":"sha256:6483db2b8c0ae2b97823fce67d6acba9a0bd74401bb894a316fee74fb1f8522a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/66LW5S5QKGACVACJR2ERROEA3T/bundle.json","state_url":"https://pith.science/pith/66LW5S5QKGACVACJR2ERROEA3T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/66LW5S5QKGACVACJR2ERROEA3T/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-27T23:26:21Z","links":{"resolver":"https://pith.science/pith/66LW5S5QKGACVACJR2ERROEA3T","bundle":"https://pith.science/pith/66LW5S5QKGACVACJR2ERROEA3T/bundle.json","state":"https://pith.science/pith/66LW5S5QKGACVACJR2ERROEA3T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/66LW5S5QKGACVACJR2ERROEA3T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:66LW5S5QKGACVACJR2ERROEA3T","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":"01fc5ae83f4d408d435d98669635973f3d7afdf1c1287d16f0ca7807c8d2ad38","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-04-22T17:29:58Z","title_canon_sha256":"aed3e77f1fc24b27c4114e8124879a3b237467a6766679a750cdca2ac85e7dab"},"schema_version":"1.0","source":{"id":"1704.06823","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.06823","created_at":"2026-05-18T00:45:55Z"},{"alias_kind":"arxiv_version","alias_value":"1704.06823v1","created_at":"2026-05-18T00:45:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.06823","created_at":"2026-05-18T00:45:55Z"},{"alias_kind":"pith_short_12","alias_value":"66LW5S5QKGAC","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"66LW5S5QKGACVACJ","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"66LW5S5Q","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:6483db2b8c0ae2b97823fce67d6acba9a0bd74401bb894a316fee74fb1f8522a","target":"graph","created_at":"2026-05-18T00:45:55Z","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":"The dispersion problem has been widely studied in computational geometry and facility location, and is closely related to the packing problem. The goal is to locate n points (e.g., facilities or persons) in a k-dimensional polytope, so that they are far away from each other and from the boundary of the polytope. In many real-world scenarios however, the points arrive and depart at different times, and decisions must be made without knowing future events. Therefore we study, for the first time in the literature, the online dispersion problem in Euclidean space.\n  There are two natural objective","authors_text":"Bo Li, Jing Chen, Yingkai Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-04-22T17:29:58Z","title":"Efficient Approximations for the Online Dispersion Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.06823","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:52bbca54b84b0dc017509fe8df78507ea98adc2f126c9f561c7e9cfeb4438315","target":"record","created_at":"2026-05-18T00:45:55Z","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":"01fc5ae83f4d408d435d98669635973f3d7afdf1c1287d16f0ca7807c8d2ad38","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-04-22T17:29:58Z","title_canon_sha256":"aed3e77f1fc24b27c4114e8124879a3b237467a6766679a750cdca2ac85e7dab"},"schema_version":"1.0","source":{"id":"1704.06823","kind":"arxiv","version":1}},"canonical_sha256":"f7976ecbb051802a80498e8918b880dcd8375b7c05048821e795c93a4f78f877","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f7976ecbb051802a80498e8918b880dcd8375b7c05048821e795c93a4f78f877","first_computed_at":"2026-05-18T00:45:55.661701Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:55.661701Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"reh44Pgmkz1aq9p3fMolIv/LEpVtplD7lHztfD4K5/0joETr36/ty9AXfQTaLkMfK4aFX792/oXMOyifYUOxAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:55.662369Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.06823","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:52bbca54b84b0dc017509fe8df78507ea98adc2f126c9f561c7e9cfeb4438315","sha256:6483db2b8c0ae2b97823fce67d6acba9a0bd74401bb894a316fee74fb1f8522a"],"state_sha256":"14f400ef01de62dd06373e4c57aeb67c7098eca64dc95364fc02743fdb33ddce"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u1u98GDO+qSKq5TUbq0N74cAlmH0wBgy349aIkcjpG6ZfsGIFmyMrvBAZqrZDcO5UK6sMIxelWfy5c0ZRUvFAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T23:26:21.194712Z","bundle_sha256":"d1c7389d69e6aa50fa6b46b76757b5ee094fbb3336e7d96a7a29f5da8e8516b2"}}