{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:UOCW7QFVTBULKZFXKDYG67WVTL","short_pith_number":"pith:UOCW7QFV","schema_version":"1.0","canonical_sha256":"a3856fc0b59868b564b750f06f7ed59afeac6604f1f3ba4e0d21916baaf979a3","source":{"kind":"arxiv","id":"2205.00900","version":2},"attestation_state":"computed","paper":{"title":"Quantum Robustness Verification: A Hybrid Quantum-Classical Neural Network Certification Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Jeanette Miriam Lorenz, Nicholas Gao, Nicola Franco, Stephan Guennemann, Tom Wollschlaeger","submitted_at":"2022-05-02T13:23:56Z","abstract_excerpt":"In recent years, quantum computers and algorithms have made significant progress indicating the prospective importance of quantum computing (QC). Especially combinatorial optimization has gained a lot of attention as an application field for near-term quantum computers, both by using gate-based QC via the Quantum Approximate Optimization Algorithm and by quantum annealing using the Ising model. However, demonstrating an advantage over classical methods in real-world applications remains an active area of research. In this work, we investigate the robustness verification of ReLU networks, which"},"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":"2205.00900","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-05-02T13:23:56Z","cross_cats_sorted":[],"title_canon_sha256":"966953e9011069d7138ca656d1d42ce53edf3096dcad0675b47a46d3c2e6e1d9","abstract_canon_sha256":"602ecf23f4a105283b367a31f4b77e25debc96919f7dc21cfd730f9dd69f57eb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:47:58.096693Z","signature_b64":"pRdBTqfcWDRpRHdr0td/OSdPNXeHhhcgnRSGshQfncSFPKbZ5YwaHl/8JeG0/r8KUAnVSrpeyoHkjh4MInz9Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3856fc0b59868b564b750f06f7ed59afeac6604f1f3ba4e0d21916baaf979a3","last_reissued_at":"2026-07-05T04:47:58.096244Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:47:58.096244Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Robustness Verification: A Hybrid Quantum-Classical Neural Network Certification Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Jeanette Miriam Lorenz, Nicholas Gao, Nicola Franco, Stephan Guennemann, Tom Wollschlaeger","submitted_at":"2022-05-02T13:23:56Z","abstract_excerpt":"In recent years, quantum computers and algorithms have made significant progress indicating the prospective importance of quantum computing (QC). Especially combinatorial optimization has gained a lot of attention as an application field for near-term quantum computers, both by using gate-based QC via the Quantum Approximate Optimization Algorithm and by quantum annealing using the Ising model. However, demonstrating an advantage over classical methods in real-world applications remains an active area of research. In this work, we investigate the robustness verification of ReLU networks, which"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.00900","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/2205.00900/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":"2205.00900","created_at":"2026-07-05T04:47:58.096304+00:00"},{"alias_kind":"arxiv_version","alias_value":"2205.00900v2","created_at":"2026-07-05T04:47:58.096304+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.00900","created_at":"2026-07-05T04:47:58.096304+00:00"},{"alias_kind":"pith_short_12","alias_value":"UOCW7QFVTBUL","created_at":"2026-07-05T04:47:58.096304+00:00"},{"alias_kind":"pith_short_16","alias_value":"UOCW7QFVTBULKZFX","created_at":"2026-07-05T04:47:58.096304+00:00"},{"alias_kind":"pith_short_8","alias_value":"UOCW7QFV","created_at":"2026-07-05T04:47:58.096304+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2412.15665","citing_title":"Quantum Subroutines in Branch-Price-and-Cut for Vehicle Routing","ref_index":31,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UOCW7QFVTBULKZFXKDYG67WVTL","json":"https://pith.science/pith/UOCW7QFVTBULKZFXKDYG67WVTL.json","graph_json":"https://pith.science/api/pith-number/UOCW7QFVTBULKZFXKDYG67WVTL/graph.json","events_json":"https://pith.science/api/pith-number/UOCW7QFVTBULKZFXKDYG67WVTL/events.json","paper":"https://pith.science/paper/UOCW7QFV"},"agent_actions":{"view_html":"https://pith.science/pith/UOCW7QFVTBULKZFXKDYG67WVTL","download_json":"https://pith.science/pith/UOCW7QFVTBULKZFXKDYG67WVTL.json","view_paper":"https://pith.science/paper/UOCW7QFV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2205.00900&json=true","fetch_graph":"https://pith.science/api/pith-number/UOCW7QFVTBULKZFXKDYG67WVTL/graph.json","fetch_events":"https://pith.science/api/pith-number/UOCW7QFVTBULKZFXKDYG67WVTL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UOCW7QFVTBULKZFXKDYG67WVTL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UOCW7QFVTBULKZFXKDYG67WVTL/action/storage_attestation","attest_author":"https://pith.science/pith/UOCW7QFVTBULKZFXKDYG67WVTL/action/author_attestation","sign_citation":"https://pith.science/pith/UOCW7QFVTBULKZFXKDYG67WVTL/action/citation_signature","submit_replication":"https://pith.science/pith/UOCW7QFVTBULKZFXKDYG67WVTL/action/replication_record"}},"created_at":"2026-07-05T04:47:58.096304+00:00","updated_at":"2026-07-05T04:47:58.096304+00:00"}