{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:XYT2LPGYO3LAHZ4U76ZXL5VL55","short_pith_number":"pith:XYT2LPGY","canonical_record":{"source":{"id":"1308.1212","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-08-06T09:19:50Z","cross_cats_sorted":["cs.DS","cs.IT","math.IT"],"title_canon_sha256":"f4e2331f60daac91599ba1054e6eb3462e405838eb26f2de7a4490587f5a729d","abstract_canon_sha256":"debb9de4acc1a3e4e7db5bfee670802f8dadfe8d1334fc0f1f6123819e7d4786"},"schema_version":"1.0"},"canonical_sha256":"be27a5bcd876d603e794ffb375f6abef4048891d43660cbcd215d30f5da0f6d1","source":{"kind":"arxiv","id":"1308.1212","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.1212","created_at":"2026-05-18T03:16:39Z"},{"alias_kind":"arxiv_version","alias_value":"1308.1212v1","created_at":"2026-05-18T03:16:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.1212","created_at":"2026-05-18T03:16:39Z"},{"alias_kind":"pith_short_12","alias_value":"XYT2LPGYO3LA","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XYT2LPGYO3LAHZ4U","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XYT2LPGY","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:XYT2LPGYO3LAHZ4U76ZXL5VL55","target":"record","payload":{"canonical_record":{"source":{"id":"1308.1212","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-08-06T09:19:50Z","cross_cats_sorted":["cs.DS","cs.IT","math.IT"],"title_canon_sha256":"f4e2331f60daac91599ba1054e6eb3462e405838eb26f2de7a4490587f5a729d","abstract_canon_sha256":"debb9de4acc1a3e4e7db5bfee670802f8dadfe8d1334fc0f1f6123819e7d4786"},"schema_version":"1.0"},"canonical_sha256":"be27a5bcd876d603e794ffb375f6abef4048891d43660cbcd215d30f5da0f6d1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:16:39.489975Z","signature_b64":"bQpytFlYGDNJpVT4Ylwu19rDVhq0Fm7Jt4w2rsjZnQWpyu/PMhQ43USnJAN1/qa3SDtGHnTo/KtqJYxwGsqIAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be27a5bcd876d603e794ffb375f6abef4048891d43660cbcd215d30f5da0f6d1","last_reissued_at":"2026-05-18T03:16:39.489194Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:16:39.489194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1308.1212","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-18T03:16:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b4efCVky/PkRYAagBYA/3hIIzUkmWhnO8QlBuXuLfH7YMGE7LeQvkjTOIYoL8sWR+2KMj5BxTZdQMlaQdx+cDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T17:58:48.987804Z"},"content_sha256":"6544bb040a6315adb5f03301d0acd091eb3e2f407a803a1e56569597282377a5","schema_version":"1.0","event_id":"sha256:6544bb040a6315adb5f03301d0acd091eb3e2f407a803a1e56569597282377a5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:XYT2LPGYO3LAHZ4U76ZXL5VL55","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Algorithms for Basestation Allocation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Andrew Thangaraj, Rahul Vaze","submitted_at":"2013-08-06T09:19:50Z","abstract_excerpt":"Design of {\\it online algorithms} for assigning mobile users to basestations is considered with the objective of maximizing the sum-rate, when all users associated to any one basestation equally share each basestation's resources. Each user on its arrival reveals the rates it can obtain if connected to each of the basestations, and the problem is to assign each user to any one basestation irrevocably so that the sum-rate is maximized at the end of all user arrivals, without knowing the future user arrival or rate information or its statistics at each user arrival. Online algorithms with consta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.1212","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-18T03:16:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oONEBg/IC/aoTBKG+eA2j2WFyscnBY+2H2T+BpiMbN5MkEyTXrjFlQCcM/3N84FC49dK50AyvBf+/BECOaWaAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T17:58:48.988450Z"},"content_sha256":"7651877c653ba1021eefbc63839391f8933d0c5de82d9f8b3a7960c5d06807a2","schema_version":"1.0","event_id":"sha256:7651877c653ba1021eefbc63839391f8933d0c5de82d9f8b3a7960c5d06807a2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XYT2LPGYO3LAHZ4U76ZXL5VL55/bundle.json","state_url":"https://pith.science/pith/XYT2LPGYO3LAHZ4U76ZXL5VL55/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XYT2LPGYO3LAHZ4U76ZXL5VL55/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-08T17:58:48Z","links":{"resolver":"https://pith.science/pith/XYT2LPGYO3LAHZ4U76ZXL5VL55","bundle":"https://pith.science/pith/XYT2LPGYO3LAHZ4U76ZXL5VL55/bundle.json","state":"https://pith.science/pith/XYT2LPGYO3LAHZ4U76ZXL5VL55/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XYT2LPGYO3LAHZ4U76ZXL5VL55/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:XYT2LPGYO3LAHZ4U76ZXL5VL55","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":"debb9de4acc1a3e4e7db5bfee670802f8dadfe8d1334fc0f1f6123819e7d4786","cross_cats_sorted":["cs.DS","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-08-06T09:19:50Z","title_canon_sha256":"f4e2331f60daac91599ba1054e6eb3462e405838eb26f2de7a4490587f5a729d"},"schema_version":"1.0","source":{"id":"1308.1212","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.1212","created_at":"2026-05-18T03:16:39Z"},{"alias_kind":"arxiv_version","alias_value":"1308.1212v1","created_at":"2026-05-18T03:16:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.1212","created_at":"2026-05-18T03:16:39Z"},{"alias_kind":"pith_short_12","alias_value":"XYT2LPGYO3LA","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XYT2LPGYO3LAHZ4U","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XYT2LPGY","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:7651877c653ba1021eefbc63839391f8933d0c5de82d9f8b3a7960c5d06807a2","target":"graph","created_at":"2026-05-18T03:16:39Z","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":"Design of {\\it online algorithms} for assigning mobile users to basestations is considered with the objective of maximizing the sum-rate, when all users associated to any one basestation equally share each basestation's resources. Each user on its arrival reveals the rates it can obtain if connected to each of the basestations, and the problem is to assign each user to any one basestation irrevocably so that the sum-rate is maximized at the end of all user arrivals, without knowing the future user arrival or rate information or its statistics at each user arrival. Online algorithms with consta","authors_text":"Andrew Thangaraj, Rahul Vaze","cross_cats":["cs.DS","cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-08-06T09:19:50Z","title":"Online Algorithms for Basestation Allocation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.1212","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:6544bb040a6315adb5f03301d0acd091eb3e2f407a803a1e56569597282377a5","target":"record","created_at":"2026-05-18T03:16:39Z","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":"debb9de4acc1a3e4e7db5bfee670802f8dadfe8d1334fc0f1f6123819e7d4786","cross_cats_sorted":["cs.DS","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-08-06T09:19:50Z","title_canon_sha256":"f4e2331f60daac91599ba1054e6eb3462e405838eb26f2de7a4490587f5a729d"},"schema_version":"1.0","source":{"id":"1308.1212","kind":"arxiv","version":1}},"canonical_sha256":"be27a5bcd876d603e794ffb375f6abef4048891d43660cbcd215d30f5da0f6d1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"be27a5bcd876d603e794ffb375f6abef4048891d43660cbcd215d30f5da0f6d1","first_computed_at":"2026-05-18T03:16:39.489194Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:16:39.489194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bQpytFlYGDNJpVT4Ylwu19rDVhq0Fm7Jt4w2rsjZnQWpyu/PMhQ43USnJAN1/qa3SDtGHnTo/KtqJYxwGsqIAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:16:39.489975Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.1212","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6544bb040a6315adb5f03301d0acd091eb3e2f407a803a1e56569597282377a5","sha256:7651877c653ba1021eefbc63839391f8933d0c5de82d9f8b3a7960c5d06807a2"],"state_sha256":"61cbb81efadb571a9af7e1397e0aefb3e92b0396eac2790563b2279893a7dd7a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dK4KLaS/oTtzgHQZ9yPBHogEudleLtSPcU2765b+x6OyluNydL4N5BP5TK+QLCAEJ2na5V18GT6g7Tbnx2QwBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T17:58:48.992532Z","bundle_sha256":"b0ed4c0f4d61812eaaa4766d1af060b91ef341b10ad8fe046f4c9001613a2389"}}