{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:CFUK32JSVA627DMOJS2SOISZ44","short_pith_number":"pith:CFUK32JS","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"},"canonical_sha256":"1168ade932a83daf8d8e4cb5272259e701cb73122b4ca4b04171e72f93ca1a1c","source":{"kind":"arxiv","id":"1711.06656","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.06656","created_at":"2026-05-18T00:30:18Z"},{"alias_kind":"arxiv_version","alias_value":"1711.06656v1","created_at":"2026-05-18T00:30:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.06656","created_at":"2026-05-18T00:30:18Z"},{"alias_kind":"pith_short_12","alias_value":"CFUK32JSVA62","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CFUK32JSVA627DMO","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CFUK32JS","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:CFUK32JSVA627DMOJS2SOISZ44","target":"record","payload":{"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"},"canonical_sha256":"1168ade932a83daf8d8e4cb5272259e701cb73122b4ca4b04171e72f93ca1a1c","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"},"source_kind":"arxiv","source_id":"1711.06656","source_version":1,"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-18T00:30:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p+nnmW8IMGvpbHJs/VP/AFMV3RBe0ms7RDX00oYQpgr0uiBe+N7/GX2MwejcZ1dU4Ffaa2lloqRMhHQGiomeBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T18:44:00.477301Z"},"content_sha256":"812e0ad54484ffcb85d851d8f82307748a1b4fd6b75a447299887a6e0a133101","schema_version":"1.0","event_id":"sha256:812e0ad54484ffcb85d851d8f82307748a1b4fd6b75a447299887a6e0a133101"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:CFUK32JSVA627DMOJS2SOISZ44","target":"graph","payload":{"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"},"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-18T00:30:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7QWat4iJQiMPXBxL48JTmZmb0YiMeu7d6eoX43BSyE/LikmfX/5PzndRlQIr3u+uCLgrxsDstTtjq6K4IlBjAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T18:44:00.477939Z"},"content_sha256":"47dfef0e3dbd860515e6b11ae5f3d2305dcd223854450c57d4c4379132256f5c","schema_version":"1.0","event_id":"sha256:47dfef0e3dbd860515e6b11ae5f3d2305dcd223854450c57d4c4379132256f5c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CFUK32JSVA627DMOJS2SOISZ44/bundle.json","state_url":"https://pith.science/pith/CFUK32JSVA627DMOJS2SOISZ44/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CFUK32JSVA627DMOJS2SOISZ44/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-06-05T18:44:00Z","links":{"resolver":"https://pith.science/pith/CFUK32JSVA627DMOJS2SOISZ44","bundle":"https://pith.science/pith/CFUK32JSVA627DMOJS2SOISZ44/bundle.json","state":"https://pith.science/pith/CFUK32JSVA627DMOJS2SOISZ44/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CFUK32JSVA627DMOJS2SOISZ44/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:CFUK32JSVA627DMOJS2SOISZ44","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":"f3e2e6164203638cdf6a1c0e8dc269644253400ba278c34a6a986a78f8c0f177","cross_cats_sorted":["cs.NA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-17T18:17:01Z","title_canon_sha256":"4fe96c1d7ba966d2c52a656abcfa6e90b84a435c5d16c55305dab5611947f026"},"schema_version":"1.0","source":{"id":"1711.06656","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.06656","created_at":"2026-05-18T00:30:18Z"},{"alias_kind":"arxiv_version","alias_value":"1711.06656v1","created_at":"2026-05-18T00:30:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.06656","created_at":"2026-05-18T00:30:18Z"},{"alias_kind":"pith_short_12","alias_value":"CFUK32JSVA62","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CFUK32JSVA627DMO","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CFUK32JS","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:47dfef0e3dbd860515e6b11ae5f3d2305dcd223854450c57d4c4379132256f5c","target":"graph","created_at":"2026-05-18T00:30:18Z","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":"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","authors_text":"Adam Wierman, Hanling Yi, Palma London, Shai Vardi","cross_cats":["cs.NA","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-17T18:17:01Z","title":"A Parallelizable Acceleration Framework for Packing Linear Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.06656","kind":"arxiv","version":1},"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:812e0ad54484ffcb85d851d8f82307748a1b4fd6b75a447299887a6e0a133101","target":"record","created_at":"2026-05-18T00:30:18Z","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":"f3e2e6164203638cdf6a1c0e8dc269644253400ba278c34a6a986a78f8c0f177","cross_cats_sorted":["cs.NA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-17T18:17:01Z","title_canon_sha256":"4fe96c1d7ba966d2c52a656abcfa6e90b84a435c5d16c55305dab5611947f026"},"schema_version":"1.0","source":{"id":"1711.06656","kind":"arxiv","version":1}},"canonical_sha256":"1168ade932a83daf8d8e4cb5272259e701cb73122b4ca4b04171e72f93ca1a1c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1168ade932a83daf8d8e4cb5272259e701cb73122b4ca4b04171e72f93ca1a1c","first_computed_at":"2026-05-18T00:30:18.294087Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:18.294087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zYRHdsaE5g4KcsYb9bth/Am29oVaAPi6ViiASZc7tvU4S2TEdkJwA4aux99sa/ozplCOqiR+UikvaDqO3a9yDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:18.294893Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.06656","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:812e0ad54484ffcb85d851d8f82307748a1b4fd6b75a447299887a6e0a133101","sha256:47dfef0e3dbd860515e6b11ae5f3d2305dcd223854450c57d4c4379132256f5c"],"state_sha256":"25bf426ba616e2703795a4f69b835d418cddc5d8e960d54c9aa961a775fb17f5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hfNu/DRc61gHFgTmVS0qWtlfhbkxdtRXyey64+wbWIjX/ArhAb+I7KNg/Np0RRt/IYrmjY48n970xkCRFtaLDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T18:44:00.481220Z","bundle_sha256":"9d18a90889ccf45e9ad00e33933cb953b946572443fede7194c77715a8ef846a"}}