{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:DCSKF4C5GM4PZ2UN6O5GL6XNH5","short_pith_number":"pith:DCSKF4C5","schema_version":"1.0","canonical_sha256":"18a4a2f05d3338fcea8df3ba65faed3f4867ffe7707e92c61264a4dd63548e2b","source":{"kind":"arxiv","id":"1503.02880","version":1},"attestation_state":"computed","paper":{"title":"On the Approximability of Independent Set Problem on Power Law Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO","math.OC"],"primary_cat":"cs.DS","authors_text":"Marek Karpinski, Mathias Hauptmann","submitted_at":"2015-03-10T12:18:44Z","abstract_excerpt":"We give the first nonconstant lower bounds for the approximability of the Independent Set Problem on the Power Law Graphs. These bounds are of the form $n^{\\epsilon}$ in the case when the power law exponent satisfies $\\beta <1$. In the case when $\\beta =1$, the lower bound is of the form $\\log (n)^{\\epsilon}$. The embedding technique used in the proof could also be of independent interest."},"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":"1503.02880","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-10T12:18:44Z","cross_cats_sorted":["cs.DM","math.CO","math.OC"],"title_canon_sha256":"138120dd34ab537e287d1ae3df1a25aa875d4d9defa840f035a51a74d07c5a3a","abstract_canon_sha256":"18a58754ba9bcfefde0b1cad2e97c53712d262a6d99d0d0c4afaed8adfa28f30"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:12.849714Z","signature_b64":"Yu6L6U18jJ5wpfpZ2P/Pu1Awm4gtZa6n1WpLmxgwVNetfac33FI/jVZfsm5lu+ToaDRO/hQrWuoH0c1ZDS9cCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18a4a2f05d3338fcea8df3ba65faed3f4867ffe7707e92c61264a4dd63548e2b","last_reissued_at":"2026-05-18T02:25:12.849134Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:12.849134Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Approximability of Independent Set Problem on Power Law Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO","math.OC"],"primary_cat":"cs.DS","authors_text":"Marek Karpinski, Mathias Hauptmann","submitted_at":"2015-03-10T12:18:44Z","abstract_excerpt":"We give the first nonconstant lower bounds for the approximability of the Independent Set Problem on the Power Law Graphs. These bounds are of the form $n^{\\epsilon}$ in the case when the power law exponent satisfies $\\beta <1$. In the case when $\\beta =1$, the lower bound is of the form $\\log (n)^{\\epsilon}$. The embedding technique used in the proof could also be of independent interest."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.02880","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":"1503.02880","created_at":"2026-05-18T02:25:12.849229+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.02880v1","created_at":"2026-05-18T02:25:12.849229+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.02880","created_at":"2026-05-18T02:25:12.849229+00:00"},{"alias_kind":"pith_short_12","alias_value":"DCSKF4C5GM4P","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"DCSKF4C5GM4PZ2UN","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"DCSKF4C5","created_at":"2026-05-18T12:29:17.054201+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/DCSKF4C5GM4PZ2UN6O5GL6XNH5","json":"https://pith.science/pith/DCSKF4C5GM4PZ2UN6O5GL6XNH5.json","graph_json":"https://pith.science/api/pith-number/DCSKF4C5GM4PZ2UN6O5GL6XNH5/graph.json","events_json":"https://pith.science/api/pith-number/DCSKF4C5GM4PZ2UN6O5GL6XNH5/events.json","paper":"https://pith.science/paper/DCSKF4C5"},"agent_actions":{"view_html":"https://pith.science/pith/DCSKF4C5GM4PZ2UN6O5GL6XNH5","download_json":"https://pith.science/pith/DCSKF4C5GM4PZ2UN6O5GL6XNH5.json","view_paper":"https://pith.science/paper/DCSKF4C5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.02880&json=true","fetch_graph":"https://pith.science/api/pith-number/DCSKF4C5GM4PZ2UN6O5GL6XNH5/graph.json","fetch_events":"https://pith.science/api/pith-number/DCSKF4C5GM4PZ2UN6O5GL6XNH5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DCSKF4C5GM4PZ2UN6O5GL6XNH5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DCSKF4C5GM4PZ2UN6O5GL6XNH5/action/storage_attestation","attest_author":"https://pith.science/pith/DCSKF4C5GM4PZ2UN6O5GL6XNH5/action/author_attestation","sign_citation":"https://pith.science/pith/DCSKF4C5GM4PZ2UN6O5GL6XNH5/action/citation_signature","submit_replication":"https://pith.science/pith/DCSKF4C5GM4PZ2UN6O5GL6XNH5/action/replication_record"}},"created_at":"2026-05-18T02:25:12.849229+00:00","updated_at":"2026-05-18T02:25:12.849229+00:00"}