{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:7R7VEPUHKVWTGAIJAXT7M4LMOU","short_pith_number":"pith:7R7VEPUH","canonical_record":{"source":{"id":"1206.6187","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-06-27T07:13:16Z","cross_cats_sorted":[],"title_canon_sha256":"5a8f9f455efbaf38e01c6949171ade8b19233f023e3144e0af95722633f5b4f9","abstract_canon_sha256":"d8b4c8f5a98c56e1c29f8f67be94b52526908714bb23a36dfb348a69bc6f4bc5"},"schema_version":"1.0"},"canonical_sha256":"fc7f523e87556d33010905e7f6716c753d1c238f330479b09649fc2c5d81659f","source":{"kind":"arxiv","id":"1206.6187","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.6187","created_at":"2026-05-18T03:52:27Z"},{"alias_kind":"arxiv_version","alias_value":"1206.6187v1","created_at":"2026-05-18T03:52:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.6187","created_at":"2026-05-18T03:52:27Z"},{"alias_kind":"pith_short_12","alias_value":"7R7VEPUHKVWT","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"7R7VEPUHKVWTGAIJ","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"7R7VEPUH","created_at":"2026-05-18T12:26:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:7R7VEPUHKVWTGAIJAXT7M4LMOU","target":"record","payload":{"canonical_record":{"source":{"id":"1206.6187","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-06-27T07:13:16Z","cross_cats_sorted":[],"title_canon_sha256":"5a8f9f455efbaf38e01c6949171ade8b19233f023e3144e0af95722633f5b4f9","abstract_canon_sha256":"d8b4c8f5a98c56e1c29f8f67be94b52526908714bb23a36dfb348a69bc6f4bc5"},"schema_version":"1.0"},"canonical_sha256":"fc7f523e87556d33010905e7f6716c753d1c238f330479b09649fc2c5d81659f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:52:27.452947Z","signature_b64":"dhI2w8yklyFocRcbKuvZ7V4HFpkAQA+edIrDBGo19Xcl0iBxIUsZk9xK96ed1D8FECY1oT6wmPyUXph3IVy/AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc7f523e87556d33010905e7f6716c753d1c238f330479b09649fc2c5d81659f","last_reissued_at":"2026-05-18T03:52:27.452094Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:52:27.452094Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.6187","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-18T03:52:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WmM18JOSRaKfvdnbwYaIEJLP8djG72pBIJDfYfUwsZKHvDDkCFS2Yb0VIhZQzQGDD2iQNa1mlshZwh858zAkAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:18:52.308912Z"},"content_sha256":"fd7409da20e95dae79e9bc76951750d3d7dc925260c2e526dd0b5aace6dea3d9","schema_version":"1.0","event_id":"sha256:fd7409da20e95dae79e9bc76951750d3d7dc925260c2e526dd0b5aace6dea3d9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:7R7VEPUHKVWTGAIJAXT7M4LMOU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Some Novel Results From Analysis of Move To Front (MTF) List Accessing Algorithm","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":"2012-06-27T07:13:16Z","abstract_excerpt":"List accessing problem has been studied as a problem of significant theoretical and practical interest in the context of linear search. Various list accessing algorithms have been proposed in the literature and their performances have been analyzed theoretically and experimentally. Move-To-Front(MTF),Transpose (TRANS) and Frequency Count (FC) are the three primitive and widely used list accessing algorithms. Most of the other list accessing algorithms are the variants of these three algorithms. As mentioned in the literature as an open problem, direct bounds on the behavior and performance of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.6187","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-18T03:52:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"paiFxBylg2OAyMVeOtEa0mZAJ4s5xcLZfhdkjlHkvZdmxMhEM6Ytc4ueMzyQMWUQQPeeXK/eoK4gp6R1ip1FBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:18:52.309255Z"},"content_sha256":"36c2130b0e5e5fb32436ed49779cb639891362fd1712c8fce666c74b3236f1e7","schema_version":"1.0","event_id":"sha256:36c2130b0e5e5fb32436ed49779cb639891362fd1712c8fce666c74b3236f1e7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7R7VEPUHKVWTGAIJAXT7M4LMOU/bundle.json","state_url":"https://pith.science/pith/7R7VEPUHKVWTGAIJAXT7M4LMOU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7R7VEPUHKVWTGAIJAXT7M4LMOU/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-03T17:18:52Z","links":{"resolver":"https://pith.science/pith/7R7VEPUHKVWTGAIJAXT7M4LMOU","bundle":"https://pith.science/pith/7R7VEPUHKVWTGAIJAXT7M4LMOU/bundle.json","state":"https://pith.science/pith/7R7VEPUHKVWTGAIJAXT7M4LMOU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7R7VEPUHKVWTGAIJAXT7M4LMOU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:7R7VEPUHKVWTGAIJAXT7M4LMOU","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":"d8b4c8f5a98c56e1c29f8f67be94b52526908714bb23a36dfb348a69bc6f4bc5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-06-27T07:13:16Z","title_canon_sha256":"5a8f9f455efbaf38e01c6949171ade8b19233f023e3144e0af95722633f5b4f9"},"schema_version":"1.0","source":{"id":"1206.6187","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.6187","created_at":"2026-05-18T03:52:27Z"},{"alias_kind":"arxiv_version","alias_value":"1206.6187v1","created_at":"2026-05-18T03:52:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.6187","created_at":"2026-05-18T03:52:27Z"},{"alias_kind":"pith_short_12","alias_value":"7R7VEPUHKVWT","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"7R7VEPUHKVWTGAIJ","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"7R7VEPUH","created_at":"2026-05-18T12:26:58Z"}],"graph_snapshots":[{"event_id":"sha256:36c2130b0e5e5fb32436ed49779cb639891362fd1712c8fce666c74b3236f1e7","target":"graph","created_at":"2026-05-18T03:52:27Z","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 has been studied as a problem of significant theoretical and practical interest in the context of linear search. Various list accessing algorithms have been proposed in the literature and their performances have been analyzed theoretically and experimentally. Move-To-Front(MTF),Transpose (TRANS) and Frequency Count (FC) are the three primitive and widely used list accessing algorithms. Most of the other list accessing algorithms are the variants of these three algorithms. As mentioned in the literature as an open problem, direct bounds on the behavior and performance of ","authors_text":"Burle Sharma, Rakesh Mohanty, Sangita Patel, Shiba Prasad Dash","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-06-27T07:13:16Z","title":"Some Novel Results From Analysis of Move To Front (MTF) List Accessing Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.6187","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:fd7409da20e95dae79e9bc76951750d3d7dc925260c2e526dd0b5aace6dea3d9","target":"record","created_at":"2026-05-18T03:52:27Z","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":"d8b4c8f5a98c56e1c29f8f67be94b52526908714bb23a36dfb348a69bc6f4bc5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-06-27T07:13:16Z","title_canon_sha256":"5a8f9f455efbaf38e01c6949171ade8b19233f023e3144e0af95722633f5b4f9"},"schema_version":"1.0","source":{"id":"1206.6187","kind":"arxiv","version":1}},"canonical_sha256":"fc7f523e87556d33010905e7f6716c753d1c238f330479b09649fc2c5d81659f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fc7f523e87556d33010905e7f6716c753d1c238f330479b09649fc2c5d81659f","first_computed_at":"2026-05-18T03:52:27.452094Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:52:27.452094Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dhI2w8yklyFocRcbKuvZ7V4HFpkAQA+edIrDBGo19Xcl0iBxIUsZk9xK96ed1D8FECY1oT6wmPyUXph3IVy/AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:52:27.452947Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.6187","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fd7409da20e95dae79e9bc76951750d3d7dc925260c2e526dd0b5aace6dea3d9","sha256:36c2130b0e5e5fb32436ed49779cb639891362fd1712c8fce666c74b3236f1e7"],"state_sha256":"3592e49f0cb96358a481bea84e3144a0bd45d3852e20ac94951e6dafc7cf528e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PUMy2y3T9vGdAT/J3AuR1/J1R9+xIW/XYv7W7wI+Je9JdrzhRhKIiOibGeYc7jPjZX+C6lcvkwYv5mLQj6bCBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T17:18:52.311221Z","bundle_sha256":"801253733094bdc78ca96e54edc31032ed0b2429f2a320bea9cb75187488d27b"}}