{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:KHTE6PJOSGPB365CAWGI52OAMH","short_pith_number":"pith:KHTE6PJO","canonical_record":{"source":{"id":"1602.08369","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-26T15:32:29Z","cross_cats_sorted":["cs.CC","cs.DM","math.CO","math.OC"],"title_canon_sha256":"660ab63e5ec69f3a95bc4e7897b34a7302bf7e2f8d4e523b7a908b4cbc28c37a","abstract_canon_sha256":"0ddba9d2c30c496fcd0fa2122a00565b5e225f7ea9b480e34eee0ebbf17ef963"},"schema_version":"1.0"},"canonical_sha256":"51e64f3d2e919e1dfba2058c8ee9c061c0ce3caef5ecbea314c614e9643f87ba","source":{"kind":"arxiv","id":"1602.08369","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.08369","created_at":"2026-05-18T01:19:56Z"},{"alias_kind":"arxiv_version","alias_value":"1602.08369v1","created_at":"2026-05-18T01:19:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.08369","created_at":"2026-05-18T01:19:56Z"},{"alias_kind":"pith_short_12","alias_value":"KHTE6PJOSGPB","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"KHTE6PJOSGPB365C","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"KHTE6PJO","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:KHTE6PJOSGPB365CAWGI52OAMH","target":"record","payload":{"canonical_record":{"source":{"id":"1602.08369","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-26T15:32:29Z","cross_cats_sorted":["cs.CC","cs.DM","math.CO","math.OC"],"title_canon_sha256":"660ab63e5ec69f3a95bc4e7897b34a7302bf7e2f8d4e523b7a908b4cbc28c37a","abstract_canon_sha256":"0ddba9d2c30c496fcd0fa2122a00565b5e225f7ea9b480e34eee0ebbf17ef963"},"schema_version":"1.0"},"canonical_sha256":"51e64f3d2e919e1dfba2058c8ee9c061c0ce3caef5ecbea314c614e9643f87ba","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:56.217360Z","signature_b64":"whCF3+Ca9Lhc6gend+PKsWefTOkHbgrIOVdGrGv3Aig7ujdGoGSKA/Xvn3a6/pA6LmuLYzzuja6zf0a+tQ09Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51e64f3d2e919e1dfba2058c8ee9c061c0ce3caef5ecbea314c614e9643f87ba","last_reissued_at":"2026-05-18T01:19:56.216726Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:56.216726Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.08369","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-05-18T01:19:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NSuu95V5xNFpsufUfJH9PDe/GdmQrwz8CMY5VRf6WadAE4+gF86DajApSyuaaf3rjf+C+ks5wiq2OL2n8iQTCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:54:22.882409Z"},"content_sha256":"73b59f07d146f2fa628483420d52f4788ba83b6214da807cc3fad7f7600934c1","schema_version":"1.0","event_id":"sha256:73b59f07d146f2fa628483420d52f4788ba83b6214da807cc3fad7f7600934c1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:KHTE6PJOSGPB365CAWGI52OAMH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximation Complexity of Max-Cut on Power Law Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","math.CO","math.OC"],"primary_cat":"cs.DS","authors_text":"Marek Karpinski, Mathias Hauptmann, Mikael Gast","submitted_at":"2016-02-26T15:32:29Z","abstract_excerpt":"In this paper we study the MAX-CUT problem on power law graphs (PLGs) with power law exponent $\\beta$. We prove some new approximability results on that problem. In particular we show that there exist polynomial time approximation schemes (PTAS) for MAX-CUT on PLGs for the power law exponent $\\beta$ in the interval $(0,2)$. For $\\beta>2$ we show that for some $\\epsilon>0$, MAX-CUT is NP-hard to approximate within approximation ratio $1+\\epsilon$, ruling out the existence of a PTAS in this case. Moreover we give an approximation algorithm with improved constant approximation ratio for the case "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.08369","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":""},"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-18T01:19:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LYcajt3AaHAvynrQ58uQM00faFdJh1Vmb5XiR0qlTChWmk41PkK2xOU4kNUXyFhduqLF0KV3kM/806P0qmOVDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:54:22.882754Z"},"content_sha256":"6d3b86cbfa38c8fa9e814f3b2bad36299c476bff4578462bdef2c4b82a24dec5","schema_version":"1.0","event_id":"sha256:6d3b86cbfa38c8fa9e814f3b2bad36299c476bff4578462bdef2c4b82a24dec5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KHTE6PJOSGPB365CAWGI52OAMH/bundle.json","state_url":"https://pith.science/pith/KHTE6PJOSGPB365CAWGI52OAMH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KHTE6PJOSGPB365CAWGI52OAMH/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-28T12:54:22Z","links":{"resolver":"https://pith.science/pith/KHTE6PJOSGPB365CAWGI52OAMH","bundle":"https://pith.science/pith/KHTE6PJOSGPB365CAWGI52OAMH/bundle.json","state":"https://pith.science/pith/KHTE6PJOSGPB365CAWGI52OAMH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KHTE6PJOSGPB365CAWGI52OAMH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:KHTE6PJOSGPB365CAWGI52OAMH","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":"0ddba9d2c30c496fcd0fa2122a00565b5e225f7ea9b480e34eee0ebbf17ef963","cross_cats_sorted":["cs.CC","cs.DM","math.CO","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-26T15:32:29Z","title_canon_sha256":"660ab63e5ec69f3a95bc4e7897b34a7302bf7e2f8d4e523b7a908b4cbc28c37a"},"schema_version":"1.0","source":{"id":"1602.08369","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.08369","created_at":"2026-05-18T01:19:56Z"},{"alias_kind":"arxiv_version","alias_value":"1602.08369v1","created_at":"2026-05-18T01:19:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.08369","created_at":"2026-05-18T01:19:56Z"},{"alias_kind":"pith_short_12","alias_value":"KHTE6PJOSGPB","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"KHTE6PJOSGPB365C","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"KHTE6PJO","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:6d3b86cbfa38c8fa9e814f3b2bad36299c476bff4578462bdef2c4b82a24dec5","target":"graph","created_at":"2026-05-18T01:19:56Z","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 this paper we study the MAX-CUT problem on power law graphs (PLGs) with power law exponent $\\beta$. We prove some new approximability results on that problem. In particular we show that there exist polynomial time approximation schemes (PTAS) for MAX-CUT on PLGs for the power law exponent $\\beta$ in the interval $(0,2)$. For $\\beta>2$ we show that for some $\\epsilon>0$, MAX-CUT is NP-hard to approximate within approximation ratio $1+\\epsilon$, ruling out the existence of a PTAS in this case. Moreover we give an approximation algorithm with improved constant approximation ratio for the case ","authors_text":"Marek Karpinski, Mathias Hauptmann, Mikael Gast","cross_cats":["cs.CC","cs.DM","math.CO","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-26T15:32:29Z","title":"Approximation Complexity of Max-Cut on Power Law Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.08369","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:73b59f07d146f2fa628483420d52f4788ba83b6214da807cc3fad7f7600934c1","target":"record","created_at":"2026-05-18T01:19:56Z","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":"0ddba9d2c30c496fcd0fa2122a00565b5e225f7ea9b480e34eee0ebbf17ef963","cross_cats_sorted":["cs.CC","cs.DM","math.CO","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-26T15:32:29Z","title_canon_sha256":"660ab63e5ec69f3a95bc4e7897b34a7302bf7e2f8d4e523b7a908b4cbc28c37a"},"schema_version":"1.0","source":{"id":"1602.08369","kind":"arxiv","version":1}},"canonical_sha256":"51e64f3d2e919e1dfba2058c8ee9c061c0ce3caef5ecbea314c614e9643f87ba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"51e64f3d2e919e1dfba2058c8ee9c061c0ce3caef5ecbea314c614e9643f87ba","first_computed_at":"2026-05-18T01:19:56.216726Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:56.216726Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"whCF3+Ca9Lhc6gend+PKsWefTOkHbgrIOVdGrGv3Aig7ujdGoGSKA/Xvn3a6/pA6LmuLYzzuja6zf0a+tQ09Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:56.217360Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.08369","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:73b59f07d146f2fa628483420d52f4788ba83b6214da807cc3fad7f7600934c1","sha256:6d3b86cbfa38c8fa9e814f3b2bad36299c476bff4578462bdef2c4b82a24dec5"],"state_sha256":"0c597b3c7d353692e7bef78f049f1e0078124bd9a8e704f2e6b7948cc4bacc8a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sU6P1oJewqQR4on8BCm00fwHWp3m7hZ3Aiv0IJRT1z6x+nKrZxPFsiwSiijvla/6u6arJ4JcYVdYxHE2eUmyDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T12:54:22.884705Z","bundle_sha256":"7b3607d497851ceb130e1aa067230fce917a55c81229f5431561da60c4b86e5d"}}