{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:ABG6KTCZCZJAZFWFIMS2QVCCSS","short_pith_number":"pith:ABG6KTCZ","canonical_record":{"source":{"id":"2505.03908","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2025-05-06T18:29:57Z","cross_cats_sorted":["cs.DS","cs.PF"],"title_canon_sha256":"491823fadcbdff4c2fb6c376461c96282c6b4020d01587b1d24a0fd77ba46422","abstract_canon_sha256":"dbd4bb57e741c5ad4398ccc52abcd7b99c7c0321da67c96e42579aaaa5fcca7e"},"schema_version":"1.0"},"canonical_sha256":"004de54c5916520c96c54325a854429495576b78e676347a5982b4184227d171","source":{"kind":"arxiv","id":"2505.03908","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.03908","created_at":"2026-07-05T10:59:33Z"},{"alias_kind":"arxiv_version","alias_value":"2505.03908v1","created_at":"2026-07-05T10:59:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.03908","created_at":"2026-07-05T10:59:33Z"},{"alias_kind":"pith_short_12","alias_value":"ABG6KTCZCZJA","created_at":"2026-07-05T10:59:33Z"},{"alias_kind":"pith_short_16","alias_value":"ABG6KTCZCZJAZFWF","created_at":"2026-07-05T10:59:33Z"},{"alias_kind":"pith_short_8","alias_value":"ABG6KTCZ","created_at":"2026-07-05T10:59:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:ABG6KTCZCZJAZFWFIMS2QVCCSS","target":"record","payload":{"canonical_record":{"source":{"id":"2505.03908","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2025-05-06T18:29:57Z","cross_cats_sorted":["cs.DS","cs.PF"],"title_canon_sha256":"491823fadcbdff4c2fb6c376461c96282c6b4020d01587b1d24a0fd77ba46422","abstract_canon_sha256":"dbd4bb57e741c5ad4398ccc52abcd7b99c7c0321da67c96e42579aaaa5fcca7e"},"schema_version":"1.0"},"canonical_sha256":"004de54c5916520c96c54325a854429495576b78e676347a5982b4184227d171","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:59:33.631333Z","signature_b64":"k3RplhN/6zH/pxLnxS4Q14LY7qqlI0sdYPK6klHOxAc7W/J5heJP6/2a/Ye+/0EAq0g0TQtiNaP9aV7gVNTQBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"004de54c5916520c96c54325a854429495576b78e676347a5982b4184227d171","last_reissued_at":"2026-07-05T10:59:33.630822Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:59:33.630822Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.03908","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-05T10:59:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uydMqzsnNnywrp/YidZ0Qk0p/YBo+eIz5gYxoLLJ7jCmNrO93HA/g4dB4jZUJah0vJaAV1yt45dD0b/pjVKVDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T00:06:03.406826Z"},"content_sha256":"fae52300d6cbe6988180d884ad110ac91965674bca4cecc82330f76a68907fd9","schema_version":"1.0","event_id":"sha256:fae52300d6cbe6988180d884ad110ac91965674bca4cecc82330f76a68907fd9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:ABG6KTCZCZJAZFWFIMS2QVCCSS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.PF"],"primary_cat":"cs.NI","authors_text":"Jo\\~ao Lu\\'is Sobrinho, Justine Sherry, Michael Dinitz, Miguel Ferreira, Nirav Atre","submitted_at":"2025-05-06T18:29:57Z","abstract_excerpt":"Millions of flows are routed concurrently through a modern data-center. These networks are often built as Clos topologies, and flow demands are constrained only by the link capacities at the ingress and egress points. The minimum congestion routing problem seeks to route a set of flows through a data center while minimizing the maximum flow demand on any link. This is easily achieved by splitting flow demands along all available paths. However, arbitrary flow splitting is unrealistic. Instead, network operators rely on heuristics for routing unsplittable flows, the best of which results in a w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.03908","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/2505.03908/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-05T10:59:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T56qb2fFWavqqfv5D5XdIlioyiuEuEU8Wfdn+XPC8F6W+lImlDSPfRKKNHeerHhXyeIGArlUitMO/upxraZaAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T00:06:03.407345Z"},"content_sha256":"31f9555ebad59c5593012eaec64e76b8e464edd6d01f51650acfc3aefe9f032b","schema_version":"1.0","event_id":"sha256:31f9555ebad59c5593012eaec64e76b8e464edd6d01f51650acfc3aefe9f032b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ABG6KTCZCZJAZFWFIMS2QVCCSS/bundle.json","state_url":"https://pith.science/pith/ABG6KTCZCZJAZFWFIMS2QVCCSS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ABG6KTCZCZJAZFWFIMS2QVCCSS/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-19T00:06:03Z","links":{"resolver":"https://pith.science/pith/ABG6KTCZCZJAZFWFIMS2QVCCSS","bundle":"https://pith.science/pith/ABG6KTCZCZJAZFWFIMS2QVCCSS/bundle.json","state":"https://pith.science/pith/ABG6KTCZCZJAZFWFIMS2QVCCSS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ABG6KTCZCZJAZFWFIMS2QVCCSS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:ABG6KTCZCZJAZFWFIMS2QVCCSS","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":"dbd4bb57e741c5ad4398ccc52abcd7b99c7c0321da67c96e42579aaaa5fcca7e","cross_cats_sorted":["cs.DS","cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2025-05-06T18:29:57Z","title_canon_sha256":"491823fadcbdff4c2fb6c376461c96282c6b4020d01587b1d24a0fd77ba46422"},"schema_version":"1.0","source":{"id":"2505.03908","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.03908","created_at":"2026-07-05T10:59:33Z"},{"alias_kind":"arxiv_version","alias_value":"2505.03908v1","created_at":"2026-07-05T10:59:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.03908","created_at":"2026-07-05T10:59:33Z"},{"alias_kind":"pith_short_12","alias_value":"ABG6KTCZCZJA","created_at":"2026-07-05T10:59:33Z"},{"alias_kind":"pith_short_16","alias_value":"ABG6KTCZCZJAZFWF","created_at":"2026-07-05T10:59:33Z"},{"alias_kind":"pith_short_8","alias_value":"ABG6KTCZ","created_at":"2026-07-05T10:59:33Z"}],"graph_snapshots":[{"event_id":"sha256:31f9555ebad59c5593012eaec64e76b8e464edd6d01f51650acfc3aefe9f032b","target":"graph","created_at":"2026-07-05T10:59:33Z","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/2505.03908/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Millions of flows are routed concurrently through a modern data-center. These networks are often built as Clos topologies, and flow demands are constrained only by the link capacities at the ingress and egress points. The minimum congestion routing problem seeks to route a set of flows through a data center while minimizing the maximum flow demand on any link. This is easily achieved by splitting flow demands along all available paths. However, arbitrary flow splitting is unrealistic. Instead, network operators rely on heuristics for routing unsplittable flows, the best of which results in a w","authors_text":"Jo\\~ao Lu\\'is Sobrinho, Justine Sherry, Michael Dinitz, Miguel Ferreira, Nirav Atre","cross_cats":["cs.DS","cs.PF"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2025-05-06T18:29:57Z","title":"Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.03908","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:fae52300d6cbe6988180d884ad110ac91965674bca4cecc82330f76a68907fd9","target":"record","created_at":"2026-07-05T10:59:33Z","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":"dbd4bb57e741c5ad4398ccc52abcd7b99c7c0321da67c96e42579aaaa5fcca7e","cross_cats_sorted":["cs.DS","cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2025-05-06T18:29:57Z","title_canon_sha256":"491823fadcbdff4c2fb6c376461c96282c6b4020d01587b1d24a0fd77ba46422"},"schema_version":"1.0","source":{"id":"2505.03908","kind":"arxiv","version":1}},"canonical_sha256":"004de54c5916520c96c54325a854429495576b78e676347a5982b4184227d171","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"004de54c5916520c96c54325a854429495576b78e676347a5982b4184227d171","first_computed_at":"2026-07-05T10:59:33.630822Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:59:33.630822Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"k3RplhN/6zH/pxLnxS4Q14LY7qqlI0sdYPK6klHOxAc7W/J5heJP6/2a/Ye+/0EAq0g0TQtiNaP9aV7gVNTQBA==","signature_status":"signed_v1","signed_at":"2026-07-05T10:59:33.631333Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.03908","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fae52300d6cbe6988180d884ad110ac91965674bca4cecc82330f76a68907fd9","sha256:31f9555ebad59c5593012eaec64e76b8e464edd6d01f51650acfc3aefe9f032b"],"state_sha256":"2fa1ad4a62300247a8cd5ef58a3c20a54e6b499360f3223c7f02bab4a4cf6cf0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LqV7AJS5qYuKSanU3n1SRw+Ikn/s9RkeCH28ghQf2WoYP34kPPfqwWqpvSHJ+iOmkLoHhhoWnEOzD34VdthYBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T00:06:03.412921Z","bundle_sha256":"3d3507d2e8b89eb0074a482a04df27972b22bac815e3495dbfc4af55d8e204d8"}}