{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:BPASZLN6NISRJMWNIASAWNL6NA","short_pith_number":"pith:BPASZLN6","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"},"canonical_sha256":"0bc12cadbe6a2514b2cd40240b357e68257b4654112d02677debd166dd26586f","source":{"kind":"arxiv","id":"2301.04285","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.04285","created_at":"2026-07-05T05:32:14Z"},{"alias_kind":"arxiv_version","alias_value":"2301.04285v1","created_at":"2026-07-05T05:32:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.04285","created_at":"2026-07-05T05:32:14Z"},{"alias_kind":"pith_short_12","alias_value":"BPASZLN6NISR","created_at":"2026-07-05T05:32:14Z"},{"alias_kind":"pith_short_16","alias_value":"BPASZLN6NISRJMWN","created_at":"2026-07-05T05:32:14Z"},{"alias_kind":"pith_short_8","alias_value":"BPASZLN6","created_at":"2026-07-05T05:32:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:BPASZLN6NISRJMWNIASAWNL6NA","target":"record","payload":{"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"},"canonical_sha256":"0bc12cadbe6a2514b2cd40240b357e68257b4654112d02677debd166dd26586f","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"},"source_kind":"arxiv","source_id":"2301.04285","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-07-05T05:32:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GTUCSCrfwRhISoFzHwRa+1drICg5eT+N8WEHrLiXTZOWkQbjh3oZgwvB3ZGr0rgVYdP0CAblt0T1BAI6BgqEDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T11:45:55.665834Z"},"content_sha256":"2b48acbabab23dc4dd8e3aad41bb2ffcf56c0b3b4297821b63b558c7758b42f3","schema_version":"1.0","event_id":"sha256:2b48acbabab23dc4dd8e3aad41bb2ffcf56c0b3b4297821b63b558c7758b42f3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:BPASZLN6NISRJMWNIASAWNL6NA","target":"graph","payload":{"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"},"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-07-05T05:32:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zs+VIsZwBNcAYaNxqyeWIID/Dn1fFgnaCn92etOPtduI9HW0yKmsG/x/hMdRGJDQ6oNbOoU+laN4EWNZq7AHBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T11:45:55.666312Z"},"content_sha256":"999e0d8c1afbae596dec27642219072a9b551ba06e5d2d15eaba3d11f6abcc4c","schema_version":"1.0","event_id":"sha256:999e0d8c1afbae596dec27642219072a9b551ba06e5d2d15eaba3d11f6abcc4c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BPASZLN6NISRJMWNIASAWNL6NA/bundle.json","state_url":"https://pith.science/pith/BPASZLN6NISRJMWNIASAWNL6NA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BPASZLN6NISRJMWNIASAWNL6NA/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-08-06T11:45:55Z","links":{"resolver":"https://pith.science/pith/BPASZLN6NISRJMWNIASAWNL6NA","bundle":"https://pith.science/pith/BPASZLN6NISRJMWNIASAWNL6NA/bundle.json","state":"https://pith.science/pith/BPASZLN6NISRJMWNIASAWNL6NA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BPASZLN6NISRJMWNIASAWNL6NA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:BPASZLN6NISRJMWNIASAWNL6NA","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":"d88d622bdf32f101df2a9e5d739e0c3a10b25786814d7ddb56a5769461de6ca5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2023-01-11T03:11:45Z","title_canon_sha256":"6c0476cf332f42b2b489b864e172b0f5fcbf23cc522338d4c58024e8a59ef57a"},"schema_version":"1.0","source":{"id":"2301.04285","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.04285","created_at":"2026-07-05T05:32:14Z"},{"alias_kind":"arxiv_version","alias_value":"2301.04285v1","created_at":"2026-07-05T05:32:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.04285","created_at":"2026-07-05T05:32:14Z"},{"alias_kind":"pith_short_12","alias_value":"BPASZLN6NISR","created_at":"2026-07-05T05:32:14Z"},{"alias_kind":"pith_short_16","alias_value":"BPASZLN6NISRJMWN","created_at":"2026-07-05T05:32:14Z"},{"alias_kind":"pith_short_8","alias_value":"BPASZLN6","created_at":"2026-07-05T05:32:14Z"}],"graph_snapshots":[{"event_id":"sha256:999e0d8c1afbae596dec27642219072a9b551ba06e5d2d15eaba3d11f6abcc4c","target":"graph","created_at":"2026-07-05T05:32:14Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2301.04285/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Dongsheng Li, Hao Zheng, Linbo Qiao, Peng Liang, Teng Su","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2023-01-11T03:11:45Z","title":"TAPS: Topology-Aware Intra-Operator Parallelism Strategy Searching Algorithm for Deep Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.04285","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:2b48acbabab23dc4dd8e3aad41bb2ffcf56c0b3b4297821b63b558c7758b42f3","target":"record","created_at":"2026-07-05T05:32:14Z","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":"d88d622bdf32f101df2a9e5d739e0c3a10b25786814d7ddb56a5769461de6ca5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2023-01-11T03:11:45Z","title_canon_sha256":"6c0476cf332f42b2b489b864e172b0f5fcbf23cc522338d4c58024e8a59ef57a"},"schema_version":"1.0","source":{"id":"2301.04285","kind":"arxiv","version":1}},"canonical_sha256":"0bc12cadbe6a2514b2cd40240b357e68257b4654112d02677debd166dd26586f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0bc12cadbe6a2514b2cd40240b357e68257b4654112d02677debd166dd26586f","first_computed_at":"2026-07-05T05:32:14.504787Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:32:14.504787Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MsFjkKbQBpr2gIoGW0z1WfdMkKdGXQUctD4GKNMcUecyHkAe6BV266CilUkVJ1LXRNBz9sWfzhvA0GvSBySsBw==","signature_status":"signed_v1","signed_at":"2026-07-05T05:32:14.505331Z","signed_message":"canonical_sha256_bytes"},"source_id":"2301.04285","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2b48acbabab23dc4dd8e3aad41bb2ffcf56c0b3b4297821b63b558c7758b42f3","sha256:999e0d8c1afbae596dec27642219072a9b551ba06e5d2d15eaba3d11f6abcc4c"],"state_sha256":"0aaeff741acf32f800706cab00181c3fda7912d35986ea3e05f47462380614fc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9srDB+NRAK5Ashu52xdxXTME8ZFQrf4YEVsg6vHH6xNoXUwFpVsebOZN7RbeSu1TrmLVYhYVlL6JfF8NCreuBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T11:45:55.669910Z","bundle_sha256":"91dc6ad420ba5ed204b692f527db5cd306ed32c3c866875ba27d9124eed7de46"}}