{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:TM3L5DRZ7EH66Z2BB3EQN6SLBH","short_pith_number":"pith:TM3L5DRZ","schema_version":"1.0","canonical_sha256":"9b36be8e39f90fef67410ec906fa4b09ea7c6515c32cff383adae7ead161b157","source":{"kind":"arxiv","id":"1410.8816","version":5},"attestation_state":"computed","paper":{"title":"Affine reductions for LPs and SDPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Daniel Zink, G\\'abor Braun, Sebastian Pokutta","submitted_at":"2014-10-31T17:12:00Z","abstract_excerpt":"We define a reduction mechanism for LP and SDP formulations that degrades approximation factors in a controlled fashion. Our reduction mechanism is a minor restriction of classical reductions establishing inapproximability in the context of PCP theorems. As a consequence we establish strong linear programming inapproximability (for LPs with a polynomial number of constraints) for many problems. In particular we obtain a $3/2-\\varepsilon$ inapproximability for VertexCover answering an open question in [arXiv:1309.0563] and we answer a weak version of our sparse graph conjecture posed in [arXiv:"},"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":"1410.8816","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-10-31T17:12:00Z","cross_cats_sorted":[],"title_canon_sha256":"08956b1fb3ef231130978bceba9185b6e97d827f55ae240270cb229772b47103","abstract_canon_sha256":"51a4b3cebcfeaee9205620d99b6dfabd3f11d56f5ded86496a3e73959f197289"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:41.729913Z","signature_b64":"9mTP3xtneMjoje7G6EMRkNP/yVmqk05kQ7VSS8agcPbBFm3clpi+zFiTEfgWMS8B6jRAAH2/Q6fS8J7mGVo1Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b36be8e39f90fef67410ec906fa4b09ea7c6515c32cff383adae7ead161b157","last_reissued_at":"2026-05-18T01:22:41.729399Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:41.729399Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Affine reductions for LPs and SDPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Daniel Zink, G\\'abor Braun, Sebastian Pokutta","submitted_at":"2014-10-31T17:12:00Z","abstract_excerpt":"We define a reduction mechanism for LP and SDP formulations that degrades approximation factors in a controlled fashion. Our reduction mechanism is a minor restriction of classical reductions establishing inapproximability in the context of PCP theorems. As a consequence we establish strong linear programming inapproximability (for LPs with a polynomial number of constraints) for many problems. In particular we obtain a $3/2-\\varepsilon$ inapproximability for VertexCover answering an open question in [arXiv:1309.0563] and we answer a weak version of our sparse graph conjecture posed in [arXiv:"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.8816","kind":"arxiv","version":5},"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":"1410.8816","created_at":"2026-05-18T01:22:41.729485+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.8816v5","created_at":"2026-05-18T01:22:41.729485+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.8816","created_at":"2026-05-18T01:22:41.729485+00:00"},{"alias_kind":"pith_short_12","alias_value":"TM3L5DRZ7EH6","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"TM3L5DRZ7EH66Z2B","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"TM3L5DRZ","created_at":"2026-05-18T12:28:49.207871+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/TM3L5DRZ7EH66Z2BB3EQN6SLBH","json":"https://pith.science/pith/TM3L5DRZ7EH66Z2BB3EQN6SLBH.json","graph_json":"https://pith.science/api/pith-number/TM3L5DRZ7EH66Z2BB3EQN6SLBH/graph.json","events_json":"https://pith.science/api/pith-number/TM3L5DRZ7EH66Z2BB3EQN6SLBH/events.json","paper":"https://pith.science/paper/TM3L5DRZ"},"agent_actions":{"view_html":"https://pith.science/pith/TM3L5DRZ7EH66Z2BB3EQN6SLBH","download_json":"https://pith.science/pith/TM3L5DRZ7EH66Z2BB3EQN6SLBH.json","view_paper":"https://pith.science/paper/TM3L5DRZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.8816&json=true","fetch_graph":"https://pith.science/api/pith-number/TM3L5DRZ7EH66Z2BB3EQN6SLBH/graph.json","fetch_events":"https://pith.science/api/pith-number/TM3L5DRZ7EH66Z2BB3EQN6SLBH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TM3L5DRZ7EH66Z2BB3EQN6SLBH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TM3L5DRZ7EH66Z2BB3EQN6SLBH/action/storage_attestation","attest_author":"https://pith.science/pith/TM3L5DRZ7EH66Z2BB3EQN6SLBH/action/author_attestation","sign_citation":"https://pith.science/pith/TM3L5DRZ7EH66Z2BB3EQN6SLBH/action/citation_signature","submit_replication":"https://pith.science/pith/TM3L5DRZ7EH66Z2BB3EQN6SLBH/action/replication_record"}},"created_at":"2026-05-18T01:22:41.729485+00:00","updated_at":"2026-05-18T01:22:41.729485+00:00"}