{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:Z22YHB24EGDPVNPHFPBPVETAOG","short_pith_number":"pith:Z22YHB24","schema_version":"1.0","canonical_sha256":"ceb583875c2186fab5e72bc2fa9260718b2a854ba289a303aca8c451a1279a67","source":{"kind":"arxiv","id":"1708.03074","version":2},"attestation_state":"computed","paper":{"title":"A Machine Learning Approach to Routing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.NI","authors_text":"Asaf Valadarsky, Aviv Tamar, Dafna Shahaf, Michael Schapira","submitted_at":"2017-08-10T04:33:09Z","abstract_excerpt":"Can ideas and techniques from machine learning be leveraged to automatically generate \"good\" routing configurations? We investigate the power of data-driven routing protocols. Our results suggest that applying ideas and techniques from deep reinforcement learning to this context yields high performance, motivating further research along these lines."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1708.03074","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-08-10T04:33:09Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"12b327127ddd28f5acba68ad04b0f851359544b4b8e4fbae3411d3021c5dee4e","abstract_canon_sha256":"4fb65b9db39940b52932357922c144f2f50d534acbfb2fefb6cb99b3ebc155b8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:50.555289Z","signature_b64":"aKuPNymu1gShq/sfoDS7wnpt4G3+jKxN2FoUkZAL175LbaWpu/ewkB9lRIBx0k3LNif1cFFixRz3e4BXXtpKDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ceb583875c2186fab5e72bc2fa9260718b2a854ba289a303aca8c451a1279a67","last_reissued_at":"2026-05-18T00:30:50.554658Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:50.554658Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Machine Learning Approach to Routing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.NI","authors_text":"Asaf Valadarsky, Aviv Tamar, Dafna Shahaf, Michael Schapira","submitted_at":"2017-08-10T04:33:09Z","abstract_excerpt":"Can ideas and techniques from machine learning be leveraged to automatically generate \"good\" routing configurations? We investigate the power of data-driven routing protocols. Our results suggest that applying ideas and techniques from deep reinforcement learning to this context yields high performance, motivating further research along these lines."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.03074","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":""},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1708.03074","created_at":"2026-05-18T00:30:50.554754+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.03074v2","created_at":"2026-05-18T00:30:50.554754+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.03074","created_at":"2026-05-18T00:30:50.554754+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z22YHB24EGDP","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z22YHB24EGDPVNPH","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z22YHB24","created_at":"2026-05-18T12:31:59.375834+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Z22YHB24EGDPVNPHFPBPVETAOG","json":"https://pith.science/pith/Z22YHB24EGDPVNPHFPBPVETAOG.json","graph_json":"https://pith.science/api/pith-number/Z22YHB24EGDPVNPHFPBPVETAOG/graph.json","events_json":"https://pith.science/api/pith-number/Z22YHB24EGDPVNPHFPBPVETAOG/events.json","paper":"https://pith.science/paper/Z22YHB24"},"agent_actions":{"view_html":"https://pith.science/pith/Z22YHB24EGDPVNPHFPBPVETAOG","download_json":"https://pith.science/pith/Z22YHB24EGDPVNPHFPBPVETAOG.json","view_paper":"https://pith.science/paper/Z22YHB24","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.03074&json=true","fetch_graph":"https://pith.science/api/pith-number/Z22YHB24EGDPVNPHFPBPVETAOG/graph.json","fetch_events":"https://pith.science/api/pith-number/Z22YHB24EGDPVNPHFPBPVETAOG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z22YHB24EGDPVNPHFPBPVETAOG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z22YHB24EGDPVNPHFPBPVETAOG/action/storage_attestation","attest_author":"https://pith.science/pith/Z22YHB24EGDPVNPHFPBPVETAOG/action/author_attestation","sign_citation":"https://pith.science/pith/Z22YHB24EGDPVNPHFPBPVETAOG/action/citation_signature","submit_replication":"https://pith.science/pith/Z22YHB24EGDPVNPHFPBPVETAOG/action/replication_record"}},"created_at":"2026-05-18T00:30:50.554754+00:00","updated_at":"2026-05-18T00:30:50.554754+00:00"}