{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:Q7QYHAKMA4D5GOK4DIGTFHYNII","short_pith_number":"pith:Q7QYHAKM","schema_version":"1.0","canonical_sha256":"87e183814c0707d3395c1a0d329f0d4239db9bac8878d381d07a341efb90e706","source":{"kind":"arxiv","id":"1511.06487","version":4},"attestation_state":"computed","paper":{"title":"mplrs: A scalable parallel vertex/facet enumeration code","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.DC"],"primary_cat":"cs.MS","authors_text":"Charles Jordan, David Avis","submitted_at":"2015-11-20T04:54:22Z","abstract_excerpt":"We describe a new parallel implementation, mplrs, of the vertex enumeration code lrs that uses the MPI parallel environment and can be run on a network of computers. The implementation makes use of a C wrapper that essentially uses the existing lrs code with only minor modifications. mplrs was derived from the earlier parallel implementation plrs, written by G. Roumanis in C++. plrs uses the Boost library and runs on a shared memory machine. In developing mplrs we discovered a method of balancing the parallel tree search, called budgeting, that greatly improves parallelization beyond the bottl"},"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":"1511.06487","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2015-11-20T04:54:22Z","cross_cats_sorted":["cs.CG","cs.DC"],"title_canon_sha256":"6b907f439826a199f1aa01442e5ef75c2e01dc052d62e16a91df19e65dd4144f","abstract_canon_sha256":"bbac1ea5005394e2742dc712e8270c0136016789a2e376d8a11fcf1272c3594d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:02.580464Z","signature_b64":"qlxdblyHhSdXz0MAocEn60Pah9WBrAduPh9KWgxKoesOPwJh5lXVmNsAIQYseMoUf/K/GnDCE7X3yH1JcPcWBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"87e183814c0707d3395c1a0d329f0d4239db9bac8878d381d07a341efb90e706","last_reissued_at":"2026-05-18T00:33:02.579976Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:02.579976Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"mplrs: A scalable parallel vertex/facet enumeration code","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.DC"],"primary_cat":"cs.MS","authors_text":"Charles Jordan, David Avis","submitted_at":"2015-11-20T04:54:22Z","abstract_excerpt":"We describe a new parallel implementation, mplrs, of the vertex enumeration code lrs that uses the MPI parallel environment and can be run on a network of computers. The implementation makes use of a C wrapper that essentially uses the existing lrs code with only minor modifications. mplrs was derived from the earlier parallel implementation plrs, written by G. Roumanis in C++. plrs uses the Boost library and runs on a shared memory machine. In developing mplrs we discovered a method of balancing the parallel tree search, called budgeting, that greatly improves parallelization beyond the bottl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.06487","kind":"arxiv","version":4},"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":"1511.06487","created_at":"2026-05-18T00:33:02.580045+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.06487v4","created_at":"2026-05-18T00:33:02.580045+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.06487","created_at":"2026-05-18T00:33:02.580045+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q7QYHAKMA4D5","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q7QYHAKMA4D5GOK4","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q7QYHAKM","created_at":"2026-05-18T12:29:37.295048+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/Q7QYHAKMA4D5GOK4DIGTFHYNII","json":"https://pith.science/pith/Q7QYHAKMA4D5GOK4DIGTFHYNII.json","graph_json":"https://pith.science/api/pith-number/Q7QYHAKMA4D5GOK4DIGTFHYNII/graph.json","events_json":"https://pith.science/api/pith-number/Q7QYHAKMA4D5GOK4DIGTFHYNII/events.json","paper":"https://pith.science/paper/Q7QYHAKM"},"agent_actions":{"view_html":"https://pith.science/pith/Q7QYHAKMA4D5GOK4DIGTFHYNII","download_json":"https://pith.science/pith/Q7QYHAKMA4D5GOK4DIGTFHYNII.json","view_paper":"https://pith.science/paper/Q7QYHAKM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.06487&json=true","fetch_graph":"https://pith.science/api/pith-number/Q7QYHAKMA4D5GOK4DIGTFHYNII/graph.json","fetch_events":"https://pith.science/api/pith-number/Q7QYHAKMA4D5GOK4DIGTFHYNII/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q7QYHAKMA4D5GOK4DIGTFHYNII/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q7QYHAKMA4D5GOK4DIGTFHYNII/action/storage_attestation","attest_author":"https://pith.science/pith/Q7QYHAKMA4D5GOK4DIGTFHYNII/action/author_attestation","sign_citation":"https://pith.science/pith/Q7QYHAKMA4D5GOK4DIGTFHYNII/action/citation_signature","submit_replication":"https://pith.science/pith/Q7QYHAKMA4D5GOK4DIGTFHYNII/action/replication_record"}},"created_at":"2026-05-18T00:33:02.580045+00:00","updated_at":"2026-05-18T00:33:02.580045+00:00"}