{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:Y6QYMC5O2KLUJXJRAWIIMWUPVB","short_pith_number":"pith:Y6QYMC5O","schema_version":"1.0","canonical_sha256":"c7a1860baed29744dd310590865a8fa85a55d3775f3b9dcd7cf935a47ea1aad4","source":{"kind":"arxiv","id":"2006.15067","version":1},"attestation_state":"computed","paper":{"title":"Constrained-optimization Approach Delivers Superior Classical Performance for Graph Partitioning via Quantum-ready Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"quant-ph","authors_text":"DeYung Le, Jesse Berwald, John Dawson, Mark Wainger, Michael Booth, Raouf Dridi, Steven P. Reinhardt, Uchenna Chukwu","submitted_at":"2020-06-26T15:55:12Z","abstract_excerpt":"Graph partitioning is one of an important set of well-known compute-intense (NP-hard) graph problems that devolve to discrete constrained optimization. We sampled solutions to the problem via two different quantum-ready methods to understand the pros and cons of each method. First we formulated and sampled the problem as a quadratic unconstrained binary optimization (QUBO) problem, via the best known QUBO formulation, using a best-in-class QUBO sampler running purely classically. Second, we formulated the problem at a higher level, as a set of constraints and an objective function, and sampled"},"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":"2006.15067","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-06-26T15:55:12Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"11a2599ba40429b12618fd53f6b6c2df96550f285ce72745d3b30048ff844b60","abstract_canon_sha256":"92375e5bb5c455097051a666840e32b55f63a941ebc05d95973af2bc9783c503"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:13:49.341397Z","signature_b64":"OLoGpYX1XYu7Pbos2Rb+Zc8zgmqQN3kPv4DSIQ/KA0gH2dBWdSgl2UoyghGKp+yTkNttSk7ssnnflgEHVGnMBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c7a1860baed29744dd310590865a8fa85a55d3775f3b9dcd7cf935a47ea1aad4","last_reissued_at":"2026-07-05T01:13:49.340952Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:13:49.340952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constrained-optimization Approach Delivers Superior Classical Performance for Graph Partitioning via Quantum-ready Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"quant-ph","authors_text":"DeYung Le, Jesse Berwald, John Dawson, Mark Wainger, Michael Booth, Raouf Dridi, Steven P. Reinhardt, Uchenna Chukwu","submitted_at":"2020-06-26T15:55:12Z","abstract_excerpt":"Graph partitioning is one of an important set of well-known compute-intense (NP-hard) graph problems that devolve to discrete constrained optimization. We sampled solutions to the problem via two different quantum-ready methods to understand the pros and cons of each method. First we formulated and sampled the problem as a quadratic unconstrained binary optimization (QUBO) problem, via the best known QUBO formulation, using a best-in-class QUBO sampler running purely classically. Second, we formulated the problem at a higher level, as a set of constraints and an objective function, and sampled"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.15067","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/2006.15067/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":"2006.15067","created_at":"2026-07-05T01:13:49.341009+00:00"},{"alias_kind":"arxiv_version","alias_value":"2006.15067v1","created_at":"2026-07-05T01:13:49.341009+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.15067","created_at":"2026-07-05T01:13:49.341009+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y6QYMC5O2KLU","created_at":"2026-07-05T01:13:49.341009+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y6QYMC5O2KLUJXJR","created_at":"2026-07-05T01:13:49.341009+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y6QYMC5O","created_at":"2026-07-05T01:13:49.341009+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/Y6QYMC5O2KLUJXJRAWIIMWUPVB","json":"https://pith.science/pith/Y6QYMC5O2KLUJXJRAWIIMWUPVB.json","graph_json":"https://pith.science/api/pith-number/Y6QYMC5O2KLUJXJRAWIIMWUPVB/graph.json","events_json":"https://pith.science/api/pith-number/Y6QYMC5O2KLUJXJRAWIIMWUPVB/events.json","paper":"https://pith.science/paper/Y6QYMC5O"},"agent_actions":{"view_html":"https://pith.science/pith/Y6QYMC5O2KLUJXJRAWIIMWUPVB","download_json":"https://pith.science/pith/Y6QYMC5O2KLUJXJRAWIIMWUPVB.json","view_paper":"https://pith.science/paper/Y6QYMC5O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2006.15067&json=true","fetch_graph":"https://pith.science/api/pith-number/Y6QYMC5O2KLUJXJRAWIIMWUPVB/graph.json","fetch_events":"https://pith.science/api/pith-number/Y6QYMC5O2KLUJXJRAWIIMWUPVB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y6QYMC5O2KLUJXJRAWIIMWUPVB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y6QYMC5O2KLUJXJRAWIIMWUPVB/action/storage_attestation","attest_author":"https://pith.science/pith/Y6QYMC5O2KLUJXJRAWIIMWUPVB/action/author_attestation","sign_citation":"https://pith.science/pith/Y6QYMC5O2KLUJXJRAWIIMWUPVB/action/citation_signature","submit_replication":"https://pith.science/pith/Y6QYMC5O2KLUJXJRAWIIMWUPVB/action/replication_record"}},"created_at":"2026-07-05T01:13:49.341009+00:00","updated_at":"2026-07-05T01:13:49.341009+00:00"}