{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ATU2BLTACJBICBR6T6ZBFI4GU5","short_pith_number":"pith:ATU2BLTA","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"},"canonical_sha256":"04e9a0ae60124281063e9fb212a386a77275303ed10ac887959b1080e9dce0f7","source":{"kind":"arxiv","id":"1502.02422","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.02422","created_at":"2026-05-18T02:27:42Z"},{"alias_kind":"arxiv_version","alias_value":"1502.02422v1","created_at":"2026-05-18T02:27:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.02422","created_at":"2026-05-18T02:27:42Z"},{"alias_kind":"pith_short_12","alias_value":"ATU2BLTACJBI","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"ATU2BLTACJBICBR6","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"ATU2BLTA","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ATU2BLTACJBICBR6T6ZBFI4GU5","target":"record","payload":{"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"},"canonical_sha256":"04e9a0ae60124281063e9fb212a386a77275303ed10ac887959b1080e9dce0f7","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"},"source_kind":"arxiv","source_id":"1502.02422","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-18T02:27:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MFVyF5DPlNIfAEYdRAzT8aiMPRIAJDmFPol3pVw7EO2jFHfY2l8ozvXpZuNjv856EM3wf8MCUayhkiX6iYyFDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T01:40:02.987209Z"},"content_sha256":"f547ed3a9ee233c1f4c0fd2342e2e78da6d656123070dce4bf54458c34163402","schema_version":"1.0","event_id":"sha256:f547ed3a9ee233c1f4c0fd2342e2e78da6d656123070dce4bf54458c34163402"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ATU2BLTACJBICBR6T6ZBFI4GU5","target":"graph","payload":{"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"},"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-18T02:27:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1K3LU0WkVBWZ3Ati1aTGVkrIk62hNH8/q2ih2PR1JiqXhSE31xTHpOaAu6TyyvvHwo4g87J3illfdumlVqyyDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T01:40:02.987756Z"},"content_sha256":"1764f0df8e80232107d29905068f3c9e503345e092fb7541d1db8e8473e88b6d","schema_version":"1.0","event_id":"sha256:1764f0df8e80232107d29905068f3c9e503345e092fb7541d1db8e8473e88b6d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ATU2BLTACJBICBR6T6ZBFI4GU5/bundle.json","state_url":"https://pith.science/pith/ATU2BLTACJBICBR6T6ZBFI4GU5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ATU2BLTACJBICBR6T6ZBFI4GU5/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-02T01:40:02Z","links":{"resolver":"https://pith.science/pith/ATU2BLTACJBICBR6T6ZBFI4GU5","bundle":"https://pith.science/pith/ATU2BLTACJBICBR6T6ZBFI4GU5/bundle.json","state":"https://pith.science/pith/ATU2BLTACJBICBR6T6ZBFI4GU5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ATU2BLTACJBICBR6T6ZBFI4GU5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ATU2BLTACJBICBR6T6ZBFI4GU5","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":"00677d55fe7f481f5dd9c8291f24299538300d2e77fd48d3144ce3c93f3d232b","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-09T10:34:48Z","title_canon_sha256":"5ec46e78df8e270b6d01e30ac094095f9e9d0d1bd81c9e3be4b687f8ac5bb9e4"},"schema_version":"1.0","source":{"id":"1502.02422","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.02422","created_at":"2026-05-18T02:27:42Z"},{"alias_kind":"arxiv_version","alias_value":"1502.02422v1","created_at":"2026-05-18T02:27:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.02422","created_at":"2026-05-18T02:27:42Z"},{"alias_kind":"pith_short_12","alias_value":"ATU2BLTACJBI","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"ATU2BLTACJBICBR6","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"ATU2BLTA","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:1764f0df8e80232107d29905068f3c9e503345e092fb7541d1db8e8473e88b6d","target":"graph","created_at":"2026-05-18T02:27:42Z","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 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","authors_text":"Jun Kawahara, Koji M. Kobayashi","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-09T10:34:48Z","title":"An improved lower bound for one-dimensional online unit clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.02422","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:f547ed3a9ee233c1f4c0fd2342e2e78da6d656123070dce4bf54458c34163402","target":"record","created_at":"2026-05-18T02:27:42Z","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":"00677d55fe7f481f5dd9c8291f24299538300d2e77fd48d3144ce3c93f3d232b","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-09T10:34:48Z","title_canon_sha256":"5ec46e78df8e270b6d01e30ac094095f9e9d0d1bd81c9e3be4b687f8ac5bb9e4"},"schema_version":"1.0","source":{"id":"1502.02422","kind":"arxiv","version":1}},"canonical_sha256":"04e9a0ae60124281063e9fb212a386a77275303ed10ac887959b1080e9dce0f7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"04e9a0ae60124281063e9fb212a386a77275303ed10ac887959b1080e9dce0f7","first_computed_at":"2026-05-18T02:27:42.401016Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:27:42.401016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3FS+K0Yref722h1efmN+UqeLHj1LDYvIKIFcXxB9/wSG42wdttWDRvCzuevAYjePV9iux4g9okUNtYxOwgucCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:27:42.401901Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.02422","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f547ed3a9ee233c1f4c0fd2342e2e78da6d656123070dce4bf54458c34163402","sha256:1764f0df8e80232107d29905068f3c9e503345e092fb7541d1db8e8473e88b6d"],"state_sha256":"a2670fa4ed0a091370939606b06c15511d10cf521999820d1d340920564c303b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sZNI4CVduiIfDLtKNPhwhDJUoiXH9lhnZ6vSmFIAy8JgTG27XvB7W9EY0vX0mGnGxYEAP40xlRneO2B1JSH+DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T01:40:02.990538Z","bundle_sha256":"8584049194f40b55ff4f5c6b50ca7c32edc82869408d250d4af0c1d138b15aa7"}}