{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:NJMGE343QTFOLEFIK7GK24YKHX","short_pith_number":"pith:NJMGE343","canonical_record":{"source":{"id":"1610.04807","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-16T01:32:48Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"18415c81e77307cc6b702d4de66a366c62526edbbd580c44e9180de322e2068e","abstract_canon_sha256":"5c640e44e0a9f589df31fe9db9940ff05933fe1cadbfb64f9213a28d44ff29fe"},"schema_version":"1.0"},"canonical_sha256":"6a58626f9b84cae590a857ccad730a3dcf8c29357b6944d76e900aa7f0df30b6","source":{"kind":"arxiv","id":"1610.04807","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.04807","created_at":"2026-05-18T00:46:39Z"},{"alias_kind":"arxiv_version","alias_value":"1610.04807v3","created_at":"2026-05-18T00:46:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.04807","created_at":"2026-05-18T00:46:39Z"},{"alias_kind":"pith_short_12","alias_value":"NJMGE343QTFO","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"NJMGE343QTFOLEFI","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"NJMGE343","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:NJMGE343QTFOLEFIK7GK24YKHX","target":"record","payload":{"canonical_record":{"source":{"id":"1610.04807","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-16T01:32:48Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"18415c81e77307cc6b702d4de66a366c62526edbbd580c44e9180de322e2068e","abstract_canon_sha256":"5c640e44e0a9f589df31fe9db9940ff05933fe1cadbfb64f9213a28d44ff29fe"},"schema_version":"1.0"},"canonical_sha256":"6a58626f9b84cae590a857ccad730a3dcf8c29357b6944d76e900aa7f0df30b6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:39.451272Z","signature_b64":"3ye491XnNYzADslMNBRPLvkZ5okIagJxG9/xsajG+f8tvA2+TjxTUIXdVs+qY5E5Qu9NXIwLzgFNww8pA1+5BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a58626f9b84cae590a857ccad730a3dcf8c29357b6944d76e900aa7f0df30b6","last_reissued_at":"2026-05-18T00:46:39.450489Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:39.450489Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.04807","source_version":3,"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-05-18T00:46:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5LSRwXv4Gr6xwdZ1MABWxXWW0pUZN9KJXkArtvlkPLCjA/5+gMTeLaF5Q06fbVPUu9zhdvba30MLpWUZmmbVAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:11:01.328561Z"},"content_sha256":"b954892775a1d51c3ad5cd864cd7932aabeb6a993f89fbd779109ef5294682b8","schema_version":"1.0","event_id":"sha256:b954892775a1d51c3ad5cd864cd7932aabeb6a993f89fbd779109ef5294682b8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:NJMGE343QTFOLEFIK7GK24YKHX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Local max-cut in smoothed polynomial time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"cs.DS","authors_text":"Fan Wei, Omer Angel, S\\'ebastien Bubeck, Yuval Peres","submitted_at":"2016-10-16T01:32:48Z","abstract_excerpt":"In 1988, Johnson, Papadimitriou and Yannakakis wrote that \"Practically all the empirical evidence would lead us to conclude that finding locally optimal solutions is much easier than solving NP-hard problems\". Since then the empirical evidence has continued to amass, but formal proofs of this phenomenon have remained elusive. A canonical (and indeed complete) example is the local max-cut problem, for which no polynomial time method is known. In a breakthrough paper, Etscheid and R\\\"oglin proved that the smoothed complexity of local max-cut is quasi-polynomial, i.e., if arbitrary bounded weight"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.04807","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-05-18T00:46:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3qZceDL37dTzlnCj+X/LOe0qqYF929ujOQ0QKivKvtCpIxmueoVYxGYtJg2DNyv1PI/IFWnTqzlM0M7X+dvzDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:11:01.329224Z"},"content_sha256":"1addbc6f6b6722e1263428c413f53d23fc180d4ceb6e2f4be67f769f264028c9","schema_version":"1.0","event_id":"sha256:1addbc6f6b6722e1263428c413f53d23fc180d4ceb6e2f4be67f769f264028c9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NJMGE343QTFOLEFIK7GK24YKHX/bundle.json","state_url":"https://pith.science/pith/NJMGE343QTFOLEFIK7GK24YKHX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NJMGE343QTFOLEFIK7GK24YKHX/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-05-27T16:11:01Z","links":{"resolver":"https://pith.science/pith/NJMGE343QTFOLEFIK7GK24YKHX","bundle":"https://pith.science/pith/NJMGE343QTFOLEFIK7GK24YKHX/bundle.json","state":"https://pith.science/pith/NJMGE343QTFOLEFIK7GK24YKHX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NJMGE343QTFOLEFIK7GK24YKHX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:NJMGE343QTFOLEFIK7GK24YKHX","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":"5c640e44e0a9f589df31fe9db9940ff05933fe1cadbfb64f9213a28d44ff29fe","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-16T01:32:48Z","title_canon_sha256":"18415c81e77307cc6b702d4de66a366c62526edbbd580c44e9180de322e2068e"},"schema_version":"1.0","source":{"id":"1610.04807","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.04807","created_at":"2026-05-18T00:46:39Z"},{"alias_kind":"arxiv_version","alias_value":"1610.04807v3","created_at":"2026-05-18T00:46:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.04807","created_at":"2026-05-18T00:46:39Z"},{"alias_kind":"pith_short_12","alias_value":"NJMGE343QTFO","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"NJMGE343QTFOLEFI","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"NJMGE343","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:1addbc6f6b6722e1263428c413f53d23fc180d4ceb6e2f4be67f769f264028c9","target":"graph","created_at":"2026-05-18T00:46:39Z","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"},"paper":{"abstract_excerpt":"In 1988, Johnson, Papadimitriou and Yannakakis wrote that \"Practically all the empirical evidence would lead us to conclude that finding locally optimal solutions is much easier than solving NP-hard problems\". Since then the empirical evidence has continued to amass, but formal proofs of this phenomenon have remained elusive. A canonical (and indeed complete) example is the local max-cut problem, for which no polynomial time method is known. In a breakthrough paper, Etscheid and R\\\"oglin proved that the smoothed complexity of local max-cut is quasi-polynomial, i.e., if arbitrary bounded weight","authors_text":"Fan Wei, Omer Angel, S\\'ebastien Bubeck, Yuval Peres","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-16T01:32:48Z","title":"Local max-cut in smoothed polynomial time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.04807","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:b954892775a1d51c3ad5cd864cd7932aabeb6a993f89fbd779109ef5294682b8","target":"record","created_at":"2026-05-18T00:46:39Z","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":"5c640e44e0a9f589df31fe9db9940ff05933fe1cadbfb64f9213a28d44ff29fe","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-16T01:32:48Z","title_canon_sha256":"18415c81e77307cc6b702d4de66a366c62526edbbd580c44e9180de322e2068e"},"schema_version":"1.0","source":{"id":"1610.04807","kind":"arxiv","version":3}},"canonical_sha256":"6a58626f9b84cae590a857ccad730a3dcf8c29357b6944d76e900aa7f0df30b6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6a58626f9b84cae590a857ccad730a3dcf8c29357b6944d76e900aa7f0df30b6","first_computed_at":"2026-05-18T00:46:39.450489Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:39.450489Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3ye491XnNYzADslMNBRPLvkZ5okIagJxG9/xsajG+f8tvA2+TjxTUIXdVs+qY5E5Qu9NXIwLzgFNww8pA1+5BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:39.451272Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.04807","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b954892775a1d51c3ad5cd864cd7932aabeb6a993f89fbd779109ef5294682b8","sha256:1addbc6f6b6722e1263428c413f53d23fc180d4ceb6e2f4be67f769f264028c9"],"state_sha256":"e8fa788b31fec8bc6912ed67c95c9f3007f7fe9c0f3b073eb23528056695f6fe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZdvDeQsNonT5tqKycXs/2jETZ9QNH/B0YSUvBE5UNbZY7fSEU+q6wIxrq1vyG7cnPw4DZaLeupT/q3j6dGoaAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T16:11:01.332133Z","bundle_sha256":"c0cdff315693eb3928f8523b353f307d837d5f62258f91917ac8b0448af46cba"}}