{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:OIANN3T3T44MC4XUCEUI55DZGP","short_pith_number":"pith:OIANN3T3","canonical_record":{"source":{"id":"1512.04303","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-12-14T13:28:47Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"8738fe23426f70ee1da855be79188d2634b3c8670fea1001412b5c18719bf21e","abstract_canon_sha256":"ce48c208ea7ed58adb6872a64bd5be5378cad62c2aae56afcd1b5726cf9d13b9"},"schema_version":"1.0"},"canonical_sha256":"7200d6ee7b9f38c172f411288ef47933d2ddb2c620566d54907bbb86b81835cb","source":{"kind":"arxiv","id":"1512.04303","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.04303","created_at":"2026-05-18T01:23:53Z"},{"alias_kind":"arxiv_version","alias_value":"1512.04303v1","created_at":"2026-05-18T01:23:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.04303","created_at":"2026-05-18T01:23:53Z"},{"alias_kind":"pith_short_12","alias_value":"OIANN3T3T44M","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"OIANN3T3T44MC4XU","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"OIANN3T3","created_at":"2026-05-18T12:29:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:OIANN3T3T44MC4XUCEUI55DZGP","target":"record","payload":{"canonical_record":{"source":{"id":"1512.04303","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-12-14T13:28:47Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"8738fe23426f70ee1da855be79188d2634b3c8670fea1001412b5c18719bf21e","abstract_canon_sha256":"ce48c208ea7ed58adb6872a64bd5be5378cad62c2aae56afcd1b5726cf9d13b9"},"schema_version":"1.0"},"canonical_sha256":"7200d6ee7b9f38c172f411288ef47933d2ddb2c620566d54907bbb86b81835cb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:53.789638Z","signature_b64":"g6A57tc5WWQeT2Ah9yiMmcviJN97/yzKqT9EAzvivY5EBt6HDkxtZkBenEXhmd17Bv8La8A2tz2vgiYsA7ObBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7200d6ee7b9f38c172f411288ef47933d2ddb2c620566d54907bbb86b81835cb","last_reissued_at":"2026-05-18T01:23:53.789134Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:53.789134Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.04303","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:23:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5WUHP6FNoMhxo9JBfbVrXB8NQqzR//IGS9R8DiQ1SECCfY5Cz0JWbGUe2pbFok2QF0KsgvL/toirHCFmSf2JBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:38:14.864834Z"},"content_sha256":"6f37206787ebfde237c74258c5308a42cf95c124906fa08c44189444f1bfb550","schema_version":"1.0","event_id":"sha256:6f37206787ebfde237c74258c5308a42cf95c124906fa08c44189444f1bfb550"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:OIANN3T3T44MC4XUCEUI55DZGP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Kinetic Clustering of Points on the Line","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Cristina G. Fernandes, Marcio T. I. Oshiro","submitted_at":"2015-12-14T13:28:47Z","abstract_excerpt":"The problem of clustering a set of points moving on the line consists of the following: given positive integers n and k, the initial position and the velocity of n points, find an optimal k-clustering of the points. We consider two classical quality measures for the clustering: minimizing the sum of the clusters diameters and minimizing the maximum diameter of a cluster. For the former, we present polynomial-time algorithms under some assumptions and, for the latter, a (2.71 + epsilon)-approximation."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.04303","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:23:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"smhDeKror0eLAZFG59o3B53+W7NHDNTWtRu2W+E58+DWeEZGIWfb2fqOv89P2brrYOGdc5AcB9wpjas1GHmFAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:38:14.865589Z"},"content_sha256":"6f43982fbaac8a4fa0bf08504b226d6dc9d9a499ee28d5044073557ca15680a4","schema_version":"1.0","event_id":"sha256:6f43982fbaac8a4fa0bf08504b226d6dc9d9a499ee28d5044073557ca15680a4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OIANN3T3T44MC4XUCEUI55DZGP/bundle.json","state_url":"https://pith.science/pith/OIANN3T3T44MC4XUCEUI55DZGP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OIANN3T3T44MC4XUCEUI55DZGP/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-09T08:38:14Z","links":{"resolver":"https://pith.science/pith/OIANN3T3T44MC4XUCEUI55DZGP","bundle":"https://pith.science/pith/OIANN3T3T44MC4XUCEUI55DZGP/bundle.json","state":"https://pith.science/pith/OIANN3T3T44MC4XUCEUI55DZGP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OIANN3T3T44MC4XUCEUI55DZGP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:OIANN3T3T44MC4XUCEUI55DZGP","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":"ce48c208ea7ed58adb6872a64bd5be5378cad62c2aae56afcd1b5726cf9d13b9","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-12-14T13:28:47Z","title_canon_sha256":"8738fe23426f70ee1da855be79188d2634b3c8670fea1001412b5c18719bf21e"},"schema_version":"1.0","source":{"id":"1512.04303","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.04303","created_at":"2026-05-18T01:23:53Z"},{"alias_kind":"arxiv_version","alias_value":"1512.04303v1","created_at":"2026-05-18T01:23:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.04303","created_at":"2026-05-18T01:23:53Z"},{"alias_kind":"pith_short_12","alias_value":"OIANN3T3T44M","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"OIANN3T3T44MC4XU","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"OIANN3T3","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:6f43982fbaac8a4fa0bf08504b226d6dc9d9a499ee28d5044073557ca15680a4","target":"graph","created_at":"2026-05-18T01:23:53Z","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 problem of clustering a set of points moving on the line consists of the following: given positive integers n and k, the initial position and the velocity of n points, find an optimal k-clustering of the points. We consider two classical quality measures for the clustering: minimizing the sum of the clusters diameters and minimizing the maximum diameter of a cluster. For the former, we present polynomial-time algorithms under some assumptions and, for the latter, a (2.71 + epsilon)-approximation.","authors_text":"Cristina G. Fernandes, Marcio T. I. Oshiro","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-12-14T13:28:47Z","title":"Kinetic Clustering of Points on the Line"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.04303","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:6f37206787ebfde237c74258c5308a42cf95c124906fa08c44189444f1bfb550","target":"record","created_at":"2026-05-18T01:23:53Z","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":"ce48c208ea7ed58adb6872a64bd5be5378cad62c2aae56afcd1b5726cf9d13b9","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-12-14T13:28:47Z","title_canon_sha256":"8738fe23426f70ee1da855be79188d2634b3c8670fea1001412b5c18719bf21e"},"schema_version":"1.0","source":{"id":"1512.04303","kind":"arxiv","version":1}},"canonical_sha256":"7200d6ee7b9f38c172f411288ef47933d2ddb2c620566d54907bbb86b81835cb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7200d6ee7b9f38c172f411288ef47933d2ddb2c620566d54907bbb86b81835cb","first_computed_at":"2026-05-18T01:23:53.789134Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:53.789134Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"g6A57tc5WWQeT2Ah9yiMmcviJN97/yzKqT9EAzvivY5EBt6HDkxtZkBenEXhmd17Bv8La8A2tz2vgiYsA7ObBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:53.789638Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.04303","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6f37206787ebfde237c74258c5308a42cf95c124906fa08c44189444f1bfb550","sha256:6f43982fbaac8a4fa0bf08504b226d6dc9d9a499ee28d5044073557ca15680a4"],"state_sha256":"23f695a30d87f683901c5e93d4930d6cdd4bb1a8457c5e9835cfc208f573457d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nuahcBJkpgtfZ6aXMuT1Wg6v9WViT++gf4+Aq2HFyYUUghlcbTgoYjsUjrRDgeE1RNPsuX+GPQUS1JDql/XLCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T08:38:14.869737Z","bundle_sha256":"9b40106fa454e2c78dbfc29595316cd6e3de82c91a91448924ae8e25bdbdceb3"}}