{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:5DF2UPFFGCYZXHOWE7PZXV6NF2","short_pith_number":"pith:5DF2UPFF","schema_version":"1.0","canonical_sha256":"e8cbaa3ca530b19b9dd627df9bd7cd2e92c9b492e3d807a014434435f716bf73","source":{"kind":"arxiv","id":"2112.02958","version":1},"attestation_state":"computed","paper":{"title":"Automap: Towards Ergonomic Automated Parallelism for ML Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.LG","authors_text":"Adam Paszke, Dan Belov, Dimitrios Vytiniotis, Dominik Grewe, Georg Stefan Schmid, James Molloy, Jonathan Godwin, Michael Schaarschmidt, Norman Alexander Rink, Tamara Norman, Vinod Nair","submitted_at":"2021-12-06T12:09:38Z","abstract_excerpt":"The rapid rise in demand for training large neural network architectures has brought into focus the need for partitioning strategies, for example by using data, model, or pipeline parallelism. Implementing these methods is increasingly supported through program primitives, but identifying efficient partitioning strategies requires expensive experimentation and expertise. We present the prototype of an automated partitioner that seamlessly integrates into existing compilers and existing user workflows. Our partitioner enables SPMD-style parallelism that encompasses data parallelism and paramete"},"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":"2112.02958","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-12-06T12:09:38Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"2bec5e8a783ef66e50315f61540355f8637006520ebdc71e37fae2ead69a4681","abstract_canon_sha256":"38087b6a8a53e307d21244c3f7438e50a1fff022f8e95a2a935da9832ffd58b3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:37:59.870459Z","signature_b64":"wEtUMfI6ynpFCztXUJZBLxBPfCwHJgWNa2LhtI4v/h3VmvFKqj4gNDr9652e2anhzhxaqem0xGRBUWQTFaA9Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e8cbaa3ca530b19b9dd627df9bd7cd2e92c9b492e3d807a014434435f716bf73","last_reissued_at":"2026-07-05T03:37:59.870001Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:37:59.870001Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Automap: Towards Ergonomic Automated Parallelism for ML Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.LG","authors_text":"Adam Paszke, Dan Belov, Dimitrios Vytiniotis, Dominik Grewe, Georg Stefan Schmid, James Molloy, Jonathan Godwin, Michael Schaarschmidt, Norman Alexander Rink, Tamara Norman, Vinod Nair","submitted_at":"2021-12-06T12:09:38Z","abstract_excerpt":"The rapid rise in demand for training large neural network architectures has brought into focus the need for partitioning strategies, for example by using data, model, or pipeline parallelism. Implementing these methods is increasingly supported through program primitives, but identifying efficient partitioning strategies requires expensive experimentation and expertise. We present the prototype of an automated partitioner that seamlessly integrates into existing compilers and existing user workflows. Our partitioner enables SPMD-style parallelism that encompasses data parallelism and paramete"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.02958","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2112.02958/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2112.02958","created_at":"2026-07-05T03:37:59.870070+00:00"},{"alias_kind":"arxiv_version","alias_value":"2112.02958v1","created_at":"2026-07-05T03:37:59.870070+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.02958","created_at":"2026-07-05T03:37:59.870070+00:00"},{"alias_kind":"pith_short_12","alias_value":"5DF2UPFFGCYZ","created_at":"2026-07-05T03:37:59.870070+00:00"},{"alias_kind":"pith_short_16","alias_value":"5DF2UPFFGCYZXHOW","created_at":"2026-07-05T03:37:59.870070+00:00"},{"alias_kind":"pith_short_8","alias_value":"5DF2UPFF","created_at":"2026-07-05T03:37:59.870070+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.11333","citing_title":"MLCommons Chakra: Advancing Performance Benchmarking and Co-design using Standardized Execution Traces","ref_index":93,"is_internal_anchor":false},{"citing_arxiv_id":"2605.11333","citing_title":"MLCommons Chakra: Advancing Performance Benchmarking and Co-design using Standardized Execution Traces","ref_index":93,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5DF2UPFFGCYZXHOWE7PZXV6NF2","json":"https://pith.science/pith/5DF2UPFFGCYZXHOWE7PZXV6NF2.json","graph_json":"https://pith.science/api/pith-number/5DF2UPFFGCYZXHOWE7PZXV6NF2/graph.json","events_json":"https://pith.science/api/pith-number/5DF2UPFFGCYZXHOWE7PZXV6NF2/events.json","paper":"https://pith.science/paper/5DF2UPFF"},"agent_actions":{"view_html":"https://pith.science/pith/5DF2UPFFGCYZXHOWE7PZXV6NF2","download_json":"https://pith.science/pith/5DF2UPFFGCYZXHOWE7PZXV6NF2.json","view_paper":"https://pith.science/paper/5DF2UPFF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2112.02958&json=true","fetch_graph":"https://pith.science/api/pith-number/5DF2UPFFGCYZXHOWE7PZXV6NF2/graph.json","fetch_events":"https://pith.science/api/pith-number/5DF2UPFFGCYZXHOWE7PZXV6NF2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5DF2UPFFGCYZXHOWE7PZXV6NF2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5DF2UPFFGCYZXHOWE7PZXV6NF2/action/storage_attestation","attest_author":"https://pith.science/pith/5DF2UPFFGCYZXHOWE7PZXV6NF2/action/author_attestation","sign_citation":"https://pith.science/pith/5DF2UPFFGCYZXHOWE7PZXV6NF2/action/citation_signature","submit_replication":"https://pith.science/pith/5DF2UPFFGCYZXHOWE7PZXV6NF2/action/replication_record"}},"created_at":"2026-07-05T03:37:59.870070+00:00","updated_at":"2026-07-05T03:37:59.870070+00:00"}