{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:BRFSQ5GJVI4UFCWMIDOEKCPRZJ","short_pith_number":"pith:BRFSQ5GJ","canonical_record":{"source":{"id":"2601.16091","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.MA","submitted_at":"2026-01-22T16:42:05Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"f13680b2f715bdeb0df6a7f24d0c81a30222ebe904b364cbbef3de89aab8d46d","abstract_canon_sha256":"22af86e61c76fc7bc184a55f27f4bf7d3f3d265e60980f9aa253cf22f6e800ac"},"schema_version":"1.0"},"canonical_sha256":"0c4b2874c9aa39428acc40dc4509f1ca47c35b1b3fe269de317d26bead6a672e","source":{"kind":"arxiv","id":"2601.16091","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2601.16091","created_at":"2026-05-26T01:03:22Z"},{"alias_kind":"arxiv_version","alias_value":"2601.16091v2","created_at":"2026-05-26T01:03:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.16091","created_at":"2026-05-26T01:03:22Z"},{"alias_kind":"pith_short_12","alias_value":"BRFSQ5GJVI4U","created_at":"2026-05-26T01:03:22Z"},{"alias_kind":"pith_short_16","alias_value":"BRFSQ5GJVI4UFCWM","created_at":"2026-05-26T01:03:22Z"},{"alias_kind":"pith_short_8","alias_value":"BRFSQ5GJ","created_at":"2026-05-26T01:03:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:BRFSQ5GJVI4UFCWMIDOEKCPRZJ","target":"record","payload":{"canonical_record":{"source":{"id":"2601.16091","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.MA","submitted_at":"2026-01-22T16:42:05Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"f13680b2f715bdeb0df6a7f24d0c81a30222ebe904b364cbbef3de89aab8d46d","abstract_canon_sha256":"22af86e61c76fc7bc184a55f27f4bf7d3f3d265e60980f9aa253cf22f6e800ac"},"schema_version":"1.0"},"canonical_sha256":"0c4b2874c9aa39428acc40dc4509f1ca47c35b1b3fe269de317d26bead6a672e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T01:03:22.954518Z","signature_b64":"YzvKGNcMRPAlS7s53iH/wYFKzdePnUvTuLZAPDIlHaUoK2209+DCSLyMZzwPJFsnplkmkABrMhhNEfy435peAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c4b2874c9aa39428acc40dc4509f1ca47c35b1b3fe269de317d26bead6a672e","last_reissued_at":"2026-05-26T01:03:22.953639Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T01:03:22.953639Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2601.16091","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-26T01:03:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"09JQCk6/CAHYUlhngTGrCtwXbNUGnl5D7aZJskHzxmmTqneR4QezHwLnBUbdB/Df4nukHguRJkTUn7K7wo69Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:48:04.724711Z"},"content_sha256":"e9328940330cffd359a1e724e6039069fcb327ec91ccf7c6cb7371809252876e","schema_version":"1.0","event_id":"sha256:e9328940330cffd359a1e724e6039069fcb327ec91ccf7c6cb7371809252876e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:BRFSQ5GJVI4UFCWMIDOEKCPRZJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Delayed Assignments in Online Non-Centroid Clustering with Stochastic Arrivals","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.MA","authors_text":"Saar Cohen","submitted_at":"2026-01-22T16:42:05Z","abstract_excerpt":"Clustering is a fundamental problem, aiming to partition a set of elements, like agents or data points, into clusters such that elements in the same cluster are closer to each other than to those in other clusters. In this paper, we present a new framework for studying online non-centroid clustering with delays, where elements, that arrive one at a time as points in a finite metric space, should be assigned to clusters, but assignments need not be immediate. Specifically, upon arrival, each point's location is revealed, and an online algorithm has to irrevocably assign it to an existing cluste"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.16091","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2601.16091/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-26T01:03:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eNgT4HOKVsRtCJvBREqCAdze9XYkFoLMmGsenvfQih35VLSLmFcE/pwG/krLHJ1aV+q4QxBCSGoKlZ9U8C2uBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:48:04.725351Z"},"content_sha256":"e5c83a3ab28cfd717a670097edaee51f1c4c5ae990d1582799139e975d5c3c0f","schema_version":"1.0","event_id":"sha256:e5c83a3ab28cfd717a670097edaee51f1c4c5ae990d1582799139e975d5c3c0f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BRFSQ5GJVI4UFCWMIDOEKCPRZJ/bundle.json","state_url":"https://pith.science/pith/BRFSQ5GJVI4UFCWMIDOEKCPRZJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BRFSQ5GJVI4UFCWMIDOEKCPRZJ/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-31T02:48:04Z","links":{"resolver":"https://pith.science/pith/BRFSQ5GJVI4UFCWMIDOEKCPRZJ","bundle":"https://pith.science/pith/BRFSQ5GJVI4UFCWMIDOEKCPRZJ/bundle.json","state":"https://pith.science/pith/BRFSQ5GJVI4UFCWMIDOEKCPRZJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BRFSQ5GJVI4UFCWMIDOEKCPRZJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:BRFSQ5GJVI4UFCWMIDOEKCPRZJ","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":"22af86e61c76fc7bc184a55f27f4bf7d3f3d265e60980f9aa253cf22f6e800ac","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.MA","submitted_at":"2026-01-22T16:42:05Z","title_canon_sha256":"f13680b2f715bdeb0df6a7f24d0c81a30222ebe904b364cbbef3de89aab8d46d"},"schema_version":"1.0","source":{"id":"2601.16091","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2601.16091","created_at":"2026-05-26T01:03:22Z"},{"alias_kind":"arxiv_version","alias_value":"2601.16091v2","created_at":"2026-05-26T01:03:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.16091","created_at":"2026-05-26T01:03:22Z"},{"alias_kind":"pith_short_12","alias_value":"BRFSQ5GJVI4U","created_at":"2026-05-26T01:03:22Z"},{"alias_kind":"pith_short_16","alias_value":"BRFSQ5GJVI4UFCWM","created_at":"2026-05-26T01:03:22Z"},{"alias_kind":"pith_short_8","alias_value":"BRFSQ5GJ","created_at":"2026-05-26T01:03:22Z"}],"graph_snapshots":[{"event_id":"sha256:e5c83a3ab28cfd717a670097edaee51f1c4c5ae990d1582799139e975d5c3c0f","target":"graph","created_at":"2026-05-26T01:03:22Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2601.16091/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Clustering is a fundamental problem, aiming to partition a set of elements, like agents or data points, into clusters such that elements in the same cluster are closer to each other than to those in other clusters. In this paper, we present a new framework for studying online non-centroid clustering with delays, where elements, that arrive one at a time as points in a finite metric space, should be assigned to clusters, but assignments need not be immediate. Specifically, upon arrival, each point's location is revealed, and an online algorithm has to irrevocably assign it to an existing cluste","authors_text":"Saar Cohen","cross_cats":["cs.AI","cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.MA","submitted_at":"2026-01-22T16:42:05Z","title":"Delayed Assignments in Online Non-Centroid Clustering with Stochastic Arrivals"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.16091","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:e9328940330cffd359a1e724e6039069fcb327ec91ccf7c6cb7371809252876e","target":"record","created_at":"2026-05-26T01:03:22Z","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":"22af86e61c76fc7bc184a55f27f4bf7d3f3d265e60980f9aa253cf22f6e800ac","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.MA","submitted_at":"2026-01-22T16:42:05Z","title_canon_sha256":"f13680b2f715bdeb0df6a7f24d0c81a30222ebe904b364cbbef3de89aab8d46d"},"schema_version":"1.0","source":{"id":"2601.16091","kind":"arxiv","version":2}},"canonical_sha256":"0c4b2874c9aa39428acc40dc4509f1ca47c35b1b3fe269de317d26bead6a672e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0c4b2874c9aa39428acc40dc4509f1ca47c35b1b3fe269de317d26bead6a672e","first_computed_at":"2026-05-26T01:03:22.953639Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-26T01:03:22.953639Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YzvKGNcMRPAlS7s53iH/wYFKzdePnUvTuLZAPDIlHaUoK2209+DCSLyMZzwPJFsnplkmkABrMhhNEfy435peAw==","signature_status":"signed_v1","signed_at":"2026-05-26T01:03:22.954518Z","signed_message":"canonical_sha256_bytes"},"source_id":"2601.16091","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e9328940330cffd359a1e724e6039069fcb327ec91ccf7c6cb7371809252876e","sha256:e5c83a3ab28cfd717a670097edaee51f1c4c5ae990d1582799139e975d5c3c0f"],"state_sha256":"e2d5c50c9171537f31e5272f84e159895bba140446729a820714d626b1e79a57"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X3MN673HSb5GHR3AAAYgE9k9oCyaSV5rAzxp+EmAA+rBQQbZZb53V0ORDXJ2qwXRtvhbB8rsyoglZeEkBMftDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T02:48:04.731310Z","bundle_sha256":"31d52b4e1bbcd53831c40814aae3c1ca71692df9996c7f2a9a82f8a6e1f74807"}}