{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:F63MSZUCDSV3COFZGIJWL764J6","short_pith_number":"pith:F63MSZUC","canonical_record":{"source":{"id":"1303.4191","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-03-18T09:03:56Z","cross_cats_sorted":[],"title_canon_sha256":"48e924df77818b34eb52927943bd3d39faca135d4e2d66106a9b8829963ba29a","abstract_canon_sha256":"088952d57f26b40556bc7520dbb1e04b991dd82eb49c2a4d7faaf5fa918102d5"},"schema_version":"1.0"},"canonical_sha256":"2fb6c966821cabb138b9321365ffdc4f9a6d639a2edb4b282bebfed83381a993","source":{"kind":"arxiv","id":"1303.4191","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.4191","created_at":"2026-05-18T03:19:04Z"},{"alias_kind":"arxiv_version","alias_value":"1303.4191v4","created_at":"2026-05-18T03:19:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.4191","created_at":"2026-05-18T03:19:04Z"},{"alias_kind":"pith_short_12","alias_value":"F63MSZUCDSV3","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"F63MSZUCDSV3COFZ","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"F63MSZUC","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:F63MSZUCDSV3COFZGIJWL764J6","target":"record","payload":{"canonical_record":{"source":{"id":"1303.4191","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-03-18T09:03:56Z","cross_cats_sorted":[],"title_canon_sha256":"48e924df77818b34eb52927943bd3d39faca135d4e2d66106a9b8829963ba29a","abstract_canon_sha256":"088952d57f26b40556bc7520dbb1e04b991dd82eb49c2a4d7faaf5fa918102d5"},"schema_version":"1.0"},"canonical_sha256":"2fb6c966821cabb138b9321365ffdc4f9a6d639a2edb4b282bebfed83381a993","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:19:04.274050Z","signature_b64":"cla5YwQtSNg3MkblbrgoZSQ80WvxV5FCkcEjPj9IeH6vzbDR/BFdQM9o/oGuIJh77GC6yLQJTkDR84G3S7qHBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2fb6c966821cabb138b9321365ffdc4f9a6d639a2edb4b282bebfed83381a993","last_reissued_at":"2026-05-18T03:19:04.273432Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:19:04.273432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.4191","source_version":4,"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:19:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RRJGNyzsx5BxJ5cISN/BthXQEV042IZSvK7YAZ1mP81wxaATTi2YwE3q5ruWeyHQSbxCDzupQ+iR5utcYw9zCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T02:56:17.610742Z"},"content_sha256":"6088cc8f3c58c89b1db74f6d1cdb7160bb8b3a91133e4db61f145c0b6af5ab52","schema_version":"1.0","event_id":"sha256:6088cc8f3c58c89b1db74f6d1cdb7160bb8b3a91133e4db61f145c0b6af5ab52"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:F63MSZUCDSV3COFZGIJWL764J6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parallel Search with Extended Fibonacci Primitive","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"N.Sadagopan, Surabhi Jain","submitted_at":"2013-03-18T09:03:56Z","abstract_excerpt":"Search pattern experienced by the processor to search an element in secondary storage devices follows a random sequence. Formally, it is a random walk and its modeling is crucial in studying performance metrics like memory access time. In this paper, we first model the random walk using extended Fibonacci series. Our simulation is done on a parallel computing model (PRAM) with EREW strategy. Three search primitives are proposed under parallel computing model and each primitive is thoroughly tested on an array of size $10^7$ with the size of random walk being $10^4$. Our findings reveal that se"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.4191","kind":"arxiv","version":4},"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:19:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ySjrYM1VZ9Wx/CyZdIlLwPgGPdXkV/xHXC7gZNQ4DQCs6gRSQmCM2xQQvy5SRSF2mn4eF8A+Juag7zqqNvlXDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T02:56:17.611087Z"},"content_sha256":"2b04ff79f4d6ae0eac26a5063a8383182557e0e5aeef656c0fe9465b6733e032","schema_version":"1.0","event_id":"sha256:2b04ff79f4d6ae0eac26a5063a8383182557e0e5aeef656c0fe9465b6733e032"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F63MSZUCDSV3COFZGIJWL764J6/bundle.json","state_url":"https://pith.science/pith/F63MSZUCDSV3COFZGIJWL764J6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F63MSZUCDSV3COFZGIJWL764J6/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-07-01T02:56:17Z","links":{"resolver":"https://pith.science/pith/F63MSZUCDSV3COFZGIJWL764J6","bundle":"https://pith.science/pith/F63MSZUCDSV3COFZGIJWL764J6/bundle.json","state":"https://pith.science/pith/F63MSZUCDSV3COFZGIJWL764J6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F63MSZUCDSV3COFZGIJWL764J6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:F63MSZUCDSV3COFZGIJWL764J6","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":"088952d57f26b40556bc7520dbb1e04b991dd82eb49c2a4d7faaf5fa918102d5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-03-18T09:03:56Z","title_canon_sha256":"48e924df77818b34eb52927943bd3d39faca135d4e2d66106a9b8829963ba29a"},"schema_version":"1.0","source":{"id":"1303.4191","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.4191","created_at":"2026-05-18T03:19:04Z"},{"alias_kind":"arxiv_version","alias_value":"1303.4191v4","created_at":"2026-05-18T03:19:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.4191","created_at":"2026-05-18T03:19:04Z"},{"alias_kind":"pith_short_12","alias_value":"F63MSZUCDSV3","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"F63MSZUCDSV3COFZ","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"F63MSZUC","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:2b04ff79f4d6ae0eac26a5063a8383182557e0e5aeef656c0fe9465b6733e032","target":"graph","created_at":"2026-05-18T03:19:04Z","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":"Search pattern experienced by the processor to search an element in secondary storage devices follows a random sequence. Formally, it is a random walk and its modeling is crucial in studying performance metrics like memory access time. In this paper, we first model the random walk using extended Fibonacci series. Our simulation is done on a parallel computing model (PRAM) with EREW strategy. Three search primitives are proposed under parallel computing model and each primitive is thoroughly tested on an array of size $10^7$ with the size of random walk being $10^4$. Our findings reveal that se","authors_text":"N.Sadagopan, Surabhi Jain","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-03-18T09:03:56Z","title":"Parallel Search with Extended Fibonacci Primitive"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.4191","kind":"arxiv","version":4},"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:6088cc8f3c58c89b1db74f6d1cdb7160bb8b3a91133e4db61f145c0b6af5ab52","target":"record","created_at":"2026-05-18T03:19:04Z","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":"088952d57f26b40556bc7520dbb1e04b991dd82eb49c2a4d7faaf5fa918102d5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-03-18T09:03:56Z","title_canon_sha256":"48e924df77818b34eb52927943bd3d39faca135d4e2d66106a9b8829963ba29a"},"schema_version":"1.0","source":{"id":"1303.4191","kind":"arxiv","version":4}},"canonical_sha256":"2fb6c966821cabb138b9321365ffdc4f9a6d639a2edb4b282bebfed83381a993","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2fb6c966821cabb138b9321365ffdc4f9a6d639a2edb4b282bebfed83381a993","first_computed_at":"2026-05-18T03:19:04.273432Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:19:04.273432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cla5YwQtSNg3MkblbrgoZSQ80WvxV5FCkcEjPj9IeH6vzbDR/BFdQM9o/oGuIJh77GC6yLQJTkDR84G3S7qHBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:19:04.274050Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.4191","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6088cc8f3c58c89b1db74f6d1cdb7160bb8b3a91133e4db61f145c0b6af5ab52","sha256:2b04ff79f4d6ae0eac26a5063a8383182557e0e5aeef656c0fe9465b6733e032"],"state_sha256":"c5bdee22b364dec5209a0a5dd5241e4dd1bc9b334ab26ac2f35aa43d8d6c2ea7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"12ABaGZ+VIu0DmJZ9gTzAKgs7KE6aovOLa52fNcvrcvEFvkOqFOaUlKDQW9ZlB0nuRXPDB28MzTTNfF11/PmAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T02:56:17.613015Z","bundle_sha256":"000d577c8ba7afb827310e75f94ab7d037a90def26a2a195b4b8dcb78d4c9830"}}