{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:QCNBTP6NRC4UR5XOI2KOIQCXXD","short_pith_number":"pith:QCNBTP6N","schema_version":"1.0","canonical_sha256":"809a19bfcd88b948f6ee4694e44057b8c01e8cb849f13917c627ee9ebba15391","source":{"kind":"arxiv","id":"1607.06543","version":1},"attestation_state":"computed","paper":{"title":"LLMapReduce: Multi-Level Map-Reduce for High Performance Data Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Albert Reuther, Andrew Prout, Antonio Rosa, Bill Bergeron, Chansup Byun, Charles Yee, David Bestor, Jeremy Kepner, Julie Mullen, Matthew Hubbell, Peter Michaleas, Vijay Gadepally, William Arcand","submitted_at":"2016-07-22T02:45:53Z","abstract_excerpt":"The map-reduce parallel programming model has become extremely popular in the big data community. Many big data workloads can benefit from the enhanced performance offered by supercomputers. LLMapReduce provides the familiar map-reduce parallel programming model to big data users running on a supercomputer. LLMapReduce dramatically simplifies map-reduce programming by providing simple parallel programming capability in one line of code. LLMapReduce supports all programming languages and many schedulers. LLMapReduce can work with any application without the need to modify the application. Furth"},"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":"1607.06543","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-07-22T02:45:53Z","cross_cats_sorted":[],"title_canon_sha256":"b5ff98d98505d3daba80354a32f2f48566ed3f91c298c5d826430c5cc13e4109","abstract_canon_sha256":"9d4e958592c5ddbc289f3d266dcf6169fa344019c425d530546f5375f00eb441"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:20.959137Z","signature_b64":"Id/Y/+xCrCvSue8tnN6DVaaN00mvWez5xaDPus7i5CsfRfi85qSEg84Mmbwk3LXBkqCZVAfT+gGQnIqtIaw+Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"809a19bfcd88b948f6ee4694e44057b8c01e8cb849f13917c627ee9ebba15391","last_reissued_at":"2026-05-18T00:55:20.958504Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:20.958504Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LLMapReduce: Multi-Level Map-Reduce for High Performance Data Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Albert Reuther, Andrew Prout, Antonio Rosa, Bill Bergeron, Chansup Byun, Charles Yee, David Bestor, Jeremy Kepner, Julie Mullen, Matthew Hubbell, Peter Michaleas, Vijay Gadepally, William Arcand","submitted_at":"2016-07-22T02:45:53Z","abstract_excerpt":"The map-reduce parallel programming model has become extremely popular in the big data community. Many big data workloads can benefit from the enhanced performance offered by supercomputers. LLMapReduce provides the familiar map-reduce parallel programming model to big data users running on a supercomputer. LLMapReduce dramatically simplifies map-reduce programming by providing simple parallel programming capability in one line of code. LLMapReduce supports all programming languages and many schedulers. LLMapReduce can work with any application without the need to modify the application. Furth"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.06543","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":"1607.06543","created_at":"2026-05-18T00:55:20.958591+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.06543v1","created_at":"2026-05-18T00:55:20.958591+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.06543","created_at":"2026-05-18T00:55:20.958591+00:00"},{"alias_kind":"pith_short_12","alias_value":"QCNBTP6NRC4U","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"QCNBTP6NRC4UR5XO","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"QCNBTP6N","created_at":"2026-05-18T12:30:39.010887+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/QCNBTP6NRC4UR5XOI2KOIQCXXD","json":"https://pith.science/pith/QCNBTP6NRC4UR5XOI2KOIQCXXD.json","graph_json":"https://pith.science/api/pith-number/QCNBTP6NRC4UR5XOI2KOIQCXXD/graph.json","events_json":"https://pith.science/api/pith-number/QCNBTP6NRC4UR5XOI2KOIQCXXD/events.json","paper":"https://pith.science/paper/QCNBTP6N"},"agent_actions":{"view_html":"https://pith.science/pith/QCNBTP6NRC4UR5XOI2KOIQCXXD","download_json":"https://pith.science/pith/QCNBTP6NRC4UR5XOI2KOIQCXXD.json","view_paper":"https://pith.science/paper/QCNBTP6N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.06543&json=true","fetch_graph":"https://pith.science/api/pith-number/QCNBTP6NRC4UR5XOI2KOIQCXXD/graph.json","fetch_events":"https://pith.science/api/pith-number/QCNBTP6NRC4UR5XOI2KOIQCXXD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QCNBTP6NRC4UR5XOI2KOIQCXXD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QCNBTP6NRC4UR5XOI2KOIQCXXD/action/storage_attestation","attest_author":"https://pith.science/pith/QCNBTP6NRC4UR5XOI2KOIQCXXD/action/author_attestation","sign_citation":"https://pith.science/pith/QCNBTP6NRC4UR5XOI2KOIQCXXD/action/citation_signature","submit_replication":"https://pith.science/pith/QCNBTP6NRC4UR5XOI2KOIQCXXD/action/replication_record"}},"created_at":"2026-05-18T00:55:20.958591+00:00","updated_at":"2026-05-18T00:55:20.958591+00:00"}