{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:6YGEMVQPVQPMW7XTQHAHHMM5H2","short_pith_number":"pith:6YGEMVQP","canonical_record":{"source":{"id":"2311.03703","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-11-07T03:55:39Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"6d0f3a638af8da501fc642308e9dbff31d17b51cebef7007ff61bcfa168d38c3","abstract_canon_sha256":"25de8e0dd42026266f51ac5463569da2daac24b01a1fa02f1613ba1791ce2c23"},"schema_version":"1.0"},"canonical_sha256":"f60c46560fac1ecb7ef381c073b19d3e9871ec22a3952d40f506f79a345fd1d5","source":{"kind":"arxiv","id":"2311.03703","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.03703","created_at":"2026-07-05T08:27:00Z"},{"alias_kind":"arxiv_version","alias_value":"2311.03703v3","created_at":"2026-07-05T08:27:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.03703","created_at":"2026-07-05T08:27:00Z"},{"alias_kind":"pith_short_12","alias_value":"6YGEMVQPVQPM","created_at":"2026-07-05T08:27:00Z"},{"alias_kind":"pith_short_16","alias_value":"6YGEMVQPVQPMW7XT","created_at":"2026-07-05T08:27:00Z"},{"alias_kind":"pith_short_8","alias_value":"6YGEMVQP","created_at":"2026-07-05T08:27:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:6YGEMVQPVQPMW7XTQHAHHMM5H2","target":"record","payload":{"canonical_record":{"source":{"id":"2311.03703","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-11-07T03:55:39Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"6d0f3a638af8da501fc642308e9dbff31d17b51cebef7007ff61bcfa168d38c3","abstract_canon_sha256":"25de8e0dd42026266f51ac5463569da2daac24b01a1fa02f1613ba1791ce2c23"},"schema_version":"1.0"},"canonical_sha256":"f60c46560fac1ecb7ef381c073b19d3e9871ec22a3952d40f506f79a345fd1d5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:27:00.035960Z","signature_b64":"260m5m5M4wUdfd6W+mlzKSgpqCRFX9pn8njGEgx0xoXwHjt7T9m68xuCbpfo/HX/fU3WS4nlO/IY0u2vLxVYCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f60c46560fac1ecb7ef381c073b19d3e9871ec22a3952d40f506f79a345fd1d5","last_reissued_at":"2026-07-05T08:27:00.035457Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:27:00.035457Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2311.03703","source_version":3,"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-05T08:27:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QE/H9CjOJPtObkHIoDfeDhllsEGtIA04BTVh9HjhMGk1DCd9wy9j37ZC/KnciapQ7S5icgUm3LxzzqsX3rjfCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-24T02:30:53.576500Z"},"content_sha256":"cab8a6f62f9e24f5ba73843a4dceb8173267b9201a381bc27081570f1b471c60","schema_version":"1.0","event_id":"sha256:cab8a6f62f9e24f5ba73843a4dceb8173267b9201a381bc27081570f1b471c60"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:6YGEMVQPVQPMW7XTQHAHHMM5H2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Practical Performance Guarantees for Pipelined DNN Inference","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.LG","authors_text":"Aaron Archer, Kuikui Liu, Matthew Fahrbach, Prakash Prabhu","submitted_at":"2023-11-07T03:55:39Z","abstract_excerpt":"We optimize pipeline parallelism for deep neural network (DNN) inference by partitioning model graphs into $k$ stages and minimizing the running time of the bottleneck stage, including communication. We give practical and effective algorithms for this NP-hard problem, but our emphasis is on tackling the practitioner's dilemma of deciding when a solution is good enough. To this end, we design novel mixed-integer programming (MIP) relaxations for proving lower bounds. Applying these methods to a diverse testbed of 369 production models, for $k \\in \\{2, 4, 8, 16, 32, 64\\}$, we empirically show th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.03703","kind":"arxiv","version":3},"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/2311.03703/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-05T08:27:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rq4lUDSwPj3lB7+irLWpykOOUpH3oUABeChTpjWAbZKPMgwX1SJslYywwsZ+T7IdChFdIQGoRh6iGRTrQz9iBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-24T02:30:53.576879Z"},"content_sha256":"6d5fb8172d6968d2a94d0dbb1cb4403e80785876ecc260215fcb70fac5c633c1","schema_version":"1.0","event_id":"sha256:6d5fb8172d6968d2a94d0dbb1cb4403e80785876ecc260215fcb70fac5c633c1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6YGEMVQPVQPMW7XTQHAHHMM5H2/bundle.json","state_url":"https://pith.science/pith/6YGEMVQPVQPMW7XTQHAHHMM5H2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6YGEMVQPVQPMW7XTQHAHHMM5H2/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-07-24T02:30:53Z","links":{"resolver":"https://pith.science/pith/6YGEMVQPVQPMW7XTQHAHHMM5H2","bundle":"https://pith.science/pith/6YGEMVQPVQPMW7XTQHAHHMM5H2/bundle.json","state":"https://pith.science/pith/6YGEMVQPVQPMW7XTQHAHHMM5H2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6YGEMVQPVQPMW7XTQHAHHMM5H2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:6YGEMVQPVQPMW7XTQHAHHMM5H2","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":"25de8e0dd42026266f51ac5463569da2daac24b01a1fa02f1613ba1791ce2c23","cross_cats_sorted":["cs.DC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-11-07T03:55:39Z","title_canon_sha256":"6d0f3a638af8da501fc642308e9dbff31d17b51cebef7007ff61bcfa168d38c3"},"schema_version":"1.0","source":{"id":"2311.03703","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.03703","created_at":"2026-07-05T08:27:00Z"},{"alias_kind":"arxiv_version","alias_value":"2311.03703v3","created_at":"2026-07-05T08:27:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.03703","created_at":"2026-07-05T08:27:00Z"},{"alias_kind":"pith_short_12","alias_value":"6YGEMVQPVQPM","created_at":"2026-07-05T08:27:00Z"},{"alias_kind":"pith_short_16","alias_value":"6YGEMVQPVQPMW7XT","created_at":"2026-07-05T08:27:00Z"},{"alias_kind":"pith_short_8","alias_value":"6YGEMVQP","created_at":"2026-07-05T08:27:00Z"}],"graph_snapshots":[{"event_id":"sha256:6d5fb8172d6968d2a94d0dbb1cb4403e80785876ecc260215fcb70fac5c633c1","target":"graph","created_at":"2026-07-05T08:27:00Z","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/2311.03703/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We optimize pipeline parallelism for deep neural network (DNN) inference by partitioning model graphs into $k$ stages and minimizing the running time of the bottleneck stage, including communication. We give practical and effective algorithms for this NP-hard problem, but our emphasis is on tackling the practitioner's dilemma of deciding when a solution is good enough. To this end, we design novel mixed-integer programming (MIP) relaxations for proving lower bounds. Applying these methods to a diverse testbed of 369 production models, for $k \\in \\{2, 4, 8, 16, 32, 64\\}$, we empirically show th","authors_text":"Aaron Archer, Kuikui Liu, Matthew Fahrbach, Prakash Prabhu","cross_cats":["cs.DC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-11-07T03:55:39Z","title":"Practical Performance Guarantees for Pipelined DNN Inference"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.03703","kind":"arxiv","version":3},"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:cab8a6f62f9e24f5ba73843a4dceb8173267b9201a381bc27081570f1b471c60","target":"record","created_at":"2026-07-05T08:27:00Z","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":"25de8e0dd42026266f51ac5463569da2daac24b01a1fa02f1613ba1791ce2c23","cross_cats_sorted":["cs.DC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-11-07T03:55:39Z","title_canon_sha256":"6d0f3a638af8da501fc642308e9dbff31d17b51cebef7007ff61bcfa168d38c3"},"schema_version":"1.0","source":{"id":"2311.03703","kind":"arxiv","version":3}},"canonical_sha256":"f60c46560fac1ecb7ef381c073b19d3e9871ec22a3952d40f506f79a345fd1d5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f60c46560fac1ecb7ef381c073b19d3e9871ec22a3952d40f506f79a345fd1d5","first_computed_at":"2026-07-05T08:27:00.035457Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:27:00.035457Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"260m5m5M4wUdfd6W+mlzKSgpqCRFX9pn8njGEgx0xoXwHjt7T9m68xuCbpfo/HX/fU3WS4nlO/IY0u2vLxVYCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:27:00.035960Z","signed_message":"canonical_sha256_bytes"},"source_id":"2311.03703","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cab8a6f62f9e24f5ba73843a4dceb8173267b9201a381bc27081570f1b471c60","sha256:6d5fb8172d6968d2a94d0dbb1cb4403e80785876ecc260215fcb70fac5c633c1"],"state_sha256":"3f64a2c9d2fb5d649cdebaac6600e76b9d711bc4c89543c8f68460b010b85e0e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l/Ui5ZGsfVOPjmulRDb6tTUnDIrPUdfyC2XNc/UkmMO5LLCsriNv8YKsI47mlJJ8yCq+mZGxJ9kfAwC5PYhLCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-24T02:30:53.578996Z","bundle_sha256":"6c687317e1c61a215a2098c69173d109d99c6adc48340a400ca3204cf064092f"}}