{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:4L7SYP2CPAWYH3TLAYV26EMMPV","short_pith_number":"pith:4L7SYP2C","schema_version":"1.0","canonical_sha256":"e2ff2c3f42782d83ee6b062baf118c7d7968a2324c421af44f776109f9cf13d6","source":{"kind":"arxiv","id":"1010.1086","version":1},"attestation_state":"computed","paper":{"title":"Stochastic Flips on Two-letter Words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.DM"],"primary_cat":"math.PR","authors_text":"Damien Regnault, Olivier Bodini, Thomas Fernique","submitted_at":"2010-10-06T08:24:53Z","abstract_excerpt":"This paper introduces a simple Markov process inspired by the problem of quasicrystal growth. It acts over two-letter words by randomly performing \\emph{flips}, a local transformation which exchanges two consecutive different letters. More precisely, only the flips which do not increase the number of pairs of consecutive identical letters are allowed. Fixed-points of such a process thus perfectly alternate different letters. We show that the expected number of flips to converge towards a fixed-point is bounded by $O(n^3)$ in the worst-case and by $O(n^{5/2}\\ln{n})$ in the average-case, where $"},"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":"1010.1086","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-10-06T08:24:53Z","cross_cats_sorted":["cond-mat.stat-mech","cs.DM"],"title_canon_sha256":"c2d4affac94a8ae8ee7ab6feae09267e454323a6811465608dcae8f94bab5006","abstract_canon_sha256":"822232de2156310e2825a201e61915af45b9d0ef0b848649d61dfcc4c7f1e828"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:39:49.862489Z","signature_b64":"9DdcZfuoYJ2jhv5FVUza4KIkIAlSNm5OwwzQ7eQ13LkyyKt71n2TKZnLvWGf4gLGHhZt7rDt9VPX+V8Slz+XBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2ff2c3f42782d83ee6b062baf118c7d7968a2324c421af44f776109f9cf13d6","last_reissued_at":"2026-05-18T04:39:49.861887Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:39:49.861887Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stochastic Flips on Two-letter Words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.DM"],"primary_cat":"math.PR","authors_text":"Damien Regnault, Olivier Bodini, Thomas Fernique","submitted_at":"2010-10-06T08:24:53Z","abstract_excerpt":"This paper introduces a simple Markov process inspired by the problem of quasicrystal growth. It acts over two-letter words by randomly performing \\emph{flips}, a local transformation which exchanges two consecutive different letters. More precisely, only the flips which do not increase the number of pairs of consecutive identical letters are allowed. Fixed-points of such a process thus perfectly alternate different letters. We show that the expected number of flips to converge towards a fixed-point is bounded by $O(n^3)$ in the worst-case and by $O(n^{5/2}\\ln{n})$ in the average-case, where $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.1086","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":"1010.1086","created_at":"2026-05-18T04:39:49.861975+00:00"},{"alias_kind":"arxiv_version","alias_value":"1010.1086v1","created_at":"2026-05-18T04:39:49.861975+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.1086","created_at":"2026-05-18T04:39:49.861975+00:00"},{"alias_kind":"pith_short_12","alias_value":"4L7SYP2CPAWY","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_16","alias_value":"4L7SYP2CPAWYH3TL","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_8","alias_value":"4L7SYP2C","created_at":"2026-05-18T12:26:03.138858+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/4L7SYP2CPAWYH3TLAYV26EMMPV","json":"https://pith.science/pith/4L7SYP2CPAWYH3TLAYV26EMMPV.json","graph_json":"https://pith.science/api/pith-number/4L7SYP2CPAWYH3TLAYV26EMMPV/graph.json","events_json":"https://pith.science/api/pith-number/4L7SYP2CPAWYH3TLAYV26EMMPV/events.json","paper":"https://pith.science/paper/4L7SYP2C"},"agent_actions":{"view_html":"https://pith.science/pith/4L7SYP2CPAWYH3TLAYV26EMMPV","download_json":"https://pith.science/pith/4L7SYP2CPAWYH3TLAYV26EMMPV.json","view_paper":"https://pith.science/paper/4L7SYP2C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1010.1086&json=true","fetch_graph":"https://pith.science/api/pith-number/4L7SYP2CPAWYH3TLAYV26EMMPV/graph.json","fetch_events":"https://pith.science/api/pith-number/4L7SYP2CPAWYH3TLAYV26EMMPV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4L7SYP2CPAWYH3TLAYV26EMMPV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4L7SYP2CPAWYH3TLAYV26EMMPV/action/storage_attestation","attest_author":"https://pith.science/pith/4L7SYP2CPAWYH3TLAYV26EMMPV/action/author_attestation","sign_citation":"https://pith.science/pith/4L7SYP2CPAWYH3TLAYV26EMMPV/action/citation_signature","submit_replication":"https://pith.science/pith/4L7SYP2CPAWYH3TLAYV26EMMPV/action/replication_record"}},"created_at":"2026-05-18T04:39:49.861975+00:00","updated_at":"2026-05-18T04:39:49.861975+00:00"}