{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:DLSU2M4VEMUKPG5KCMCMD4L5PO","short_pith_number":"pith:DLSU2M4V","schema_version":"1.0","canonical_sha256":"1ae54d33952328a79baa1304c1f17d7bae4cb23d343af466407e4bf7ccb6a08d","source":{"kind":"arxiv","id":"1901.10019","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1901.10019","created_at":"2026-05-17T23:55:16.368331+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.10019v1","created_at":"2026-05-17T23:55:16.368331+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.10019","created_at":"2026-05-17T23:55:16.368331+00:00"},{"alias_kind":"pith_short_12","alias_value":"DLSU2M4VEMUK","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"DLSU2M4VEMUKPG5K","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"DLSU2M4V","created_at":"2026-05-18T12:33:15.570797+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/DLSU2M4VEMUKPG5KCMCMD4L5PO","json":"https://pith.science/pith/DLSU2M4VEMUKPG5KCMCMD4L5PO.json","graph_json":"https://pith.science/api/pith-number/DLSU2M4VEMUKPG5KCMCMD4L5PO/graph.json","events_json":"https://pith.science/api/pith-number/DLSU2M4VEMUKPG5KCMCMD4L5PO/events.json","paper":"https://pith.science/paper/DLSU2M4V"},"agent_actions":{"view_html":"https://pith.science/pith/DLSU2M4VEMUKPG5KCMCMD4L5PO","download_json":"https://pith.science/pith/DLSU2M4VEMUKPG5KCMCMD4L5PO.json","view_paper":"https://pith.science/paper/DLSU2M4V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.10019&json=true","fetch_graph":"https://pith.science/api/pith-number/DLSU2M4VEMUKPG5KCMCMD4L5PO/graph.json","fetch_events":"https://pith.science/api/pith-number/DLSU2M4VEMUKPG5KCMCMD4L5PO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DLSU2M4VEMUKPG5KCMCMD4L5PO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DLSU2M4VEMUKPG5KCMCMD4L5PO/action/storage_attestation","attest_author":"https://pith.science/pith/DLSU2M4VEMUKPG5KCMCMD4L5PO/action/author_attestation","sign_citation":"https://pith.science/pith/DLSU2M4VEMUKPG5KCMCMD4L5PO/action/citation_signature","submit_replication":"https://pith.science/pith/DLSU2M4VEMUKPG5KCMCMD4L5PO/action/replication_record"}},"created_at":"2026-05-17T23:55:16.368331+00:00","updated_at":"2026-05-17T23:55:16.368331+00:00"}