{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ATU2BLTACJBICBR6T6ZBFI4GU5","short_pith_number":"pith:ATU2BLTA","schema_version":"1.0","canonical_sha256":"04e9a0ae60124281063e9fb212a386a77275303ed10ac887959b1080e9dce0f7","source":{"kind":"arxiv","id":"1502.02422","version":1},"attestation_state":"computed","paper":{"title":"An improved lower bound for one-dimensional online unit clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Jun Kawahara, Koji M. Kobayashi","submitted_at":"2015-02-09T10:34:48Z","abstract_excerpt":"The online unit clustering problem was proposed by Chan and Zarrabi-Zadeh (WAOA2007 and Theory of Computing Systems 45(3), 2009), which is defined as follows: \"Points\" are given online in the $d$-dimensional Euclidean space one by one. An algorithm creates a \"cluster,\" which is a $d$-dimensional rectangle. The initial length of each edge of a cluster is 0. An algorithm can extend an edge until it reaches unit length independently of other dimensions. The task of an algorithm is to cover a new given point either by creating a new cluster and assigning it to the point, or by extending edges of a"},"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":"1502.02422","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-09T10:34:48Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"5ec46e78df8e270b6d01e30ac094095f9e9d0d1bd81c9e3be4b687f8ac5bb9e4","abstract_canon_sha256":"00677d55fe7f481f5dd9c8291f24299538300d2e77fd48d3144ce3c93f3d232b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:42.401901Z","signature_b64":"3FS+K0Yref722h1efmN+UqeLHj1LDYvIKIFcXxB9/wSG42wdttWDRvCzuevAYjePV9iux4g9okUNtYxOwgucCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"04e9a0ae60124281063e9fb212a386a77275303ed10ac887959b1080e9dce0f7","last_reissued_at":"2026-05-18T02:27:42.401016Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:42.401016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An improved lower bound for one-dimensional online unit clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Jun Kawahara, Koji M. Kobayashi","submitted_at":"2015-02-09T10:34:48Z","abstract_excerpt":"The online unit clustering problem was proposed by Chan and Zarrabi-Zadeh (WAOA2007 and Theory of Computing Systems 45(3), 2009), which is defined as follows: \"Points\" are given online in the $d$-dimensional Euclidean space one by one. An algorithm creates a \"cluster,\" which is a $d$-dimensional rectangle. The initial length of each edge of a cluster is 0. An algorithm can extend an edge until it reaches unit length independently of other dimensions. The task of an algorithm is to cover a new given point either by creating a new cluster and assigning it to the point, or by extending edges of a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.02422","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":"1502.02422","created_at":"2026-05-18T02:27:42.401158+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.02422v1","created_at":"2026-05-18T02:27:42.401158+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.02422","created_at":"2026-05-18T02:27:42.401158+00:00"},{"alias_kind":"pith_short_12","alias_value":"ATU2BLTACJBI","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"ATU2BLTACJBICBR6","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"ATU2BLTA","created_at":"2026-05-18T12:29:10.953037+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/ATU2BLTACJBICBR6T6ZBFI4GU5","json":"https://pith.science/pith/ATU2BLTACJBICBR6T6ZBFI4GU5.json","graph_json":"https://pith.science/api/pith-number/ATU2BLTACJBICBR6T6ZBFI4GU5/graph.json","events_json":"https://pith.science/api/pith-number/ATU2BLTACJBICBR6T6ZBFI4GU5/events.json","paper":"https://pith.science/paper/ATU2BLTA"},"agent_actions":{"view_html":"https://pith.science/pith/ATU2BLTACJBICBR6T6ZBFI4GU5","download_json":"https://pith.science/pith/ATU2BLTACJBICBR6T6ZBFI4GU5.json","view_paper":"https://pith.science/paper/ATU2BLTA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.02422&json=true","fetch_graph":"https://pith.science/api/pith-number/ATU2BLTACJBICBR6T6ZBFI4GU5/graph.json","fetch_events":"https://pith.science/api/pith-number/ATU2BLTACJBICBR6T6ZBFI4GU5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ATU2BLTACJBICBR6T6ZBFI4GU5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ATU2BLTACJBICBR6T6ZBFI4GU5/action/storage_attestation","attest_author":"https://pith.science/pith/ATU2BLTACJBICBR6T6ZBFI4GU5/action/author_attestation","sign_citation":"https://pith.science/pith/ATU2BLTACJBICBR6T6ZBFI4GU5/action/citation_signature","submit_replication":"https://pith.science/pith/ATU2BLTACJBICBR6T6ZBFI4GU5/action/replication_record"}},"created_at":"2026-05-18T02:27:42.401158+00:00","updated_at":"2026-05-18T02:27:42.401158+00:00"}