{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ZPXWSIZT5VQ2IHDTK2OTK75BTF","short_pith_number":"pith:ZPXWSIZT","canonical_record":{"source":{"id":"1805.01547","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-05-03T21:32:41Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"a4f10fdc8d646609c48765e0684ae8fcc70729e4b9541a9a2287331cdf34d3c1","abstract_canon_sha256":"873f4aee2eacdcd3fe81ce7b1d27f34da454eca06cb2d196b9ba94580bea4319"},"schema_version":"1.0"},"canonical_sha256":"cbef692333ed61a41c73569d357fa1994b2944ff5ae3b092ba9a5c8b81fc2ff4","source":{"kind":"arxiv","id":"1805.01547","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.01547","created_at":"2026-05-18T00:10:16Z"},{"alias_kind":"arxiv_version","alias_value":"1805.01547v2","created_at":"2026-05-18T00:10:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.01547","created_at":"2026-05-18T00:10:16Z"},{"alias_kind":"pith_short_12","alias_value":"ZPXWSIZT5VQ2","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZPXWSIZT5VQ2IHDT","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZPXWSIZT","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ZPXWSIZT5VQ2IHDTK2OTK75BTF","target":"record","payload":{"canonical_record":{"source":{"id":"1805.01547","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-05-03T21:32:41Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"a4f10fdc8d646609c48765e0684ae8fcc70729e4b9541a9a2287331cdf34d3c1","abstract_canon_sha256":"873f4aee2eacdcd3fe81ce7b1d27f34da454eca06cb2d196b9ba94580bea4319"},"schema_version":"1.0"},"canonical_sha256":"cbef692333ed61a41c73569d357fa1994b2944ff5ae3b092ba9a5c8b81fc2ff4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:16.817402Z","signature_b64":"1FMQhB1a7N3dzz4sBEurhGM8iv3rqt0wtjSI4tMYIQudU1kLzyBpLJaC85f+boPGBbxYx2y7qcsYfgQs+6s2Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cbef692333ed61a41c73569d357fa1994b2944ff5ae3b092ba9a5c8b81fc2ff4","last_reissued_at":"2026-05-18T00:10:16.816932Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:16.816932Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.01547","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:10:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R0ORifrB5NpMyf6YxiY7x/GpYY1h7ecZdnsRN0HRyEVCcnNtOZfdNpjPzzvtBo9xHhtajQJg9l5p9LmN3rAvAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T18:15:25.245727Z"},"content_sha256":"81e9333c02c88dcd27920d83bb030b66854b26888dd65972940023669c13c9aa","schema_version":"1.0","event_id":"sha256:81e9333c02c88dcd27920d83bb030b66854b26888dd65972940023669c13c9aa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ZPXWSIZT5VQ2IHDTK2OTK75BTF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximating $(k,\\ell)$-center clustering for curves","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.CG","authors_text":"Anne Driemel, Irina Kostitsyna, Joachim Gudmundsson, Kevin Buchin, Maarten L\\\"offler, Martijn Struijs, Michael Horton","submitted_at":"2018-05-03T21:32:41Z","abstract_excerpt":"The Euclidean $k$-center problem is a classical problem that has been extensively studied in computer science. Given a set $\\mathcal{G}$ of $n$ points in Euclidean space, the problem is to determine a set $\\mathcal{C}$ of $k$ centers (not necessarily part of $\\mathcal{G}$) such that the maximum distance between a point in $\\mathcal{G}$ and its nearest neighbor in $\\mathcal{C}$ is minimized. In this paper we study the corresponding $(k,\\ell)$-center problem for polygonal curves under the Fr\\'echet distance, that is, given a set $\\mathcal{G}$ of $n$ polygonal curves in $\\mathbb{R}^d$, each of co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.01547","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:10:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Eunvne3Grqig+eEROnIDz/SW9INznLe710R33uoZaxJlA5BdsaaBRnDsl5MDA0fgif5qLXYH/KWMQKmjNwvwBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T18:15:25.246130Z"},"content_sha256":"9ac379664a2c954562af8113f96f381a06b9cdddd753eed1cf1a78e670fa8bef","schema_version":"1.0","event_id":"sha256:9ac379664a2c954562af8113f96f381a06b9cdddd753eed1cf1a78e670fa8bef"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZPXWSIZT5VQ2IHDTK2OTK75BTF/bundle.json","state_url":"https://pith.science/pith/ZPXWSIZT5VQ2IHDTK2OTK75BTF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZPXWSIZT5VQ2IHDTK2OTK75BTF/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-21T18:15:25Z","links":{"resolver":"https://pith.science/pith/ZPXWSIZT5VQ2IHDTK2OTK75BTF","bundle":"https://pith.science/pith/ZPXWSIZT5VQ2IHDTK2OTK75BTF/bundle.json","state":"https://pith.science/pith/ZPXWSIZT5VQ2IHDTK2OTK75BTF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZPXWSIZT5VQ2IHDTK2OTK75BTF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ZPXWSIZT5VQ2IHDTK2OTK75BTF","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":"873f4aee2eacdcd3fe81ce7b1d27f34da454eca06cb2d196b9ba94580bea4319","cross_cats_sorted":["cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-05-03T21:32:41Z","title_canon_sha256":"a4f10fdc8d646609c48765e0684ae8fcc70729e4b9541a9a2287331cdf34d3c1"},"schema_version":"1.0","source":{"id":"1805.01547","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.01547","created_at":"2026-05-18T00:10:16Z"},{"alias_kind":"arxiv_version","alias_value":"1805.01547v2","created_at":"2026-05-18T00:10:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.01547","created_at":"2026-05-18T00:10:16Z"},{"alias_kind":"pith_short_12","alias_value":"ZPXWSIZT5VQ2","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZPXWSIZT5VQ2IHDT","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZPXWSIZT","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:9ac379664a2c954562af8113f96f381a06b9cdddd753eed1cf1a78e670fa8bef","target":"graph","created_at":"2026-05-18T00:10:16Z","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 Euclidean $k$-center problem is a classical problem that has been extensively studied in computer science. Given a set $\\mathcal{G}$ of $n$ points in Euclidean space, the problem is to determine a set $\\mathcal{C}$ of $k$ centers (not necessarily part of $\\mathcal{G}$) such that the maximum distance between a point in $\\mathcal{G}$ and its nearest neighbor in $\\mathcal{C}$ is minimized. In this paper we study the corresponding $(k,\\ell)$-center problem for polygonal curves under the Fr\\'echet distance, that is, given a set $\\mathcal{G}$ of $n$ polygonal curves in $\\mathbb{R}^d$, each of co","authors_text":"Anne Driemel, Irina Kostitsyna, Joachim Gudmundsson, Kevin Buchin, Maarten L\\\"offler, Martijn Struijs, Michael Horton","cross_cats":["cs.IR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-05-03T21:32:41Z","title":"Approximating $(k,\\ell)$-center clustering for curves"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.01547","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:81e9333c02c88dcd27920d83bb030b66854b26888dd65972940023669c13c9aa","target":"record","created_at":"2026-05-18T00:10:16Z","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":"873f4aee2eacdcd3fe81ce7b1d27f34da454eca06cb2d196b9ba94580bea4319","cross_cats_sorted":["cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-05-03T21:32:41Z","title_canon_sha256":"a4f10fdc8d646609c48765e0684ae8fcc70729e4b9541a9a2287331cdf34d3c1"},"schema_version":"1.0","source":{"id":"1805.01547","kind":"arxiv","version":2}},"canonical_sha256":"cbef692333ed61a41c73569d357fa1994b2944ff5ae3b092ba9a5c8b81fc2ff4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cbef692333ed61a41c73569d357fa1994b2944ff5ae3b092ba9a5c8b81fc2ff4","first_computed_at":"2026-05-18T00:10:16.816932Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:16.816932Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1FMQhB1a7N3dzz4sBEurhGM8iv3rqt0wtjSI4tMYIQudU1kLzyBpLJaC85f+boPGBbxYx2y7qcsYfgQs+6s2Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:16.817402Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.01547","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:81e9333c02c88dcd27920d83bb030b66854b26888dd65972940023669c13c9aa","sha256:9ac379664a2c954562af8113f96f381a06b9cdddd753eed1cf1a78e670fa8bef"],"state_sha256":"88a071823abee97103d538aa7200a97b7ea17059351ef33101a6e316c020b98e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fmza8dPp/IZtMu3fOecTIMiuRUJaD/3thcL1C8b3vWvwD7IPQtvYs8/Z/na3MqVEVBzPYN1fFCxUSlWdtiewAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T18:15:25.248518Z","bundle_sha256":"693f07608118c3acf8e28e57291a5807aba18fa71eea97935e7243333b4c3d69"}}