{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:HDQ3LGE3RMLNAALT43T5ERDY7Q","short_pith_number":"pith:HDQ3LGE3","schema_version":"1.0","canonical_sha256":"38e1b5989b8b16d00173e6e7d24478fc158139bcb5f1630c22fc0bdb28eb67ee","source":{"kind":"arxiv","id":"1602.01295","version":1},"attestation_state":"computed","paper":{"title":"How proofs are prepared at Camelot","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Andreas Bj\\\"orklund, Petteri Kaski","submitted_at":"2016-02-03T13:45:12Z","abstract_excerpt":"We study a design framework for robust, independently verifiable, and workload-balanced distributed algorithms working on a common input. An algorithm based on the framework is essentially a distributed encoding procedure for a Reed--Solomon code, which enables (a) robustness against byzantine failures with intrinsic error-correction and identification of failed nodes, and (b) independent randomized verification to check the entire computation for correctness, which takes essentially no more resources than each node individually contributes to the computation. The framework builds on recent Me"},"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":"1602.01295","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-03T13:45:12Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"78d60189e14587a685f58903a30eab286fad89d3b2b5d0d3e738d25367fbbc2d","abstract_canon_sha256":"1b14e271c74d81b842728123ff96cda8d222e0bc851b5572564ce23f116eda80"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:20.554236Z","signature_b64":"b9jZMruNvadTLeYob70W5LDB+hCCRyxCkDGf28wzHBskon9rUPep6OEYiAZc6QuNSiM4k6SRMoBgP/Fn//9PCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"38e1b5989b8b16d00173e6e7d24478fc158139bcb5f1630c22fc0bdb28eb67ee","last_reissued_at":"2026-05-18T01:21:20.553577Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:20.553577Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"How proofs are prepared at Camelot","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Andreas Bj\\\"orklund, Petteri Kaski","submitted_at":"2016-02-03T13:45:12Z","abstract_excerpt":"We study a design framework for robust, independently verifiable, and workload-balanced distributed algorithms working on a common input. An algorithm based on the framework is essentially a distributed encoding procedure for a Reed--Solomon code, which enables (a) robustness against byzantine failures with intrinsic error-correction and identification of failed nodes, and (b) independent randomized verification to check the entire computation for correctness, which takes essentially no more resources than each node individually contributes to the computation. The framework builds on recent Me"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.01295","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":"1602.01295","created_at":"2026-05-18T01:21:20.553694+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.01295v1","created_at":"2026-05-18T01:21:20.553694+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01295","created_at":"2026-05-18T01:21:20.553694+00:00"},{"alias_kind":"pith_short_12","alias_value":"HDQ3LGE3RMLN","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"HDQ3LGE3RMLNAALT","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"HDQ3LGE3","created_at":"2026-05-18T12:30:19.053100+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/HDQ3LGE3RMLNAALT43T5ERDY7Q","json":"https://pith.science/pith/HDQ3LGE3RMLNAALT43T5ERDY7Q.json","graph_json":"https://pith.science/api/pith-number/HDQ3LGE3RMLNAALT43T5ERDY7Q/graph.json","events_json":"https://pith.science/api/pith-number/HDQ3LGE3RMLNAALT43T5ERDY7Q/events.json","paper":"https://pith.science/paper/HDQ3LGE3"},"agent_actions":{"view_html":"https://pith.science/pith/HDQ3LGE3RMLNAALT43T5ERDY7Q","download_json":"https://pith.science/pith/HDQ3LGE3RMLNAALT43T5ERDY7Q.json","view_paper":"https://pith.science/paper/HDQ3LGE3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.01295&json=true","fetch_graph":"https://pith.science/api/pith-number/HDQ3LGE3RMLNAALT43T5ERDY7Q/graph.json","fetch_events":"https://pith.science/api/pith-number/HDQ3LGE3RMLNAALT43T5ERDY7Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HDQ3LGE3RMLNAALT43T5ERDY7Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HDQ3LGE3RMLNAALT43T5ERDY7Q/action/storage_attestation","attest_author":"https://pith.science/pith/HDQ3LGE3RMLNAALT43T5ERDY7Q/action/author_attestation","sign_citation":"https://pith.science/pith/HDQ3LGE3RMLNAALT43T5ERDY7Q/action/citation_signature","submit_replication":"https://pith.science/pith/HDQ3LGE3RMLNAALT43T5ERDY7Q/action/replication_record"}},"created_at":"2026-05-18T01:21:20.553694+00:00","updated_at":"2026-05-18T01:21:20.553694+00:00"}