{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:WZPUDSXUGWATIFCCNYCHVZMATU","short_pith_number":"pith:WZPUDSXU","schema_version":"1.0","canonical_sha256":"b65f41caf435813414426e047ae5809d29da3c43140dd26ea63614ff6a4c0277","source":{"kind":"arxiv","id":"1305.5436","version":1},"attestation_state":"computed","paper":{"title":"Using LDGM Codes and Sparse Syndromes to Achieve Digital Signatures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Davide Schipani, Franco Chiaraluce, Joachim Rosenthal, Marco Baldi, Marco Bianchi","submitted_at":"2013-05-23T14:41:01Z","abstract_excerpt":"In this paper, we address the problem of achieving efficient code-based digital signatures with small public keys. The solution we propose exploits sparse syndromes and randomly designed low-density generator matrix codes. Based on our evaluations, the proposed scheme is able to outperform existing solutions, permitting to achieve considerable security levels with very small public keys."},"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":"1305.5436","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-05-23T14:41:01Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"e397604f09dad7227ccb0e75e369add1a49c5f2e5b3e72473274c1eddf72e284","abstract_canon_sha256":"e7b3504a47a0c62015143f12fe6ca7ba22b2f8f8148967649fc3c9f81b241a6b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:04.761631Z","signature_b64":"ts1is01gYM8DukOlliucVtF83+63wzQr7Wo7h+YX47LANQkggQebF+egXBSVohyzTW1Feu4sNWONQUTlcLcHDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b65f41caf435813414426e047ae5809d29da3c43140dd26ea63614ff6a4c0277","last_reissued_at":"2026-05-18T03:25:04.761122Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:04.761122Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Using LDGM Codes and Sparse Syndromes to Achieve Digital Signatures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Davide Schipani, Franco Chiaraluce, Joachim Rosenthal, Marco Baldi, Marco Bianchi","submitted_at":"2013-05-23T14:41:01Z","abstract_excerpt":"In this paper, we address the problem of achieving efficient code-based digital signatures with small public keys. The solution we propose exploits sparse syndromes and randomly designed low-density generator matrix codes. Based on our evaluations, the proposed scheme is able to outperform existing solutions, permitting to achieve considerable security levels with very small public keys."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.5436","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":"1305.5436","created_at":"2026-05-18T03:25:04.761188+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.5436v1","created_at":"2026-05-18T03:25:04.761188+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.5436","created_at":"2026-05-18T03:25:04.761188+00:00"},{"alias_kind":"pith_short_12","alias_value":"WZPUDSXUGWAT","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"WZPUDSXUGWATIFCC","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"WZPUDSXU","created_at":"2026-05-18T12:28:06.772260+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/WZPUDSXUGWATIFCCNYCHVZMATU","json":"https://pith.science/pith/WZPUDSXUGWATIFCCNYCHVZMATU.json","graph_json":"https://pith.science/api/pith-number/WZPUDSXUGWATIFCCNYCHVZMATU/graph.json","events_json":"https://pith.science/api/pith-number/WZPUDSXUGWATIFCCNYCHVZMATU/events.json","paper":"https://pith.science/paper/WZPUDSXU"},"agent_actions":{"view_html":"https://pith.science/pith/WZPUDSXUGWATIFCCNYCHVZMATU","download_json":"https://pith.science/pith/WZPUDSXUGWATIFCCNYCHVZMATU.json","view_paper":"https://pith.science/paper/WZPUDSXU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.5436&json=true","fetch_graph":"https://pith.science/api/pith-number/WZPUDSXUGWATIFCCNYCHVZMATU/graph.json","fetch_events":"https://pith.science/api/pith-number/WZPUDSXUGWATIFCCNYCHVZMATU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WZPUDSXUGWATIFCCNYCHVZMATU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WZPUDSXUGWATIFCCNYCHVZMATU/action/storage_attestation","attest_author":"https://pith.science/pith/WZPUDSXUGWATIFCCNYCHVZMATU/action/author_attestation","sign_citation":"https://pith.science/pith/WZPUDSXUGWATIFCCNYCHVZMATU/action/citation_signature","submit_replication":"https://pith.science/pith/WZPUDSXUGWATIFCCNYCHVZMATU/action/replication_record"}},"created_at":"2026-05-18T03:25:04.761188+00:00","updated_at":"2026-05-18T03:25:04.761188+00:00"}