{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:SARBJWVRTIWFV2EXRXVL5WVLH3","short_pith_number":"pith:SARBJWVR","schema_version":"1.0","canonical_sha256":"902214dab19a2c5ae8978deabedaab3ee5310b3d7be28424aaed3a6a3b54cdc8","source":{"kind":"arxiv","id":"1509.03976","version":1},"attestation_state":"computed","paper":{"title":"Approximability of TSP 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":"2015-09-14T07:50:27Z","abstract_excerpt":"In this paper we study the special case of Graphic TSP where the underlying graph is a power law graph (PLG). We give a refined analysis of some of the current best approximation algorithms and show that an improved approximation ratio can be achieved for certain ranges of the power law exponent $\\beta$. For the value of power law exponent $\\beta=1.5$ we obtain an approximation ratio of $1.34$ for Graphic TSP. Moreover we study the $(1,2)$-TSP with the underlying graph of $1$-edges being a PLG. We show improved approximation ratios in the case of underlying deterministic PLGs for $\\beta$ great"},"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":"1509.03976","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-14T07:50:27Z","cross_cats_sorted":["cs.CC","cs.DM","math.CO","math.OC"],"title_canon_sha256":"23ee0321df1f02c67b4e6ff657d158fde25d94024416a5ae8ea7d04ffd02e314","abstract_canon_sha256":"16b90f162012862cfa06795375dd1bea4992f82843506dc12d40724e4ee0a78d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:08.587601Z","signature_b64":"wkEroT4yipg3PVIFLFStmFaiFoeHmWFDXWbH1EUnNtVErYMsibPtaiZrRySryHM6Yux+aRGgU8GsZ1wcZ8lrAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"902214dab19a2c5ae8978deabedaab3ee5310b3d7be28424aaed3a6a3b54cdc8","last_reissued_at":"2026-05-18T01:33:08.587088Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:08.587088Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximability of TSP 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":"2015-09-14T07:50:27Z","abstract_excerpt":"In this paper we study the special case of Graphic TSP where the underlying graph is a power law graph (PLG). We give a refined analysis of some of the current best approximation algorithms and show that an improved approximation ratio can be achieved for certain ranges of the power law exponent $\\beta$. For the value of power law exponent $\\beta=1.5$ we obtain an approximation ratio of $1.34$ for Graphic TSP. Moreover we study the $(1,2)$-TSP with the underlying graph of $1$-edges being a PLG. We show improved approximation ratios in the case of underlying deterministic PLGs for $\\beta$ great"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.03976","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":"1509.03976","created_at":"2026-05-18T01:33:08.587187+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.03976v1","created_at":"2026-05-18T01:33:08.587187+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.03976","created_at":"2026-05-18T01:33:08.587187+00:00"},{"alias_kind":"pith_short_12","alias_value":"SARBJWVRTIWF","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"SARBJWVRTIWFV2EX","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"SARBJWVR","created_at":"2026-05-18T12:29:39.896362+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/SARBJWVRTIWFV2EXRXVL5WVLH3","json":"https://pith.science/pith/SARBJWVRTIWFV2EXRXVL5WVLH3.json","graph_json":"https://pith.science/api/pith-number/SARBJWVRTIWFV2EXRXVL5WVLH3/graph.json","events_json":"https://pith.science/api/pith-number/SARBJWVRTIWFV2EXRXVL5WVLH3/events.json","paper":"https://pith.science/paper/SARBJWVR"},"agent_actions":{"view_html":"https://pith.science/pith/SARBJWVRTIWFV2EXRXVL5WVLH3","download_json":"https://pith.science/pith/SARBJWVRTIWFV2EXRXVL5WVLH3.json","view_paper":"https://pith.science/paper/SARBJWVR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.03976&json=true","fetch_graph":"https://pith.science/api/pith-number/SARBJWVRTIWFV2EXRXVL5WVLH3/graph.json","fetch_events":"https://pith.science/api/pith-number/SARBJWVRTIWFV2EXRXVL5WVLH3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SARBJWVRTIWFV2EXRXVL5WVLH3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SARBJWVRTIWFV2EXRXVL5WVLH3/action/storage_attestation","attest_author":"https://pith.science/pith/SARBJWVRTIWFV2EXRXVL5WVLH3/action/author_attestation","sign_citation":"https://pith.science/pith/SARBJWVRTIWFV2EXRXVL5WVLH3/action/citation_signature","submit_replication":"https://pith.science/pith/SARBJWVRTIWFV2EXRXVL5WVLH3/action/replication_record"}},"created_at":"2026-05-18T01:33:08.587187+00:00","updated_at":"2026-05-18T01:33:08.587187+00:00"}