{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:OIANN3T3T44MC4XUCEUI55DZGP","short_pith_number":"pith:OIANN3T3","schema_version":"1.0","canonical_sha256":"7200d6ee7b9f38c172f411288ef47933d2ddb2c620566d54907bbb86b81835cb","source":{"kind":"arxiv","id":"1512.04303","version":1},"attestation_state":"computed","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1512.04303","created_at":"2026-05-18T01:23:53.789208+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.04303v1","created_at":"2026-05-18T01:23:53.789208+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.04303","created_at":"2026-05-18T01:23:53.789208+00:00"},{"alias_kind":"pith_short_12","alias_value":"OIANN3T3T44M","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_16","alias_value":"OIANN3T3T44MC4XU","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_8","alias_value":"OIANN3T3","created_at":"2026-05-18T12:29:34.919912+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OIANN3T3T44MC4XUCEUI55DZGP","json":"https://pith.science/pith/OIANN3T3T44MC4XUCEUI55DZGP.json","graph_json":"https://pith.science/api/pith-number/OIANN3T3T44MC4XUCEUI55DZGP/graph.json","events_json":"https://pith.science/api/pith-number/OIANN3T3T44MC4XUCEUI55DZGP/events.json","paper":"https://pith.science/paper/OIANN3T3"},"agent_actions":{"view_html":"https://pith.science/pith/OIANN3T3T44MC4XUCEUI55DZGP","download_json":"https://pith.science/pith/OIANN3T3T44MC4XUCEUI55DZGP.json","view_paper":"https://pith.science/paper/OIANN3T3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.04303&json=true","fetch_graph":"https://pith.science/api/pith-number/OIANN3T3T44MC4XUCEUI55DZGP/graph.json","fetch_events":"https://pith.science/api/pith-number/OIANN3T3T44MC4XUCEUI55DZGP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OIANN3T3T44MC4XUCEUI55DZGP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OIANN3T3T44MC4XUCEUI55DZGP/action/storage_attestation","attest_author":"https://pith.science/pith/OIANN3T3T44MC4XUCEUI55DZGP/action/author_attestation","sign_citation":"https://pith.science/pith/OIANN3T3T44MC4XUCEUI55DZGP/action/citation_signature","submit_replication":"https://pith.science/pith/OIANN3T3T44MC4XUCEUI55DZGP/action/replication_record"}},"created_at":"2026-05-18T01:23:53.789208+00:00","updated_at":"2026-05-18T01:23:53.789208+00:00"}