{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:SKOZNTSR5HY2FLJQVR6YBTKRDP","short_pith_number":"pith:SKOZNTSR","schema_version":"1.0","canonical_sha256":"929d96ce51e9f1a2ad30ac7d80cd511bff35437cf5581a6cb7a7848ac3d51846","source":{"kind":"arxiv","id":"1801.08495","version":1},"attestation_state":"computed","paper":{"title":"Limiting behaviour of the stationary search cost distribution driven by a generalized gamma process","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"stat.ME","authors_text":"Alfred Kume, Antonio Lijoi, Fabrizio Leisen","submitted_at":"2018-01-25T17:21:15Z","abstract_excerpt":"Consider a list of labeled objects that are organized in a heap. At each time, object $j$ is selected with probability $p_j$ and moved to the top of the heap. This procedure defines a Markov chain on the set of permutations which is referred to in the literature as Move-to-Front rule. The present contribution focuses on the stationary search cost, namely the position of the requested item in the heap when the Markov chain is in equilibrium. We consider the scenario where the number of objects is infinite and the probabilities $p_j$'s are defined as the normalization of the increments of a subo"},"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":"1801.08495","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2018-01-25T17:21:15Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"e8e5f22fec5aa59a782a6c4db006bfc0341900be7e88e7517e344bcd2a8b9cbb","abstract_canon_sha256":"fc167c0c970845b21419b7481d5b7621f257043a1a4f253ce565458a5ee75ea6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:06.195168Z","signature_b64":"Aii7UUfF2pcMi86yGPXo36Ph3WxjE0SmRenIMxG8CivYIJhAJAotRrBKvppfsfWP/uyRp/4ktwnrw+YE1RlfBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"929d96ce51e9f1a2ad30ac7d80cd511bff35437cf5581a6cb7a7848ac3d51846","last_reissued_at":"2026-05-18T00:25:06.194793Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:06.194793Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Limiting behaviour of the stationary search cost distribution driven by a generalized gamma process","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"stat.ME","authors_text":"Alfred Kume, Antonio Lijoi, Fabrizio Leisen","submitted_at":"2018-01-25T17:21:15Z","abstract_excerpt":"Consider a list of labeled objects that are organized in a heap. At each time, object $j$ is selected with probability $p_j$ and moved to the top of the heap. This procedure defines a Markov chain on the set of permutations which is referred to in the literature as Move-to-Front rule. The present contribution focuses on the stationary search cost, namely the position of the requested item in the heap when the Markov chain is in equilibrium. We consider the scenario where the number of objects is infinite and the probabilities $p_j$'s are defined as the normalization of the increments of a subo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.08495","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":"1801.08495","created_at":"2026-05-18T00:25:06.194852+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.08495v1","created_at":"2026-05-18T00:25:06.194852+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.08495","created_at":"2026-05-18T00:25:06.194852+00:00"},{"alias_kind":"pith_short_12","alias_value":"SKOZNTSR5HY2","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"SKOZNTSR5HY2FLJQ","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"SKOZNTSR","created_at":"2026-05-18T12:32:53.628368+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/SKOZNTSR5HY2FLJQVR6YBTKRDP","json":"https://pith.science/pith/SKOZNTSR5HY2FLJQVR6YBTKRDP.json","graph_json":"https://pith.science/api/pith-number/SKOZNTSR5HY2FLJQVR6YBTKRDP/graph.json","events_json":"https://pith.science/api/pith-number/SKOZNTSR5HY2FLJQVR6YBTKRDP/events.json","paper":"https://pith.science/paper/SKOZNTSR"},"agent_actions":{"view_html":"https://pith.science/pith/SKOZNTSR5HY2FLJQVR6YBTKRDP","download_json":"https://pith.science/pith/SKOZNTSR5HY2FLJQVR6YBTKRDP.json","view_paper":"https://pith.science/paper/SKOZNTSR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.08495&json=true","fetch_graph":"https://pith.science/api/pith-number/SKOZNTSR5HY2FLJQVR6YBTKRDP/graph.json","fetch_events":"https://pith.science/api/pith-number/SKOZNTSR5HY2FLJQVR6YBTKRDP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SKOZNTSR5HY2FLJQVR6YBTKRDP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SKOZNTSR5HY2FLJQVR6YBTKRDP/action/storage_attestation","attest_author":"https://pith.science/pith/SKOZNTSR5HY2FLJQVR6YBTKRDP/action/author_attestation","sign_citation":"https://pith.science/pith/SKOZNTSR5HY2FLJQVR6YBTKRDP/action/citation_signature","submit_replication":"https://pith.science/pith/SKOZNTSR5HY2FLJQVR6YBTKRDP/action/replication_record"}},"created_at":"2026-05-18T00:25:06.194852+00:00","updated_at":"2026-05-18T00:25:06.194852+00:00"}