{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:IQBSI53DLSQNNJVRS7SHSTOSOB","short_pith_number":"pith:IQBSI53D","schema_version":"1.0","canonical_sha256":"44032477635ca0d6a6b197e4794dd2706b903e939b6924d2af51c5e47fa6a86f","source":{"kind":"arxiv","id":"2008.06054","version":1},"attestation_state":"computed","paper":{"title":"Approximate optimization of MAXCUT with a local spin algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Aniruddha Bapat, Stephen P. Jordan","submitted_at":"2020-08-13T18:00:00Z","abstract_excerpt":"Local tensor methods are a class of optimization algorithms that was introduced in [Hastings,arXiv:1905.07047v2][1] as a classical analogue of the quantum approximate optimization algorithm (QAOA). These algorithms treat the cost function as a Hamiltonian on spin degrees of freedom and simulate the relaxation of the system to a low energy configuration using local update rules on the spins. Whereas the emphasis in [1] was on theoretical worst-case analysis, we here investigate performance in practice through benchmarking experiments on instances of the MAXCUT problem.Through heuristic argument"},"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":"2008.06054","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-08-13T18:00:00Z","cross_cats_sorted":[],"title_canon_sha256":"b9c2e27e3fa9accb6e5340f0ba72db74697bfbbbb464fa67ce470ccdab09bd59","abstract_canon_sha256":"4e91329e1449b87f86ff21c487bcb08e0bf165d23959bee22148bea4258ad1fd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:41:04.052089Z","signature_b64":"qb3iVCahwXezdu0mk0Yc0TmW1bJ6s+nfS/QhiqNJ8Ncmdsc6t1mqK0vTO2A7DpbasoOsQCcOhyjiqRomv8CqCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44032477635ca0d6a6b197e4794dd2706b903e939b6924d2af51c5e47fa6a86f","last_reissued_at":"2026-07-05T02:41:04.051575Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:41:04.051575Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximate optimization of MAXCUT with a local spin algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Aniruddha Bapat, Stephen P. Jordan","submitted_at":"2020-08-13T18:00:00Z","abstract_excerpt":"Local tensor methods are a class of optimization algorithms that was introduced in [Hastings,arXiv:1905.07047v2][1] as a classical analogue of the quantum approximate optimization algorithm (QAOA). These algorithms treat the cost function as a Hamiltonian on spin degrees of freedom and simulate the relaxation of the system to a low energy configuration using local update rules on the spins. Whereas the emphasis in [1] was on theoretical worst-case analysis, we here investigate performance in practice through benchmarking experiments on instances of the MAXCUT problem.Through heuristic argument"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.06054","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/2008.06054/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":"2008.06054","created_at":"2026-07-05T02:41:04.051639+00:00"},{"alias_kind":"arxiv_version","alias_value":"2008.06054v1","created_at":"2026-07-05T02:41:04.051639+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.06054","created_at":"2026-07-05T02:41:04.051639+00:00"},{"alias_kind":"pith_short_12","alias_value":"IQBSI53DLSQN","created_at":"2026-07-05T02:41:04.051639+00:00"},{"alias_kind":"pith_short_16","alias_value":"IQBSI53DLSQNNJVR","created_at":"2026-07-05T02:41:04.051639+00:00"},{"alias_kind":"pith_short_8","alias_value":"IQBSI53D","created_at":"2026-07-05T02:41:04.051639+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/IQBSI53DLSQNNJVRS7SHSTOSOB","json":"https://pith.science/pith/IQBSI53DLSQNNJVRS7SHSTOSOB.json","graph_json":"https://pith.science/api/pith-number/IQBSI53DLSQNNJVRS7SHSTOSOB/graph.json","events_json":"https://pith.science/api/pith-number/IQBSI53DLSQNNJVRS7SHSTOSOB/events.json","paper":"https://pith.science/paper/IQBSI53D"},"agent_actions":{"view_html":"https://pith.science/pith/IQBSI53DLSQNNJVRS7SHSTOSOB","download_json":"https://pith.science/pith/IQBSI53DLSQNNJVRS7SHSTOSOB.json","view_paper":"https://pith.science/paper/IQBSI53D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2008.06054&json=true","fetch_graph":"https://pith.science/api/pith-number/IQBSI53DLSQNNJVRS7SHSTOSOB/graph.json","fetch_events":"https://pith.science/api/pith-number/IQBSI53DLSQNNJVRS7SHSTOSOB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IQBSI53DLSQNNJVRS7SHSTOSOB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IQBSI53DLSQNNJVRS7SHSTOSOB/action/storage_attestation","attest_author":"https://pith.science/pith/IQBSI53DLSQNNJVRS7SHSTOSOB/action/author_attestation","sign_citation":"https://pith.science/pith/IQBSI53DLSQNNJVRS7SHSTOSOB/action/citation_signature","submit_replication":"https://pith.science/pith/IQBSI53DLSQNNJVRS7SHSTOSOB/action/replication_record"}},"created_at":"2026-07-05T02:41:04.051639+00:00","updated_at":"2026-07-05T02:41:04.051639+00:00"}