{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:5ME4MM3ZLV6XCIXDWVQJSK3OQJ","short_pith_number":"pith:5ME4MM3Z","schema_version":"1.0","canonical_sha256":"eb09c633795d7d7122e3b560992b6e82584b5b6625a6e2d20029fb5ac1fa917b","source":{"kind":"arxiv","id":"1512.04932","version":3},"attestation_state":"computed","paper":{"title":"Strong reductions for extended formulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Aurko Roy, G\\'abor Braun, Sebastian Pokutta","submitted_at":"2015-12-15T20:50:27Z","abstract_excerpt":"We generalize the reduction mechanism for linear programming problems and semidefinite programming problems from [arXiv:1410.8816] in two ways 1) relaxing the requirement of affineness and 2) extending to fractional optimization problems. As applications we provide several new LP-hardness and SDP-hardness results, e.g., for the SparsestCut problem, the BalancedSeparator problem, the MaxCut problem and the Matching problem on 3-regular graphs. We also provide a new, very strong Lasserre integrality gap result for the IndependentSet problem, which is strictly greater than the best known LP appro"},"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":"1512.04932","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-12-15T20:50:27Z","cross_cats_sorted":[],"title_canon_sha256":"a7622affb7afe1088d33607e9a2cc30b3b799e50039d053147c349ab35d1aa55","abstract_canon_sha256":"a4c9972835c6ad6498dd623225065a3d27449917da74d02a71066c6d2d4cdd50"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:46.033697Z","signature_b64":"jYs9rZOA4zyNRc34ZY6h8TFermIxS7HVZUlOJYKpbfpR9vm64m5A/JKoIGSe60cglAKHtOl4OqO7/k7WqjO5DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb09c633795d7d7122e3b560992b6e82584b5b6625a6e2d20029fb5ac1fa917b","last_reissued_at":"2026-05-18T00:02:46.033226Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:46.033226Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Strong reductions for extended formulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Aurko Roy, G\\'abor Braun, Sebastian Pokutta","submitted_at":"2015-12-15T20:50:27Z","abstract_excerpt":"We generalize the reduction mechanism for linear programming problems and semidefinite programming problems from [arXiv:1410.8816] in two ways 1) relaxing the requirement of affineness and 2) extending to fractional optimization problems. As applications we provide several new LP-hardness and SDP-hardness results, e.g., for the SparsestCut problem, the BalancedSeparator problem, the MaxCut problem and the Matching problem on 3-regular graphs. We also provide a new, very strong Lasserre integrality gap result for the IndependentSet problem, which is strictly greater than the best known LP appro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.04932","kind":"arxiv","version":3},"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":"1512.04932","created_at":"2026-05-18T00:02:46.033276+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.04932v3","created_at":"2026-05-18T00:02:46.033276+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.04932","created_at":"2026-05-18T00:02:46.033276+00:00"},{"alias_kind":"pith_short_12","alias_value":"5ME4MM3ZLV6X","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"5ME4MM3ZLV6XCIXD","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"5ME4MM3Z","created_at":"2026-05-18T12:29:05.191682+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/5ME4MM3ZLV6XCIXDWVQJSK3OQJ","json":"https://pith.science/pith/5ME4MM3ZLV6XCIXDWVQJSK3OQJ.json","graph_json":"https://pith.science/api/pith-number/5ME4MM3ZLV6XCIXDWVQJSK3OQJ/graph.json","events_json":"https://pith.science/api/pith-number/5ME4MM3ZLV6XCIXDWVQJSK3OQJ/events.json","paper":"https://pith.science/paper/5ME4MM3Z"},"agent_actions":{"view_html":"https://pith.science/pith/5ME4MM3ZLV6XCIXDWVQJSK3OQJ","download_json":"https://pith.science/pith/5ME4MM3ZLV6XCIXDWVQJSK3OQJ.json","view_paper":"https://pith.science/paper/5ME4MM3Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.04932&json=true","fetch_graph":"https://pith.science/api/pith-number/5ME4MM3ZLV6XCIXDWVQJSK3OQJ/graph.json","fetch_events":"https://pith.science/api/pith-number/5ME4MM3ZLV6XCIXDWVQJSK3OQJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5ME4MM3ZLV6XCIXDWVQJSK3OQJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5ME4MM3ZLV6XCIXDWVQJSK3OQJ/action/storage_attestation","attest_author":"https://pith.science/pith/5ME4MM3ZLV6XCIXDWVQJSK3OQJ/action/author_attestation","sign_citation":"https://pith.science/pith/5ME4MM3ZLV6XCIXDWVQJSK3OQJ/action/citation_signature","submit_replication":"https://pith.science/pith/5ME4MM3ZLV6XCIXDWVQJSK3OQJ/action/replication_record"}},"created_at":"2026-05-18T00:02:46.033276+00:00","updated_at":"2026-05-18T00:02:46.033276+00:00"}