{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:NQ5CJZWN3TWUNLJKWTGNZ4EWDG","short_pith_number":"pith:NQ5CJZWN","schema_version":"1.0","canonical_sha256":"6c3a24e6cddced46ad2ab4ccdcf09619bacbd91ef4b67ab25adb5666961d4b1e","source":{"kind":"arxiv","id":"2508.00565","version":2},"attestation_state":"computed","paper":{"title":"A More Convex Ising Formulation of Max-3-Cut Using Higher-Order Spin Interactions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math-ph","math.MP","nlin.AO","nlin.CG","physics.app-ph"],"primary_cat":"cond-mat.stat-mech","authors_text":"Guy Van der Sande, Peter Bienstman, Robbe De Prins, Thomas Van Vaerenbergh","submitted_at":"2025-08-01T12:05:39Z","abstract_excerpt":"Many combinatorial optimization problems (COPs) are naturally expressed using variables that take on more than two discrete values. To solve such problems using Ising machines (IMs) - specialized analog or digital devices designed to solve COPs efficiently - these multi-valued integers must be encoded using binary spin variables. A common approach is one-hot encoding, where each variable is represented by a group of spins constrained so that exactly one spin is in the \"up\" state. However, this encoding introduces energy barriers: changing an integer's value requires flipping two spins and pass"},"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":"2508.00565","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2025-08-01T12:05:39Z","cross_cats_sorted":["math-ph","math.MP","nlin.AO","nlin.CG","physics.app-ph"],"title_canon_sha256":"558a8621e81b7fa4c834037b41c28bc5456e773ef0c46a3341293ba30bf67e2e","abstract_canon_sha256":"bf2a90e60b194464533e3b53ae5db9a814a6e8159dd3078a7c50eb6a6ca3cd19"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:48:52.202890Z","signature_b64":"U9jzHHAjmts5tuMmRn/HsRlZ5TKMFXJh9F6tafgGvjIr7eph8rR8qZ3qUuXpdCQWI7Zq8Kn+Axr8znUN2l35CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c3a24e6cddced46ad2ab4ccdcf09619bacbd91ef4b67ab25adb5666961d4b1e","last_reissued_at":"2026-07-05T11:48:52.202338Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:48:52.202338Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A More Convex Ising Formulation of Max-3-Cut Using Higher-Order Spin Interactions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math-ph","math.MP","nlin.AO","nlin.CG","physics.app-ph"],"primary_cat":"cond-mat.stat-mech","authors_text":"Guy Van der Sande, Peter Bienstman, Robbe De Prins, Thomas Van Vaerenbergh","submitted_at":"2025-08-01T12:05:39Z","abstract_excerpt":"Many combinatorial optimization problems (COPs) are naturally expressed using variables that take on more than two discrete values. To solve such problems using Ising machines (IMs) - specialized analog or digital devices designed to solve COPs efficiently - these multi-valued integers must be encoded using binary spin variables. A common approach is one-hot encoding, where each variable is represented by a group of spins constrained so that exactly one spin is in the \"up\" state. However, this encoding introduces energy barriers: changing an integer's value requires flipping two spins and pass"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.00565","kind":"arxiv","version":2},"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.00565/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":"2508.00565","created_at":"2026-07-05T11:48:52.202421+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.00565v2","created_at":"2026-07-05T11:48:52.202421+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.00565","created_at":"2026-07-05T11:48:52.202421+00:00"},{"alias_kind":"pith_short_12","alias_value":"NQ5CJZWN3TWU","created_at":"2026-07-05T11:48:52.202421+00:00"},{"alias_kind":"pith_short_16","alias_value":"NQ5CJZWN3TWUNLJK","created_at":"2026-07-05T11:48:52.202421+00:00"},{"alias_kind":"pith_short_8","alias_value":"NQ5CJZWN","created_at":"2026-07-05T11:48:52.202421+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/NQ5CJZWN3TWUNLJKWTGNZ4EWDG","json":"https://pith.science/pith/NQ5CJZWN3TWUNLJKWTGNZ4EWDG.json","graph_json":"https://pith.science/api/pith-number/NQ5CJZWN3TWUNLJKWTGNZ4EWDG/graph.json","events_json":"https://pith.science/api/pith-number/NQ5CJZWN3TWUNLJKWTGNZ4EWDG/events.json","paper":"https://pith.science/paper/NQ5CJZWN"},"agent_actions":{"view_html":"https://pith.science/pith/NQ5CJZWN3TWUNLJKWTGNZ4EWDG","download_json":"https://pith.science/pith/NQ5CJZWN3TWUNLJKWTGNZ4EWDG.json","view_paper":"https://pith.science/paper/NQ5CJZWN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.00565&json=true","fetch_graph":"https://pith.science/api/pith-number/NQ5CJZWN3TWUNLJKWTGNZ4EWDG/graph.json","fetch_events":"https://pith.science/api/pith-number/NQ5CJZWN3TWUNLJKWTGNZ4EWDG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NQ5CJZWN3TWUNLJKWTGNZ4EWDG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NQ5CJZWN3TWUNLJKWTGNZ4EWDG/action/storage_attestation","attest_author":"https://pith.science/pith/NQ5CJZWN3TWUNLJKWTGNZ4EWDG/action/author_attestation","sign_citation":"https://pith.science/pith/NQ5CJZWN3TWUNLJKWTGNZ4EWDG/action/citation_signature","submit_replication":"https://pith.science/pith/NQ5CJZWN3TWUNLJKWTGNZ4EWDG/action/replication_record"}},"created_at":"2026-07-05T11:48:52.202421+00:00","updated_at":"2026-07-05T11:48:52.202421+00:00"}