{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:J7PMQW2SZS3GQVHVHB3OU3XN7W","short_pith_number":"pith:J7PMQW2S","canonical_record":{"source":{"id":"1112.3506","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-15T13:38:50Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"05eb8c43ab58ca2dff28acd17d92e5468b6790d747092ca4735c4168fd812918","abstract_canon_sha256":"0f6cd7b06b2b520f8817cf6cfa536fd6987b5ab652a5ad5e05c5d329a9f97101"},"schema_version":"1.0"},"canonical_sha256":"4fdec85b52ccb66854f53876ea6eedfd8fe4d4a668542a4ffe3bbef2fd1eacf0","source":{"kind":"arxiv","id":"1112.3506","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.3506","created_at":"2026-05-18T03:07:55Z"},{"alias_kind":"arxiv_version","alias_value":"1112.3506v3","created_at":"2026-05-18T03:07:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.3506","created_at":"2026-05-18T03:07:55Z"},{"alias_kind":"pith_short_12","alias_value":"J7PMQW2SZS3G","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"J7PMQW2SZS3GQVHV","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"J7PMQW2S","created_at":"2026-05-18T12:26:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:J7PMQW2SZS3GQVHVHB3OU3XN7W","target":"record","payload":{"canonical_record":{"source":{"id":"1112.3506","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-15T13:38:50Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"05eb8c43ab58ca2dff28acd17d92e5468b6790d747092ca4735c4168fd812918","abstract_canon_sha256":"0f6cd7b06b2b520f8817cf6cfa536fd6987b5ab652a5ad5e05c5d329a9f97101"},"schema_version":"1.0"},"canonical_sha256":"4fdec85b52ccb66854f53876ea6eedfd8fe4d4a668542a4ffe3bbef2fd1eacf0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:07:55.038918Z","signature_b64":"TaQOzLT4PoZxIu3GJYfquuBjKbTW0GI304ZMuB/Y9+IM9Yci605K/hfMJgf1AD52qdKU+0RXnOa3SnjJ7u6lBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4fdec85b52ccb66854f53876ea6eedfd8fe4d4a668542a4ffe3bbef2fd1eacf0","last_reissued_at":"2026-05-18T03:07:55.038274Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:07:55.038274Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1112.3506","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-18T03:07:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gm4Z4sERt0M+bFNbH0x1R3ovT/coG/KWP42eBrFrtoKGbJhES8eVw38XQt9FvBalkEdiwGnsH914NhWx61CUAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:16:13.096959Z"},"content_sha256":"fbae456c874961329a045a348a9650abf38a62a14405fcafc52d12621552cbc5","schema_version":"1.0","event_id":"sha256:fbae456c874961329a045a348a9650abf38a62a14405fcafc52d12621552cbc5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:J7PMQW2SZS3GQVHVHB3OU3XN7W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Max-Cut Parameterized Above the Edwards-Erd\\H{o}s Bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"cs.DS","authors_text":"Mark Jones, Matthias Mnich, Robert Crowston","submitted_at":"2011-12-15T13:38:50Z","abstract_excerpt":"We study the boundary of tractability for the Max-Cut problem in graphs. Our main result shows that Max-Cut above the Edwards-Erd\\H{o}s bound is fixed-parameter tractable: we give an algorithm that for any connected graph with n vertices and m edges finds a cut of size m/2 + (n-1)/4 + k in time 2^O(k)n^4, or decides that no such cut exists. This answers a long-standing open question from parameterized complexity that has been posed several times over the past 15 years. Our algorithm is asymptotically optimal, under the Exponential Time Hypothesis, and is strengthened by a polynomial-time compu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.3506","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-18T03:07:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZlmpMwLIf2VexuHuVKswAGJSckWJhyDe/F9qOkUY/V3hKduqDV85GIUSTTntQ9DXbu0IjRmPxO38wCbAQ2HGCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:16:13.097662Z"},"content_sha256":"515a33ed1e04ff9fad969e72257f277863aebb3b66d22018a8e758f3c4b42662","schema_version":"1.0","event_id":"sha256:515a33ed1e04ff9fad969e72257f277863aebb3b66d22018a8e758f3c4b42662"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J7PMQW2SZS3GQVHVHB3OU3XN7W/bundle.json","state_url":"https://pith.science/pith/J7PMQW2SZS3GQVHVHB3OU3XN7W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J7PMQW2SZS3GQVHVHB3OU3XN7W/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-28T20:16:13Z","links":{"resolver":"https://pith.science/pith/J7PMQW2SZS3GQVHVHB3OU3XN7W","bundle":"https://pith.science/pith/J7PMQW2SZS3GQVHVHB3OU3XN7W/bundle.json","state":"https://pith.science/pith/J7PMQW2SZS3GQVHVHB3OU3XN7W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J7PMQW2SZS3GQVHVHB3OU3XN7W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:J7PMQW2SZS3GQVHVHB3OU3XN7W","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":"0f6cd7b06b2b520f8817cf6cfa536fd6987b5ab652a5ad5e05c5d329a9f97101","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-15T13:38:50Z","title_canon_sha256":"05eb8c43ab58ca2dff28acd17d92e5468b6790d747092ca4735c4168fd812918"},"schema_version":"1.0","source":{"id":"1112.3506","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.3506","created_at":"2026-05-18T03:07:55Z"},{"alias_kind":"arxiv_version","alias_value":"1112.3506v3","created_at":"2026-05-18T03:07:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.3506","created_at":"2026-05-18T03:07:55Z"},{"alias_kind":"pith_short_12","alias_value":"J7PMQW2SZS3G","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"J7PMQW2SZS3GQVHV","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"J7PMQW2S","created_at":"2026-05-18T12:26:32Z"}],"graph_snapshots":[{"event_id":"sha256:515a33ed1e04ff9fad969e72257f277863aebb3b66d22018a8e758f3c4b42662","target":"graph","created_at":"2026-05-18T03:07:55Z","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":"We study the boundary of tractability for the Max-Cut problem in graphs. Our main result shows that Max-Cut above the Edwards-Erd\\H{o}s bound is fixed-parameter tractable: we give an algorithm that for any connected graph with n vertices and m edges finds a cut of size m/2 + (n-1)/4 + k in time 2^O(k)n^4, or decides that no such cut exists. This answers a long-standing open question from parameterized complexity that has been posed several times over the past 15 years. Our algorithm is asymptotically optimal, under the Exponential Time Hypothesis, and is strengthened by a polynomial-time compu","authors_text":"Mark Jones, Matthias Mnich, Robert Crowston","cross_cats":["cs.CC","cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-15T13:38:50Z","title":"Max-Cut Parameterized Above the Edwards-Erd\\H{o}s Bound"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.3506","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:fbae456c874961329a045a348a9650abf38a62a14405fcafc52d12621552cbc5","target":"record","created_at":"2026-05-18T03:07:55Z","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":"0f6cd7b06b2b520f8817cf6cfa536fd6987b5ab652a5ad5e05c5d329a9f97101","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-15T13:38:50Z","title_canon_sha256":"05eb8c43ab58ca2dff28acd17d92e5468b6790d747092ca4735c4168fd812918"},"schema_version":"1.0","source":{"id":"1112.3506","kind":"arxiv","version":3}},"canonical_sha256":"4fdec85b52ccb66854f53876ea6eedfd8fe4d4a668542a4ffe3bbef2fd1eacf0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4fdec85b52ccb66854f53876ea6eedfd8fe4d4a668542a4ffe3bbef2fd1eacf0","first_computed_at":"2026-05-18T03:07:55.038274Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:07:55.038274Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TaQOzLT4PoZxIu3GJYfquuBjKbTW0GI304ZMuB/Y9+IM9Yci605K/hfMJgf1AD52qdKU+0RXnOa3SnjJ7u6lBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:07:55.038918Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.3506","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fbae456c874961329a045a348a9650abf38a62a14405fcafc52d12621552cbc5","sha256:515a33ed1e04ff9fad969e72257f277863aebb3b66d22018a8e758f3c4b42662"],"state_sha256":"764b2acaad38a38c58aeb33991a821b2f4b83864f2a32d8cf2516814bf860874"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f6DkOFFbnTZmKFxpeMI8Q/V2mvW0EjPUh+EDAgzBYOvhwHYGYjVSjkHB7zvxiU/AqyXe2Flg923aw6qXmEfCCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T20:16:13.101349Z","bundle_sha256":"08e0a51fb4408470d10742621d9fe011a4a4783b4f62e37b3227282d84f10298"}}