{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:ZQVT6WRIGXVDJYSFSJU6VRFR2K","short_pith_number":"pith:ZQVT6WRI","canonical_record":{"source":{"id":"2311.00182","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-10-31T23:00:14Z","cross_cats_sorted":[],"title_canon_sha256":"8f8065c335b3aee5acb2b4ce9e196b71154f11b2897cd498c8ae224503d38458","abstract_canon_sha256":"0299942815330cf02ceb5e15e7f365c2b1e737f95aa2cd17e18b4f033207dad8"},"schema_version":"1.0"},"canonical_sha256":"cc2b3f5a2835ea34e2459269eac4b1d28b818e154f01ce470dda34570e354b4a","source":{"kind":"arxiv","id":"2311.00182","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.00182","created_at":"2026-07-05T08:10:19Z"},{"alias_kind":"arxiv_version","alias_value":"2311.00182v3","created_at":"2026-07-05T08:10:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.00182","created_at":"2026-07-05T08:10:19Z"},{"alias_kind":"pith_short_12","alias_value":"ZQVT6WRIGXVD","created_at":"2026-07-05T08:10:19Z"},{"alias_kind":"pith_short_16","alias_value":"ZQVT6WRIGXVDJYSF","created_at":"2026-07-05T08:10:19Z"},{"alias_kind":"pith_short_8","alias_value":"ZQVT6WRI","created_at":"2026-07-05T08:10:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:ZQVT6WRIGXVDJYSFSJU6VRFR2K","target":"record","payload":{"canonical_record":{"source":{"id":"2311.00182","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-10-31T23:00:14Z","cross_cats_sorted":[],"title_canon_sha256":"8f8065c335b3aee5acb2b4ce9e196b71154f11b2897cd498c8ae224503d38458","abstract_canon_sha256":"0299942815330cf02ceb5e15e7f365c2b1e737f95aa2cd17e18b4f033207dad8"},"schema_version":"1.0"},"canonical_sha256":"cc2b3f5a2835ea34e2459269eac4b1d28b818e154f01ce470dda34570e354b4a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:10:19.296583Z","signature_b64":"gtAEfl0Kjkr2iEGM4POW9HCRk3b3oQU7tz4un3rgaP3W2RJWTPLwoLC4GN2j6tih9rRz5u/7zY4QxTA21R8BAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc2b3f5a2835ea34e2459269eac4b1d28b818e154f01ce470dda34570e354b4a","last_reissued_at":"2026-07-05T08:10:19.296187Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:10:19.296187Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2311.00182","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-07-05T08:10:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BohTwLjkY1AjoSqBh7cYbpG9RXHjS1OHYhm9QwXuOfhjHBKVLVsie8DKz1tmz3F1bSjepQhDTUthVyxATHkAAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-10T09:35:52.034378Z"},"content_sha256":"bcaf47b9099b8c06de56fce166b7cc8006c8e49e59aa8e045cc1d255e277911a","schema_version":"1.0","event_id":"sha256:bcaf47b9099b8c06de56fce166b7cc8006c8e49e59aa8e045cc1d255e277911a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:ZQVT6WRIGXVDJYSFSJU6VRFR2K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Local Max-Cut on Sparse Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gregory Schwartzman","submitted_at":"2023-10-31T23:00:14Z","abstract_excerpt":"We bound the smoothed running time of the FLIP algorithm for local Max-Cut as a function of $\\alpha$, the arboricity of the input graph. We show that, with high probability and in expectation, the following holds (where $n$ is the number of nodes and $\\phi$ is the smoothing parameter):\n  1) When $\\alpha = O(\\log^{1-\\delta} n)$ FLIP terminates in $\\phi poly(n)$ iterations, where $\\delta \\in (0,1]$ is an arbitrarily small constant. Previous to our results the only graph families for which FLIP was known to achieve a smoothed polynomial running time were complete graphs and graphs with logarithmi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.00182","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2311.00182/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-05T08:10:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uAqc2ORvTDCDwC9XXR9lAwMdHIIw8IX/pYTUdH60o312X7AvOWkoYa6H+I83YCdqF9isIlRe+AiqwVzlY/S6Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-10T09:35:52.034786Z"},"content_sha256":"51b2ee470d1dee252727fd9b67b912ca394b450a6f62ba4fddfcc7fb71af8563","schema_version":"1.0","event_id":"sha256:51b2ee470d1dee252727fd9b67b912ca394b450a6f62ba4fddfcc7fb71af8563"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZQVT6WRIGXVDJYSFSJU6VRFR2K/bundle.json","state_url":"https://pith.science/pith/ZQVT6WRIGXVDJYSFSJU6VRFR2K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZQVT6WRIGXVDJYSFSJU6VRFR2K/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-07-10T09:35:52Z","links":{"resolver":"https://pith.science/pith/ZQVT6WRIGXVDJYSFSJU6VRFR2K","bundle":"https://pith.science/pith/ZQVT6WRIGXVDJYSFSJU6VRFR2K/bundle.json","state":"https://pith.science/pith/ZQVT6WRIGXVDJYSFSJU6VRFR2K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZQVT6WRIGXVDJYSFSJU6VRFR2K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:ZQVT6WRIGXVDJYSFSJU6VRFR2K","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":"0299942815330cf02ceb5e15e7f365c2b1e737f95aa2cd17e18b4f033207dad8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-10-31T23:00:14Z","title_canon_sha256":"8f8065c335b3aee5acb2b4ce9e196b71154f11b2897cd498c8ae224503d38458"},"schema_version":"1.0","source":{"id":"2311.00182","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.00182","created_at":"2026-07-05T08:10:19Z"},{"alias_kind":"arxiv_version","alias_value":"2311.00182v3","created_at":"2026-07-05T08:10:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.00182","created_at":"2026-07-05T08:10:19Z"},{"alias_kind":"pith_short_12","alias_value":"ZQVT6WRIGXVD","created_at":"2026-07-05T08:10:19Z"},{"alias_kind":"pith_short_16","alias_value":"ZQVT6WRIGXVDJYSF","created_at":"2026-07-05T08:10:19Z"},{"alias_kind":"pith_short_8","alias_value":"ZQVT6WRI","created_at":"2026-07-05T08:10:19Z"}],"graph_snapshots":[{"event_id":"sha256:51b2ee470d1dee252727fd9b67b912ca394b450a6f62ba4fddfcc7fb71af8563","target":"graph","created_at":"2026-07-05T08:10:19Z","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/2311.00182/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We bound the smoothed running time of the FLIP algorithm for local Max-Cut as a function of $\\alpha$, the arboricity of the input graph. We show that, with high probability and in expectation, the following holds (where $n$ is the number of nodes and $\\phi$ is the smoothing parameter):\n  1) When $\\alpha = O(\\log^{1-\\delta} n)$ FLIP terminates in $\\phi poly(n)$ iterations, where $\\delta \\in (0,1]$ is an arbitrarily small constant. Previous to our results the only graph families for which FLIP was known to achieve a smoothed polynomial running time were complete graphs and graphs with logarithmi","authors_text":"Gregory Schwartzman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-10-31T23:00:14Z","title":"Local Max-Cut on Sparse Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.00182","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:bcaf47b9099b8c06de56fce166b7cc8006c8e49e59aa8e045cc1d255e277911a","target":"record","created_at":"2026-07-05T08:10:19Z","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":"0299942815330cf02ceb5e15e7f365c2b1e737f95aa2cd17e18b4f033207dad8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-10-31T23:00:14Z","title_canon_sha256":"8f8065c335b3aee5acb2b4ce9e196b71154f11b2897cd498c8ae224503d38458"},"schema_version":"1.0","source":{"id":"2311.00182","kind":"arxiv","version":3}},"canonical_sha256":"cc2b3f5a2835ea34e2459269eac4b1d28b818e154f01ce470dda34570e354b4a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cc2b3f5a2835ea34e2459269eac4b1d28b818e154f01ce470dda34570e354b4a","first_computed_at":"2026-07-05T08:10:19.296187Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:10:19.296187Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gtAEfl0Kjkr2iEGM4POW9HCRk3b3oQU7tz4un3rgaP3W2RJWTPLwoLC4GN2j6tih9rRz5u/7zY4QxTA21R8BAA==","signature_status":"signed_v1","signed_at":"2026-07-05T08:10:19.296583Z","signed_message":"canonical_sha256_bytes"},"source_id":"2311.00182","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bcaf47b9099b8c06de56fce166b7cc8006c8e49e59aa8e045cc1d255e277911a","sha256:51b2ee470d1dee252727fd9b67b912ca394b450a6f62ba4fddfcc7fb71af8563"],"state_sha256":"793bfc353ec0c0359549387bce630a53d210e67d5af6d287c0f4a99b8c06f07c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p/JJN5fuaU3LeIbFNMTJvyJwCLcOPm72p0RInAIYMWVS3Fm5Yqh+zErTHGhcY6RL9SKQYDe63t0hnIh3geNbAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-10T09:35:52.036736Z","bundle_sha256":"9ce4d080ade9199c4cfbfda0c7e51f5b52a9b9a3aa3bff76e8c98c13f6559a55"}}