{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:Y5IKMJYXL22SHMSRFLX3RDYWXR","short_pith_number":"pith:Y5IKMJYX","canonical_record":{"source":{"id":"1002.2440","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-02-11T21:48:07Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"2458ffafeb9d987bef2f8c3b8e249846dab1522d6cfeeb0f80799929b6921cc5","abstract_canon_sha256":"56a9171cb48c69bf3f50c5fcdd2dd0a607a50c8b0df11a89aa61574595f5a107"},"schema_version":"1.0"},"canonical_sha256":"c750a627175eb523b2512aefb88f16bc6dd5924d651877f562bb9f234a0d841f","source":{"kind":"arxiv","id":"1002.2440","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1002.2440","created_at":"2026-05-18T02:32:31Z"},{"alias_kind":"arxiv_version","alias_value":"1002.2440v3","created_at":"2026-05-18T02:32:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1002.2440","created_at":"2026-05-18T02:32:31Z"},{"alias_kind":"pith_short_12","alias_value":"Y5IKMJYXL22S","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"Y5IKMJYXL22SHMSR","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"Y5IKMJYX","created_at":"2026-05-18T12:26:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:Y5IKMJYXL22SHMSRFLX3RDYWXR","target":"record","payload":{"canonical_record":{"source":{"id":"1002.2440","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-02-11T21:48:07Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"2458ffafeb9d987bef2f8c3b8e249846dab1522d6cfeeb0f80799929b6921cc5","abstract_canon_sha256":"56a9171cb48c69bf3f50c5fcdd2dd0a607a50c8b0df11a89aa61574595f5a107"},"schema_version":"1.0"},"canonical_sha256":"c750a627175eb523b2512aefb88f16bc6dd5924d651877f562bb9f234a0d841f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:31.776663Z","signature_b64":"U+Z/4XtRUDUfUWwzF3Jcjc1sDqMhGTABkMl3MxklTRibvDXjwCvYXzgdk6hjZeDUeli94gmBGUqbTeVuEjdRBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c750a627175eb523b2512aefb88f16bc6dd5924d651877f562bb9f234a0d841f","last_reissued_at":"2026-05-18T02:32:31.776118Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:31.776118Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1002.2440","source_version":3,"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:32:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MsjZscdYOU6Rg6HxAkqOwRVJBwcSKFMsAHSsYs/lQowrE/fNMOTKi1KymiWeCFcrPsKG+t/oe3v5dRLPblBQAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T09:27:38.739103Z"},"content_sha256":"c227e5b126eadb5deabd328c7fc7c6d72963d2a978b0d78244efdf5580a178e1","schema_version":"1.0","event_id":"sha256:c227e5b126eadb5deabd328c7fc7c6d72963d2a978b0d78244efdf5580a178e1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:Y5IKMJYXL22SHMSRFLX3RDYWXR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Lower Bounds for Projective List Update Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Bernd Gaertner, Bernhard von Stengel, Christoph Ambuehl","submitted_at":"2010-02-11T21:48:07Z","abstract_excerpt":"The list update problem is a classical online problem, with an optimal competitive ratio that is still open, known to be somewhere between 1.5 and 1.6. An algorithm with competitive ratio 1.6, the smallest known to date, is COMB, a randomized combination of BIT and the TIMESTAMP algorithm TS. This and almost all other list update algorithms, like MTF, are projective in the sense that they can be defined by looking only at any pair of list items at a time. Projectivity (also known as \"list factoring\") simplifies both the description of the algorithm and its analysis, and so far seems to be the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1002.2440","kind":"arxiv","version":3},"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:32:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qncAqxu2vtbSsR8Yo/v/3ZOlocm1RFHgAg5sQzFjvwYTj3IflIAuDPVCoRuzL2ykbb9t0399aeDC+3mlLn98Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T09:27:38.739462Z"},"content_sha256":"72b7a7b61faeab5a5f3a0f6c9e068e0bd8b6276f692c6d30bb83b60fb3bf29d4","schema_version":"1.0","event_id":"sha256:72b7a7b61faeab5a5f3a0f6c9e068e0bd8b6276f692c6d30bb83b60fb3bf29d4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y5IKMJYXL22SHMSRFLX3RDYWXR/bundle.json","state_url":"https://pith.science/pith/Y5IKMJYXL22SHMSRFLX3RDYWXR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y5IKMJYXL22SHMSRFLX3RDYWXR/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-24T09:27:38Z","links":{"resolver":"https://pith.science/pith/Y5IKMJYXL22SHMSRFLX3RDYWXR","bundle":"https://pith.science/pith/Y5IKMJYXL22SHMSRFLX3RDYWXR/bundle.json","state":"https://pith.science/pith/Y5IKMJYXL22SHMSRFLX3RDYWXR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y5IKMJYXL22SHMSRFLX3RDYWXR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:Y5IKMJYXL22SHMSRFLX3RDYWXR","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":"56a9171cb48c69bf3f50c5fcdd2dd0a607a50c8b0df11a89aa61574595f5a107","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-02-11T21:48:07Z","title_canon_sha256":"2458ffafeb9d987bef2f8c3b8e249846dab1522d6cfeeb0f80799929b6921cc5"},"schema_version":"1.0","source":{"id":"1002.2440","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1002.2440","created_at":"2026-05-18T02:32:31Z"},{"alias_kind":"arxiv_version","alias_value":"1002.2440v3","created_at":"2026-05-18T02:32:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1002.2440","created_at":"2026-05-18T02:32:31Z"},{"alias_kind":"pith_short_12","alias_value":"Y5IKMJYXL22S","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"Y5IKMJYXL22SHMSR","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"Y5IKMJYX","created_at":"2026-05-18T12:26:17Z"}],"graph_snapshots":[{"event_id":"sha256:72b7a7b61faeab5a5f3a0f6c9e068e0bd8b6276f692c6d30bb83b60fb3bf29d4","target":"graph","created_at":"2026-05-18T02:32:31Z","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 list update problem is a classical online problem, with an optimal competitive ratio that is still open, known to be somewhere between 1.5 and 1.6. An algorithm with competitive ratio 1.6, the smallest known to date, is COMB, a randomized combination of BIT and the TIMESTAMP algorithm TS. This and almost all other list update algorithms, like MTF, are projective in the sense that they can be defined by looking only at any pair of list items at a time. Projectivity (also known as \"list factoring\") simplifies both the description of the algorithm and its analysis, and so far seems to be the ","authors_text":"Bernd Gaertner, Bernhard von Stengel, Christoph Ambuehl","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-02-11T21:48:07Z","title":"Optimal Lower Bounds for Projective List Update Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1002.2440","kind":"arxiv","version":3},"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:c227e5b126eadb5deabd328c7fc7c6d72963d2a978b0d78244efdf5580a178e1","target":"record","created_at":"2026-05-18T02:32:31Z","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":"56a9171cb48c69bf3f50c5fcdd2dd0a607a50c8b0df11a89aa61574595f5a107","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-02-11T21:48:07Z","title_canon_sha256":"2458ffafeb9d987bef2f8c3b8e249846dab1522d6cfeeb0f80799929b6921cc5"},"schema_version":"1.0","source":{"id":"1002.2440","kind":"arxiv","version":3}},"canonical_sha256":"c750a627175eb523b2512aefb88f16bc6dd5924d651877f562bb9f234a0d841f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c750a627175eb523b2512aefb88f16bc6dd5924d651877f562bb9f234a0d841f","first_computed_at":"2026-05-18T02:32:31.776118Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:32:31.776118Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"U+Z/4XtRUDUfUWwzF3Jcjc1sDqMhGTABkMl3MxklTRibvDXjwCvYXzgdk6hjZeDUeli94gmBGUqbTeVuEjdRBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:32:31.776663Z","signed_message":"canonical_sha256_bytes"},"source_id":"1002.2440","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c227e5b126eadb5deabd328c7fc7c6d72963d2a978b0d78244efdf5580a178e1","sha256:72b7a7b61faeab5a5f3a0f6c9e068e0bd8b6276f692c6d30bb83b60fb3bf29d4"],"state_sha256":"8859f2bc51858e7afc8a5aa03779ca186774240809a4ed072814347e44dd4800"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aDLgPIiAc52QofkL3jfjy77lA9kt23WUxr0RziTRu769sBSMQwNp2IW6e6bvOlr5JO1d9VoTJQktz9oz8ZArAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T09:27:38.741402Z","bundle_sha256":"f46de38f6c7d7637e875de7986d1005725c5bfbe97dbfba79e59c766a53d2b89"}}