{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:INPB4PTPCKEUBSEWEI5IEM7S4J","short_pith_number":"pith:INPB4PTP","schema_version":"1.0","canonical_sha256":"435e1e3e6f128940c896223a8233f2e260b81f61ea38d9891340842aa5d7094a","source":{"kind":"arxiv","id":"1309.2476","version":1},"attestation_state":"computed","paper":{"title":"TRANS outperforms MTF for two special types of request sequences without locality of reference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Burle Sharma, Rakesh Mohanty, Sangita Patel, Shiba Prasad Dash","submitted_at":"2013-09-10T12:24:50Z","abstract_excerpt":"Various list accessing algorithms have been proposed in the literature and their performances have been analyzed theoretically and experimentally. Move-To-Front (MTF) and Transpose (TRANS) are two well known primitive list accessing algorithms. MTF has been proved to be the best performing online algorithm till date in the literature for real life inputs and practical applications with locality of reference. It has been shown that when storage space is extremely limited and pointers for lists cannot be used, then array implementation of TRANS gives efficient reorganization. Use of MTF is exten"},"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":"1309.2476","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-10T12:24:50Z","cross_cats_sorted":[],"title_canon_sha256":"b40ed0e48bd71f27fc7a4ad567b779f8c1ea36a5f4d18755867eee790a4df653","abstract_canon_sha256":"43540803c6d50392d4aed10c84bfcf545ba04e7069f514d8a9cb0601568f3727"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:13:44.561428Z","signature_b64":"B4xlpZcKZF/bUzbsYyIHb/jbhsTufdWfIN2YvJSNy/rLZUSFdBoUBa/hBY+14sjkwoPRdsDNS1nmgS69DxWLAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"435e1e3e6f128940c896223a8233f2e260b81f61ea38d9891340842aa5d7094a","last_reissued_at":"2026-05-18T03:13:44.560673Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:13:44.560673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"TRANS outperforms MTF for two special types of request sequences without locality of reference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Burle Sharma, Rakesh Mohanty, Sangita Patel, Shiba Prasad Dash","submitted_at":"2013-09-10T12:24:50Z","abstract_excerpt":"Various list accessing algorithms have been proposed in the literature and their performances have been analyzed theoretically and experimentally. Move-To-Front (MTF) and Transpose (TRANS) are two well known primitive list accessing algorithms. MTF has been proved to be the best performing online algorithm till date in the literature for real life inputs and practical applications with locality of reference. It has been shown that when storage space is extremely limited and pointers for lists cannot be used, then array implementation of TRANS gives efficient reorganization. Use of MTF is exten"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.2476","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":"1309.2476","created_at":"2026-05-18T03:13:44.560777+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.2476v1","created_at":"2026-05-18T03:13:44.560777+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.2476","created_at":"2026-05-18T03:13:44.560777+00:00"},{"alias_kind":"pith_short_12","alias_value":"INPB4PTPCKEU","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"INPB4PTPCKEUBSEW","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"INPB4PTP","created_at":"2026-05-18T12:27:46.883200+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/INPB4PTPCKEUBSEWEI5IEM7S4J","json":"https://pith.science/pith/INPB4PTPCKEUBSEWEI5IEM7S4J.json","graph_json":"https://pith.science/api/pith-number/INPB4PTPCKEUBSEWEI5IEM7S4J/graph.json","events_json":"https://pith.science/api/pith-number/INPB4PTPCKEUBSEWEI5IEM7S4J/events.json","paper":"https://pith.science/paper/INPB4PTP"},"agent_actions":{"view_html":"https://pith.science/pith/INPB4PTPCKEUBSEWEI5IEM7S4J","download_json":"https://pith.science/pith/INPB4PTPCKEUBSEWEI5IEM7S4J.json","view_paper":"https://pith.science/paper/INPB4PTP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.2476&json=true","fetch_graph":"https://pith.science/api/pith-number/INPB4PTPCKEUBSEWEI5IEM7S4J/graph.json","fetch_events":"https://pith.science/api/pith-number/INPB4PTPCKEUBSEWEI5IEM7S4J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/INPB4PTPCKEUBSEWEI5IEM7S4J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/INPB4PTPCKEUBSEWEI5IEM7S4J/action/storage_attestation","attest_author":"https://pith.science/pith/INPB4PTPCKEUBSEWEI5IEM7S4J/action/author_attestation","sign_citation":"https://pith.science/pith/INPB4PTPCKEUBSEWEI5IEM7S4J/action/citation_signature","submit_replication":"https://pith.science/pith/INPB4PTPCKEUBSEWEI5IEM7S4J/action/replication_record"}},"created_at":"2026-05-18T03:13:44.560777+00:00","updated_at":"2026-05-18T03:13:44.560777+00:00"}