{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:UMWN3DXP37TWJYLMQBIQUD3VHP","short_pith_number":"pith:UMWN3DXP","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"},"canonical_sha256":"a32cdd8eefdfe764e16c80510a0f753bfaaaa09e9b981e4314c6c8fcf14e7e67","source":{"kind":"arxiv","id":"2509.06640","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.06640","created_at":"2026-07-05T12:06:39Z"},{"alias_kind":"arxiv_version","alias_value":"2509.06640v1","created_at":"2026-07-05T12:06:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.06640","created_at":"2026-07-05T12:06:39Z"},{"alias_kind":"pith_short_12","alias_value":"UMWN3DXP37TW","created_at":"2026-07-05T12:06:39Z"},{"alias_kind":"pith_short_16","alias_value":"UMWN3DXP37TWJYLM","created_at":"2026-07-05T12:06:39Z"},{"alias_kind":"pith_short_8","alias_value":"UMWN3DXP","created_at":"2026-07-05T12:06:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:UMWN3DXP37TWJYLMQBIQUD3VHP","target":"record","payload":{"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"},"canonical_sha256":"a32cdd8eefdfe764e16c80510a0f753bfaaaa09e9b981e4314c6c8fcf14e7e67","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"},"source_kind":"arxiv","source_id":"2509.06640","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-05T12:06:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BJietWTHpm4lo0ZoKFfwYPfaJyl3adwUIgXlVVSKjN6vlkQBx+jWM3midUZRPc/iFZe7OVGo1dmU1EUZ5AOpCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T05:34:07.276227Z"},"content_sha256":"a83f7ace67c25d9f709948f30d741de30685dadc6123a5e0269b00e00d02e93b","schema_version":"1.0","event_id":"sha256:a83f7ace67c25d9f709948f30d741de30685dadc6123a5e0269b00e00d02e93b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:UMWN3DXP37TWJYLMQBIQUD3VHP","target":"graph","payload":{"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"},"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-05T12:06:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9URokD9ZmpiJMqz6KrmXPr2r1onVMcLai33w3Z8jbfwxQ1wnzbfIbuJ2sBshobB1Zp8O/YdHXNskb2iXgQXeDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T05:34:07.276743Z"},"content_sha256":"0eb44af32d9912b36bea73bf47608bc6fabc4a255721725aeb702a0ae35052cb","schema_version":"1.0","event_id":"sha256:0eb44af32d9912b36bea73bf47608bc6fabc4a255721725aeb702a0ae35052cb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UMWN3DXP37TWJYLMQBIQUD3VHP/bundle.json","state_url":"https://pith.science/pith/UMWN3DXP37TWJYLMQBIQUD3VHP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UMWN3DXP37TWJYLMQBIQUD3VHP/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-10T05:34:07Z","links":{"resolver":"https://pith.science/pith/UMWN3DXP37TWJYLMQBIQUD3VHP","bundle":"https://pith.science/pith/UMWN3DXP37TWJYLMQBIQUD3VHP/bundle.json","state":"https://pith.science/pith/UMWN3DXP37TWJYLMQBIQUD3VHP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UMWN3DXP37TWJYLMQBIQUD3VHP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:UMWN3DXP37TWJYLMQBIQUD3VHP","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":"a13ca82b117cdab6b18c7b4ffb3e8de3e4a792de45a8bf9f530ce81c15fd654b","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-09-08T12:56:42Z","title_canon_sha256":"a6ddad94141d4ffe8baaf41a4d805135c5bc005325794bf9333238130aaf66cf"},"schema_version":"1.0","source":{"id":"2509.06640","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.06640","created_at":"2026-07-05T12:06:39Z"},{"alias_kind":"arxiv_version","alias_value":"2509.06640v1","created_at":"2026-07-05T12:06:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.06640","created_at":"2026-07-05T12:06:39Z"},{"alias_kind":"pith_short_12","alias_value":"UMWN3DXP37TW","created_at":"2026-07-05T12:06:39Z"},{"alias_kind":"pith_short_16","alias_value":"UMWN3DXP37TWJYLM","created_at":"2026-07-05T12:06:39Z"},{"alias_kind":"pith_short_8","alias_value":"UMWN3DXP","created_at":"2026-07-05T12:06:39Z"}],"graph_snapshots":[{"event_id":"sha256:0eb44af32d9912b36bea73bf47608bc6fabc4a255721725aeb702a0ae35052cb","target":"graph","created_at":"2026-07-05T12:06:39Z","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/2509.06640/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Anish Arora, Sen Lin, Yung-Fu Chen","cross_cats":["cs.NI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-09-08T12:56:42Z","title":"Knowledge-Guided Machine Learning for Stabilizing Near-Shortest Path Routing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.06640","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:a83f7ace67c25d9f709948f30d741de30685dadc6123a5e0269b00e00d02e93b","target":"record","created_at":"2026-07-05T12:06:39Z","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":"a13ca82b117cdab6b18c7b4ffb3e8de3e4a792de45a8bf9f530ce81c15fd654b","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-09-08T12:56:42Z","title_canon_sha256":"a6ddad94141d4ffe8baaf41a4d805135c5bc005325794bf9333238130aaf66cf"},"schema_version":"1.0","source":{"id":"2509.06640","kind":"arxiv","version":1}},"canonical_sha256":"a32cdd8eefdfe764e16c80510a0f753bfaaaa09e9b981e4314c6c8fcf14e7e67","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a32cdd8eefdfe764e16c80510a0f753bfaaaa09e9b981e4314c6c8fcf14e7e67","first_computed_at":"2026-07-05T12:06:39.582175Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:06:39.582175Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RlnMxkM/QNp3T4bZOiJf8XL8yZru2g9VxC5xoahVttZrT8ttAvUJciv+7CSLEDtbetAdct0i1M4yTWMn0SDiDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T12:06:39.582535Z","signed_message":"canonical_sha256_bytes"},"source_id":"2509.06640","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a83f7ace67c25d9f709948f30d741de30685dadc6123a5e0269b00e00d02e93b","sha256:0eb44af32d9912b36bea73bf47608bc6fabc4a255721725aeb702a0ae35052cb"],"state_sha256":"9285627f302fc25735d962074132c44cca6befce9092b8bd00d17104ce8be1b1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cXVn/cPL5GbbSieNQVLlw4frX5CWpWe1XtrT9WO7t6drXeAM+K8Yl1MJ83r/sX2SCdBgDqMiZXq2JqwqXBuCAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T05:34:07.281125Z","bundle_sha256":"d15ff9c5d6fedd88ac68f67c91e5c0ac5b7d90c1e98f6989a28ff65611e86579"}}