{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:CGNOHOBNQP2ASOKMX52TK7Z3BR","short_pith_number":"pith:CGNOHOBN","schema_version":"1.0","canonical_sha256":"119ae3b82d83f409394cbf75357f3b0c4bdbb3f8aacb67069f1f72b27c85ec2c","source":{"kind":"arxiv","id":"1109.2231","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1109.2231","created_at":"2026-05-18T02:00:36.720499+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.2231v1","created_at":"2026-05-18T02:00:36.720499+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.2231","created_at":"2026-05-18T02:00:36.720499+00:00"},{"alias_kind":"pith_short_12","alias_value":"CGNOHOBNQP2A","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_16","alias_value":"CGNOHOBNQP2ASOKM","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_8","alias_value":"CGNOHOBN","created_at":"2026-05-18T12:26:26.731475+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CGNOHOBNQP2ASOKMX52TK7Z3BR","json":"https://pith.science/pith/CGNOHOBNQP2ASOKMX52TK7Z3BR.json","graph_json":"https://pith.science/api/pith-number/CGNOHOBNQP2ASOKMX52TK7Z3BR/graph.json","events_json":"https://pith.science/api/pith-number/CGNOHOBNQP2ASOKMX52TK7Z3BR/events.json","paper":"https://pith.science/paper/CGNOHOBN"},"agent_actions":{"view_html":"https://pith.science/pith/CGNOHOBNQP2ASOKMX52TK7Z3BR","download_json":"https://pith.science/pith/CGNOHOBNQP2ASOKMX52TK7Z3BR.json","view_paper":"https://pith.science/paper/CGNOHOBN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.2231&json=true","fetch_graph":"https://pith.science/api/pith-number/CGNOHOBNQP2ASOKMX52TK7Z3BR/graph.json","fetch_events":"https://pith.science/api/pith-number/CGNOHOBNQP2ASOKMX52TK7Z3BR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CGNOHOBNQP2ASOKMX52TK7Z3BR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CGNOHOBNQP2ASOKMX52TK7Z3BR/action/storage_attestation","attest_author":"https://pith.science/pith/CGNOHOBNQP2ASOKMX52TK7Z3BR/action/author_attestation","sign_citation":"https://pith.science/pith/CGNOHOBNQP2ASOKMX52TK7Z3BR/action/citation_signature","submit_replication":"https://pith.science/pith/CGNOHOBNQP2ASOKMX52TK7Z3BR/action/replication_record"}},"created_at":"2026-05-18T02:00:36.720499+00:00","updated_at":"2026-05-18T02:00:36.720499+00:00"}