{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:ABYL4ZGF2O5CWUOONZJKRTEZQA","short_pith_number":"pith:ABYL4ZGF","canonical_record":{"source":{"id":"2303.00735","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2023-03-01T18:50:59Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"f7825829e83c5363b92e14950b2272b97686b778fffa029e578edd7a3e640284","abstract_canon_sha256":"0de4f5e6f5ba6693d9df346c132e78e66bfa75ddebf15be0ac02e024d5112bb0"},"schema_version":"1.0"},"canonical_sha256":"0070be64c5d3ba2b51ce6e52a8cc9980038ca5723b784d5831b7ab02a17514c2","source":{"kind":"arxiv","id":"2303.00735","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.00735","created_at":"2026-07-05T05:48:06Z"},{"alias_kind":"arxiv_version","alias_value":"2303.00735v2","created_at":"2026-07-05T05:48:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.00735","created_at":"2026-07-05T05:48:06Z"},{"alias_kind":"pith_short_12","alias_value":"ABYL4ZGF2O5C","created_at":"2026-07-05T05:48:06Z"},{"alias_kind":"pith_short_16","alias_value":"ABYL4ZGF2O5CWUOO","created_at":"2026-07-05T05:48:06Z"},{"alias_kind":"pith_short_8","alias_value":"ABYL4ZGF","created_at":"2026-07-05T05:48:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:ABYL4ZGF2O5CWUOONZJKRTEZQA","target":"record","payload":{"canonical_record":{"source":{"id":"2303.00735","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2023-03-01T18:50:59Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"f7825829e83c5363b92e14950b2272b97686b778fffa029e578edd7a3e640284","abstract_canon_sha256":"0de4f5e6f5ba6693d9df346c132e78e66bfa75ddebf15be0ac02e024d5112bb0"},"schema_version":"1.0"},"canonical_sha256":"0070be64c5d3ba2b51ce6e52a8cc9980038ca5723b784d5831b7ab02a17514c2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:48:06.957997Z","signature_b64":"DiDHfb8cGqvdtBetGNGEufkScjAPdcEAQSo6XI9ixgNQOct2RjzEQBprXYZl4t409YJz1tmjQHgP5Cg35e+FCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0070be64c5d3ba2b51ce6e52a8cc9980038ca5723b784d5831b7ab02a17514c2","last_reissued_at":"2026-07-05T05:48:06.957650Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:48:06.957650Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2303.00735","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-05T05:48:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O4TGyG5xr9TSTa49RdmpG2sSe8pC7oVeJCTb8p+JA0Dc7/NWFw+6qP7s76pgE/oEKRiSID2KXkqb09acqkcbCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T11:35:14.752436Z"},"content_sha256":"4f630c7aeceb286f1cfc61f3007ee9295435f6e840d4a0391ce69fb8d7240a6d","schema_version":"1.0","event_id":"sha256:4f630c7aeceb286f1cfc61f3007ee9295435f6e840d4a0391ce69fb8d7240a6d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:ABYL4ZGF2O5CWUOONZJKRTEZQA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Deep Learning Perspective on Network Routing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.NI","authors_text":"Aviv Tamar, Chaim Hoch, Felipe Vieira Frujeri, Ishai Menache, Michael Schapira, Srikanth Kandula, Yarin Perry","submitted_at":"2023-03-01T18:50:59Z","abstract_excerpt":"Routing is, arguably, the most fundamental task in computer networking, and the most extensively studied one. A key challenge for routing in real-world environments is the need to contend with uncertainty about future traffic demands. We present a new approach to routing under demand uncertainty: tackling this challenge as stochastic optimization, and employing deep learning to learn complex patterns in traffic demands. We show that our method provably converges to the global optimum in well-studied theoretical models of multicommodity flow. We exemplify the practical usefulness of our approac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.00735","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/2303.00735/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-05T05:48:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yi4A3kyZ7HpCzwC93oBt1oahSlmQCEO/Lyl6OyC2dcY9Qe4/k5cFl/CRFKsuurQdW1U5YT2dQt3m0E1dx2vUDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T11:35:14.752951Z"},"content_sha256":"f868da59a4cdc071d6389b42de42dc81d2f25c3d54871f51ed942da28e89778d","schema_version":"1.0","event_id":"sha256:f868da59a4cdc071d6389b42de42dc81d2f25c3d54871f51ed942da28e89778d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ABYL4ZGF2O5CWUOONZJKRTEZQA/bundle.json","state_url":"https://pith.science/pith/ABYL4ZGF2O5CWUOONZJKRTEZQA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ABYL4ZGF2O5CWUOONZJKRTEZQA/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-15T11:35:14Z","links":{"resolver":"https://pith.science/pith/ABYL4ZGF2O5CWUOONZJKRTEZQA","bundle":"https://pith.science/pith/ABYL4ZGF2O5CWUOONZJKRTEZQA/bundle.json","state":"https://pith.science/pith/ABYL4ZGF2O5CWUOONZJKRTEZQA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ABYL4ZGF2O5CWUOONZJKRTEZQA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:ABYL4ZGF2O5CWUOONZJKRTEZQA","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":"0de4f5e6f5ba6693d9df346c132e78e66bfa75ddebf15be0ac02e024d5112bb0","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2023-03-01T18:50:59Z","title_canon_sha256":"f7825829e83c5363b92e14950b2272b97686b778fffa029e578edd7a3e640284"},"schema_version":"1.0","source":{"id":"2303.00735","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.00735","created_at":"2026-07-05T05:48:06Z"},{"alias_kind":"arxiv_version","alias_value":"2303.00735v2","created_at":"2026-07-05T05:48:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.00735","created_at":"2026-07-05T05:48:06Z"},{"alias_kind":"pith_short_12","alias_value":"ABYL4ZGF2O5C","created_at":"2026-07-05T05:48:06Z"},{"alias_kind":"pith_short_16","alias_value":"ABYL4ZGF2O5CWUOO","created_at":"2026-07-05T05:48:06Z"},{"alias_kind":"pith_short_8","alias_value":"ABYL4ZGF","created_at":"2026-07-05T05:48:06Z"}],"graph_snapshots":[{"event_id":"sha256:f868da59a4cdc071d6389b42de42dc81d2f25c3d54871f51ed942da28e89778d","target":"graph","created_at":"2026-07-05T05:48:06Z","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/2303.00735/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Routing is, arguably, the most fundamental task in computer networking, and the most extensively studied one. A key challenge for routing in real-world environments is the need to contend with uncertainty about future traffic demands. We present a new approach to routing under demand uncertainty: tackling this challenge as stochastic optimization, and employing deep learning to learn complex patterns in traffic demands. We show that our method provably converges to the global optimum in well-studied theoretical models of multicommodity flow. We exemplify the practical usefulness of our approac","authors_text":"Aviv Tamar, Chaim Hoch, Felipe Vieira Frujeri, Ishai Menache, Michael Schapira, Srikanth Kandula, Yarin Perry","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2023-03-01T18:50:59Z","title":"A Deep Learning Perspective on Network Routing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.00735","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:4f630c7aeceb286f1cfc61f3007ee9295435f6e840d4a0391ce69fb8d7240a6d","target":"record","created_at":"2026-07-05T05:48:06Z","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":"0de4f5e6f5ba6693d9df346c132e78e66bfa75ddebf15be0ac02e024d5112bb0","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2023-03-01T18:50:59Z","title_canon_sha256":"f7825829e83c5363b92e14950b2272b97686b778fffa029e578edd7a3e640284"},"schema_version":"1.0","source":{"id":"2303.00735","kind":"arxiv","version":2}},"canonical_sha256":"0070be64c5d3ba2b51ce6e52a8cc9980038ca5723b784d5831b7ab02a17514c2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0070be64c5d3ba2b51ce6e52a8cc9980038ca5723b784d5831b7ab02a17514c2","first_computed_at":"2026-07-05T05:48:06.957650Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:48:06.957650Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DiDHfb8cGqvdtBetGNGEufkScjAPdcEAQSo6XI9ixgNQOct2RjzEQBprXYZl4t409YJz1tmjQHgP5Cg35e+FCw==","signature_status":"signed_v1","signed_at":"2026-07-05T05:48:06.957997Z","signed_message":"canonical_sha256_bytes"},"source_id":"2303.00735","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4f630c7aeceb286f1cfc61f3007ee9295435f6e840d4a0391ce69fb8d7240a6d","sha256:f868da59a4cdc071d6389b42de42dc81d2f25c3d54871f51ed942da28e89778d"],"state_sha256":"9f822f1147c88b6b4758719660738185f1fff00764dab711920a54ef018bb53c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hqIQZgJNiMcvGVfYGnBtY5nN17T6cSDGaC+QmiXFqr0SkSCOWtgd492pAtZAZ/wNUc61Fin0aXQxwSKwzRHaDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T11:35:14.756396Z","bundle_sha256":"015c8a8d9ab0ac886df9909fcf39c4e58bcc07f6c9aab6e2fe70469d47355572"}}