{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:JW4UH5PA2BXRNTCOL52L3JVN6C","short_pith_number":"pith:JW4UH5PA","schema_version":"1.0","canonical_sha256":"4db943f5e0d06f16cc4e5f74bda6adf09262254cdf67f639f49dfbb720bdc174","source":{"kind":"arxiv","id":"2007.06319","version":2},"attestation_state":"computed","paper":{"title":"In-place implementation of Quantum-Gimli","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.CR","authors_text":"Lars Schlieper","submitted_at":"2020-07-13T11:31:38Z","abstract_excerpt":"We present an in-place implementation of the cryptographic permutation \\textbf{Gimli}, a NIST round 2 candidate for lightweight cryptography, and provide an upper bound for the required quantum resource in depth and gate-counts. In particular, we do not use any ancilla qubits and the state that our circuit produces is not entangled with any input. This offers further freedom in the usability and allows for a widespread use in different applications in a plug-and-play manner."},"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":"2007.06319","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2020-07-13T11:31:38Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"79a5f37c7a60db8cef78a79d79c0ba530aea0862647a701ad30f2a5578bd846a","abstract_canon_sha256":"c4386cc950f3c652bd9d38a713540d7ec88e3ec3f3238890569a44609d2603f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:28:09.841724Z","signature_b64":"Z+tiduQo3CDCycXyAp0guZF50BKPd4PGbyCA39tQmLJl5UJz/QryzvLR8nPql4NrDTrrHNb3/dISXidyl4JsCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4db943f5e0d06f16cc4e5f74bda6adf09262254cdf67f639f49dfbb720bdc174","last_reissued_at":"2026-07-05T03:28:09.841297Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:28:09.841297Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"In-place implementation of Quantum-Gimli","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.CR","authors_text":"Lars Schlieper","submitted_at":"2020-07-13T11:31:38Z","abstract_excerpt":"We present an in-place implementation of the cryptographic permutation \\textbf{Gimli}, a NIST round 2 candidate for lightweight cryptography, and provide an upper bound for the required quantum resource in depth and gate-counts. In particular, we do not use any ancilla qubits and the state that our circuit produces is not entangled with any input. This offers further freedom in the usability and allows for a widespread use in different applications in a plug-and-play manner."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.06319","kind":"arxiv","version":2},"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/2007.06319/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":"2007.06319","created_at":"2026-07-05T03:28:09.841371+00:00"},{"alias_kind":"arxiv_version","alias_value":"2007.06319v2","created_at":"2026-07-05T03:28:09.841371+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.06319","created_at":"2026-07-05T03:28:09.841371+00:00"},{"alias_kind":"pith_short_12","alias_value":"JW4UH5PA2BXR","created_at":"2026-07-05T03:28:09.841371+00:00"},{"alias_kind":"pith_short_16","alias_value":"JW4UH5PA2BXRNTCO","created_at":"2026-07-05T03:28:09.841371+00:00"},{"alias_kind":"pith_short_8","alias_value":"JW4UH5PA","created_at":"2026-07-05T03:28:09.841371+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2412.10835","citing_title":"Qubit Optimized Quantum Implementation of SLIM","ref_index":28,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JW4UH5PA2BXRNTCOL52L3JVN6C","json":"https://pith.science/pith/JW4UH5PA2BXRNTCOL52L3JVN6C.json","graph_json":"https://pith.science/api/pith-number/JW4UH5PA2BXRNTCOL52L3JVN6C/graph.json","events_json":"https://pith.science/api/pith-number/JW4UH5PA2BXRNTCOL52L3JVN6C/events.json","paper":"https://pith.science/paper/JW4UH5PA"},"agent_actions":{"view_html":"https://pith.science/pith/JW4UH5PA2BXRNTCOL52L3JVN6C","download_json":"https://pith.science/pith/JW4UH5PA2BXRNTCOL52L3JVN6C.json","view_paper":"https://pith.science/paper/JW4UH5PA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2007.06319&json=true","fetch_graph":"https://pith.science/api/pith-number/JW4UH5PA2BXRNTCOL52L3JVN6C/graph.json","fetch_events":"https://pith.science/api/pith-number/JW4UH5PA2BXRNTCOL52L3JVN6C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JW4UH5PA2BXRNTCOL52L3JVN6C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JW4UH5PA2BXRNTCOL52L3JVN6C/action/storage_attestation","attest_author":"https://pith.science/pith/JW4UH5PA2BXRNTCOL52L3JVN6C/action/author_attestation","sign_citation":"https://pith.science/pith/JW4UH5PA2BXRNTCOL52L3JVN6C/action/citation_signature","submit_replication":"https://pith.science/pith/JW4UH5PA2BXRNTCOL52L3JVN6C/action/replication_record"}},"created_at":"2026-07-05T03:28:09.841371+00:00","updated_at":"2026-07-05T03:28:09.841371+00:00"}