{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:BF2DQQMUOALCANWD4EM7F6QRKD","short_pith_number":"pith:BF2DQQMU","canonical_record":{"source":{"id":"2310.15471","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2023-10-24T02:49:26Z","cross_cats_sorted":[],"title_canon_sha256":"3f1989f1c9aa49f47233952206296f68fb34047b9d9e05d0724d062c64964c55","abstract_canon_sha256":"b22d17fccec5a7e00885a60b536b2febebf8eda158de5e37ee0e3398ddd3e0f4"},"schema_version":"1.0"},"canonical_sha256":"097438419470162036c3e119f2fa1150f4f4fddd5b7b63d2906620e91d28eb37","source":{"kind":"arxiv","id":"2310.15471","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.15471","created_at":"2026-07-05T11:02:37Z"},{"alias_kind":"arxiv_version","alias_value":"2310.15471v2","created_at":"2026-07-05T11:02:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.15471","created_at":"2026-07-05T11:02:37Z"},{"alias_kind":"pith_short_12","alias_value":"BF2DQQMUOALC","created_at":"2026-07-05T11:02:37Z"},{"alias_kind":"pith_short_16","alias_value":"BF2DQQMUOALCANWD","created_at":"2026-07-05T11:02:37Z"},{"alias_kind":"pith_short_8","alias_value":"BF2DQQMU","created_at":"2026-07-05T11:02:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:BF2DQQMUOALCANWD4EM7F6QRKD","target":"record","payload":{"canonical_record":{"source":{"id":"2310.15471","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2023-10-24T02:49:26Z","cross_cats_sorted":[],"title_canon_sha256":"3f1989f1c9aa49f47233952206296f68fb34047b9d9e05d0724d062c64964c55","abstract_canon_sha256":"b22d17fccec5a7e00885a60b536b2febebf8eda158de5e37ee0e3398ddd3e0f4"},"schema_version":"1.0"},"canonical_sha256":"097438419470162036c3e119f2fa1150f4f4fddd5b7b63d2906620e91d28eb37","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:02:37.660140Z","signature_b64":"A48I3Lo77NkxuAWpvp1pb0rP8wNrZTBgCCsfXNLqZAsT2E+PY2BT2sdwDxTp8Gcu4I8Ocg+w3LuUdXY++hs/CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"097438419470162036c3e119f2fa1150f4f4fddd5b7b63d2906620e91d28eb37","last_reissued_at":"2026-07-05T11:02:37.659696Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:02:37.659696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2310.15471","source_version":2,"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-05T11:02:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LrebB6IEWkiczO5nu5c8DSg2oYgKEbdiOQQQgAygXpSXM3/C0OoiKB2jwYeKNTMa3eVRKKsfDg29IJ4vS0NODg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T21:42:59.159378Z"},"content_sha256":"37398047cb39fabee834d028dbebe29db26ec12ae4cc07af17530762d6a0e6c0","schema_version":"1.0","event_id":"sha256:37398047cb39fabee834d028dbebe29db26ec12ae4cc07af17530762d6a0e6c0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:BF2DQQMUOALCANWD4EM7F6QRKD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-Path Bound for DAG Tasks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Mingsong Lv, Nan Guan, Qingqiang He, Shuai Zhao","submitted_at":"2023-10-24T02:49:26Z","abstract_excerpt":"This paper studies the response time bound of a DAG (directed acyclic graph) task. Recently, the idea of using multiple paths to bound the response time of a DAG task, instead of using a single longest path in previous results, was proposed and leads to the so-called multi-path bound. Multi-path bounds can greatly reduce the response time bound and significantly improve the schedulability of DAG tasks. This paper derives a new multi-path bound and proposes an optimal algorithm to compute this bound. We further present a systematic analysis on the dominance and the sustainability of three exist"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.15471","kind":"arxiv","version":2},"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/2310.15471/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-05T11:02:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7EymXoYCrpeipmtonpuVKyLkhGY3s9SaRMgpfpdpcCBHqDo+PBDRbD9sGYenYWSrrcSDE8Hyzl7vGcKOFN4+AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T21:42:59.160292Z"},"content_sha256":"dccac327a92fd8d8d4f47bed5a1c7b206b9595071cdd032e648db8be6401f68b","schema_version":"1.0","event_id":"sha256:dccac327a92fd8d8d4f47bed5a1c7b206b9595071cdd032e648db8be6401f68b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BF2DQQMUOALCANWD4EM7F6QRKD/bundle.json","state_url":"https://pith.science/pith/BF2DQQMUOALCANWD4EM7F6QRKD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BF2DQQMUOALCANWD4EM7F6QRKD/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-05T21:42:59Z","links":{"resolver":"https://pith.science/pith/BF2DQQMUOALCANWD4EM7F6QRKD","bundle":"https://pith.science/pith/BF2DQQMUOALCANWD4EM7F6QRKD/bundle.json","state":"https://pith.science/pith/BF2DQQMUOALCANWD4EM7F6QRKD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BF2DQQMUOALCANWD4EM7F6QRKD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:BF2DQQMUOALCANWD4EM7F6QRKD","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":"b22d17fccec5a7e00885a60b536b2febebf8eda158de5e37ee0e3398ddd3e0f4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2023-10-24T02:49:26Z","title_canon_sha256":"3f1989f1c9aa49f47233952206296f68fb34047b9d9e05d0724d062c64964c55"},"schema_version":"1.0","source":{"id":"2310.15471","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.15471","created_at":"2026-07-05T11:02:37Z"},{"alias_kind":"arxiv_version","alias_value":"2310.15471v2","created_at":"2026-07-05T11:02:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.15471","created_at":"2026-07-05T11:02:37Z"},{"alias_kind":"pith_short_12","alias_value":"BF2DQQMUOALC","created_at":"2026-07-05T11:02:37Z"},{"alias_kind":"pith_short_16","alias_value":"BF2DQQMUOALCANWD","created_at":"2026-07-05T11:02:37Z"},{"alias_kind":"pith_short_8","alias_value":"BF2DQQMU","created_at":"2026-07-05T11:02:37Z"}],"graph_snapshots":[{"event_id":"sha256:dccac327a92fd8d8d4f47bed5a1c7b206b9595071cdd032e648db8be6401f68b","target":"graph","created_at":"2026-07-05T11:02:37Z","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/2310.15471/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper studies the response time bound of a DAG (directed acyclic graph) task. Recently, the idea of using multiple paths to bound the response time of a DAG task, instead of using a single longest path in previous results, was proposed and leads to the so-called multi-path bound. Multi-path bounds can greatly reduce the response time bound and significantly improve the schedulability of DAG tasks. This paper derives a new multi-path bound and proposes an optimal algorithm to compute this bound. We further present a systematic analysis on the dominance and the sustainability of three exist","authors_text":"Mingsong Lv, Nan Guan, Qingqiang He, Shuai Zhao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2023-10-24T02:49:26Z","title":"Multi-Path Bound for DAG Tasks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.15471","kind":"arxiv","version":2},"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:37398047cb39fabee834d028dbebe29db26ec12ae4cc07af17530762d6a0e6c0","target":"record","created_at":"2026-07-05T11:02:37Z","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":"b22d17fccec5a7e00885a60b536b2febebf8eda158de5e37ee0e3398ddd3e0f4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2023-10-24T02:49:26Z","title_canon_sha256":"3f1989f1c9aa49f47233952206296f68fb34047b9d9e05d0724d062c64964c55"},"schema_version":"1.0","source":{"id":"2310.15471","kind":"arxiv","version":2}},"canonical_sha256":"097438419470162036c3e119f2fa1150f4f4fddd5b7b63d2906620e91d28eb37","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"097438419470162036c3e119f2fa1150f4f4fddd5b7b63d2906620e91d28eb37","first_computed_at":"2026-07-05T11:02:37.659696Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:02:37.659696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"A48I3Lo77NkxuAWpvp1pb0rP8wNrZTBgCCsfXNLqZAsT2E+PY2BT2sdwDxTp8Gcu4I8Ocg+w3LuUdXY++hs/CQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:02:37.660140Z","signed_message":"canonical_sha256_bytes"},"source_id":"2310.15471","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:37398047cb39fabee834d028dbebe29db26ec12ae4cc07af17530762d6a0e6c0","sha256:dccac327a92fd8d8d4f47bed5a1c7b206b9595071cdd032e648db8be6401f68b"],"state_sha256":"1b33375ca4649a859244a2acd27e3770181e94ec0641beca4476e79a2b270c95"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8KN54DuWEdoCBOVcOqW7DC4idM62j/NPOBfI5cct/rDZ3Vb6rngKhd5m72l1t3dhAvxmq88Rjyj98C9ZaTMLAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T21:42:59.167764Z","bundle_sha256":"fa1fe867a2e7545e428d7c02dc68c41e287988c64aa48738939256a79a315210"}}