{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:4H3A3QCKZ5TXT4GANCDFWMHKJM","short_pith_number":"pith:4H3A3QCK","canonical_record":{"source":{"id":"1307.7416","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-07-28T22:48:56Z","cross_cats_sorted":[],"title_canon_sha256":"57e2d0b1f36dd57d5d3f821d8dbde431af12d9f10127e6a11e689d9c3345b292","abstract_canon_sha256":"bfc4b4b4e0fede138d017eea3985e372a6bb132c5a6b1b3af402865ab2f989fc"},"schema_version":"1.0"},"canonical_sha256":"e1f60dc04acf6779f0c068865b30ea4b08e29732e46c939785ca8b36976964ac","source":{"kind":"arxiv","id":"1307.7416","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.7416","created_at":"2026-05-18T03:17:23Z"},{"alias_kind":"arxiv_version","alias_value":"1307.7416v1","created_at":"2026-05-18T03:17:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.7416","created_at":"2026-05-18T03:17:23Z"},{"alias_kind":"pith_short_12","alias_value":"4H3A3QCKZ5TX","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"4H3A3QCKZ5TXT4GA","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"4H3A3QCK","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:4H3A3QCKZ5TXT4GANCDFWMHKJM","target":"record","payload":{"canonical_record":{"source":{"id":"1307.7416","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-07-28T22:48:56Z","cross_cats_sorted":[],"title_canon_sha256":"57e2d0b1f36dd57d5d3f821d8dbde431af12d9f10127e6a11e689d9c3345b292","abstract_canon_sha256":"bfc4b4b4e0fede138d017eea3985e372a6bb132c5a6b1b3af402865ab2f989fc"},"schema_version":"1.0"},"canonical_sha256":"e1f60dc04acf6779f0c068865b30ea4b08e29732e46c939785ca8b36976964ac","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:23.344730Z","signature_b64":"dpxRDF+XHkLkkWq22wCP1cnHpLDsiVoL2QEw7YihjtAujzQ/TFWb0ynS71hwNQf5VZ8Hq+Csv+0uVkV0rRYdDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1f60dc04acf6779f0c068865b30ea4b08e29732e46c939785ca8b36976964ac","last_reissued_at":"2026-05-18T03:17:23.344325Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:23.344325Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.7416","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-18T03:17:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+RJwiEvQE01lxMfo9vBWlojS8TvnPOfnKSbYwUaluYx2BcdzCu5o4XeW6djidHpDsuSWGZ2Gfjuc9Hptc22qBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T09:23:27.551145Z"},"content_sha256":"43cee1b9961a7f4875524b9ec2c8079a5cdbffca1d12c9a705fe98d403054726","schema_version":"1.0","event_id":"sha256:43cee1b9961a7f4875524b9ec2c8079a5cdbffca1d12c9a705fe98d403054726"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:4H3A3QCKZ5TXT4GANCDFWMHKJM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"DiFS: Distributed Flow Scheduling for Data Center Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Chen Qian, Wenzhi Cui","submitted_at":"2013-07-28T22:48:56Z","abstract_excerpt":"Data center networks leverage multiple parallel paths connecting end host pairs to offer high bisection bandwidth for cluster computing applications. However, state of the art distributed multi-pathing protocols such as Equal Cost Multipath (ECMP) use static flow-to-link assignment, which is load-oblivious. They may cause bandwidth loss due to \\emph{flow collisions} on a same link. Recently proposed centralized scheduling algorithm or host-based multi-pathing may suffer from scalability problems.\n  In this paper, we present Distributed Flow Scheduling (DiFS) for data center networks, which is "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.7416","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-18T03:17:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iNHsiC4UHMDkAkWRHAxRnNenTzPdgHbY1mAE5oLc/JKNvlLtRvgZqG+ZbY2ANVYRxZ5IA9OVWOkE6PaHbchPBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T09:23:27.551506Z"},"content_sha256":"2ed09a352026c662012c9159a545a720e0b43a9cf1cd7dce0cfb09ba4c9f54f8","schema_version":"1.0","event_id":"sha256:2ed09a352026c662012c9159a545a720e0b43a9cf1cd7dce0cfb09ba4c9f54f8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4H3A3QCKZ5TXT4GANCDFWMHKJM/bundle.json","state_url":"https://pith.science/pith/4H3A3QCKZ5TXT4GANCDFWMHKJM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4H3A3QCKZ5TXT4GANCDFWMHKJM/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-02T09:23:27Z","links":{"resolver":"https://pith.science/pith/4H3A3QCKZ5TXT4GANCDFWMHKJM","bundle":"https://pith.science/pith/4H3A3QCKZ5TXT4GANCDFWMHKJM/bundle.json","state":"https://pith.science/pith/4H3A3QCKZ5TXT4GANCDFWMHKJM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4H3A3QCKZ5TXT4GANCDFWMHKJM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:4H3A3QCKZ5TXT4GANCDFWMHKJM","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":"bfc4b4b4e0fede138d017eea3985e372a6bb132c5a6b1b3af402865ab2f989fc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-07-28T22:48:56Z","title_canon_sha256":"57e2d0b1f36dd57d5d3f821d8dbde431af12d9f10127e6a11e689d9c3345b292"},"schema_version":"1.0","source":{"id":"1307.7416","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.7416","created_at":"2026-05-18T03:17:23Z"},{"alias_kind":"arxiv_version","alias_value":"1307.7416v1","created_at":"2026-05-18T03:17:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.7416","created_at":"2026-05-18T03:17:23Z"},{"alias_kind":"pith_short_12","alias_value":"4H3A3QCKZ5TX","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"4H3A3QCKZ5TXT4GA","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"4H3A3QCK","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:2ed09a352026c662012c9159a545a720e0b43a9cf1cd7dce0cfb09ba4c9f54f8","target":"graph","created_at":"2026-05-18T03:17:23Z","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":"Data center networks leverage multiple parallel paths connecting end host pairs to offer high bisection bandwidth for cluster computing applications. However, state of the art distributed multi-pathing protocols such as Equal Cost Multipath (ECMP) use static flow-to-link assignment, which is load-oblivious. They may cause bandwidth loss due to \\emph{flow collisions} on a same link. Recently proposed centralized scheduling algorithm or host-based multi-pathing may suffer from scalability problems.\n  In this paper, we present Distributed Flow Scheduling (DiFS) for data center networks, which is ","authors_text":"Chen Qian, Wenzhi Cui","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-07-28T22:48:56Z","title":"DiFS: Distributed Flow Scheduling for Data Center Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.7416","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:43cee1b9961a7f4875524b9ec2c8079a5cdbffca1d12c9a705fe98d403054726","target":"record","created_at":"2026-05-18T03:17:23Z","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":"bfc4b4b4e0fede138d017eea3985e372a6bb132c5a6b1b3af402865ab2f989fc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-07-28T22:48:56Z","title_canon_sha256":"57e2d0b1f36dd57d5d3f821d8dbde431af12d9f10127e6a11e689d9c3345b292"},"schema_version":"1.0","source":{"id":"1307.7416","kind":"arxiv","version":1}},"canonical_sha256":"e1f60dc04acf6779f0c068865b30ea4b08e29732e46c939785ca8b36976964ac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e1f60dc04acf6779f0c068865b30ea4b08e29732e46c939785ca8b36976964ac","first_computed_at":"2026-05-18T03:17:23.344325Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:17:23.344325Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dpxRDF+XHkLkkWq22wCP1cnHpLDsiVoL2QEw7YihjtAujzQ/TFWb0ynS71hwNQf5VZ8Hq+Csv+0uVkV0rRYdDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:17:23.344730Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.7416","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:43cee1b9961a7f4875524b9ec2c8079a5cdbffca1d12c9a705fe98d403054726","sha256:2ed09a352026c662012c9159a545a720e0b43a9cf1cd7dce0cfb09ba4c9f54f8"],"state_sha256":"42f6e2cec1544d53b80df5acbde69684bd382d509070d5dce18c287e37bfad60"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8mxB6Hx8HgjNGhZVlvyOBrGtkG1YkU9qJrp57zg5n4ZOKo/YFy3mnrZBjNAKm3APtl8lhF400FrETSWfnYmTAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T09:23:27.553478Z","bundle_sha256":"da8f1f1d2ed53bb7174d7f58a114dcc2b03a937b792dee0e904349554b59a9cf"}}