{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:CFUK32JSVA627DMOJS2SOISZ44","short_pith_number":"pith:CFUK32JS","schema_version":"1.0","canonical_sha256":"1168ade932a83daf8d8e4cb5272259e701cb73122b4ca4b04171e72f93ca1a1c","source":{"kind":"arxiv","id":"1711.06656","version":1},"attestation_state":"computed","paper":{"title":"A Parallelizable Acceleration Framework for Packing Linear Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","stat.ML"],"primary_cat":"math.OC","authors_text":"Adam Wierman, Hanling Yi, Palma London, Shai Vardi","submitted_at":"2017-11-17T18:17:01Z","abstract_excerpt":"This paper presents an acceleration framework for packing linear programming problems where the amount of data available is limited, i.e., where the number of constraints m is small compared to the variable dimension n. The framework can be used as a black box to speed up linear programming solvers dramatically, by two orders of magnitude in our experiments. We present worst-case guarantees on the quality of the solution and the speedup provided by the algorithm, showing that the framework provides an approximately optimal solution while running the original solver on a much smaller problem. T"},"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":"1711.06656","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-17T18:17:01Z","cross_cats_sorted":["cs.NA","stat.ML"],"title_canon_sha256":"4fe96c1d7ba966d2c52a656abcfa6e90b84a435c5d16c55305dab5611947f026","abstract_canon_sha256":"f3e2e6164203638cdf6a1c0e8dc269644253400ba278c34a6a986a78f8c0f177"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:18.294893Z","signature_b64":"zYRHdsaE5g4KcsYb9bth/Am29oVaAPi6ViiASZc7tvU4S2TEdkJwA4aux99sa/ozplCOqiR+UikvaDqO3a9yDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1168ade932a83daf8d8e4cb5272259e701cb73122b4ca4b04171e72f93ca1a1c","last_reissued_at":"2026-05-18T00:30:18.294087Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:18.294087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Parallelizable Acceleration Framework for Packing Linear Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","stat.ML"],"primary_cat":"math.OC","authors_text":"Adam Wierman, Hanling Yi, Palma London, Shai Vardi","submitted_at":"2017-11-17T18:17:01Z","abstract_excerpt":"This paper presents an acceleration framework for packing linear programming problems where the amount of data available is limited, i.e., where the number of constraints m is small compared to the variable dimension n. The framework can be used as a black box to speed up linear programming solvers dramatically, by two orders of magnitude in our experiments. We present worst-case guarantees on the quality of the solution and the speedup provided by the algorithm, showing that the framework provides an approximately optimal solution while running the original solver on a much smaller problem. T"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.06656","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":"1711.06656","created_at":"2026-05-18T00:30:18.294196+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.06656v1","created_at":"2026-05-18T00:30:18.294196+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.06656","created_at":"2026-05-18T00:30:18.294196+00:00"},{"alias_kind":"pith_short_12","alias_value":"CFUK32JSVA62","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"CFUK32JSVA627DMO","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"CFUK32JS","created_at":"2026-05-18T12:31:10.602751+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/CFUK32JSVA627DMOJS2SOISZ44","json":"https://pith.science/pith/CFUK32JSVA627DMOJS2SOISZ44.json","graph_json":"https://pith.science/api/pith-number/CFUK32JSVA627DMOJS2SOISZ44/graph.json","events_json":"https://pith.science/api/pith-number/CFUK32JSVA627DMOJS2SOISZ44/events.json","paper":"https://pith.science/paper/CFUK32JS"},"agent_actions":{"view_html":"https://pith.science/pith/CFUK32JSVA627DMOJS2SOISZ44","download_json":"https://pith.science/pith/CFUK32JSVA627DMOJS2SOISZ44.json","view_paper":"https://pith.science/paper/CFUK32JS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.06656&json=true","fetch_graph":"https://pith.science/api/pith-number/CFUK32JSVA627DMOJS2SOISZ44/graph.json","fetch_events":"https://pith.science/api/pith-number/CFUK32JSVA627DMOJS2SOISZ44/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CFUK32JSVA627DMOJS2SOISZ44/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CFUK32JSVA627DMOJS2SOISZ44/action/storage_attestation","attest_author":"https://pith.science/pith/CFUK32JSVA627DMOJS2SOISZ44/action/author_attestation","sign_citation":"https://pith.science/pith/CFUK32JSVA627DMOJS2SOISZ44/action/citation_signature","submit_replication":"https://pith.science/pith/CFUK32JSVA627DMOJS2SOISZ44/action/replication_record"}},"created_at":"2026-05-18T00:30:18.294196+00:00","updated_at":"2026-05-18T00:30:18.294196+00:00"}