{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:TM3L5DRZ7EH66Z2BB3EQN6SLBH","short_pith_number":"pith:TM3L5DRZ","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"},"canonical_sha256":"9b36be8e39f90fef67410ec906fa4b09ea7c6515c32cff383adae7ead161b157","source":{"kind":"arxiv","id":"1410.8816","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.8816","created_at":"2026-05-18T01:22:41Z"},{"alias_kind":"arxiv_version","alias_value":"1410.8816v5","created_at":"2026-05-18T01:22:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.8816","created_at":"2026-05-18T01:22:41Z"},{"alias_kind":"pith_short_12","alias_value":"TM3L5DRZ7EH6","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"TM3L5DRZ7EH66Z2B","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"TM3L5DRZ","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:TM3L5DRZ7EH66Z2BB3EQN6SLBH","target":"record","payload":{"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"},"canonical_sha256":"9b36be8e39f90fef67410ec906fa4b09ea7c6515c32cff383adae7ead161b157","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"},"source_kind":"arxiv","source_id":"1410.8816","source_version":5,"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:22:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DsRmpwqkLcUz690H40Qqb0UGkG/lNwKofViZRk218jwJ4nAPIXWADRNRzV0kS2hijDEgLuee9KsyUiVL9aibBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T02:07:24.969541Z"},"content_sha256":"78436bce15b82ca61d30c4220fb076ac9b84f286e7dff480adeeeee7088c0401","schema_version":"1.0","event_id":"sha256:78436bce15b82ca61d30c4220fb076ac9b84f286e7dff480adeeeee7088c0401"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:TM3L5DRZ7EH66Z2BB3EQN6SLBH","target":"graph","payload":{"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"},"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:22:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RYYhCbL98Y7c8YVK5rIhZEdGblF9q6ZQ5kk1+y9cwaSwuCZ1X5Pb72DBRn3BAoItG8OG9lJbq+uHt+TSd2lMCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T02:07:24.970190Z"},"content_sha256":"22e90f8aaddb8f287d8f820ae1c36100c6443fa1e5d638b3efe003ea22b5ceb6","schema_version":"1.0","event_id":"sha256:22e90f8aaddb8f287d8f820ae1c36100c6443fa1e5d638b3efe003ea22b5ceb6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TM3L5DRZ7EH66Z2BB3EQN6SLBH/bundle.json","state_url":"https://pith.science/pith/TM3L5DRZ7EH66Z2BB3EQN6SLBH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TM3L5DRZ7EH66Z2BB3EQN6SLBH/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-24T02:07:24Z","links":{"resolver":"https://pith.science/pith/TM3L5DRZ7EH66Z2BB3EQN6SLBH","bundle":"https://pith.science/pith/TM3L5DRZ7EH66Z2BB3EQN6SLBH/bundle.json","state":"https://pith.science/pith/TM3L5DRZ7EH66Z2BB3EQN6SLBH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TM3L5DRZ7EH66Z2BB3EQN6SLBH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:TM3L5DRZ7EH66Z2BB3EQN6SLBH","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":"51a4b3cebcfeaee9205620d99b6dfabd3f11d56f5ded86496a3e73959f197289","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-10-31T17:12:00Z","title_canon_sha256":"08956b1fb3ef231130978bceba9185b6e97d827f55ae240270cb229772b47103"},"schema_version":"1.0","source":{"id":"1410.8816","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.8816","created_at":"2026-05-18T01:22:41Z"},{"alias_kind":"arxiv_version","alias_value":"1410.8816v5","created_at":"2026-05-18T01:22:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.8816","created_at":"2026-05-18T01:22:41Z"},{"alias_kind":"pith_short_12","alias_value":"TM3L5DRZ7EH6","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"TM3L5DRZ7EH66Z2B","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"TM3L5DRZ","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:22e90f8aaddb8f287d8f820ae1c36100c6443fa1e5d638b3efe003ea22b5ceb6","target":"graph","created_at":"2026-05-18T01:22:41Z","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":"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:","authors_text":"Daniel Zink, G\\'abor Braun, Sebastian Pokutta","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-10-31T17:12:00Z","title":"Affine reductions for LPs and SDPs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.8816","kind":"arxiv","version":5},"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:78436bce15b82ca61d30c4220fb076ac9b84f286e7dff480adeeeee7088c0401","target":"record","created_at":"2026-05-18T01:22:41Z","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":"51a4b3cebcfeaee9205620d99b6dfabd3f11d56f5ded86496a3e73959f197289","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-10-31T17:12:00Z","title_canon_sha256":"08956b1fb3ef231130978bceba9185b6e97d827f55ae240270cb229772b47103"},"schema_version":"1.0","source":{"id":"1410.8816","kind":"arxiv","version":5}},"canonical_sha256":"9b36be8e39f90fef67410ec906fa4b09ea7c6515c32cff383adae7ead161b157","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9b36be8e39f90fef67410ec906fa4b09ea7c6515c32cff383adae7ead161b157","first_computed_at":"2026-05-18T01:22:41.729399Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:22:41.729399Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9mTP3xtneMjoje7G6EMRkNP/yVmqk05kQ7VSS8agcPbBFm3clpi+zFiTEfgWMS8B6jRAAH2/Q6fS8J7mGVo1Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T01:22:41.729913Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.8816","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:78436bce15b82ca61d30c4220fb076ac9b84f286e7dff480adeeeee7088c0401","sha256:22e90f8aaddb8f287d8f820ae1c36100c6443fa1e5d638b3efe003ea22b5ceb6"],"state_sha256":"3906444a9c7a82864544ad20a2355dda85945bc1dd05affdd8e6d0dff3163893"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bWB2l6zHWB1V+uXFz5bD5qb+X8ewqaQAoKmGLNM/3bHrnrhTeGpSh2y+s3GIk0wdaILcaGSI9kVlexf0Q03/Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T02:07:24.973218Z","bundle_sha256":"04347e51abf1c36b4ff84bd5b72de92d4a26ef7b791f3cf48085c6dc85b52b1c"}}