{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:C6THR7ZLECF7SQFPQGDUB3JANB","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":"587ad48b5349983db7ad971d0a24573ff5b01244092b51df1570f9800f730365","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2025-08-11T00:13:36Z","title_canon_sha256":"ac71cdb9066e3991a0ab3a255caf55ff19634c46228e0c53123e91f7b7058add"},"schema_version":"1.0","source":{"id":"2508.07515","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.07515","created_at":"2026-07-30T01:23:45Z"},{"alias_kind":"arxiv_version","alias_value":"2508.07515v3","created_at":"2026-07-30T01:23:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.07515","created_at":"2026-07-30T01:23:45Z"},{"alias_kind":"pith_short_12","alias_value":"C6THR7ZLECF7","created_at":"2026-07-30T01:23:45Z"},{"alias_kind":"pith_short_16","alias_value":"C6THR7ZLECF7SQFP","created_at":"2026-07-30T01:23:45Z"},{"alias_kind":"pith_short_8","alias_value":"C6THR7ZL","created_at":"2026-07-30T01:23:45Z"}],"graph_snapshots":[{"event_id":"sha256:ba01712f2fa617d3d63ccb96f9aa846b1a533419c21bc1a94a316d31ba27354f","target":"graph","created_at":"2026-07-30T01:23:45Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"Through extensive experiments, we show that neuro-symbolic search techniques yield scalability gains. Our approach yields substantial improvements across all three classes of planning problems, achieving an average performance gain of about 20% over state-of-the-art solver across key metrics, including runtime and solution quality."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"Graph neural network-based learning methods can reliably guide traditional symbolic MILP solvers on branching variable selection and solver parameter configuration for the three classes of planning problems (STL, CPP, CaTL)."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Neuro-symbolic GNN guidance accelerates MILP solvers for STL, CPP chance constraints, and CaTL planning problems with average 20% gains in runtime and solution quality over state-of-the-art solvers."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Neuro-symbolic guidance accelerates MILP motion planning for temporal logic and chance constraints by about 20 percent."}],"snapshot_sha256":"85be8ed3b8abe71571132dd34823a76fb99caa15e27fa0f9996f05cad6dde1c1"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2508.07515/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Motion-planning problems with temporal-logic or chance constraints are often encoded as mixed-integer linear programs (MILPs). Although these encodings provide rigorous specifications, their combinatorial structure can make planning prohibitively slow. Machine learning for combinatorial optimization (ML4CO) has accelerated general-purpose MILP solving, but its standard graph representations discard semantic information available in control problems, such as variable roles, time indices, sample identities, and formula structure. We introduce a domain-aware ML4CO framework for MILP-based motion ","authors_text":"Bistra Dilkina, Brendan Long, Junyang Cai, Jyotirmoy V. Deshmukh, Lars Lindemann, Matthew Cleaveland, Weimin Huang","cross_cats":["cs.SY"],"headline":"Neuro-symbolic guidance accelerates MILP motion planning for temporal logic and chance constraints by about 20 percent.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2025-08-11T00:13:36Z","title":"Domain-Aware Machine Learning for Accelerating MILP-Based Motion Planning with Temporal Logic and Chance Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.07515","kind":"arxiv","version":3},"verdict":{"created_at":"2026-05-19T00:33:39.993692Z","id":"5c63d08a-7b4b-4350-8c21-dcc1eec18280","model_set":{"reader":"grok-4.3"},"one_line_summary":"Neuro-symbolic GNN guidance accelerates MILP solvers for STL, CPP chance constraints, and CaTL planning problems with average 20% gains in runtime and solution quality over state-of-the-art solvers.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Neuro-symbolic guidance accelerates MILP motion planning for temporal logic and chance constraints by about 20 percent.","strongest_claim":"Through extensive experiments, we show that neuro-symbolic search techniques yield scalability gains. Our approach yields substantial improvements across all three classes of planning problems, achieving an average performance gain of about 20% over state-of-the-art solver across key metrics, including runtime and solution quality.","weakest_assumption":"Graph neural network-based learning methods can reliably guide traditional symbolic MILP solvers on branching variable selection and solver parameter configuration for the three classes of planning problems (STL, CPP, CaTL)."}},"verdict_id":"5c63d08a-7b4b-4350-8c21-dcc1eec18280"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a43037199a9056d2ed12e532592583a331b86db2370a6d4a2beefb7983129ee7","target":"record","created_at":"2026-07-30T01:23:45Z","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":"587ad48b5349983db7ad971d0a24573ff5b01244092b51df1570f9800f730365","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2025-08-11T00:13:36Z","title_canon_sha256":"ac71cdb9066e3991a0ab3a255caf55ff19634c46228e0c53123e91f7b7058add"},"schema_version":"1.0","source":{"id":"2508.07515","kind":"arxiv","version":3}},"canonical_sha256":"17a678ff2b208bf940af818740ed206850d0468592a1a720f260f5a796a77d43","receipt":{"builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"17a678ff2b208bf940af818740ed206850d0468592a1a720f260f5a796a77d43","first_computed_at":"2026-07-30T01:23:45.844224Z","kind":"pith_receipt","last_reissued_at":"2026-07-30T01:23:45.844224Z","receipt_version":"0.3","signature_status":"unsigned_v0"},"source_id":"2508.07515","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a43037199a9056d2ed12e532592583a331b86db2370a6d4a2beefb7983129ee7","sha256:ba01712f2fa617d3d63ccb96f9aa846b1a533419c21bc1a94a316d31ba27354f"],"state_sha256":"ed06f8dd93e4f41c5202e9afd714ec16217b97574990107c19b8d4baecf8d513"}