{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:AOZGXP3DU64AGJRF35AO4RH422","short_pith_number":"pith:AOZGXP3D","canonical_record":{"source":{"id":"1801.00837","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-01-02T21:10:52Z","cross_cats_sorted":["cs.DC","cs.PF","cs.SY"],"title_canon_sha256":"edc55730a4f5d644f0c951e9bb37e9ab42a380695aa6b74656d58fdb2e98b96d","abstract_canon_sha256":"06ca29dfeaaa69eb0a8a330dab0b2e413f7b209a7d7bc728fc44a8bf75422c34"},"schema_version":"1.0"},"canonical_sha256":"03b26bbf63a7b8032625df40ee44fcd6804b916ff4f1413fddc06da88bfb3415","source":{"kind":"arxiv","id":"1801.00837","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.00837","created_at":"2026-05-18T00:03:32Z"},{"alias_kind":"arxiv_version","alias_value":"1801.00837v1","created_at":"2026-05-18T00:03:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.00837","created_at":"2026-05-18T00:03:32Z"},{"alias_kind":"pith_short_12","alias_value":"AOZGXP3DU64A","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AOZGXP3DU64AGJRF","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AOZGXP3D","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:AOZGXP3DU64AGJRF35AO4RH422","target":"record","payload":{"canonical_record":{"source":{"id":"1801.00837","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-01-02T21:10:52Z","cross_cats_sorted":["cs.DC","cs.PF","cs.SY"],"title_canon_sha256":"edc55730a4f5d644f0c951e9bb37e9ab42a380695aa6b74656d58fdb2e98b96d","abstract_canon_sha256":"06ca29dfeaaa69eb0a8a330dab0b2e413f7b209a7d7bc728fc44a8bf75422c34"},"schema_version":"1.0"},"canonical_sha256":"03b26bbf63a7b8032625df40ee44fcd6804b916ff4f1413fddc06da88bfb3415","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:32.235039Z","signature_b64":"IK4AwvjgugA88fVBNPeVA5cY3uyE+uPftWbtq5kDhjcHxlsD0c2OE6H61YlXHcmVdhRVYa6UHBfTzG3/WNA1Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03b26bbf63a7b8032625df40ee44fcd6804b916ff4f1413fddc06da88bfb3415","last_reissued_at":"2026-05-18T00:03:32.234579Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:32.234579Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.00837","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-05-18T00:03:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OPZ7E1WnYgRj5WfaYKaR7EsIrzLbE0b8fQ6gzZK1Evyv0EYIe4NFFtQ1IYu/7kc97QJYhW2kRSr+cXrRZghLCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T13:59:33.394779Z"},"content_sha256":"5e0125cc58b5a5bab942c15a52835cf022aa811ca055117d5acb246400f1d2e5","schema_version":"1.0","event_id":"sha256:5e0125cc58b5a5bab942c15a52835cf022aa811ca055117d5acb246400f1d2e5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:AOZGXP3DU64AGJRF35AO4RH422","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"QuickCast: Fast and Efficient Inter-Datacenter Transfers using Forwarding Tree Cohorts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.PF","cs.SY"],"primary_cat":"cs.NI","authors_text":"Cauligi S. Raghavendra, Mohammad Noormohammadpour, Srikanth Kandula, Sriram Rao","submitted_at":"2018-01-02T21:10:52Z","abstract_excerpt":"Large inter-datacenter transfers are crucial for cloud service efficiency and are increasingly used by organizations that have dedicated wide area networks between datacenters. A recent work uses multicast forwarding trees to reduce the bandwidth needs and improve completion times of point-to-multipoint transfers. Using a single forwarding tree per transfer, however, leads to poor performance because the slowest receiver dictates the completion time for all receivers. Using multiple forwarding trees per transfer alleviates this concern--the average receiver could finish early; however, if done"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.00837","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":""},"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-05-18T00:03:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A2/J676sA3qU9aZ7AI1YP4XW5LdIN8FOFg4PcC/FAYzw1gBl3qA4b+aFiO3St4gTbmoERB/N6Wlk/xuvBe8mCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T13:59:33.395240Z"},"content_sha256":"54d9a9ae55a14ff1a69a810bf5afdffec9450b1135671ea24d0d6f26fd8e8a17","schema_version":"1.0","event_id":"sha256:54d9a9ae55a14ff1a69a810bf5afdffec9450b1135671ea24d0d6f26fd8e8a17"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AOZGXP3DU64AGJRF35AO4RH422/bundle.json","state_url":"https://pith.science/pith/AOZGXP3DU64AGJRF35AO4RH422/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AOZGXP3DU64AGJRF35AO4RH422/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-22T13:59:33Z","links":{"resolver":"https://pith.science/pith/AOZGXP3DU64AGJRF35AO4RH422","bundle":"https://pith.science/pith/AOZGXP3DU64AGJRF35AO4RH422/bundle.json","state":"https://pith.science/pith/AOZGXP3DU64AGJRF35AO4RH422/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AOZGXP3DU64AGJRF35AO4RH422/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:AOZGXP3DU64AGJRF35AO4RH422","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":"06ca29dfeaaa69eb0a8a330dab0b2e413f7b209a7d7bc728fc44a8bf75422c34","cross_cats_sorted":["cs.DC","cs.PF","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-01-02T21:10:52Z","title_canon_sha256":"edc55730a4f5d644f0c951e9bb37e9ab42a380695aa6b74656d58fdb2e98b96d"},"schema_version":"1.0","source":{"id":"1801.00837","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.00837","created_at":"2026-05-18T00:03:32Z"},{"alias_kind":"arxiv_version","alias_value":"1801.00837v1","created_at":"2026-05-18T00:03:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.00837","created_at":"2026-05-18T00:03:32Z"},{"alias_kind":"pith_short_12","alias_value":"AOZGXP3DU64A","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AOZGXP3DU64AGJRF","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AOZGXP3D","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:54d9a9ae55a14ff1a69a810bf5afdffec9450b1135671ea24d0d6f26fd8e8a17","target":"graph","created_at":"2026-05-18T00:03:32Z","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"},"paper":{"abstract_excerpt":"Large inter-datacenter transfers are crucial for cloud service efficiency and are increasingly used by organizations that have dedicated wide area networks between datacenters. A recent work uses multicast forwarding trees to reduce the bandwidth needs and improve completion times of point-to-multipoint transfers. Using a single forwarding tree per transfer, however, leads to poor performance because the slowest receiver dictates the completion time for all receivers. Using multiple forwarding trees per transfer alleviates this concern--the average receiver could finish early; however, if done","authors_text":"Cauligi S. Raghavendra, Mohammad Noormohammadpour, Srikanth Kandula, Sriram Rao","cross_cats":["cs.DC","cs.PF","cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-01-02T21:10:52Z","title":"QuickCast: Fast and Efficient Inter-Datacenter Transfers using Forwarding Tree Cohorts"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.00837","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:5e0125cc58b5a5bab942c15a52835cf022aa811ca055117d5acb246400f1d2e5","target":"record","created_at":"2026-05-18T00:03:32Z","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":"06ca29dfeaaa69eb0a8a330dab0b2e413f7b209a7d7bc728fc44a8bf75422c34","cross_cats_sorted":["cs.DC","cs.PF","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-01-02T21:10:52Z","title_canon_sha256":"edc55730a4f5d644f0c951e9bb37e9ab42a380695aa6b74656d58fdb2e98b96d"},"schema_version":"1.0","source":{"id":"1801.00837","kind":"arxiv","version":1}},"canonical_sha256":"03b26bbf63a7b8032625df40ee44fcd6804b916ff4f1413fddc06da88bfb3415","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"03b26bbf63a7b8032625df40ee44fcd6804b916ff4f1413fddc06da88bfb3415","first_computed_at":"2026-05-18T00:03:32.234579Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:32.234579Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IK4AwvjgugA88fVBNPeVA5cY3uyE+uPftWbtq5kDhjcHxlsD0c2OE6H61YlXHcmVdhRVYa6UHBfTzG3/WNA1Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:32.235039Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.00837","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5e0125cc58b5a5bab942c15a52835cf022aa811ca055117d5acb246400f1d2e5","sha256:54d9a9ae55a14ff1a69a810bf5afdffec9450b1135671ea24d0d6f26fd8e8a17"],"state_sha256":"3fa9631999e07ba09798a24116226b0c2630954de13aa1042805c90ed9249156"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zG1uA5d/2aOUyxhIdAoGuGhpcg0AhWdzQZLKxDJu41bDOPL32Xk9h8OzJHu+4DXc2LlRnq87q7XbtIx4D7YoDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T13:59:33.398721Z","bundle_sha256":"508057e198500a21f3cae280c00cd0b708f6a79ea15bc29b1f9622b5f803d3c6"}}