{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:BPASZLN6NISRJMWNIASAWNL6NA","short_pith_number":"pith:BPASZLN6","schema_version":"1.0","canonical_sha256":"0bc12cadbe6a2514b2cd40240b357e68257b4654112d02677debd166dd26586f","source":{"kind":"arxiv","id":"2301.04285","version":1},"attestation_state":"computed","paper":{"title":"TAPS: Topology-Aware Intra-Operator Parallelism Strategy Searching Algorithm for Deep Neural Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Dongsheng Li, Hao Zheng, Linbo Qiao, Peng Liang, Teng Su","submitted_at":"2023-01-11T03:11:45Z","abstract_excerpt":"TAPS is a Topology-Aware intra-operator Parallelism strategy Searching algorithm that generates intra-operator parallelism strategies by considering both intra-node and inter-node bandwidth. Most of the existing auto-parallelism works use the communication volume as the communication cost directly when generating strategies, which we prove to be sub-optimal in multi-nodes cases. We design a topology-aware cost model for multi-node intra-operator parallelism strategy searching. Numerical experiments demonstrate that TAPS can generate strategies with up to 85% fewer communication costs, which ou"},"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":"2301.04285","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2023-01-11T03:11:45Z","cross_cats_sorted":[],"title_canon_sha256":"6c0476cf332f42b2b489b864e172b0f5fcbf23cc522338d4c58024e8a59ef57a","abstract_canon_sha256":"d88d622bdf32f101df2a9e5d739e0c3a10b25786814d7ddb56a5769461de6ca5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:32:14.505331Z","signature_b64":"MsFjkKbQBpr2gIoGW0z1WfdMkKdGXQUctD4GKNMcUecyHkAe6BV266CilUkVJ1LXRNBz9sWfzhvA0GvSBySsBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0bc12cadbe6a2514b2cd40240b357e68257b4654112d02677debd166dd26586f","last_reissued_at":"2026-07-05T05:32:14.504787Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:32:14.504787Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"TAPS: Topology-Aware Intra-Operator Parallelism Strategy Searching Algorithm for Deep Neural Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Dongsheng Li, Hao Zheng, Linbo Qiao, Peng Liang, Teng Su","submitted_at":"2023-01-11T03:11:45Z","abstract_excerpt":"TAPS is a Topology-Aware intra-operator Parallelism strategy Searching algorithm that generates intra-operator parallelism strategies by considering both intra-node and inter-node bandwidth. Most of the existing auto-parallelism works use the communication volume as the communication cost directly when generating strategies, which we prove to be sub-optimal in multi-nodes cases. We design a topology-aware cost model for multi-node intra-operator parallelism strategy searching. Numerical experiments demonstrate that TAPS can generate strategies with up to 85% fewer communication costs, which ou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.04285","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/2301.04285/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":"2301.04285","created_at":"2026-07-05T05:32:14.504843+00:00"},{"alias_kind":"arxiv_version","alias_value":"2301.04285v1","created_at":"2026-07-05T05:32:14.504843+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.04285","created_at":"2026-07-05T05:32:14.504843+00:00"},{"alias_kind":"pith_short_12","alias_value":"BPASZLN6NISR","created_at":"2026-07-05T05:32:14.504843+00:00"},{"alias_kind":"pith_short_16","alias_value":"BPASZLN6NISRJMWN","created_at":"2026-07-05T05:32:14.504843+00:00"},{"alias_kind":"pith_short_8","alias_value":"BPASZLN6","created_at":"2026-07-05T05:32:14.504843+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/BPASZLN6NISRJMWNIASAWNL6NA","json":"https://pith.science/pith/BPASZLN6NISRJMWNIASAWNL6NA.json","graph_json":"https://pith.science/api/pith-number/BPASZLN6NISRJMWNIASAWNL6NA/graph.json","events_json":"https://pith.science/api/pith-number/BPASZLN6NISRJMWNIASAWNL6NA/events.json","paper":"https://pith.science/paper/BPASZLN6"},"agent_actions":{"view_html":"https://pith.science/pith/BPASZLN6NISRJMWNIASAWNL6NA","download_json":"https://pith.science/pith/BPASZLN6NISRJMWNIASAWNL6NA.json","view_paper":"https://pith.science/paper/BPASZLN6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2301.04285&json=true","fetch_graph":"https://pith.science/api/pith-number/BPASZLN6NISRJMWNIASAWNL6NA/graph.json","fetch_events":"https://pith.science/api/pith-number/BPASZLN6NISRJMWNIASAWNL6NA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BPASZLN6NISRJMWNIASAWNL6NA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BPASZLN6NISRJMWNIASAWNL6NA/action/storage_attestation","attest_author":"https://pith.science/pith/BPASZLN6NISRJMWNIASAWNL6NA/action/author_attestation","sign_citation":"https://pith.science/pith/BPASZLN6NISRJMWNIASAWNL6NA/action/citation_signature","submit_replication":"https://pith.science/pith/BPASZLN6NISRJMWNIASAWNL6NA/action/replication_record"}},"created_at":"2026-07-05T05:32:14.504843+00:00","updated_at":"2026-07-05T05:32:14.504843+00:00"}