{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:RJSQE3XSOGRBVOPGL5FDDEIZ66","short_pith_number":"pith:RJSQE3XS","schema_version":"1.0","canonical_sha256":"8a65026ef271a21ab9e65f4a319119f79f29b0521719ee10cad056cdac232c6f","source":{"kind":"arxiv","id":"1310.1306","version":2},"attestation_state":"computed","paper":{"title":"Bit flipping and time to recover","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Anton Muratov, Sergei Zuyev","submitted_at":"2013-10-04T14:59:10Z","abstract_excerpt":"We call `bits' a sequence of devices indexed by positive integers, where every device can be in two states: $0$ (idle) and $1$ (active). Start from the `ground state' of the system when all bits are in $0$-state. In our first Binary Flipping (BF) model, the evolution of the system is the following: at each time step choose one bit from a given distribution $\\mathcal{P}$ on the integers independently of anything else, then flip the state of this bit to the opposite. In our second Damaged Bits (DB) model a `damaged' state is added: each selected idling bit changes to active, but selecting an act"},"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":"1310.1306","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-10-04T14:59:10Z","cross_cats_sorted":[],"title_canon_sha256":"2d10e343fd28c5c9a50fdbf9dc6adbbd273438f8d827c93714416f3b6b818400","abstract_canon_sha256":"aa4fba2cedfc32997971f1d55071389ca92f08336fa490fcb25fa781f3d4e4f4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:23.317740Z","signature_b64":"mGD3BjvmZvmj3tsC92T7zr7ndpwbnbdSKIiWTDKVQS0p6UzySihNiNxQwCehTT035hhuk/WPLDMa3IKrIzDZCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a65026ef271a21ab9e65f4a319119f79f29b0521719ee10cad056cdac232c6f","last_reissued_at":"2026-05-18T02:45:23.317289Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:23.317289Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bit flipping and time to recover","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Anton Muratov, Sergei Zuyev","submitted_at":"2013-10-04T14:59:10Z","abstract_excerpt":"We call `bits' a sequence of devices indexed by positive integers, where every device can be in two states: $0$ (idle) and $1$ (active). Start from the `ground state' of the system when all bits are in $0$-state. In our first Binary Flipping (BF) model, the evolution of the system is the following: at each time step choose one bit from a given distribution $\\mathcal{P}$ on the integers independently of anything else, then flip the state of this bit to the opposite. In our second Damaged Bits (DB) model a `damaged' state is added: each selected idling bit changes to active, but selecting an act"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.1306","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":"1310.1306","created_at":"2026-05-18T02:45:23.317358+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.1306v2","created_at":"2026-05-18T02:45:23.317358+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.1306","created_at":"2026-05-18T02:45:23.317358+00:00"},{"alias_kind":"pith_short_12","alias_value":"RJSQE3XSOGRB","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"RJSQE3XSOGRBVOPG","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"RJSQE3XS","created_at":"2026-05-18T12:27:57.521954+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/RJSQE3XSOGRBVOPGL5FDDEIZ66","json":"https://pith.science/pith/RJSQE3XSOGRBVOPGL5FDDEIZ66.json","graph_json":"https://pith.science/api/pith-number/RJSQE3XSOGRBVOPGL5FDDEIZ66/graph.json","events_json":"https://pith.science/api/pith-number/RJSQE3XSOGRBVOPGL5FDDEIZ66/events.json","paper":"https://pith.science/paper/RJSQE3XS"},"agent_actions":{"view_html":"https://pith.science/pith/RJSQE3XSOGRBVOPGL5FDDEIZ66","download_json":"https://pith.science/pith/RJSQE3XSOGRBVOPGL5FDDEIZ66.json","view_paper":"https://pith.science/paper/RJSQE3XS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.1306&json=true","fetch_graph":"https://pith.science/api/pith-number/RJSQE3XSOGRBVOPGL5FDDEIZ66/graph.json","fetch_events":"https://pith.science/api/pith-number/RJSQE3XSOGRBVOPGL5FDDEIZ66/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RJSQE3XSOGRBVOPGL5FDDEIZ66/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RJSQE3XSOGRBVOPGL5FDDEIZ66/action/storage_attestation","attest_author":"https://pith.science/pith/RJSQE3XSOGRBVOPGL5FDDEIZ66/action/author_attestation","sign_citation":"https://pith.science/pith/RJSQE3XSOGRBVOPGL5FDDEIZ66/action/citation_signature","submit_replication":"https://pith.science/pith/RJSQE3XSOGRBVOPGL5FDDEIZ66/action/replication_record"}},"created_at":"2026-05-18T02:45:23.317358+00:00","updated_at":"2026-05-18T02:45:23.317358+00:00"}