{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:4BALGAAO2EZQ6N3F7QL45B6TBO","short_pith_number":"pith:4BALGAAO","canonical_record":{"source":{"id":"1907.07248","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DC","submitted_at":"2019-07-13T18:49:18Z","cross_cats_sorted":[],"title_canon_sha256":"eb220643c69d0dbbcfbba3721e8b20fa4469cec6491a6d1bc09ab3d857de5f41","abstract_canon_sha256":"92b3af0672f3c2e90019bb7e2331b2f09272b7cd7906b2af0d3aab763c21e006"},"schema_version":"1.0"},"canonical_sha256":"e040b3000ed1330f3765fc17ce87d30b9bd71e531c278e79896977149fa6a81f","source":{"kind":"arxiv","id":"1907.07248","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.07248","created_at":"2026-05-17T23:40:27Z"},{"alias_kind":"arxiv_version","alias_value":"1907.07248v1","created_at":"2026-05-17T23:40:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.07248","created_at":"2026-05-17T23:40:27Z"},{"alias_kind":"pith_short_12","alias_value":"4BALGAAO2EZQ","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"4BALGAAO2EZQ6N3F","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"4BALGAAO","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:4BALGAAO2EZQ6N3F7QL45B6TBO","target":"record","payload":{"canonical_record":{"source":{"id":"1907.07248","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DC","submitted_at":"2019-07-13T18:49:18Z","cross_cats_sorted":[],"title_canon_sha256":"eb220643c69d0dbbcfbba3721e8b20fa4469cec6491a6d1bc09ab3d857de5f41","abstract_canon_sha256":"92b3af0672f3c2e90019bb7e2331b2f09272b7cd7906b2af0d3aab763c21e006"},"schema_version":"1.0"},"canonical_sha256":"e040b3000ed1330f3765fc17ce87d30b9bd71e531c278e79896977149fa6a81f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:27.282175Z","signature_b64":"aqrE7FjBfGNIwVRBYSge98/DSFxcHgGCBY4wLY7K2OsiyBzCYmoGCzm2u3tIyKyCnInn6jS7R2vqb25Wwu/gAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e040b3000ed1330f3765fc17ce87d30b9bd71e531c278e79896977149fa6a81f","last_reissued_at":"2026-05-17T23:40:27.281276Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:27.281276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.07248","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:40:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X206J2tIK0QkP/N2A6D2Jj6VSJqwvzpE8bNsbRdg01azlJ4o23S9ytUYSUKM4Yp1tElEsAWxsXfcWLRnaiKICQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T14:18:13.623743Z"},"content_sha256":"e68b24aeab16dfb04d901f2f629cca1a080fd8bc52fd1f2dd1d5bce64b304046","schema_version":"1.0","event_id":"sha256:e68b24aeab16dfb04d901f2f629cca1a080fd8bc52fd1f2dd1d5bce64b304046"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:4BALGAAO2EZQ6N3F7QL45B6TBO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Crisis: Probabilistically Self Organizing Total Order in Unstructured P2P Networks","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Mirco Richter","submitted_at":"2019-07-13T18:49:18Z","abstract_excerpt":"A framework for asynchronous, signature free, fully local and probabilistically converging total order algorithms is developed, that may survive in high entropy, unstructured Peer-to-Peer networks with near optimal communication efficiency. Regarding the natural boundaries of the CAP-theorem, Crisis chooses different compromises for consistency and availability, depending on the severity of the attack.\n  The family is parameterized by a few constants and external functions called voting-weight, incentivation \\& punishement, difficulty oracle and quorum-selector. These functions are necessary t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.07248","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:40:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JM/ro9ivi1d22wbTcAK4WbI5AD/2s9jyrY1ENf4Q1SrOKtfR2qJqKM32sAEUWjybt3GOVRCctSvWHKRAEVZuBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T14:18:13.624083Z"},"content_sha256":"8a2dfcf6b479c613c55f5f9ab66c19feb73afd19180c66f5e7868ce2d1defceb","schema_version":"1.0","event_id":"sha256:8a2dfcf6b479c613c55f5f9ab66c19feb73afd19180c66f5e7868ce2d1defceb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4BALGAAO2EZQ6N3F7QL45B6TBO/bundle.json","state_url":"https://pith.science/pith/4BALGAAO2EZQ6N3F7QL45B6TBO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4BALGAAO2EZQ6N3F7QL45B6TBO/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-28T14:18:13Z","links":{"resolver":"https://pith.science/pith/4BALGAAO2EZQ6N3F7QL45B6TBO","bundle":"https://pith.science/pith/4BALGAAO2EZQ6N3F7QL45B6TBO/bundle.json","state":"https://pith.science/pith/4BALGAAO2EZQ6N3F7QL45B6TBO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4BALGAAO2EZQ6N3F7QL45B6TBO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:4BALGAAO2EZQ6N3F7QL45B6TBO","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"92b3af0672f3c2e90019bb7e2331b2f09272b7cd7906b2af0d3aab763c21e006","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DC","submitted_at":"2019-07-13T18:49:18Z","title_canon_sha256":"eb220643c69d0dbbcfbba3721e8b20fa4469cec6491a6d1bc09ab3d857de5f41"},"schema_version":"1.0","source":{"id":"1907.07248","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.07248","created_at":"2026-05-17T23:40:27Z"},{"alias_kind":"arxiv_version","alias_value":"1907.07248v1","created_at":"2026-05-17T23:40:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.07248","created_at":"2026-05-17T23:40:27Z"},{"alias_kind":"pith_short_12","alias_value":"4BALGAAO2EZQ","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"4BALGAAO2EZQ6N3F","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"4BALGAAO","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:8a2dfcf6b479c613c55f5f9ab66c19feb73afd19180c66f5e7868ce2d1defceb","target":"graph","created_at":"2026-05-17T23:40:27Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"A framework for asynchronous, signature free, fully local and probabilistically converging total order algorithms is developed, that may survive in high entropy, unstructured Peer-to-Peer networks with near optimal communication efficiency. Regarding the natural boundaries of the CAP-theorem, Crisis chooses different compromises for consistency and availability, depending on the severity of the attack.\n  The family is parameterized by a few constants and external functions called voting-weight, incentivation \\& punishement, difficulty oracle and quorum-selector. These functions are necessary t","authors_text":"Mirco Richter","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DC","submitted_at":"2019-07-13T18:49:18Z","title":"Crisis: Probabilistically Self Organizing Total Order in Unstructured P2P Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.07248","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e68b24aeab16dfb04d901f2f629cca1a080fd8bc52fd1f2dd1d5bce64b304046","target":"record","created_at":"2026-05-17T23:40:27Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"92b3af0672f3c2e90019bb7e2331b2f09272b7cd7906b2af0d3aab763c21e006","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DC","submitted_at":"2019-07-13T18:49:18Z","title_canon_sha256":"eb220643c69d0dbbcfbba3721e8b20fa4469cec6491a6d1bc09ab3d857de5f41"},"schema_version":"1.0","source":{"id":"1907.07248","kind":"arxiv","version":1}},"canonical_sha256":"e040b3000ed1330f3765fc17ce87d30b9bd71e531c278e79896977149fa6a81f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e040b3000ed1330f3765fc17ce87d30b9bd71e531c278e79896977149fa6a81f","first_computed_at":"2026-05-17T23:40:27.281276Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:27.281276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aqrE7FjBfGNIwVRBYSge98/DSFxcHgGCBY4wLY7K2OsiyBzCYmoGCzm2u3tIyKyCnInn6jS7R2vqb25Wwu/gAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:27.282175Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.07248","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e68b24aeab16dfb04d901f2f629cca1a080fd8bc52fd1f2dd1d5bce64b304046","sha256:8a2dfcf6b479c613c55f5f9ab66c19feb73afd19180c66f5e7868ce2d1defceb"],"state_sha256":"7f39666419312be8ed6a68ea07e9e98e07cf255e906e1331ba56ffe54c32cffa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2wqym6pVTkiwPByfQp2YUQi1/zRczViihHxUAMoMQQEtxYU2lMH3p1YY024vJBHoWwqXTWL09H9A7ue3pMGPAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T14:18:13.625976Z","bundle_sha256":"307f5a21b34331323f42869ff197c13bc192ac41f9215115a9f5b0827e708f7c"}}