{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:DLSU2M4VEMUKPG5KCMCMD4L5PO","short_pith_number":"pith:DLSU2M4V","canonical_record":{"source":{"id":"1901.10019","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-01-28T22:28:07Z","cross_cats_sorted":[],"title_canon_sha256":"b6b34514ef0bbe8ef2d7bd894e206ca7e1e28f51aac8bace32673143639ca984","abstract_canon_sha256":"d633147655cb8093bddf234516257694d19cfebd5cb9fd08b100e90e43faf474"},"schema_version":"1.0"},"canonical_sha256":"1ae54d33952328a79baa1304c1f17d7bae4cb23d343af466407e4bf7ccb6a08d","source":{"kind":"arxiv","id":"1901.10019","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.10019","created_at":"2026-05-17T23:55:16Z"},{"alias_kind":"arxiv_version","alias_value":"1901.10019v1","created_at":"2026-05-17T23:55:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.10019","created_at":"2026-05-17T23:55:16Z"},{"alias_kind":"pith_short_12","alias_value":"DLSU2M4VEMUK","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"DLSU2M4VEMUKPG5K","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"DLSU2M4V","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:DLSU2M4VEMUKPG5KCMCMD4L5PO","target":"record","payload":{"canonical_record":{"source":{"id":"1901.10019","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-01-28T22:28:07Z","cross_cats_sorted":[],"title_canon_sha256":"b6b34514ef0bbe8ef2d7bd894e206ca7e1e28f51aac8bace32673143639ca984","abstract_canon_sha256":"d633147655cb8093bddf234516257694d19cfebd5cb9fd08b100e90e43faf474"},"schema_version":"1.0"},"canonical_sha256":"1ae54d33952328a79baa1304c1f17d7bae4cb23d343af466407e4bf7ccb6a08d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:16.368715Z","signature_b64":"H6nIingekKZ/uMmbwZM/wX85OwUpuSf8eeQVBT3+0ptP+2oPL7C8TxLtYr9i0d2n3BdnoM7Yum4SigqW8wuXCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ae54d33952328a79baa1304c1f17d7bae4cb23d343af466407e4bf7ccb6a08d","last_reissued_at":"2026-05-17T23:55:16.368250Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:16.368250Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.10019","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:55:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sjgeRx+LDFWlE8/GVCUkzfkAb3MMxE3+kTtHzIocFZ5ukV/Uxcjofsghvz2LIAtOKOTX9JiokW9V/+jDHWamBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T03:59:23.000478Z"},"content_sha256":"6612b578ab0b841301df0ffa5b547299ea6baff21d322783a9f729da60e90b2a","schema_version":"1.0","event_id":"sha256:6612b578ab0b841301df0ffa5b547299ea6baff21d322783a9f729da60e90b2a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:DLSU2M4VEMUKPG5KCMCMD4L5PO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Blockchain Trilemma Solver Algorand has Dilemma over Undecidable Messages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Ankit Gangwal, Mauro Conti, Michele Todero","submitted_at":"2019-01-28T22:28:07Z","abstract_excerpt":"Recently, an ingenious protocol called Algorand has been proposed to overcome these limitations. Algorand uses an innovative process - called cryptographic sortition - to securely and unpredictably elect a set of voters from the network periodically. These voters are responsible for reaching consensus through a Byzantine Agreement (BA) protocol on one block per time, guaranteeing an overwhelming probability of linearity of the blockchain.\n  In this paper, we present a security analysis of Algorand. To the best of our knowledge, it is the first security analysis as well as the first formal stud"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.10019","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:55:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RBqObmlmX6I4bnrGach7m6wXS+8EuWFg5pLuXuM76CjPka4mJPxnWELZEg3LyJNya0VqBA2r9ZbUNniEpy+QDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T03:59:23.001095Z"},"content_sha256":"e8e003297e147ed7c081e9f988b1ad69e43e8b9d017c51e30de18dd28432273c","schema_version":"1.0","event_id":"sha256:e8e003297e147ed7c081e9f988b1ad69e43e8b9d017c51e30de18dd28432273c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DLSU2M4VEMUKPG5KCMCMD4L5PO/bundle.json","state_url":"https://pith.science/pith/DLSU2M4VEMUKPG5KCMCMD4L5PO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DLSU2M4VEMUKPG5KCMCMD4L5PO/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-12T03:59:23Z","links":{"resolver":"https://pith.science/pith/DLSU2M4VEMUKPG5KCMCMD4L5PO","bundle":"https://pith.science/pith/DLSU2M4VEMUKPG5KCMCMD4L5PO/bundle.json","state":"https://pith.science/pith/DLSU2M4VEMUKPG5KCMCMD4L5PO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DLSU2M4VEMUKPG5KCMCMD4L5PO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:DLSU2M4VEMUKPG5KCMCMD4L5PO","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":"d633147655cb8093bddf234516257694d19cfebd5cb9fd08b100e90e43faf474","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-01-28T22:28:07Z","title_canon_sha256":"b6b34514ef0bbe8ef2d7bd894e206ca7e1e28f51aac8bace32673143639ca984"},"schema_version":"1.0","source":{"id":"1901.10019","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.10019","created_at":"2026-05-17T23:55:16Z"},{"alias_kind":"arxiv_version","alias_value":"1901.10019v1","created_at":"2026-05-17T23:55:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.10019","created_at":"2026-05-17T23:55:16Z"},{"alias_kind":"pith_short_12","alias_value":"DLSU2M4VEMUK","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"DLSU2M4VEMUKPG5K","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"DLSU2M4V","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:e8e003297e147ed7c081e9f988b1ad69e43e8b9d017c51e30de18dd28432273c","target":"graph","created_at":"2026-05-17T23:55:16Z","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":"Recently, an ingenious protocol called Algorand has been proposed to overcome these limitations. Algorand uses an innovative process - called cryptographic sortition - to securely and unpredictably elect a set of voters from the network periodically. These voters are responsible for reaching consensus through a Byzantine Agreement (BA) protocol on one block per time, guaranteeing an overwhelming probability of linearity of the blockchain.\n  In this paper, we present a security analysis of Algorand. To the best of our knowledge, it is the first security analysis as well as the first formal stud","authors_text":"Ankit Gangwal, Mauro Conti, Michele Todero","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-01-28T22:28:07Z","title":"Blockchain Trilemma Solver Algorand has Dilemma over Undecidable Messages"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.10019","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:6612b578ab0b841301df0ffa5b547299ea6baff21d322783a9f729da60e90b2a","target":"record","created_at":"2026-05-17T23:55:16Z","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":"d633147655cb8093bddf234516257694d19cfebd5cb9fd08b100e90e43faf474","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-01-28T22:28:07Z","title_canon_sha256":"b6b34514ef0bbe8ef2d7bd894e206ca7e1e28f51aac8bace32673143639ca984"},"schema_version":"1.0","source":{"id":"1901.10019","kind":"arxiv","version":1}},"canonical_sha256":"1ae54d33952328a79baa1304c1f17d7bae4cb23d343af466407e4bf7ccb6a08d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1ae54d33952328a79baa1304c1f17d7bae4cb23d343af466407e4bf7ccb6a08d","first_computed_at":"2026-05-17T23:55:16.368250Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:16.368250Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"H6nIingekKZ/uMmbwZM/wX85OwUpuSf8eeQVBT3+0ptP+2oPL7C8TxLtYr9i0d2n3BdnoM7Yum4SigqW8wuXCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:16.368715Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.10019","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6612b578ab0b841301df0ffa5b547299ea6baff21d322783a9f729da60e90b2a","sha256:e8e003297e147ed7c081e9f988b1ad69e43e8b9d017c51e30de18dd28432273c"],"state_sha256":"9ef37b4cac69acb7a035b08a99ee7a839c9368ff3180b9af2ab3ee41a4b83c0b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TvUpBWC+/iEbNTnLIFXIJY/ccNjEwEdx6ZKi/LgoqiJGkUyMtmKrg8HpwEADy/dxpmnGdo5Br89V7c+lrZtdAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T03:59:23.004685Z","bundle_sha256":"c6fb22a7f92e992c01ae226d2e56d9b99634b980f4e8efcebc510d8de0083372"}}