{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:LAUGFEVUMREEZY5RT7A2Y3GDLP","short_pith_number":"pith:LAUGFEVU","schema_version":"1.0","canonical_sha256":"58286292b464484ce3b19fc1ac6cc35be8e83229cf6401b64a73aa05e106be1c","source":{"kind":"arxiv","id":"2606.08581","version":1},"attestation_state":"computed","paper":{"title":"The Pile Process on a Cycle","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Eric Shellef, Itai Benjamini","submitted_at":"2026-06-07T11:32:47Z","abstract_excerpt":"Consider a finite particle system in which, at each step, one particle from a vertex with a lower neighboring vertex moves to a neighboring vertex of minimum height. For the cycle C_n, started with n particles at one vertex and no particles elsewhere, we prove that the expected stabilization time is at most a constant multiple of n^3 The deterministic transportation lower bound is of order n^2. Simulations suggest that the true order should be near n^3. Chat GPT was used to reincarnate notes from 2007."},"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":"2606.08581","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.PR","submitted_at":"2026-06-07T11:32:47Z","cross_cats_sorted":[],"title_canon_sha256":"523fa57a3e4d26578d9e05cede3040431182a4f7cf503077fcaa075d304a8b05","abstract_canon_sha256":"7cd1a6b0d179327203238739dd257778f81a3a9d5e86a74c6ceae5d89ba44d32"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-09T01:05:40.735429Z","signature_b64":"h24DKS8NzauyUpxRBqbTzsZEoDadZrfztdSv4ZRj4AjjNJjvcDeMBLrrweUpDXodvhY1X7swhLYNxDsS8JQuDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58286292b464484ce3b19fc1ac6cc35be8e83229cf6401b64a73aa05e106be1c","last_reissued_at":"2026-06-09T01:05:40.734990Z","signature_status":"signed_v1","first_computed_at":"2026-06-09T01:05:40.734990Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Pile Process on a Cycle","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Eric Shellef, Itai Benjamini","submitted_at":"2026-06-07T11:32:47Z","abstract_excerpt":"Consider a finite particle system in which, at each step, one particle from a vertex with a lower neighboring vertex moves to a neighboring vertex of minimum height. For the cycle C_n, started with n particles at one vertex and no particles elsewhere, we prove that the expected stabilization time is at most a constant multiple of n^3 The deterministic transportation lower bound is of order n^2. Simulations suggest that the true order should be near n^3. Chat GPT was used to reincarnate notes from 2007."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.08581","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.08581/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2606.08581","created_at":"2026-06-09T01:05:40.735058+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.08581v1","created_at":"2026-06-09T01:05:40.735058+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.08581","created_at":"2026-06-09T01:05:40.735058+00:00"},{"alias_kind":"pith_short_12","alias_value":"LAUGFEVUMREE","created_at":"2026-06-09T01:05:40.735058+00:00"},{"alias_kind":"pith_short_16","alias_value":"LAUGFEVUMREEZY5R","created_at":"2026-06-09T01:05:40.735058+00:00"},{"alias_kind":"pith_short_8","alias_value":"LAUGFEVU","created_at":"2026-06-09T01:05:40.735058+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/LAUGFEVUMREEZY5RT7A2Y3GDLP","json":"https://pith.science/pith/LAUGFEVUMREEZY5RT7A2Y3GDLP.json","graph_json":"https://pith.science/api/pith-number/LAUGFEVUMREEZY5RT7A2Y3GDLP/graph.json","events_json":"https://pith.science/api/pith-number/LAUGFEVUMREEZY5RT7A2Y3GDLP/events.json","paper":"https://pith.science/paper/LAUGFEVU"},"agent_actions":{"view_html":"https://pith.science/pith/LAUGFEVUMREEZY5RT7A2Y3GDLP","download_json":"https://pith.science/pith/LAUGFEVUMREEZY5RT7A2Y3GDLP.json","view_paper":"https://pith.science/paper/LAUGFEVU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.08581&json=true","fetch_graph":"https://pith.science/api/pith-number/LAUGFEVUMREEZY5RT7A2Y3GDLP/graph.json","fetch_events":"https://pith.science/api/pith-number/LAUGFEVUMREEZY5RT7A2Y3GDLP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LAUGFEVUMREEZY5RT7A2Y3GDLP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LAUGFEVUMREEZY5RT7A2Y3GDLP/action/storage_attestation","attest_author":"https://pith.science/pith/LAUGFEVUMREEZY5RT7A2Y3GDLP/action/author_attestation","sign_citation":"https://pith.science/pith/LAUGFEVUMREEZY5RT7A2Y3GDLP/action/citation_signature","submit_replication":"https://pith.science/pith/LAUGFEVUMREEZY5RT7A2Y3GDLP/action/replication_record"}},"created_at":"2026-06-09T01:05:40.735058+00:00","updated_at":"2026-06-09T01:05:40.735058+00:00"}