{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:UMWN3DXP37TWJYLMQBIQUD3VHP","short_pith_number":"pith:UMWN3DXP","schema_version":"1.0","canonical_sha256":"a32cdd8eefdfe764e16c80510a0f753bfaaaa09e9b981e4314c6c8fcf14e7e67","source":{"kind":"arxiv","id":"2509.06640","version":1},"attestation_state":"computed","paper":{"title":"Knowledge-Guided Machine Learning for Stabilizing Near-Shortest Path Routing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.LG","authors_text":"Anish Arora, Sen Lin, Yung-Fu Chen","submitted_at":"2025-09-08T12:56:42Z","abstract_excerpt":"We propose a simple algorithm that needs only a few data samples from a single graph for learning local routing policies that generalize across a rich class of geometric random graphs in Euclidean metric spaces. We thus solve the all-pairs near-shortest path problem by training deep neural networks (DNNs) that let each graph node efficiently and scalably route (i.e., forward) packets by considering only the node's state and the state of the neighboring nodes. Our algorithm design exploits network domain knowledge in the selection of input features and design of the policy function for learning"},"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":"2509.06640","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-09-08T12:56:42Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"a6ddad94141d4ffe8baaf41a4d805135c5bc005325794bf9333238130aaf66cf","abstract_canon_sha256":"a13ca82b117cdab6b18c7b4ffb3e8de3e4a792de45a8bf9f530ce81c15fd654b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:06:39.582535Z","signature_b64":"RlnMxkM/QNp3T4bZOiJf8XL8yZru2g9VxC5xoahVttZrT8ttAvUJciv+7CSLEDtbetAdct0i1M4yTWMn0SDiDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a32cdd8eefdfe764e16c80510a0f753bfaaaa09e9b981e4314c6c8fcf14e7e67","last_reissued_at":"2026-07-05T12:06:39.582175Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:06:39.582175Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Knowledge-Guided Machine Learning for Stabilizing Near-Shortest Path Routing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.LG","authors_text":"Anish Arora, Sen Lin, Yung-Fu Chen","submitted_at":"2025-09-08T12:56:42Z","abstract_excerpt":"We propose a simple algorithm that needs only a few data samples from a single graph for learning local routing policies that generalize across a rich class of geometric random graphs in Euclidean metric spaces. We thus solve the all-pairs near-shortest path problem by training deep neural networks (DNNs) that let each graph node efficiently and scalably route (i.e., forward) packets by considering only the node's state and the state of the neighboring nodes. Our algorithm design exploits network domain knowledge in the selection of input features and design of the policy function for learning"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.06640","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/2509.06640/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2509.06640","created_at":"2026-07-05T12:06:39.582230+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.06640v1","created_at":"2026-07-05T12:06:39.582230+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.06640","created_at":"2026-07-05T12:06:39.582230+00:00"},{"alias_kind":"pith_short_12","alias_value":"UMWN3DXP37TW","created_at":"2026-07-05T12:06:39.582230+00:00"},{"alias_kind":"pith_short_16","alias_value":"UMWN3DXP37TWJYLM","created_at":"2026-07-05T12:06:39.582230+00:00"},{"alias_kind":"pith_short_8","alias_value":"UMWN3DXP","created_at":"2026-07-05T12:06:39.582230+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/UMWN3DXP37TWJYLMQBIQUD3VHP","json":"https://pith.science/pith/UMWN3DXP37TWJYLMQBIQUD3VHP.json","graph_json":"https://pith.science/api/pith-number/UMWN3DXP37TWJYLMQBIQUD3VHP/graph.json","events_json":"https://pith.science/api/pith-number/UMWN3DXP37TWJYLMQBIQUD3VHP/events.json","paper":"https://pith.science/paper/UMWN3DXP"},"agent_actions":{"view_html":"https://pith.science/pith/UMWN3DXP37TWJYLMQBIQUD3VHP","download_json":"https://pith.science/pith/UMWN3DXP37TWJYLMQBIQUD3VHP.json","view_paper":"https://pith.science/paper/UMWN3DXP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.06640&json=true","fetch_graph":"https://pith.science/api/pith-number/UMWN3DXP37TWJYLMQBIQUD3VHP/graph.json","fetch_events":"https://pith.science/api/pith-number/UMWN3DXP37TWJYLMQBIQUD3VHP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UMWN3DXP37TWJYLMQBIQUD3VHP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UMWN3DXP37TWJYLMQBIQUD3VHP/action/storage_attestation","attest_author":"https://pith.science/pith/UMWN3DXP37TWJYLMQBIQUD3VHP/action/author_attestation","sign_citation":"https://pith.science/pith/UMWN3DXP37TWJYLMQBIQUD3VHP/action/citation_signature","submit_replication":"https://pith.science/pith/UMWN3DXP37TWJYLMQBIQUD3VHP/action/replication_record"}},"created_at":"2026-07-05T12:06:39.582230+00:00","updated_at":"2026-07-05T12:06:39.582230+00:00"}