{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:LU2H4K3DR3Z6O7TIE4OQACZO7Q","short_pith_number":"pith:LU2H4K3D","schema_version":"1.0","canonical_sha256":"5d347e2b638ef3e77e68271d000b2efc2cc89acdb3c7e78edd70227666719b06","source":{"kind":"arxiv","id":"1801.05279","version":2},"attestation_state":"computed","paper":{"title":"Greedy algorithms and Zipf laws","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-fin.GN"],"primary_cat":"cond-mat.stat-mech","authors_text":"Jean-Philippe Bouchaud, Jos\\'e Moran","submitted_at":"2018-01-16T15:02:09Z","abstract_excerpt":"We consider a simple model of firm/city/etc. growth based on a multi-item criterion: whenever entity B fares better that entity A on a subset of $M$ items out of $K$, the agent originally in A moves to B. We solve the model analytically in the cases $K=1$ and $K \\to \\infty$. The resulting stationary distribution of sizes is generically a Zipf-law provided $M > K/2$. When $M \\leq K/2$, no selection occurs and the size distribution remains thin-tailed. In the special case $M=K$, one needs to regularise the problem by introducing a small \"default\" probability $\\phi$. We find that the stationary d"},"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.05279","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2018-01-16T15:02:09Z","cross_cats_sorted":["q-fin.GN"],"title_canon_sha256":"07171c6d725367e3ba9f790ccf51897cc76762c35616013877aef9d9e9738838","abstract_canon_sha256":"24ba9ac55ae116d66743074f2ae571009b2c31851427519b4f37c0b7e9f94fce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:52.295500Z","signature_b64":"ONqxbcUUZAfG3+QYZYPzgtUo9m7b9BFSjmon02JAbpahbPKOb/vFlkc1yBdi5zssRUT33tMfctB08YYfspQyCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d347e2b638ef3e77e68271d000b2efc2cc89acdb3c7e78edd70227666719b06","last_reissued_at":"2026-05-18T00:18:52.295004Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:52.295004Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Greedy algorithms and Zipf laws","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-fin.GN"],"primary_cat":"cond-mat.stat-mech","authors_text":"Jean-Philippe Bouchaud, Jos\\'e Moran","submitted_at":"2018-01-16T15:02:09Z","abstract_excerpt":"We consider a simple model of firm/city/etc. growth based on a multi-item criterion: whenever entity B fares better that entity A on a subset of $M$ items out of $K$, the agent originally in A moves to B. We solve the model analytically in the cases $K=1$ and $K \\to \\infty$. The resulting stationary distribution of sizes is generically a Zipf-law provided $M > K/2$. When $M \\leq K/2$, no selection occurs and the size distribution remains thin-tailed. In the special case $M=K$, one needs to regularise the problem by introducing a small \"default\" probability $\\phi$. We find that the stationary d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.05279","kind":"arxiv","version":2},"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.05279","created_at":"2026-05-18T00:18:52.295082+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.05279v2","created_at":"2026-05-18T00:18:52.295082+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.05279","created_at":"2026-05-18T00:18:52.295082+00:00"},{"alias_kind":"pith_short_12","alias_value":"LU2H4K3DR3Z6","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"LU2H4K3DR3Z6O7TI","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"LU2H4K3D","created_at":"2026-05-18T12:32:37.024351+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/LU2H4K3DR3Z6O7TIE4OQACZO7Q","json":"https://pith.science/pith/LU2H4K3DR3Z6O7TIE4OQACZO7Q.json","graph_json":"https://pith.science/api/pith-number/LU2H4K3DR3Z6O7TIE4OQACZO7Q/graph.json","events_json":"https://pith.science/api/pith-number/LU2H4K3DR3Z6O7TIE4OQACZO7Q/events.json","paper":"https://pith.science/paper/LU2H4K3D"},"agent_actions":{"view_html":"https://pith.science/pith/LU2H4K3DR3Z6O7TIE4OQACZO7Q","download_json":"https://pith.science/pith/LU2H4K3DR3Z6O7TIE4OQACZO7Q.json","view_paper":"https://pith.science/paper/LU2H4K3D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.05279&json=true","fetch_graph":"https://pith.science/api/pith-number/LU2H4K3DR3Z6O7TIE4OQACZO7Q/graph.json","fetch_events":"https://pith.science/api/pith-number/LU2H4K3DR3Z6O7TIE4OQACZO7Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LU2H4K3DR3Z6O7TIE4OQACZO7Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LU2H4K3DR3Z6O7TIE4OQACZO7Q/action/storage_attestation","attest_author":"https://pith.science/pith/LU2H4K3DR3Z6O7TIE4OQACZO7Q/action/author_attestation","sign_citation":"https://pith.science/pith/LU2H4K3DR3Z6O7TIE4OQACZO7Q/action/citation_signature","submit_replication":"https://pith.science/pith/LU2H4K3DR3Z6O7TIE4OQACZO7Q/action/replication_record"}},"created_at":"2026-05-18T00:18:52.295082+00:00","updated_at":"2026-05-18T00:18:52.295082+00:00"}