{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:KHTE6PJOSGPB365CAWGI52OAMH","short_pith_number":"pith:KHTE6PJO","schema_version":"1.0","canonical_sha256":"51e64f3d2e919e1dfba2058c8ee9c061c0ce3caef5ecbea314c614e9643f87ba","source":{"kind":"arxiv","id":"1602.08369","version":1},"attestation_state":"computed","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1602.08369","created_at":"2026-05-18T01:19:56.216819+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.08369v1","created_at":"2026-05-18T01:19:56.216819+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.08369","created_at":"2026-05-18T01:19:56.216819+00:00"},{"alias_kind":"pith_short_12","alias_value":"KHTE6PJOSGPB","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"KHTE6PJOSGPB365C","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"KHTE6PJO","created_at":"2026-05-18T12:30:25.849896+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KHTE6PJOSGPB365CAWGI52OAMH","json":"https://pith.science/pith/KHTE6PJOSGPB365CAWGI52OAMH.json","graph_json":"https://pith.science/api/pith-number/KHTE6PJOSGPB365CAWGI52OAMH/graph.json","events_json":"https://pith.science/api/pith-number/KHTE6PJOSGPB365CAWGI52OAMH/events.json","paper":"https://pith.science/paper/KHTE6PJO"},"agent_actions":{"view_html":"https://pith.science/pith/KHTE6PJOSGPB365CAWGI52OAMH","download_json":"https://pith.science/pith/KHTE6PJOSGPB365CAWGI52OAMH.json","view_paper":"https://pith.science/paper/KHTE6PJO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.08369&json=true","fetch_graph":"https://pith.science/api/pith-number/KHTE6PJOSGPB365CAWGI52OAMH/graph.json","fetch_events":"https://pith.science/api/pith-number/KHTE6PJOSGPB365CAWGI52OAMH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KHTE6PJOSGPB365CAWGI52OAMH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KHTE6PJOSGPB365CAWGI52OAMH/action/storage_attestation","attest_author":"https://pith.science/pith/KHTE6PJOSGPB365CAWGI52OAMH/action/author_attestation","sign_citation":"https://pith.science/pith/KHTE6PJOSGPB365CAWGI52OAMH/action/citation_signature","submit_replication":"https://pith.science/pith/KHTE6PJOSGPB365CAWGI52OAMH/action/replication_record"}},"created_at":"2026-05-18T01:19:56.216819+00:00","updated_at":"2026-05-18T01:19:56.216819+00:00"}