{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:2VQS7UXLLGJPCSFTG3K5BWGHB5","short_pith_number":"pith:2VQS7UXL","canonical_record":{"source":{"id":"1009.5787","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-09-29T07:17:38Z","cross_cats_sorted":[],"title_canon_sha256":"b85588d77bb53b4cdeee192c350d43e1d0b71a6b07d9147ddfd237f2a412361f","abstract_canon_sha256":"a54638b9f6581a20d1b452c82ed183b022430bebc1dac9727be4adc6ade1c147"},"schema_version":"1.0"},"canonical_sha256":"d5612fd2eb5992f148b336d5d0d8c70f540ca5d0fa641812134fc4657bfc5d3c","source":{"kind":"arxiv","id":"1009.5787","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.5787","created_at":"2026-05-18T02:23:48Z"},{"alias_kind":"arxiv_version","alias_value":"1009.5787v1","created_at":"2026-05-18T02:23:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.5787","created_at":"2026-05-18T02:23:48Z"},{"alias_kind":"pith_short_12","alias_value":"2VQS7UXLLGJP","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"2VQS7UXLLGJPCSFT","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"2VQS7UXL","created_at":"2026-05-18T12:26:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:2VQS7UXLLGJPCSFTG3K5BWGHB5","target":"record","payload":{"canonical_record":{"source":{"id":"1009.5787","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-09-29T07:17:38Z","cross_cats_sorted":[],"title_canon_sha256":"b85588d77bb53b4cdeee192c350d43e1d0b71a6b07d9147ddfd237f2a412361f","abstract_canon_sha256":"a54638b9f6581a20d1b452c82ed183b022430bebc1dac9727be4adc6ade1c147"},"schema_version":"1.0"},"canonical_sha256":"d5612fd2eb5992f148b336d5d0d8c70f540ca5d0fa641812134fc4657bfc5d3c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:48.166850Z","signature_b64":"KqjQl088TucBkcIKF+vb9wBaufSTVQ4sBRVe19Zst6wdU/qNuYYquk44xbr+coGA4YC4jlC/+DJwCSlZ5+XeCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d5612fd2eb5992f148b336d5d0d8c70f540ca5d0fa641812134fc4657bfc5d3c","last_reissued_at":"2026-05-18T02:23:48.166045Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:48.166045Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1009.5787","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:23:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"urhUv1NlTKEKrmPDgo5uBtwBOySubm8z2wilVHp8d72XVqbnA6avIVO9LyOTcsVLihPLFhGaUYB5QGylKlSsCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T08:24:34.723353Z"},"content_sha256":"ca307eb6f669f965e217e0ba3436aceca9752502530f786c4743e4b35ad57553","schema_version":"1.0","event_id":"sha256:ca307eb6f669f965e217e0ba3436aceca9752502530f786c4743e4b35ad57553"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:2VQS7UXLLGJPCSFTG3K5BWGHB5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"List Factoring and Relative Worst Order Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jens S. Kohrt, Kim S. Larsen, Martin R. Ehmsen","submitted_at":"2010-09-29T07:17:38Z","abstract_excerpt":"Relative worst order analysis is a supplement or alternative to competitive analysis which has been shown to give results more in accordance with observed behavior of online algorithms for a range of different online problems. The contribution of this paper is twofold. First, it adds the static list accessing problem to the collection of online problems where relative worst order analysis gives better results. Second, and maybe more interesting, it adds the non-trivial supplementary proof technique of list factoring to the theoretical toolbox for relative worst order analysis."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.5787","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:23:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wo7uQRVhrBO2U4+kr3ouZmvFvDFB3uUhe25UJdyTGvju7gAluSj5QXPtOsxU9IKR5upnGyvUFaWl6GHjZXNLBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T08:24:34.723701Z"},"content_sha256":"d4fe3ed95acf82d1090ec97d28b6ae40966e69c4bfc1f190b9d9cfe3bcadad5a","schema_version":"1.0","event_id":"sha256:d4fe3ed95acf82d1090ec97d28b6ae40966e69c4bfc1f190b9d9cfe3bcadad5a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2VQS7UXLLGJPCSFTG3K5BWGHB5/bundle.json","state_url":"https://pith.science/pith/2VQS7UXLLGJPCSFTG3K5BWGHB5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2VQS7UXLLGJPCSFTG3K5BWGHB5/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-22T08:24:34Z","links":{"resolver":"https://pith.science/pith/2VQS7UXLLGJPCSFTG3K5BWGHB5","bundle":"https://pith.science/pith/2VQS7UXLLGJPCSFTG3K5BWGHB5/bundle.json","state":"https://pith.science/pith/2VQS7UXLLGJPCSFTG3K5BWGHB5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2VQS7UXLLGJPCSFTG3K5BWGHB5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:2VQS7UXLLGJPCSFTG3K5BWGHB5","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":"a54638b9f6581a20d1b452c82ed183b022430bebc1dac9727be4adc6ade1c147","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-09-29T07:17:38Z","title_canon_sha256":"b85588d77bb53b4cdeee192c350d43e1d0b71a6b07d9147ddfd237f2a412361f"},"schema_version":"1.0","source":{"id":"1009.5787","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.5787","created_at":"2026-05-18T02:23:48Z"},{"alias_kind":"arxiv_version","alias_value":"1009.5787v1","created_at":"2026-05-18T02:23:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.5787","created_at":"2026-05-18T02:23:48Z"},{"alias_kind":"pith_short_12","alias_value":"2VQS7UXLLGJP","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"2VQS7UXLLGJPCSFT","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"2VQS7UXL","created_at":"2026-05-18T12:26:03Z"}],"graph_snapshots":[{"event_id":"sha256:d4fe3ed95acf82d1090ec97d28b6ae40966e69c4bfc1f190b9d9cfe3bcadad5a","target":"graph","created_at":"2026-05-18T02:23:48Z","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":"Relative worst order analysis is a supplement or alternative to competitive analysis which has been shown to give results more in accordance with observed behavior of online algorithms for a range of different online problems. The contribution of this paper is twofold. First, it adds the static list accessing problem to the collection of online problems where relative worst order analysis gives better results. Second, and maybe more interesting, it adds the non-trivial supplementary proof technique of list factoring to the theoretical toolbox for relative worst order analysis.","authors_text":"Jens S. Kohrt, Kim S. Larsen, Martin R. Ehmsen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-09-29T07:17:38Z","title":"List Factoring and Relative Worst Order Analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.5787","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:ca307eb6f669f965e217e0ba3436aceca9752502530f786c4743e4b35ad57553","target":"record","created_at":"2026-05-18T02:23:48Z","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":"a54638b9f6581a20d1b452c82ed183b022430bebc1dac9727be4adc6ade1c147","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-09-29T07:17:38Z","title_canon_sha256":"b85588d77bb53b4cdeee192c350d43e1d0b71a6b07d9147ddfd237f2a412361f"},"schema_version":"1.0","source":{"id":"1009.5787","kind":"arxiv","version":1}},"canonical_sha256":"d5612fd2eb5992f148b336d5d0d8c70f540ca5d0fa641812134fc4657bfc5d3c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d5612fd2eb5992f148b336d5d0d8c70f540ca5d0fa641812134fc4657bfc5d3c","first_computed_at":"2026-05-18T02:23:48.166045Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:23:48.166045Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KqjQl088TucBkcIKF+vb9wBaufSTVQ4sBRVe19Zst6wdU/qNuYYquk44xbr+coGA4YC4jlC/+DJwCSlZ5+XeCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:23:48.166850Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.5787","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ca307eb6f669f965e217e0ba3436aceca9752502530f786c4743e4b35ad57553","sha256:d4fe3ed95acf82d1090ec97d28b6ae40966e69c4bfc1f190b9d9cfe3bcadad5a"],"state_sha256":"868d416c69b6caf595ad759156eb6a6edbf932a927ef9cafde841f5c11ad189d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XhMWVhOjwDMeylCYmet9Z2QH3aQ5ZbtJaM1Vq4oQ36QTKTyS+YRjfiHCOA31OjaA9yRpHOleFstbeu+7qqNTAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T08:24:34.725692Z","bundle_sha256":"27d5a66937208649bce61382f6931ad4d10576cc6f3d79c7aa57cf4d7745882c"}}