{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:IUKKFGMX3UW4G5VSSRAU4VHR45","short_pith_number":"pith:IUKKFGMX","canonical_record":{"source":{"id":"2508.21686","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-08-29T14:53:56Z","cross_cats_sorted":[],"title_canon_sha256":"4b6d7a623b3e4914fd4ca10cb90e3cfb99a25d69e80f9be6a8e4f380fe57605a","abstract_canon_sha256":"04b692d3da91519ccef0141466cdb061a6966477af4fa81e7f8e181ad0c3acd5"},"schema_version":"1.0"},"canonical_sha256":"4514a29997dd2dc376b294414e54f1e761c0c71e0e406405fef66fcbdf9045d1","source":{"kind":"arxiv","id":"2508.21686","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.21686","created_at":"2026-07-05T12:01:47Z"},{"alias_kind":"arxiv_version","alias_value":"2508.21686v1","created_at":"2026-07-05T12:01:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.21686","created_at":"2026-07-05T12:01:47Z"},{"alias_kind":"pith_short_12","alias_value":"IUKKFGMX3UW4","created_at":"2026-07-05T12:01:47Z"},{"alias_kind":"pith_short_16","alias_value":"IUKKFGMX3UW4G5VS","created_at":"2026-07-05T12:01:47Z"},{"alias_kind":"pith_short_8","alias_value":"IUKKFGMX","created_at":"2026-07-05T12:01:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:IUKKFGMX3UW4G5VSSRAU4VHR45","target":"record","payload":{"canonical_record":{"source":{"id":"2508.21686","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-08-29T14:53:56Z","cross_cats_sorted":[],"title_canon_sha256":"4b6d7a623b3e4914fd4ca10cb90e3cfb99a25d69e80f9be6a8e4f380fe57605a","abstract_canon_sha256":"04b692d3da91519ccef0141466cdb061a6966477af4fa81e7f8e181ad0c3acd5"},"schema_version":"1.0"},"canonical_sha256":"4514a29997dd2dc376b294414e54f1e761c0c71e0e406405fef66fcbdf9045d1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:01:47.839469Z","signature_b64":"kbisdG7b2bCMhcbfN5bBDQC93uLUvW/4DpVnAusrBsgAZpEVwB5FjLzvRgSA6nTqXDFndoYIs++d3RLlxOl9BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4514a29997dd2dc376b294414e54f1e761c0c71e0e406405fef66fcbdf9045d1","last_reissued_at":"2026-07-05T12:01:47.838939Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:01:47.838939Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2508.21686","source_version":1,"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-05T12:01:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6E5X3g9giWSiNFIYhAQ33BNFs1aVzO0GjWEAc7laBetoj84wj3ZE5iaVohmFAQWu3kCiznBvUt+d6bJczVn9Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T12:06:35.820207Z"},"content_sha256":"438947706dd1778ebea4756bd64de897532f4366ebb00f04346b05835f84a561","schema_version":"1.0","event_id":"sha256:438947706dd1778ebea4756bd64de897532f4366ebb00f04346b05835f84a561"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:IUKKFGMX3UW4G5VSSRAU4VHR45","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Exclusive-Sum-of-Products Pipeline for QAOA","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Anthony Wilkie, Matthew Brunet, Mostafa Atallah, Rebekah Herrman, Shilpi Shah","submitted_at":"2025-08-29T14:53:56Z","abstract_excerpt":"The quantum approximate optimization algorithm is commonly used to solve combinatorial optimization problems. While unconstrained problems map naturally into the algorithm, incorporating constraints typically requires penalizing constraint violations in the objective function. In this work, we propose an alternative approach that encodes constraints as Boolean expressions in exclusive-sum-of-products (ESOP) form before penalization. We test this method on the maximum independent set problem using graphs with 3 to 20 vertices and find that ESOP constraint formulations achieve higher approximati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.21686","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/2508.21686/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T12:01:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ePq9cfV/SC84I0Nk32An4uJqOWqbibL2syC/vuP0pYfA/IoefU7R6Kg/b8V3CG1l71YqIdGD5dcVisNBLy37AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T12:06:35.820767Z"},"content_sha256":"e0289d6493ddc980b8c8165b642739625f3192ee033b0fb3b6b9deb082f3406b","schema_version":"1.0","event_id":"sha256:e0289d6493ddc980b8c8165b642739625f3192ee033b0fb3b6b9deb082f3406b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IUKKFGMX3UW4G5VSSRAU4VHR45/bundle.json","state_url":"https://pith.science/pith/IUKKFGMX3UW4G5VSSRAU4VHR45/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IUKKFGMX3UW4G5VSSRAU4VHR45/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-14T12:06:35Z","links":{"resolver":"https://pith.science/pith/IUKKFGMX3UW4G5VSSRAU4VHR45","bundle":"https://pith.science/pith/IUKKFGMX3UW4G5VSSRAU4VHR45/bundle.json","state":"https://pith.science/pith/IUKKFGMX3UW4G5VSSRAU4VHR45/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IUKKFGMX3UW4G5VSSRAU4VHR45/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:IUKKFGMX3UW4G5VSSRAU4VHR45","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":"04b692d3da91519ccef0141466cdb061a6966477af4fa81e7f8e181ad0c3acd5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-08-29T14:53:56Z","title_canon_sha256":"4b6d7a623b3e4914fd4ca10cb90e3cfb99a25d69e80f9be6a8e4f380fe57605a"},"schema_version":"1.0","source":{"id":"2508.21686","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.21686","created_at":"2026-07-05T12:01:47Z"},{"alias_kind":"arxiv_version","alias_value":"2508.21686v1","created_at":"2026-07-05T12:01:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.21686","created_at":"2026-07-05T12:01:47Z"},{"alias_kind":"pith_short_12","alias_value":"IUKKFGMX3UW4","created_at":"2026-07-05T12:01:47Z"},{"alias_kind":"pith_short_16","alias_value":"IUKKFGMX3UW4G5VS","created_at":"2026-07-05T12:01:47Z"},{"alias_kind":"pith_short_8","alias_value":"IUKKFGMX","created_at":"2026-07-05T12:01:47Z"}],"graph_snapshots":[{"event_id":"sha256:e0289d6493ddc980b8c8165b642739625f3192ee033b0fb3b6b9deb082f3406b","target":"graph","created_at":"2026-07-05T12:01:47Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2508.21686/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The quantum approximate optimization algorithm is commonly used to solve combinatorial optimization problems. While unconstrained problems map naturally into the algorithm, incorporating constraints typically requires penalizing constraint violations in the objective function. In this work, we propose an alternative approach that encodes constraints as Boolean expressions in exclusive-sum-of-products (ESOP) form before penalization. We test this method on the maximum independent set problem using graphs with 3 to 20 vertices and find that ESOP constraint formulations achieve higher approximati","authors_text":"Anthony Wilkie, Matthew Brunet, Mostafa Atallah, Rebekah Herrman, Shilpi Shah","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-08-29T14:53:56Z","title":"An Exclusive-Sum-of-Products Pipeline for QAOA"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.21686","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:438947706dd1778ebea4756bd64de897532f4366ebb00f04346b05835f84a561","target":"record","created_at":"2026-07-05T12:01:47Z","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":"04b692d3da91519ccef0141466cdb061a6966477af4fa81e7f8e181ad0c3acd5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-08-29T14:53:56Z","title_canon_sha256":"4b6d7a623b3e4914fd4ca10cb90e3cfb99a25d69e80f9be6a8e4f380fe57605a"},"schema_version":"1.0","source":{"id":"2508.21686","kind":"arxiv","version":1}},"canonical_sha256":"4514a29997dd2dc376b294414e54f1e761c0c71e0e406405fef66fcbdf9045d1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4514a29997dd2dc376b294414e54f1e761c0c71e0e406405fef66fcbdf9045d1","first_computed_at":"2026-07-05T12:01:47.838939Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:01:47.838939Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kbisdG7b2bCMhcbfN5bBDQC93uLUvW/4DpVnAusrBsgAZpEVwB5FjLzvRgSA6nTqXDFndoYIs++d3RLlxOl9BQ==","signature_status":"signed_v1","signed_at":"2026-07-05T12:01:47.839469Z","signed_message":"canonical_sha256_bytes"},"source_id":"2508.21686","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:438947706dd1778ebea4756bd64de897532f4366ebb00f04346b05835f84a561","sha256:e0289d6493ddc980b8c8165b642739625f3192ee033b0fb3b6b9deb082f3406b"],"state_sha256":"8e1e09c66b454bc92d8c8de8abbb91243256da8df8b21ec08a648ea6e716aee4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yqErXxJ8qo32sGIbCWillFHlo+aH8z2T8gPFCD+n/Hg5mrrZXBh2p18eonI9EOF6su21vl1pmN3DZuhtoZvbCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T12:06:35.825284Z","bundle_sha256":"11d3ee7004ea8dd78de6b7136aba8675612d7fe21dcf0761f99fefc9a2253342"}}