{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:52LUWP2MQUCON7PIGX3C4RMQJI","short_pith_number":"pith:52LUWP2M","schema_version":"1.0","canonical_sha256":"ee974b3f4c8504e6fde835f62e45904a30614dbf7b84c19771db98ee27bc7a77","source":{"kind":"arxiv","id":"2506.00247","version":1},"attestation_state":"computed","paper":{"title":"Performance Analysis of Convolutional Neural Network By Applying Unconstrained Binary Quadratic Programming","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"cs.LG","authors_text":"Aasish Kumar Sharma, Julian M. Kunkel, Sanjeeb Prashad Pandey","submitted_at":"2025-05-30T21:25:31Z","abstract_excerpt":"Convolutional Neural Networks (CNNs) are pivotal in computer vision and Big Data analytics but demand significant computational resources when trained on large-scale datasets. Conventional training via back-propagation (BP) with losses like Mean Squared Error or Cross-Entropy often requires extensive iterations and may converge sub-optimally. Quantum computing offers a promising alternative by leveraging superposition, tunneling, and entanglement to search complex optimization landscapes more efficiently. In this work, we propose a hybrid optimization method that combines an Unconstrained Bina"},"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":"2506.00247","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-30T21:25:31Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"7c7130e863b1d138cc9c53d3be5a1a76e8d563adc0a591e1d30e0cddd22666b6","abstract_canon_sha256":"d7461b66ed91a2408e175c2129fd02a5e9d2b59621ef6cac3055693babee81bf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:13:31.485543Z","signature_b64":"J6K1m2gpKUHpVCflL4DbbWVvRfAveDdAb9e4aVbwh/dP7tdDPsRWaTlNeE94Dq+TaijJ6048+/WSJI27+u57Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee974b3f4c8504e6fde835f62e45904a30614dbf7b84c19771db98ee27bc7a77","last_reissued_at":"2026-07-05T11:13:31.485067Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:13:31.485067Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Performance Analysis of Convolutional Neural Network By Applying Unconstrained Binary Quadratic Programming","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"cs.LG","authors_text":"Aasish Kumar Sharma, Julian M. Kunkel, Sanjeeb Prashad Pandey","submitted_at":"2025-05-30T21:25:31Z","abstract_excerpt":"Convolutional Neural Networks (CNNs) are pivotal in computer vision and Big Data analytics but demand significant computational resources when trained on large-scale datasets. Conventional training via back-propagation (BP) with losses like Mean Squared Error or Cross-Entropy often requires extensive iterations and may converge sub-optimally. Quantum computing offers a promising alternative by leveraging superposition, tunneling, and entanglement to search complex optimization landscapes more efficiently. In this work, we propose a hybrid optimization method that combines an Unconstrained Bina"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.00247","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/2506.00247/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":"2506.00247","created_at":"2026-07-05T11:13:31.485127+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.00247v1","created_at":"2026-07-05T11:13:31.485127+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.00247","created_at":"2026-07-05T11:13:31.485127+00:00"},{"alias_kind":"pith_short_12","alias_value":"52LUWP2MQUCO","created_at":"2026-07-05T11:13:31.485127+00:00"},{"alias_kind":"pith_short_16","alias_value":"52LUWP2MQUCON7PI","created_at":"2026-07-05T11:13:31.485127+00:00"},{"alias_kind":"pith_short_8","alias_value":"52LUWP2M","created_at":"2026-07-05T11:13:31.485127+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/52LUWP2MQUCON7PIGX3C4RMQJI","json":"https://pith.science/pith/52LUWP2MQUCON7PIGX3C4RMQJI.json","graph_json":"https://pith.science/api/pith-number/52LUWP2MQUCON7PIGX3C4RMQJI/graph.json","events_json":"https://pith.science/api/pith-number/52LUWP2MQUCON7PIGX3C4RMQJI/events.json","paper":"https://pith.science/paper/52LUWP2M"},"agent_actions":{"view_html":"https://pith.science/pith/52LUWP2MQUCON7PIGX3C4RMQJI","download_json":"https://pith.science/pith/52LUWP2MQUCON7PIGX3C4RMQJI.json","view_paper":"https://pith.science/paper/52LUWP2M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.00247&json=true","fetch_graph":"https://pith.science/api/pith-number/52LUWP2MQUCON7PIGX3C4RMQJI/graph.json","fetch_events":"https://pith.science/api/pith-number/52LUWP2MQUCON7PIGX3C4RMQJI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/52LUWP2MQUCON7PIGX3C4RMQJI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/52LUWP2MQUCON7PIGX3C4RMQJI/action/storage_attestation","attest_author":"https://pith.science/pith/52LUWP2MQUCON7PIGX3C4RMQJI/action/author_attestation","sign_citation":"https://pith.science/pith/52LUWP2MQUCON7PIGX3C4RMQJI/action/citation_signature","submit_replication":"https://pith.science/pith/52LUWP2MQUCON7PIGX3C4RMQJI/action/replication_record"}},"created_at":"2026-07-05T11:13:31.485127+00:00","updated_at":"2026-07-05T11:13:31.485127+00:00"}