{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:SVU3XD5DNNNI5PO5NJSYLVT2OY","short_pith_number":"pith:SVU3XD5D","schema_version":"1.0","canonical_sha256":"9569bb8fa36b5a8ebddd6a6585d67a76377acdb67c011c9fae7a0efc15cde041","source":{"kind":"arxiv","id":"2606.31601","version":1},"attestation_state":"computed","paper":{"title":"Digital signature schemes based on code equivalence and syndrome decoding from restricted errors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Gretchen L. Matthews, Hiram H. L\\'opez, Jason T. LeGrow, Sarah Arpin","submitted_at":"2026-06-30T12:50:55Z","abstract_excerpt":"Digital signature schemes are an important cryptographic tool to ensure data authenticity and integrity in many applications that must be resilient to attacks, including those facilitated by quantum computers. We consider the two digital signature schemes based on error-correcting codes that are second-round candidates in NIST's call for Additional Signature Schemes, which is part of the Post-Quantum Cryptography Standardization Process. Specifically, we provide an overview of the Codes and Restricted Objects Signature Scheme (CROSS) and the Linear Equivalence Signature Scheme (LESS). We descr"},"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":"2606.31601","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2026-06-30T12:50:55Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"a9c73209e8ebc071f04d79aaffd0df1bed6e44845e45bbfd1b4c5224f5ed5fe9","abstract_canon_sha256":"b3f8f0a910401e4a7507f2a47e8aab365a804d898f3f4cf9d6bcdbf39a407b78"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-01T01:18:08.792501Z","signature_b64":"M+JxriXz6xYFVs8HP9xKsdu26vMtmJH1dKH3TFFT19otxYC76GLwF0ixGHb9I/sC4LCeq97o6pFIQdcELwkcAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9569bb8fa36b5a8ebddd6a6585d67a76377acdb67c011c9fae7a0efc15cde041","last_reissued_at":"2026-07-01T01:18:08.792085Z","signature_status":"signed_v1","first_computed_at":"2026-07-01T01:18:08.792085Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Digital signature schemes based on code equivalence and syndrome decoding from restricted errors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Gretchen L. Matthews, Hiram H. L\\'opez, Jason T. LeGrow, Sarah Arpin","submitted_at":"2026-06-30T12:50:55Z","abstract_excerpt":"Digital signature schemes are an important cryptographic tool to ensure data authenticity and integrity in many applications that must be resilient to attacks, including those facilitated by quantum computers. We consider the two digital signature schemes based on error-correcting codes that are second-round candidates in NIST's call for Additional Signature Schemes, which is part of the Post-Quantum Cryptography Standardization Process. Specifically, we provide an overview of the Codes and Restricted Objects Signature Scheme (CROSS) and the Linear Equivalence Signature Scheme (LESS). We descr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.31601","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.31601/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2606.31601","created_at":"2026-07-01T01:18:08.792147+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.31601v1","created_at":"2026-07-01T01:18:08.792147+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.31601","created_at":"2026-07-01T01:18:08.792147+00:00"},{"alias_kind":"pith_short_12","alias_value":"SVU3XD5DNNNI","created_at":"2026-07-01T01:18:08.792147+00:00"},{"alias_kind":"pith_short_16","alias_value":"SVU3XD5DNNNI5PO5","created_at":"2026-07-01T01:18:08.792147+00:00"},{"alias_kind":"pith_short_8","alias_value":"SVU3XD5D","created_at":"2026-07-01T01:18:08.792147+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/SVU3XD5DNNNI5PO5NJSYLVT2OY","json":"https://pith.science/pith/SVU3XD5DNNNI5PO5NJSYLVT2OY.json","graph_json":"https://pith.science/api/pith-number/SVU3XD5DNNNI5PO5NJSYLVT2OY/graph.json","events_json":"https://pith.science/api/pith-number/SVU3XD5DNNNI5PO5NJSYLVT2OY/events.json","paper":"https://pith.science/paper/SVU3XD5D"},"agent_actions":{"view_html":"https://pith.science/pith/SVU3XD5DNNNI5PO5NJSYLVT2OY","download_json":"https://pith.science/pith/SVU3XD5DNNNI5PO5NJSYLVT2OY.json","view_paper":"https://pith.science/paper/SVU3XD5D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.31601&json=true","fetch_graph":"https://pith.science/api/pith-number/SVU3XD5DNNNI5PO5NJSYLVT2OY/graph.json","fetch_events":"https://pith.science/api/pith-number/SVU3XD5DNNNI5PO5NJSYLVT2OY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SVU3XD5DNNNI5PO5NJSYLVT2OY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SVU3XD5DNNNI5PO5NJSYLVT2OY/action/storage_attestation","attest_author":"https://pith.science/pith/SVU3XD5DNNNI5PO5NJSYLVT2OY/action/author_attestation","sign_citation":"https://pith.science/pith/SVU3XD5DNNNI5PO5NJSYLVT2OY/action/citation_signature","submit_replication":"https://pith.science/pith/SVU3XD5DNNNI5PO5NJSYLVT2OY/action/replication_record"}},"created_at":"2026-07-01T01:18:08.792147+00:00","updated_at":"2026-07-01T01:18:08.792147+00:00"}