{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:PBFFDPGEPSCUOSA5DZZN7V6L4H","short_pith_number":"pith:PBFFDPGE","canonical_record":{"source":{"id":"1112.5636","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-23T19:02:01Z","cross_cats_sorted":[],"title_canon_sha256":"a0a36d8c35d9d0fc0ef1e118245bbed4bd94adf2725f19585fc1ca37abe094ed","abstract_canon_sha256":"5987e7969767d066279ec6d29b6adcdbab3d7dc61aa25e7ea08b78af7674c1eb"},"schema_version":"1.0"},"canonical_sha256":"784a51bcc47c8547481d1e72dfd7cbe1f95674caa076fcbe9b8d209c41c105c5","source":{"kind":"arxiv","id":"1112.5636","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.5636","created_at":"2026-05-18T02:21:26Z"},{"alias_kind":"arxiv_version","alias_value":"1112.5636v1","created_at":"2026-05-18T02:21:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.5636","created_at":"2026-05-18T02:21:26Z"},{"alias_kind":"pith_short_12","alias_value":"PBFFDPGEPSCU","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"PBFFDPGEPSCUOSA5","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"PBFFDPGE","created_at":"2026-05-18T12:26:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:PBFFDPGEPSCUOSA5DZZN7V6L4H","target":"record","payload":{"canonical_record":{"source":{"id":"1112.5636","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-23T19:02:01Z","cross_cats_sorted":[],"title_canon_sha256":"a0a36d8c35d9d0fc0ef1e118245bbed4bd94adf2725f19585fc1ca37abe094ed","abstract_canon_sha256":"5987e7969767d066279ec6d29b6adcdbab3d7dc61aa25e7ea08b78af7674c1eb"},"schema_version":"1.0"},"canonical_sha256":"784a51bcc47c8547481d1e72dfd7cbe1f95674caa076fcbe9b8d209c41c105c5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:26.973240Z","signature_b64":"GvoGVgWS10F5CPoRbBkGroZ5kdOMLZn4TpvIwtvxwn0Khmoi8FdUW/IDkqQH24u8FU3QORzTJSgE1Zy20KItAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"784a51bcc47c8547481d1e72dfd7cbe1f95674caa076fcbe9b8d209c41c105c5","last_reissued_at":"2026-05-18T02:21:26.972612Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:26.972612Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1112.5636","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:21:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/rQmevyJbAxUf6mq9oJ1lbl3psA80CGvN+DKCuZutVP2LmwPEdW8VZOUzl5UmLE/MksTfFWKVEE9GNnZjodZAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:09:22.456687Z"},"content_sha256":"b9895cc24939674f68f255f71411c6ba666d913138db9a5caaca5bcd959ee3da","schema_version":"1.0","event_id":"sha256:b9895cc24939674f68f255f71411c6ba666d913138db9a5caaca5bcd959ee3da"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:PBFFDPGEPSCUOSA5DZZN7V6L4H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tight lower bounds for online labeling problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jan Bul\\'anek, Michael Saks, Michal Kouck\\'y","submitted_at":"2011-12-23T19:02:01Z","abstract_excerpt":"We consider the file maintenance problem (also called the online labeling problem) in which n integer items from the set {1,...,r} are to be stored in an array of size m >= n. The items are presented sequentially in an arbitrary order, and must be stored in the array in sorted order (but not necessarily in consecutive locations in the array). Each new item must be stored in the array before the next item is received. If r<=m then we can simply store item j in location j but if r>m then we may have to shift the location of stored items to make space for a newly arrived item. The algorithm is ch"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.5636","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:21:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K53Xj8lOHzaLVGgbGQhzC7v3DMcv/JyD9dwrzDP62ssstqncina9ke2e+M/rPr49a37ixsHqXmisFnZ2sTY1Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:09:22.457044Z"},"content_sha256":"239065656da833d1ca710af5baed9a96d7bd6efff5bcefcef442f24d692a28d8","schema_version":"1.0","event_id":"sha256:239065656da833d1ca710af5baed9a96d7bd6efff5bcefcef442f24d692a28d8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PBFFDPGEPSCUOSA5DZZN7V6L4H/bundle.json","state_url":"https://pith.science/pith/PBFFDPGEPSCUOSA5DZZN7V6L4H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PBFFDPGEPSCUOSA5DZZN7V6L4H/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-28T03:09:22Z","links":{"resolver":"https://pith.science/pith/PBFFDPGEPSCUOSA5DZZN7V6L4H","bundle":"https://pith.science/pith/PBFFDPGEPSCUOSA5DZZN7V6L4H/bundle.json","state":"https://pith.science/pith/PBFFDPGEPSCUOSA5DZZN7V6L4H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PBFFDPGEPSCUOSA5DZZN7V6L4H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:PBFFDPGEPSCUOSA5DZZN7V6L4H","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":"5987e7969767d066279ec6d29b6adcdbab3d7dc61aa25e7ea08b78af7674c1eb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-23T19:02:01Z","title_canon_sha256":"a0a36d8c35d9d0fc0ef1e118245bbed4bd94adf2725f19585fc1ca37abe094ed"},"schema_version":"1.0","source":{"id":"1112.5636","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.5636","created_at":"2026-05-18T02:21:26Z"},{"alias_kind":"arxiv_version","alias_value":"1112.5636v1","created_at":"2026-05-18T02:21:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.5636","created_at":"2026-05-18T02:21:26Z"},{"alias_kind":"pith_short_12","alias_value":"PBFFDPGEPSCU","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"PBFFDPGEPSCUOSA5","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"PBFFDPGE","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:239065656da833d1ca710af5baed9a96d7bd6efff5bcefcef442f24d692a28d8","target":"graph","created_at":"2026-05-18T02:21:26Z","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":"We consider the file maintenance problem (also called the online labeling problem) in which n integer items from the set {1,...,r} are to be stored in an array of size m >= n. The items are presented sequentially in an arbitrary order, and must be stored in the array in sorted order (but not necessarily in consecutive locations in the array). Each new item must be stored in the array before the next item is received. If r<=m then we can simply store item j in location j but if r>m then we may have to shift the location of stored items to make space for a newly arrived item. The algorithm is ch","authors_text":"Jan Bul\\'anek, Michael Saks, Michal Kouck\\'y","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-23T19:02:01Z","title":"Tight lower bounds for online labeling problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.5636","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:b9895cc24939674f68f255f71411c6ba666d913138db9a5caaca5bcd959ee3da","target":"record","created_at":"2026-05-18T02:21:26Z","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":"5987e7969767d066279ec6d29b6adcdbab3d7dc61aa25e7ea08b78af7674c1eb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-23T19:02:01Z","title_canon_sha256":"a0a36d8c35d9d0fc0ef1e118245bbed4bd94adf2725f19585fc1ca37abe094ed"},"schema_version":"1.0","source":{"id":"1112.5636","kind":"arxiv","version":1}},"canonical_sha256":"784a51bcc47c8547481d1e72dfd7cbe1f95674caa076fcbe9b8d209c41c105c5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"784a51bcc47c8547481d1e72dfd7cbe1f95674caa076fcbe9b8d209c41c105c5","first_computed_at":"2026-05-18T02:21:26.972612Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:26.972612Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GvoGVgWS10F5CPoRbBkGroZ5kdOMLZn4TpvIwtvxwn0Khmoi8FdUW/IDkqQH24u8FU3QORzTJSgE1Zy20KItAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:26.973240Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.5636","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b9895cc24939674f68f255f71411c6ba666d913138db9a5caaca5bcd959ee3da","sha256:239065656da833d1ca710af5baed9a96d7bd6efff5bcefcef442f24d692a28d8"],"state_sha256":"aa469228191c3e3be2e6d16d30d7f861c4ab2ffadcf4bb3a1e85f2483430e2c0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lD1WZr6G3L2IyNZSp0eO8jzBazp0zs3011qGyEinLSq1A7OiVnoxlSzJUBOmbIkILFJEniVpTYYIFVZ3/TxiBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T03:09:22.459175Z","bundle_sha256":"4a67d65b93995da822fe887a71f8080a9369d6cade278ef081736dac93c32d48"}}