{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:72RTEBEL42MSCDTSCAJZQWWZ3G","short_pith_number":"pith:72RTEBEL","schema_version":"1.0","canonical_sha256":"fea332048be699210e721013985ad9d9829acf2bd9b79dff975ffcc0f00ae541","source":{"kind":"arxiv","id":"2412.06482","version":3},"attestation_state":"computed","paper":{"title":"A Cardinality-Constrained Approach to Combinatorial Bilevel Congestion Pricing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","cs.SY","eess.SY"],"primary_cat":"math.OC","authors_text":"Jiayang Li, Jun Xie, Lei Guo, Yu Marco Nie","submitted_at":"2024-12-09T13:31:32Z","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"},"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":"2412.06482","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-12-09T13:31:32Z","cross_cats_sorted":["cs.GT","cs.SY","eess.SY"],"title_canon_sha256":"a729e71e2a1b3884b7639da3d6238d7e54f9d54c2047b1356332d607771967e6","abstract_canon_sha256":"399fc04e471cf6493471c8e073867b807a1c0698fb179fca6403c77eed64208a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:52:57.132482Z","signature_b64":"xusxFFoX49/aKU8us6qdsGizaSGvBBubBrVbsO9bZ4ND5zJMCLJ+rxr9vPfKFttoknyigA3sIgQMZj10qrwDDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fea332048be699210e721013985ad9d9829acf2bd9b79dff975ffcc0f00ae541","last_reissued_at":"2026-07-05T10:52:57.131937Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:52:57.131937Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Cardinality-Constrained Approach to Combinatorial Bilevel Congestion Pricing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","cs.SY","eess.SY"],"primary_cat":"math.OC","authors_text":"Jiayang Li, Jun Xie, Lei Guo, Yu Marco Nie","submitted_at":"2024-12-09T13:31:32Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.06482","kind":"arxiv","version":3},"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/2412.06482/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":"2412.06482","created_at":"2026-07-05T10:52:57.131993+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.06482v3","created_at":"2026-07-05T10:52:57.131993+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.06482","created_at":"2026-07-05T10:52:57.131993+00:00"},{"alias_kind":"pith_short_12","alias_value":"72RTEBEL42MS","created_at":"2026-07-05T10:52:57.131993+00:00"},{"alias_kind":"pith_short_16","alias_value":"72RTEBEL42MSCDTS","created_at":"2026-07-05T10:52:57.131993+00:00"},{"alias_kind":"pith_short_8","alias_value":"72RTEBEL","created_at":"2026-07-05T10:52:57.131993+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/72RTEBEL42MSCDTSCAJZQWWZ3G","json":"https://pith.science/pith/72RTEBEL42MSCDTSCAJZQWWZ3G.json","graph_json":"https://pith.science/api/pith-number/72RTEBEL42MSCDTSCAJZQWWZ3G/graph.json","events_json":"https://pith.science/api/pith-number/72RTEBEL42MSCDTSCAJZQWWZ3G/events.json","paper":"https://pith.science/paper/72RTEBEL"},"agent_actions":{"view_html":"https://pith.science/pith/72RTEBEL42MSCDTSCAJZQWWZ3G","download_json":"https://pith.science/pith/72RTEBEL42MSCDTSCAJZQWWZ3G.json","view_paper":"https://pith.science/paper/72RTEBEL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.06482&json=true","fetch_graph":"https://pith.science/api/pith-number/72RTEBEL42MSCDTSCAJZQWWZ3G/graph.json","fetch_events":"https://pith.science/api/pith-number/72RTEBEL42MSCDTSCAJZQWWZ3G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/72RTEBEL42MSCDTSCAJZQWWZ3G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/72RTEBEL42MSCDTSCAJZQWWZ3G/action/storage_attestation","attest_author":"https://pith.science/pith/72RTEBEL42MSCDTSCAJZQWWZ3G/action/author_attestation","sign_citation":"https://pith.science/pith/72RTEBEL42MSCDTSCAJZQWWZ3G/action/citation_signature","submit_replication":"https://pith.science/pith/72RTEBEL42MSCDTSCAJZQWWZ3G/action/replication_record"}},"created_at":"2026-07-05T10:52:57.131993+00:00","updated_at":"2026-07-05T10:52:57.131993+00:00"}