{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:GUAWR5B2LWHVFCM4JFTLOMAK5I","short_pith_number":"pith:GUAWR5B2","canonical_record":{"source":{"id":"2606.18105","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2026-06-16T16:06:51Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"78104fcb284aea57c44e0c0b63588fce97d4d39ea609efbcf10239d4f588b5ad","abstract_canon_sha256":"9ef5539b82bd0a5ad3837613a95a82e05c86aa72ac43d056973b096382c35afa"},"schema_version":"1.0"},"canonical_sha256":"350168f43a5d8f52899c4966b7300aea24ff49d6056c156758f89647c13697ec","source":{"kind":"arxiv","id":"2606.18105","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.18105","created_at":"2026-06-19T16:11:38Z"},{"alias_kind":"arxiv_version","alias_value":"2606.18105v2","created_at":"2026-06-19T16:11:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.18105","created_at":"2026-06-19T16:11:38Z"},{"alias_kind":"pith_short_12","alias_value":"GUAWR5B2LWHV","created_at":"2026-06-19T16:11:38Z"},{"alias_kind":"pith_short_16","alias_value":"GUAWR5B2LWHVFCM4","created_at":"2026-06-19T16:11:38Z"},{"alias_kind":"pith_short_8","alias_value":"GUAWR5B2","created_at":"2026-06-19T16:11:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:GUAWR5B2LWHVFCM4JFTLOMAK5I","target":"record","payload":{"canonical_record":{"source":{"id":"2606.18105","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2026-06-16T16:06:51Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"78104fcb284aea57c44e0c0b63588fce97d4d39ea609efbcf10239d4f588b5ad","abstract_canon_sha256":"9ef5539b82bd0a5ad3837613a95a82e05c86aa72ac43d056973b096382c35afa"},"schema_version":"1.0"},"canonical_sha256":"350168f43a5d8f52899c4966b7300aea24ff49d6056c156758f89647c13697ec","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:11:38.970458Z","signature_b64":"wd6yfvnjz7O4ZdJo7fTYzX9l3yKWZz/b561CKoMeDW4xCwdgUr4LJLYmkrYPHYWDS8iMKiASxU9xhQwwtCGNCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"350168f43a5d8f52899c4966b7300aea24ff49d6056c156758f89647c13697ec","last_reissued_at":"2026-06-19T16:11:38.970095Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:11:38.970095Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.18105","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-06-19T16:11:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UptZPQQQGDsfVX/KWgcgFB96xoaym/3OzQJ0a1StIzSZWW3DvTDDZTU7+Epn4X5X84ccTt0TGBUzdgkMgiK8AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T10:43:43.637170Z"},"content_sha256":"af4dcce01864e3eacb903e7dca659ae261760f0a48434243f1160d437f6f9291","schema_version":"1.0","event_id":"sha256:af4dcce01864e3eacb903e7dca659ae261760f0a48434243f1160d437f6f9291"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:GUAWR5B2LWHVFCM4JFTLOMAK5I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"OmniPlan: An Adaptive Framework for Timely and Near-Optimal Network Planning Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.NI","authors_text":"Chunming Wu, Dong Zhang, Hongyan Liu, Jiajie Su, Jiashuo Yu, Longlong Zhu, Shaopeng Zhou, Xiang Chen, Xingyuan Li, Xuan Liu, Yimeng Liu, Yuchen Xian, Yuhan Wu, Zedi Chen, Zhifan Jiang","submitted_at":"2026-06-16T16:06:51Z","abstract_excerpt":"Network planning optimization is a fundamental problem across diverse domains, including transportation systems, communication networks, and power grids. It requires simultaneous optimization of multiple competing objectives under complex constraints. Existing network planning optimization frameworks rely on mixed integer programming (MIP) solvers, heuristics, and deep reinforcement learning (DRL) models to compute planning decisions. However, they lack effective adaptability to diverse and dynamic user intents, thus leading to the trade-off between execution time and optimality. In this paper"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.18105","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/2606.18105/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-06-19T16:11:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gZc19yWSqAOwny7PCg+klS2iWlTlKv7htXgFvQTcsSk9xzS6yB8obvcCS0q212bxeza2YUWAGWRqoi7+JDsPAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T10:43:43.637588Z"},"content_sha256":"1538fd254b0023401ad0189dd6ad52eded8abcf581f83ecc186ffc0693b75f77","schema_version":"1.0","event_id":"sha256:1538fd254b0023401ad0189dd6ad52eded8abcf581f83ecc186ffc0693b75f77"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GUAWR5B2LWHVFCM4JFTLOMAK5I/bundle.json","state_url":"https://pith.science/pith/GUAWR5B2LWHVFCM4JFTLOMAK5I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GUAWR5B2LWHVFCM4JFTLOMAK5I/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-06-26T10:43:43Z","links":{"resolver":"https://pith.science/pith/GUAWR5B2LWHVFCM4JFTLOMAK5I","bundle":"https://pith.science/pith/GUAWR5B2LWHVFCM4JFTLOMAK5I/bundle.json","state":"https://pith.science/pith/GUAWR5B2LWHVFCM4JFTLOMAK5I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GUAWR5B2LWHVFCM4JFTLOMAK5I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:GUAWR5B2LWHVFCM4JFTLOMAK5I","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":"9ef5539b82bd0a5ad3837613a95a82e05c86aa72ac43d056973b096382c35afa","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2026-06-16T16:06:51Z","title_canon_sha256":"78104fcb284aea57c44e0c0b63588fce97d4d39ea609efbcf10239d4f588b5ad"},"schema_version":"1.0","source":{"id":"2606.18105","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.18105","created_at":"2026-06-19T16:11:38Z"},{"alias_kind":"arxiv_version","alias_value":"2606.18105v2","created_at":"2026-06-19T16:11:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.18105","created_at":"2026-06-19T16:11:38Z"},{"alias_kind":"pith_short_12","alias_value":"GUAWR5B2LWHV","created_at":"2026-06-19T16:11:38Z"},{"alias_kind":"pith_short_16","alias_value":"GUAWR5B2LWHVFCM4","created_at":"2026-06-19T16:11:38Z"},{"alias_kind":"pith_short_8","alias_value":"GUAWR5B2","created_at":"2026-06-19T16:11:38Z"}],"graph_snapshots":[{"event_id":"sha256:1538fd254b0023401ad0189dd6ad52eded8abcf581f83ecc186ffc0693b75f77","target":"graph","created_at":"2026-06-19T16:11:38Z","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/2606.18105/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Network planning optimization is a fundamental problem across diverse domains, including transportation systems, communication networks, and power grids. It requires simultaneous optimization of multiple competing objectives under complex constraints. Existing network planning optimization frameworks rely on mixed integer programming (MIP) solvers, heuristics, and deep reinforcement learning (DRL) models to compute planning decisions. However, they lack effective adaptability to diverse and dynamic user intents, thus leading to the trade-off between execution time and optimality. In this paper","authors_text":"Chunming Wu, Dong Zhang, Hongyan Liu, Jiajie Su, Jiashuo Yu, Longlong Zhu, Shaopeng Zhou, Xiang Chen, Xingyuan Li, Xuan Liu, Yimeng Liu, Yuchen Xian, Yuhan Wu, Zedi Chen, Zhifan Jiang","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2026-06-16T16:06:51Z","title":"OmniPlan: An Adaptive Framework for Timely and Near-Optimal Network Planning Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.18105","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:af4dcce01864e3eacb903e7dca659ae261760f0a48434243f1160d437f6f9291","target":"record","created_at":"2026-06-19T16:11:38Z","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":"9ef5539b82bd0a5ad3837613a95a82e05c86aa72ac43d056973b096382c35afa","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2026-06-16T16:06:51Z","title_canon_sha256":"78104fcb284aea57c44e0c0b63588fce97d4d39ea609efbcf10239d4f588b5ad"},"schema_version":"1.0","source":{"id":"2606.18105","kind":"arxiv","version":2}},"canonical_sha256":"350168f43a5d8f52899c4966b7300aea24ff49d6056c156758f89647c13697ec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"350168f43a5d8f52899c4966b7300aea24ff49d6056c156758f89647c13697ec","first_computed_at":"2026-06-19T16:11:38.970095Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-19T16:11:38.970095Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wd6yfvnjz7O4ZdJo7fTYzX9l3yKWZz/b561CKoMeDW4xCwdgUr4LJLYmkrYPHYWDS8iMKiASxU9xhQwwtCGNCg==","signature_status":"signed_v1","signed_at":"2026-06-19T16:11:38.970458Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.18105","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:af4dcce01864e3eacb903e7dca659ae261760f0a48434243f1160d437f6f9291","sha256:1538fd254b0023401ad0189dd6ad52eded8abcf581f83ecc186ffc0693b75f77"],"state_sha256":"772e2c7d395fd9f787c73d07749c128cc012f41d065830d7b6c5cc643b1d2e55"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xW8RCZ1yaUsMT8GL3GI8CrnDM2dx440O7JjfScbG5W/vrTj5VQN0Qx1h6csJqSGfLLLGjUXeXgHZmfqVpz5sDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T10:43:43.639608Z","bundle_sha256":"55cc126c2dc1352832f823aa844210965a8f5bfe2b0960615c1e36ac23933473"}}