{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:O752KUYLMWR3RQ4F2RH3IZKIHI","short_pith_number":"pith:O752KUYL","canonical_record":{"source":{"id":"2605.08332","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2026-05-08T17:55:49Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"b38a26a9e68e29be91cb106e06f3b1bc22544727524f7bd7ee86b256feb88f21","abstract_canon_sha256":"7e5b9fd6631f236a70facd582247a45ed4993d25e2c32c24841280c736502141"},"schema_version":"1.0"},"canonical_sha256":"77fba5530b65a3b8c385d44fb465483a0257022352faba35f6a6bf9ca08b28f5","source":{"kind":"arxiv","id":"2605.08332","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.08332","created_at":"2026-07-09T00:19:14Z"},{"alias_kind":"arxiv_version","alias_value":"2605.08332v2","created_at":"2026-07-09T00:19:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.08332","created_at":"2026-07-09T00:19:14Z"},{"alias_kind":"pith_short_12","alias_value":"O752KUYLMWR3","created_at":"2026-07-09T00:19:14Z"},{"alias_kind":"pith_short_16","alias_value":"O752KUYLMWR3RQ4F","created_at":"2026-07-09T00:19:14Z"},{"alias_kind":"pith_short_8","alias_value":"O752KUYL","created_at":"2026-07-09T00:19:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:O752KUYLMWR3RQ4F2RH3IZKIHI","target":"record","payload":{"canonical_record":{"source":{"id":"2605.08332","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2026-05-08T17:55:49Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"b38a26a9e68e29be91cb106e06f3b1bc22544727524f7bd7ee86b256feb88f21","abstract_canon_sha256":"7e5b9fd6631f236a70facd582247a45ed4993d25e2c32c24841280c736502141"},"schema_version":"1.0"},"canonical_sha256":"77fba5530b65a3b8c385d44fb465483a0257022352faba35f6a6bf9ca08b28f5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-09T00:19:14.141526Z","signature_b64":"apmpFNnvXpgBXmZISadr1jZPBS4IsqyuuHJ6p6eH4sA40iwnFOugy2BLIWOSrwJfHy3kKONwjcFJea/cvqKpAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77fba5530b65a3b8c385d44fb465483a0257022352faba35f6a6bf9ca08b28f5","last_reissued_at":"2026-07-09T00:19:14.140853Z","signature_status":"signed_v1","first_computed_at":"2026-07-09T00:19:14.140853Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.08332","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-09T00:19:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kwj/Q3bSPbAYbTgIwQYQvKK9BUpTuh4W97VMpuh5b3Iuqhkkijuy5e0ZX6ito0FiU0n4viRTBVpxghuSLzITCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T09:40:56.366372Z"},"content_sha256":"388970e475a33db2b65bf84002436e691e0922b1cf7a540cef8f43485633c778","schema_version":"1.0","event_id":"sha256:388970e475a33db2b65bf84002436e691e0922b1cf7a540cef8f43485633c778"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:O752KUYLMWR3RQ4F2RH3IZKIHI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal FALQON for Quantum Approximate Optimization via Layer-wise Parameter Tuning","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"Optimizing per-layer time steps and scaling factors in FALQON improves success probability and efficiency for combinatorial optimization on quantum devices.","cross_cats":["cs.AI"],"primary_cat":"quant-ph","authors_text":"Michael Mancini, Shabnam Sodagari","submitted_at":"2026-05-08T17:55:49Z","abstract_excerpt":"Feedback-based adaptive quantum optimization (FALQON) is a promising approach for solving combinatorial problems on noisy intermediate-scale quantum (NISQ) devices, requiring only single circuit evaluations per layer. However, standard FALQON relies on fixed hyperparameters that severely limit convergence speed, requiring hundreds to thousands of layers for acceptable solutions. This paper proposes Optimal FALQON, an optimization-based formulation that treats the per-layer time step ($\\delta_k$) and scaling factor ($M_k$) as decision variables optimized via classical methods. We present a comp"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Results demonstrate statistically significant improvements in success probability, evaluation efficiency, and depth-normalized cost across the evaluated benchmarks. Furthermore, initializing QAOA with parameters from Optimal FALQON yields superior warm-start performance compared to fixed initialization.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That classical optimization of the per-layer parameters δ_k and M_k can be performed efficiently and that the observed improvements on 12-vertex 3-regular graphs will generalize to larger or differently structured instances without prohibitive overhead.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Optimal FALQON optimizes per-layer δ_k and M_k via classical methods, yielding statistically significant gains in success probability and efficiency over standard FALQON on 94 non-isomorphic 3-regular graphs with 12 vertices.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Optimizing per-layer time steps and scaling factors in FALQON improves success probability and efficiency for combinatorial optimization on quantum devices.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"6e1a0b91976520a340f061145de994d80140d5f48a8b48c1093b0dc791698830"},"source":{"id":"2605.08332","kind":"arxiv","version":2},"verdict":{"id":"2ab8b95d-4a19-41a6-ad7c-0985e31db2b5","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-12T01:03:52.864111Z","strongest_claim":"Results demonstrate statistically significant improvements in success probability, evaluation efficiency, and depth-normalized cost across the evaluated benchmarks. Furthermore, initializing QAOA with parameters from Optimal FALQON yields superior warm-start performance compared to fixed initialization.","one_line_summary":"Optimal FALQON optimizes per-layer δ_k and M_k via classical methods, yielding statistically significant gains in success probability and efficiency over standard FALQON on 94 non-isomorphic 3-regular graphs with 12 vertices.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That classical optimization of the per-layer parameters δ_k and M_k can be performed efficiently and that the observed improvements on 12-vertex 3-regular graphs will generalize to larger or differently structured instances without prohibitive overhead.","pith_extraction_headline":"Optimizing per-layer time steps and scaling factors in FALQON improves success probability and efficiency for combinatorial optimization on quantum devices."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.08332/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"claim_evidence","ran_at":"2026-05-20T09:42:04.407831Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-20T04:39:29.204463Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-19T15:01:18.442224Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T11:15:08.318734Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"d5627729712a89597bddcbba85f4c57ab81ed57e52ad2aaad618f150d6b77b5a"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"0040f51dd423397d8a975b42d05d9c3b6a98302eb6003419c07c171530b283e8"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"2ab8b95d-4a19-41a6-ad7c-0985e31db2b5"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-09T00:19:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pAHDJCnadd2QvEoeyZWOpkrwxA8gFGTlj+S4snW5kUMuivuIgtqbnhSNcCT9CeXyMgqpMHD8EdlatfWp+znFBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T09:40:56.366829Z"},"content_sha256":"8ce2b38fe516f900f72e80c807ef07c55eef416429332a006e4a0212a02dd732","schema_version":"1.0","event_id":"sha256:8ce2b38fe516f900f72e80c807ef07c55eef416429332a006e4a0212a02dd732"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O752KUYLMWR3RQ4F2RH3IZKIHI/bundle.json","state_url":"https://pith.science/pith/O752KUYLMWR3RQ4F2RH3IZKIHI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O752KUYLMWR3RQ4F2RH3IZKIHI/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-14T09:40:56Z","links":{"resolver":"https://pith.science/pith/O752KUYLMWR3RQ4F2RH3IZKIHI","bundle":"https://pith.science/pith/O752KUYLMWR3RQ4F2RH3IZKIHI/bundle.json","state":"https://pith.science/pith/O752KUYLMWR3RQ4F2RH3IZKIHI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O752KUYLMWR3RQ4F2RH3IZKIHI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:O752KUYLMWR3RQ4F2RH3IZKIHI","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"7e5b9fd6631f236a70facd582247a45ed4993d25e2c32c24841280c736502141","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2026-05-08T17:55:49Z","title_canon_sha256":"b38a26a9e68e29be91cb106e06f3b1bc22544727524f7bd7ee86b256feb88f21"},"schema_version":"1.0","source":{"id":"2605.08332","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.08332","created_at":"2026-07-09T00:19:14Z"},{"alias_kind":"arxiv_version","alias_value":"2605.08332v2","created_at":"2026-07-09T00:19:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.08332","created_at":"2026-07-09T00:19:14Z"},{"alias_kind":"pith_short_12","alias_value":"O752KUYLMWR3","created_at":"2026-07-09T00:19:14Z"},{"alias_kind":"pith_short_16","alias_value":"O752KUYLMWR3RQ4F","created_at":"2026-07-09T00:19:14Z"},{"alias_kind":"pith_short_8","alias_value":"O752KUYL","created_at":"2026-07-09T00:19:14Z"}],"graph_snapshots":[{"event_id":"sha256:8ce2b38fe516f900f72e80c807ef07c55eef416429332a006e4a0212a02dd732","target":"graph","created_at":"2026-07-09T00:19:14Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"Results demonstrate statistically significant improvements in success probability, evaluation efficiency, and depth-normalized cost across the evaluated benchmarks. Furthermore, initializing QAOA with parameters from Optimal FALQON yields superior warm-start performance compared to fixed initialization."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That classical optimization of the per-layer parameters δ_k and M_k can be performed efficiently and that the observed improvements on 12-vertex 3-regular graphs will generalize to larger or differently structured instances without prohibitive overhead."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Optimal FALQON optimizes per-layer δ_k and M_k via classical methods, yielding statistically significant gains in success probability and efficiency over standard FALQON on 94 non-isomorphic 3-regular graphs with 12 vertices."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Optimizing per-layer time steps and scaling factors in FALQON improves success probability and efficiency for combinatorial optimization on quantum devices."}],"snapshot_sha256":"6e1a0b91976520a340f061145de994d80140d5f48a8b48c1093b0dc791698830"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"0040f51dd423397d8a975b42d05d9c3b6a98302eb6003419c07c171530b283e8"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-20T09:42:04.407831Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-20T04:39:29.204463Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T15:01:18.442224Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T11:15:08.318734Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.08332/integrity.json","findings":[],"snapshot_sha256":"d5627729712a89597bddcbba85f4c57ab81ed57e52ad2aaad618f150d6b77b5a","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Feedback-based adaptive quantum optimization (FALQON) is a promising approach for solving combinatorial problems on noisy intermediate-scale quantum (NISQ) devices, requiring only single circuit evaluations per layer. However, standard FALQON relies on fixed hyperparameters that severely limit convergence speed, requiring hundreds to thousands of layers for acceptable solutions. This paper proposes Optimal FALQON, an optimization-based formulation that treats the per-layer time step ($\\delta_k$) and scaling factor ($M_k$) as decision variables optimized via classical methods. We present a comp","authors_text":"Michael Mancini, Shabnam Sodagari","cross_cats":["cs.AI"],"headline":"Optimizing per-layer time steps and scaling factors in FALQON improves success probability and efficiency for combinatorial optimization on quantum devices.","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2026-05-08T17:55:49Z","title":"Optimal FALQON for Quantum Approximate Optimization via Layer-wise Parameter Tuning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.08332","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-12T01:03:52.864111Z","id":"2ab8b95d-4a19-41a6-ad7c-0985e31db2b5","model_set":{"reader":"grok-4.3"},"one_line_summary":"Optimal FALQON optimizes per-layer δ_k and M_k via classical methods, yielding statistically significant gains in success probability and efficiency over standard FALQON on 94 non-isomorphic 3-regular graphs with 12 vertices.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Optimizing per-layer time steps and scaling factors in FALQON improves success probability and efficiency for combinatorial optimization on quantum devices.","strongest_claim":"Results demonstrate statistically significant improvements in success probability, evaluation efficiency, and depth-normalized cost across the evaluated benchmarks. Furthermore, initializing QAOA with parameters from Optimal FALQON yields superior warm-start performance compared to fixed initialization.","weakest_assumption":"That classical optimization of the per-layer parameters δ_k and M_k can be performed efficiently and that the observed improvements on 12-vertex 3-regular graphs will generalize to larger or differently structured instances without prohibitive overhead."}},"verdict_id":"2ab8b95d-4a19-41a6-ad7c-0985e31db2b5"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:388970e475a33db2b65bf84002436e691e0922b1cf7a540cef8f43485633c778","target":"record","created_at":"2026-07-09T00:19:14Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"7e5b9fd6631f236a70facd582247a45ed4993d25e2c32c24841280c736502141","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2026-05-08T17:55:49Z","title_canon_sha256":"b38a26a9e68e29be91cb106e06f3b1bc22544727524f7bd7ee86b256feb88f21"},"schema_version":"1.0","source":{"id":"2605.08332","kind":"arxiv","version":2}},"canonical_sha256":"77fba5530b65a3b8c385d44fb465483a0257022352faba35f6a6bf9ca08b28f5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"77fba5530b65a3b8c385d44fb465483a0257022352faba35f6a6bf9ca08b28f5","first_computed_at":"2026-07-09T00:19:14.140853Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-09T00:19:14.140853Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"apmpFNnvXpgBXmZISadr1jZPBS4IsqyuuHJ6p6eH4sA40iwnFOugy2BLIWOSrwJfHy3kKONwjcFJea/cvqKpAQ==","signature_status":"signed_v1","signed_at":"2026-07-09T00:19:14.141526Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.08332","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:388970e475a33db2b65bf84002436e691e0922b1cf7a540cef8f43485633c778","sha256:8ce2b38fe516f900f72e80c807ef07c55eef416429332a006e4a0212a02dd732"],"state_sha256":"d8347a7bf711aa80965592d690118b7946cc83206e7016739dd19cc3ce6d8883"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fY0WgTAn4rlz7oDCNYkZNYbG4QUOUFPXMmFTKFskQlc85wGg3jyCNa6WVtX30v7OAmx0BdJQ6i2db4733HWzAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T09:40:56.369421Z","bundle_sha256":"1007f6e44b8decabfbe35540c4cd265efa1ff5d17ab48f031269ae15054c178c"}}