{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:CGNOHOBNQP2ASOKMX52TK7Z3BR","short_pith_number":"pith:CGNOHOBN","canonical_record":{"source":{"id":"1109.2231","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-10T15:37:28Z","cross_cats_sorted":[],"title_canon_sha256":"26896bebe2b562ac91869ef0036de84859eee1dd9b19827bc457a7b181210bf7","abstract_canon_sha256":"07b7e6389cb6e66a3ce0a2836af1b612ed268e7d446e392243d4a71b187e068b"},"schema_version":"1.0"},"canonical_sha256":"119ae3b82d83f409394cbf75357f3b0c4bdbb3f8aacb67069f1f72b27c85ec2c","source":{"kind":"arxiv","id":"1109.2231","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.2231","created_at":"2026-05-18T02:00:36Z"},{"alias_kind":"arxiv_version","alias_value":"1109.2231v1","created_at":"2026-05-18T02:00:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.2231","created_at":"2026-05-18T02:00:36Z"},{"alias_kind":"pith_short_12","alias_value":"CGNOHOBNQP2A","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"CGNOHOBNQP2ASOKM","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"CGNOHOBN","created_at":"2026-05-18T12:26:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:CGNOHOBNQP2ASOKMX52TK7Z3BR","target":"record","payload":{"canonical_record":{"source":{"id":"1109.2231","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-10T15:37:28Z","cross_cats_sorted":[],"title_canon_sha256":"26896bebe2b562ac91869ef0036de84859eee1dd9b19827bc457a7b181210bf7","abstract_canon_sha256":"07b7e6389cb6e66a3ce0a2836af1b612ed268e7d446e392243d4a71b187e068b"},"schema_version":"1.0"},"canonical_sha256":"119ae3b82d83f409394cbf75357f3b0c4bdbb3f8aacb67069f1f72b27c85ec2c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:00:36.720947Z","signature_b64":"YlIM0U6VdUoLYBvvC1d318QpV9CBoU2fAPFwj7Q4HTqoqdTu4+s4qyMhxTs9oY6kpTb/i0X4Ww3905eIWWmVCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"119ae3b82d83f409394cbf75357f3b0c4bdbb3f8aacb67069f1f72b27c85ec2c","last_reissued_at":"2026-05-18T02:00:36.720404Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:00:36.720404Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.2231","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:00:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9CR3U6OrIdH5vfuC6RrTYEMJGLR1m4DjzJDr9+TRfElExVJ/28rrZ1uqW5IDNEaYANmYozZ45efluY1fT+g/DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T13:02:09.391372Z"},"content_sha256":"9736b73bbc9ac931af033e77f80af71f687ff3fede2b6375a826dbefda78004d","schema_version":"1.0","event_id":"sha256:9736b73bbc9ac931af033e77f80af71f687ff3fede2b6375a826dbefda78004d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:CGNOHOBNQP2ASOKMX52TK7Z3BR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Characterization of Request Sequences for List Accessing Problem and New Theoretical Results for MTF Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Burle Sharma, Rakesh Mohanty, Sasmita Tripathy","submitted_at":"2011-09-10T15:37:28Z","abstract_excerpt":"List Accessing Problem is a well studied research problem in the context of linear search. Input to the list accessing problem is an unsorted linear list of distinct elements along with a sequence of requests, where each request is an access operation on an element of the list. A list accessing algorithm reorganizes the list while processing a request sequence on the list in order to minimize the access cost. Move-To-Front algorithm has been proved to be the best performing list accessing online algorithm till date in the literature. Characterization of the input request sequences correspondin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.2231","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:00:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"goAatRTN6Wt9SrMRc4riUDlwgHJZDlyzQnTy4WcQS+VJ6TGj2giPJo3jEx6qlOGdJkO+H89755d8OXwe8BC4BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T13:02:09.391762Z"},"content_sha256":"40dcdf04ea47f6c1b51af8fb0afd44259711031b4f42c715b4ac7133ec4206e1","schema_version":"1.0","event_id":"sha256:40dcdf04ea47f6c1b51af8fb0afd44259711031b4f42c715b4ac7133ec4206e1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CGNOHOBNQP2ASOKMX52TK7Z3BR/bundle.json","state_url":"https://pith.science/pith/CGNOHOBNQP2ASOKMX52TK7Z3BR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CGNOHOBNQP2ASOKMX52TK7Z3BR/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-03T13:02:09Z","links":{"resolver":"https://pith.science/pith/CGNOHOBNQP2ASOKMX52TK7Z3BR","bundle":"https://pith.science/pith/CGNOHOBNQP2ASOKMX52TK7Z3BR/bundle.json","state":"https://pith.science/pith/CGNOHOBNQP2ASOKMX52TK7Z3BR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CGNOHOBNQP2ASOKMX52TK7Z3BR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:CGNOHOBNQP2ASOKMX52TK7Z3BR","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":"07b7e6389cb6e66a3ce0a2836af1b612ed268e7d446e392243d4a71b187e068b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-10T15:37:28Z","title_canon_sha256":"26896bebe2b562ac91869ef0036de84859eee1dd9b19827bc457a7b181210bf7"},"schema_version":"1.0","source":{"id":"1109.2231","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.2231","created_at":"2026-05-18T02:00:36Z"},{"alias_kind":"arxiv_version","alias_value":"1109.2231v1","created_at":"2026-05-18T02:00:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.2231","created_at":"2026-05-18T02:00:36Z"},{"alias_kind":"pith_short_12","alias_value":"CGNOHOBNQP2A","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"CGNOHOBNQP2ASOKM","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"CGNOHOBN","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:40dcdf04ea47f6c1b51af8fb0afd44259711031b4f42c715b4ac7133ec4206e1","target":"graph","created_at":"2026-05-18T02:00:36Z","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":"List Accessing Problem is a well studied research problem in the context of linear search. Input to the list accessing problem is an unsorted linear list of distinct elements along with a sequence of requests, where each request is an access operation on an element of the list. A list accessing algorithm reorganizes the list while processing a request sequence on the list in order to minimize the access cost. Move-To-Front algorithm has been proved to be the best performing list accessing online algorithm till date in the literature. Characterization of the input request sequences correspondin","authors_text":"Burle Sharma, Rakesh Mohanty, Sasmita Tripathy","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-10T15:37:28Z","title":"Characterization of Request Sequences for List Accessing Problem and New Theoretical Results for MTF Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.2231","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:9736b73bbc9ac931af033e77f80af71f687ff3fede2b6375a826dbefda78004d","target":"record","created_at":"2026-05-18T02:00:36Z","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":"07b7e6389cb6e66a3ce0a2836af1b612ed268e7d446e392243d4a71b187e068b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-10T15:37:28Z","title_canon_sha256":"26896bebe2b562ac91869ef0036de84859eee1dd9b19827bc457a7b181210bf7"},"schema_version":"1.0","source":{"id":"1109.2231","kind":"arxiv","version":1}},"canonical_sha256":"119ae3b82d83f409394cbf75357f3b0c4bdbb3f8aacb67069f1f72b27c85ec2c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"119ae3b82d83f409394cbf75357f3b0c4bdbb3f8aacb67069f1f72b27c85ec2c","first_computed_at":"2026-05-18T02:00:36.720404Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:00:36.720404Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YlIM0U6VdUoLYBvvC1d318QpV9CBoU2fAPFwj7Q4HTqoqdTu4+s4qyMhxTs9oY6kpTb/i0X4Ww3905eIWWmVCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:00:36.720947Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.2231","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9736b73bbc9ac931af033e77f80af71f687ff3fede2b6375a826dbefda78004d","sha256:40dcdf04ea47f6c1b51af8fb0afd44259711031b4f42c715b4ac7133ec4206e1"],"state_sha256":"0753701e7c5ad77bab90df9c010a3aff9a8161acf29b55a3516c7eba4d1fdf4b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4bEV+LlA8dF9S27TzRgcBbgT1C4zB2guvtDJni17pWtnoo6m4oADiyxMKreuWRY/CLcZpKaWYyomkxCLZxA9Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T13:02:09.393914Z","bundle_sha256":"f3d1ccb0c74707ae361826a6c09cbb087405011adf930a2b4321e50fe97c233c"}}