{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:FJFC6R5GMFL2GUZRFMLVCLNQWO","short_pith_number":"pith:FJFC6R5G","schema_version":"1.0","canonical_sha256":"2a4a2f47a66157a353312b17512db0b395b1739b4c1fbc0aa54bbb71905e4801","source":{"kind":"arxiv","id":"1412.7749","version":1},"attestation_state":"computed","paper":{"title":"Concerning the bookshelf problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.HO","authors_text":"Grigori Yurgin, Lev Radzivilovsky","submitted_at":"2014-12-24T20:31:42Z","abstract_excerpt":"We discuss the following folklore problem. On a bookshelf, there are $N$ tomes of the Encyclopedia in random order. Each hour, a librarian takes a tome which stands not on its place, and puts it in its place. Show that the process will stop. A natural additional question is how many moves are required for the process to stop. We show that the process can last $2^{N-1}-1$ moves, and that it will stop anyway in less than $2^N$ moves."},"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":"1412.7749","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.HO","submitted_at":"2014-12-24T20:31:42Z","cross_cats_sorted":[],"title_canon_sha256":"480fd9719abc7786592994daf5c30c6065fc5e7e97bd3659bf3a670051694e2d","abstract_canon_sha256":"0b7c8f8280806c077f388ce9fdcf2badc4d71175941385e985b5877f59ec3cfe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:33.112382Z","signature_b64":"Amp4pdqWBjc7h8CXH+uI2EqIM9M/05omWeQ4bFv29ILTzMfBgrna4dcDFTLOS+o1XDx10ZkLLvmG9m9ce2XmBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a4a2f47a66157a353312b17512db0b395b1739b4c1fbc0aa54bbb71905e4801","last_reissued_at":"2026-05-18T02:30:33.111910Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:33.111910Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Concerning the bookshelf problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.HO","authors_text":"Grigori Yurgin, Lev Radzivilovsky","submitted_at":"2014-12-24T20:31:42Z","abstract_excerpt":"We discuss the following folklore problem. On a bookshelf, there are $N$ tomes of the Encyclopedia in random order. Each hour, a librarian takes a tome which stands not on its place, and puts it in its place. Show that the process will stop. A natural additional question is how many moves are required for the process to stop. We show that the process can last $2^{N-1}-1$ moves, and that it will stop anyway in less than $2^N$ moves."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.7749","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":"1412.7749","created_at":"2026-05-18T02:30:33.111984+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.7749v1","created_at":"2026-05-18T02:30:33.111984+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.7749","created_at":"2026-05-18T02:30:33.111984+00:00"},{"alias_kind":"pith_short_12","alias_value":"FJFC6R5GMFL2","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"FJFC6R5GMFL2GUZR","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"FJFC6R5G","created_at":"2026-05-18T12:28:28.263976+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/FJFC6R5GMFL2GUZRFMLVCLNQWO","json":"https://pith.science/pith/FJFC6R5GMFL2GUZRFMLVCLNQWO.json","graph_json":"https://pith.science/api/pith-number/FJFC6R5GMFL2GUZRFMLVCLNQWO/graph.json","events_json":"https://pith.science/api/pith-number/FJFC6R5GMFL2GUZRFMLVCLNQWO/events.json","paper":"https://pith.science/paper/FJFC6R5G"},"agent_actions":{"view_html":"https://pith.science/pith/FJFC6R5GMFL2GUZRFMLVCLNQWO","download_json":"https://pith.science/pith/FJFC6R5GMFL2GUZRFMLVCLNQWO.json","view_paper":"https://pith.science/paper/FJFC6R5G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.7749&json=true","fetch_graph":"https://pith.science/api/pith-number/FJFC6R5GMFL2GUZRFMLVCLNQWO/graph.json","fetch_events":"https://pith.science/api/pith-number/FJFC6R5GMFL2GUZRFMLVCLNQWO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FJFC6R5GMFL2GUZRFMLVCLNQWO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FJFC6R5GMFL2GUZRFMLVCLNQWO/action/storage_attestation","attest_author":"https://pith.science/pith/FJFC6R5GMFL2GUZRFMLVCLNQWO/action/author_attestation","sign_citation":"https://pith.science/pith/FJFC6R5GMFL2GUZRFMLVCLNQWO/action/citation_signature","submit_replication":"https://pith.science/pith/FJFC6R5GMFL2GUZRFMLVCLNQWO/action/replication_record"}},"created_at":"2026-05-18T02:30:33.111984+00:00","updated_at":"2026-05-18T02:30:33.111984+00:00"}