{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:72RTEBEL42MSCDTSCAJZQWWZ3G","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":"399fc04e471cf6493471c8e073867b807a1c0698fb179fca6403c77eed64208a","cross_cats_sorted":["cs.GT","cs.SY","eess.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-12-09T13:31:32Z","title_canon_sha256":"a729e71e2a1b3884b7639da3d6238d7e54f9d54c2047b1356332d607771967e6"},"schema_version":"1.0","source":{"id":"2412.06482","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.06482","created_at":"2026-07-05T10:52:57Z"},{"alias_kind":"arxiv_version","alias_value":"2412.06482v3","created_at":"2026-07-05T10:52:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.06482","created_at":"2026-07-05T10:52:57Z"},{"alias_kind":"pith_short_12","alias_value":"72RTEBEL42MS","created_at":"2026-07-05T10:52:57Z"},{"alias_kind":"pith_short_16","alias_value":"72RTEBEL42MSCDTS","created_at":"2026-07-05T10:52:57Z"},{"alias_kind":"pith_short_8","alias_value":"72RTEBEL","created_at":"2026-07-05T10:52:57Z"}],"graph_snapshots":[{"event_id":"sha256:d05d129942b0e7b9906c41e131cd7cead5404906dfbae642eea8fbc77589db2a","target":"graph","created_at":"2026-07-05T10:52:57Z","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/2412.06482/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Combinatorial bilevel congestion pricing (CBCP), a variant of the mixed (continuous/discrete) network design problems, seeks to minimize the total travel time experienced by all travelers in a road network, by strategically selecting toll locations and determining toll charges. Conventional wisdom suggests that these problems are intractable since they have to be formulated and solved with a significant number of integer variables. Here, we devise a scalable local algorithm for the CBCP problem that guarantees convergence to an approximate Karush-Kuhn-Tucker point. Our approach is novel in tha","authors_text":"Jiayang Li, Jun Xie, Lei Guo, Yu Marco Nie","cross_cats":["cs.GT","cs.SY","eess.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-12-09T13:31:32Z","title":"A Cardinality-Constrained Approach to Combinatorial Bilevel Congestion Pricing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.06482","kind":"arxiv","version":3},"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:969c572135d53a1c407e0d2f7b63b0d3346844dc8f0ca2530563948d7d130a9a","target":"record","created_at":"2026-07-05T10:52:57Z","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":"399fc04e471cf6493471c8e073867b807a1c0698fb179fca6403c77eed64208a","cross_cats_sorted":["cs.GT","cs.SY","eess.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-12-09T13:31:32Z","title_canon_sha256":"a729e71e2a1b3884b7639da3d6238d7e54f9d54c2047b1356332d607771967e6"},"schema_version":"1.0","source":{"id":"2412.06482","kind":"arxiv","version":3}},"canonical_sha256":"fea332048be699210e721013985ad9d9829acf2bd9b79dff975ffcc0f00ae541","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fea332048be699210e721013985ad9d9829acf2bd9b79dff975ffcc0f00ae541","first_computed_at":"2026-07-05T10:52:57.131937Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:52:57.131937Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xusxFFoX49/aKU8us6qdsGizaSGvBBubBrVbsO9bZ4ND5zJMCLJ+rxr9vPfKFttoknyigA3sIgQMZj10qrwDDg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:52:57.132482Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.06482","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:969c572135d53a1c407e0d2f7b63b0d3346844dc8f0ca2530563948d7d130a9a","sha256:d05d129942b0e7b9906c41e131cd7cead5404906dfbae642eea8fbc77589db2a"],"state_sha256":"c93128aadd5b8a87c64a3359b53c878bf71130a1755d90600d05119f66513272"}