{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:2HIHHZ3DP6DDEMDDZTF3ZI2GRE","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":"3b9c33a6f191603f6e5604e990e79d3aead5fe5dee64106218f93a355c7af2b4","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2025-10-17T14:56:50Z","title_canon_sha256":"642d1de6ec98386ff3b53174b6e3f2f50e8d13b902a0d56585575a765a8baa68"},"schema_version":"1.0","source":{"id":"2510.15712","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2510.15712","created_at":"2026-05-20T00:05:35Z"},{"alias_kind":"arxiv_version","alias_value":"2510.15712v3","created_at":"2026-05-20T00:05:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.15712","created_at":"2026-05-20T00:05:35Z"},{"alias_kind":"pith_short_12","alias_value":"2HIHHZ3DP6DD","created_at":"2026-05-20T00:05:35Z"},{"alias_kind":"pith_short_16","alias_value":"2HIHHZ3DP6DDEMDD","created_at":"2026-05-20T00:05:35Z"},{"alias_kind":"pith_short_8","alias_value":"2HIHHZ3D","created_at":"2026-05-20T00:05:35Z"}],"graph_snapshots":[{"event_id":"sha256:e7a6c9fa9081f791e3cecf5c85f07e7e64cf7c421bd263cb97c580eb59b6af51","target":"graph","created_at":"2026-05-20T00:05:35Z","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/2510.15712/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"How hard is it to find a local optimum? If we are given a graph and want to find a locally maximal cut--meaning that the number of edges in the cut can't be improved by moving a single vertex from one side to the other--then just iterating improving steps finds a local maximum in $ |E|$ steps. If, on the other hand, the edges are weighted, this problem becomes hard for the class PLS (Polynomial Local Search). We are interested in optimization problems with lexicographic costs. For Max-Cut this would mean that the edges $e_1,\\dots, e_m$ have costs $c(e_i) = 2^i$. For such a cost function findin","authors_text":"Dominik Scheder, Johannes Tantow","cross_cats":["cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2025-10-17T14:56:50Z","title":"PLS-complete problems with lexicographic cost functions: Max-$k$-SAT and Abelian Permutation Orbit Minimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.15712","kind":"arxiv","version":3},"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:bd58d7955b5c54764bfb0cba3cb49df3c96e52d37708f477a4d5d01c5bca40bf","target":"record","created_at":"2026-05-20T00:05:35Z","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":"3b9c33a6f191603f6e5604e990e79d3aead5fe5dee64106218f93a355c7af2b4","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2025-10-17T14:56:50Z","title_canon_sha256":"642d1de6ec98386ff3b53174b6e3f2f50e8d13b902a0d56585575a765a8baa68"},"schema_version":"1.0","source":{"id":"2510.15712","kind":"arxiv","version":3}},"canonical_sha256":"d1d073e7637f86323063cccbbca346891ae8adc70dcb1361707fb9b48abc514d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d1d073e7637f86323063cccbbca346891ae8adc70dcb1361707fb9b48abc514d","first_computed_at":"2026-05-20T00:05:35.132955Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:05:35.132955Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0d+uNSDv5zh/ksj9RNEqSlETlfZSlr3CwEJ6K5IMVaEHmmdmohXY/UMgfs0cxQ/J4Ozi0KcPK2ykoeE71STLAg==","signature_status":"signed_v1","signed_at":"2026-05-20T00:05:35.133581Z","signed_message":"canonical_sha256_bytes"},"source_id":"2510.15712","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bd58d7955b5c54764bfb0cba3cb49df3c96e52d37708f477a4d5d01c5bca40bf","sha256:e7a6c9fa9081f791e3cecf5c85f07e7e64cf7c421bd263cb97c580eb59b6af51"],"state_sha256":"7e38472d73d4def37d75347e8bb3211cec2c33f6b8a7a0a480da1707550c9d6c"}