{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:DHQBQTVGFHQ4FT22GM2V47FHWP","short_pith_number":"pith:DHQBQTVG","canonical_record":{"source":{"id":"2202.02305","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2022-02-04T18:42:05Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"ba78c566381badfcb6fb90df8b681937e96ae98cd6ed9b3f2e906203c0e6f5fd","abstract_canon_sha256":"987ea07a1731375fadc25c3fce07b301bf376aeb403a81d45faee560c1a2bf12"},"schema_version":"1.0"},"canonical_sha256":"19e0184ea629e1c2cf5a33355e7ca7b3d36c1ffe4cae38c54ce13ebe795b37de","source":{"kind":"arxiv","id":"2202.02305","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2202.02305","created_at":"2026-07-05T03:54:10Z"},{"alias_kind":"arxiv_version","alias_value":"2202.02305v1","created_at":"2026-07-05T03:54:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.02305","created_at":"2026-07-05T03:54:10Z"},{"alias_kind":"pith_short_12","alias_value":"DHQBQTVGFHQ4","created_at":"2026-07-05T03:54:10Z"},{"alias_kind":"pith_short_16","alias_value":"DHQBQTVGFHQ4FT22","created_at":"2026-07-05T03:54:10Z"},{"alias_kind":"pith_short_8","alias_value":"DHQBQTVG","created_at":"2026-07-05T03:54:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:DHQBQTVGFHQ4FT22GM2V47FHWP","target":"record","payload":{"canonical_record":{"source":{"id":"2202.02305","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2022-02-04T18:42:05Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"ba78c566381badfcb6fb90df8b681937e96ae98cd6ed9b3f2e906203c0e6f5fd","abstract_canon_sha256":"987ea07a1731375fadc25c3fce07b301bf376aeb403a81d45faee560c1a2bf12"},"schema_version":"1.0"},"canonical_sha256":"19e0184ea629e1c2cf5a33355e7ca7b3d36c1ffe4cae38c54ce13ebe795b37de","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:54:10.470756Z","signature_b64":"5CvMgbPQFct5WPOQ4lvVWgSfjcRTS1L4VOL6FHMQhgK2/I+ayaxihaZm5qZYmXZoVHrn8YnKHNk03Npxr1e8AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"19e0184ea629e1c2cf5a33355e7ca7b3d36c1ffe4cae38c54ce13ebe795b37de","last_reissued_at":"2026-07-05T03:54:10.470368Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:54:10.470368Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2202.02305","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-05T03:54:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wBLJRtwpq/kXlaOrJDYNz4tMxm4dN4G1Q64M3XGZAchysc9dlt3IwHJKfm9y3k3hAE5iPrS585hvlML0VehKBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T23:41:08.797100Z"},"content_sha256":"76b9ca5d18cf7cf9be428605b18f7992165c3b9f775ad2bff3036bcebd8e06c4","schema_version":"1.0","event_id":"sha256:76b9ca5d18cf7cf9be428605b18f7992165c3b9f775ad2bff3036bcebd8e06c4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:DHQBQTVGFHQ4FT22GM2V47FHWP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Faster exact solution of sparse MaxCut and QUBO problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"math.OC","authors_text":"Daniel Rehfeldt, Thorsten Koch, Yuji Shinano","submitted_at":"2022-02-04T18:42:05Z","abstract_excerpt":"The maximum-cut problem is one of the fundamental problems in combinatorial optimization. With the advent of quantum computers, both the maximum-cut and the equivalent quadratic unconstrained binary optimization problem have experienced much interest in recent years.\n  This article aims to advance the state of the art in the exact solution of both problems -- by using mathematical programming techniques on digital computers. The main focus lies on sparse problem instances, although also dense ones can be solved. We enhance several algorithmic components such as reduction techniques and cutting"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.02305","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/2202.02305/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-05T03:54:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0xNOKaRQ680LnZeRBNOUSnAZkAN7KOVKciua0YWpiGMfPPc3mDvl+ktb9WHMlWuxANnlfWJbkNi9tipMSUWADg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T23:41:08.797602Z"},"content_sha256":"6a4fdbdde32b30328a1233e56fff5158a58446d1d229e48f491027fd31c82643","schema_version":"1.0","event_id":"sha256:6a4fdbdde32b30328a1233e56fff5158a58446d1d229e48f491027fd31c82643"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DHQBQTVGFHQ4FT22GM2V47FHWP/bundle.json","state_url":"https://pith.science/pith/DHQBQTVGFHQ4FT22GM2V47FHWP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DHQBQTVGFHQ4FT22GM2V47FHWP/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-23T23:41:08Z","links":{"resolver":"https://pith.science/pith/DHQBQTVGFHQ4FT22GM2V47FHWP","bundle":"https://pith.science/pith/DHQBQTVGFHQ4FT22GM2V47FHWP/bundle.json","state":"https://pith.science/pith/DHQBQTVGFHQ4FT22GM2V47FHWP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DHQBQTVGFHQ4FT22GM2V47FHWP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:DHQBQTVGFHQ4FT22GM2V47FHWP","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":"987ea07a1731375fadc25c3fce07b301bf376aeb403a81d45faee560c1a2bf12","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2022-02-04T18:42:05Z","title_canon_sha256":"ba78c566381badfcb6fb90df8b681937e96ae98cd6ed9b3f2e906203c0e6f5fd"},"schema_version":"1.0","source":{"id":"2202.02305","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2202.02305","created_at":"2026-07-05T03:54:10Z"},{"alias_kind":"arxiv_version","alias_value":"2202.02305v1","created_at":"2026-07-05T03:54:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.02305","created_at":"2026-07-05T03:54:10Z"},{"alias_kind":"pith_short_12","alias_value":"DHQBQTVGFHQ4","created_at":"2026-07-05T03:54:10Z"},{"alias_kind":"pith_short_16","alias_value":"DHQBQTVGFHQ4FT22","created_at":"2026-07-05T03:54:10Z"},{"alias_kind":"pith_short_8","alias_value":"DHQBQTVG","created_at":"2026-07-05T03:54:10Z"}],"graph_snapshots":[{"event_id":"sha256:6a4fdbdde32b30328a1233e56fff5158a58446d1d229e48f491027fd31c82643","target":"graph","created_at":"2026-07-05T03:54:10Z","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/2202.02305/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The maximum-cut problem is one of the fundamental problems in combinatorial optimization. With the advent of quantum computers, both the maximum-cut and the equivalent quadratic unconstrained binary optimization problem have experienced much interest in recent years.\n  This article aims to advance the state of the art in the exact solution of both problems -- by using mathematical programming techniques on digital computers. The main focus lies on sparse problem instances, although also dense ones can be solved. We enhance several algorithmic components such as reduction techniques and cutting","authors_text":"Daniel Rehfeldt, Thorsten Koch, Yuji Shinano","cross_cats":["cs.DM","cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2022-02-04T18:42:05Z","title":"Faster exact solution of sparse MaxCut and QUBO problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.02305","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:76b9ca5d18cf7cf9be428605b18f7992165c3b9f775ad2bff3036bcebd8e06c4","target":"record","created_at":"2026-07-05T03:54:10Z","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":"987ea07a1731375fadc25c3fce07b301bf376aeb403a81d45faee560c1a2bf12","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2022-02-04T18:42:05Z","title_canon_sha256":"ba78c566381badfcb6fb90df8b681937e96ae98cd6ed9b3f2e906203c0e6f5fd"},"schema_version":"1.0","source":{"id":"2202.02305","kind":"arxiv","version":1}},"canonical_sha256":"19e0184ea629e1c2cf5a33355e7ca7b3d36c1ffe4cae38c54ce13ebe795b37de","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"19e0184ea629e1c2cf5a33355e7ca7b3d36c1ffe4cae38c54ce13ebe795b37de","first_computed_at":"2026-07-05T03:54:10.470368Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:54:10.470368Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5CvMgbPQFct5WPOQ4lvVWgSfjcRTS1L4VOL6FHMQhgK2/I+ayaxihaZm5qZYmXZoVHrn8YnKHNk03Npxr1e8AA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:54:10.470756Z","signed_message":"canonical_sha256_bytes"},"source_id":"2202.02305","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:76b9ca5d18cf7cf9be428605b18f7992165c3b9f775ad2bff3036bcebd8e06c4","sha256:6a4fdbdde32b30328a1233e56fff5158a58446d1d229e48f491027fd31c82643"],"state_sha256":"37cbe1a7ecbad104e4706aa428b5e2ecc3646c88736a68310601ea3627feb361"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UkD0caz+cGew+woWszHazhuTEMXci2A4oRGnNNzYRrirwqs9fQKmA40QlGB0SMtZGhsh1nZmiW6RiOgWQvL7Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T23:41:08.803942Z","bundle_sha256":"a29c612686f18200ffd810eb8d0e128bb88eccd5dbe674625af48a544fd8a4d2"}}