{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:6UU7GNYMY6BJV2XCPR7BY4YB2I","short_pith_number":"pith:6UU7GNYM","canonical_record":{"source":{"id":"1307.4258","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-07-16T12:28:11Z","cross_cats_sorted":["cs.DS","math.OC"],"title_canon_sha256":"8a4b49747d54b3a3196e3fc73d4cdf6f4484b3ad5e826c9d25aa68fa8067fa41","abstract_canon_sha256":"9b22dc1bb7b83248c6b54c7f62d32d12571fbe6e557032c6b0027e2e5768ad6e"},"schema_version":"1.0"},"canonical_sha256":"f529f3370cc7829aeae27c7e1c7301d207899b32c8aa7052ccc2084360d3c600","source":{"kind":"arxiv","id":"1307.4258","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.4258","created_at":"2026-05-18T03:07:23Z"},{"alias_kind":"arxiv_version","alias_value":"1307.4258v2","created_at":"2026-05-18T03:07:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.4258","created_at":"2026-05-18T03:07:23Z"},{"alias_kind":"pith_short_12","alias_value":"6UU7GNYMY6BJ","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6UU7GNYMY6BJV2XC","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6UU7GNYM","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:6UU7GNYMY6BJV2XCPR7BY4YB2I","target":"record","payload":{"canonical_record":{"source":{"id":"1307.4258","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-07-16T12:28:11Z","cross_cats_sorted":["cs.DS","math.OC"],"title_canon_sha256":"8a4b49747d54b3a3196e3fc73d4cdf6f4484b3ad5e826c9d25aa68fa8067fa41","abstract_canon_sha256":"9b22dc1bb7b83248c6b54c7f62d32d12571fbe6e557032c6b0027e2e5768ad6e"},"schema_version":"1.0"},"canonical_sha256":"f529f3370cc7829aeae27c7e1c7301d207899b32c8aa7052ccc2084360d3c600","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:07:23.127640Z","signature_b64":"/2GxdxJD3GkCvqWKfKdCOe8Mm8GZnq8/1gunMlQdcRrud3AMouIykpkNspRclvY/QXnLeIY2uko6LH2pXTp3BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f529f3370cc7829aeae27c7e1c7301d207899b32c8aa7052ccc2084360d3c600","last_reissued_at":"2026-05-18T03:07:23.126942Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:07:23.126942Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.4258","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-05-18T03:07:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rEqvrJ7lBjmSE+0oCpJc53v47IsuWfow6HmjLpzyrfq17WacbJ+w5z8tLjjyMtQIuQweh7aj2agnpIWB2cezCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T11:49:16.512970Z"},"content_sha256":"db8a325c0f5a24cdc17e303a3820d81a88ebe90738fbf55f895c56e81c168826","schema_version":"1.0","event_id":"sha256:db8a325c0f5a24cdc17e303a3820d81a88ebe90738fbf55f895c56e81c168826"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:6UU7GNYMY6BJV2XCPR7BY4YB2I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Complexity and Approximation of the Continuous Network Design Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.OC"],"primary_cat":"cs.GT","authors_text":"Martin Gairing, Max Klimm, Tobias Harks","submitted_at":"2013-07-16T12:28:11Z","abstract_excerpt":"We revisit a classical problem in transportation, known as the continuous (bilevel) network design problem, CNDP for short. We are given a graph for which the latency of each edge depends on the ratio of the edge flow and the capacity installed. The goal is to find an optimal investment in edge capacities so as to minimize the sum of the routing cost of the induced Wardrop equilibrium and the investment cost. While this problem is considered as challenging in the literature, its complexity status was still unknown. We close this gap showing that CNDP is strongly NP-complete and APX-hard, both "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.4258","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":""},"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-05-18T03:07:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y8IsF54MRyf2wyAybI8y94XfYjhSVurONqGKtg6EjsFGReokBJxumPO/1JTVNwAsD85JSs0ojvvTQm4B7IKsBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T11:49:16.513548Z"},"content_sha256":"25f0048fb870832ce333e44d4e45319c0ec837f87d24fc033d6cc66462b5032e","schema_version":"1.0","event_id":"sha256:25f0048fb870832ce333e44d4e45319c0ec837f87d24fc033d6cc66462b5032e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6UU7GNYMY6BJV2XCPR7BY4YB2I/bundle.json","state_url":"https://pith.science/pith/6UU7GNYMY6BJV2XCPR7BY4YB2I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6UU7GNYMY6BJV2XCPR7BY4YB2I/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-07T11:49:16Z","links":{"resolver":"https://pith.science/pith/6UU7GNYMY6BJV2XCPR7BY4YB2I","bundle":"https://pith.science/pith/6UU7GNYMY6BJV2XCPR7BY4YB2I/bundle.json","state":"https://pith.science/pith/6UU7GNYMY6BJV2XCPR7BY4YB2I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6UU7GNYMY6BJV2XCPR7BY4YB2I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:6UU7GNYMY6BJV2XCPR7BY4YB2I","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":"9b22dc1bb7b83248c6b54c7f62d32d12571fbe6e557032c6b0027e2e5768ad6e","cross_cats_sorted":["cs.DS","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-07-16T12:28:11Z","title_canon_sha256":"8a4b49747d54b3a3196e3fc73d4cdf6f4484b3ad5e826c9d25aa68fa8067fa41"},"schema_version":"1.0","source":{"id":"1307.4258","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.4258","created_at":"2026-05-18T03:07:23Z"},{"alias_kind":"arxiv_version","alias_value":"1307.4258v2","created_at":"2026-05-18T03:07:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.4258","created_at":"2026-05-18T03:07:23Z"},{"alias_kind":"pith_short_12","alias_value":"6UU7GNYMY6BJ","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6UU7GNYMY6BJV2XC","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6UU7GNYM","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:25f0048fb870832ce333e44d4e45319c0ec837f87d24fc033d6cc66462b5032e","target":"graph","created_at":"2026-05-18T03:07:23Z","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"},"paper":{"abstract_excerpt":"We revisit a classical problem in transportation, known as the continuous (bilevel) network design problem, CNDP for short. We are given a graph for which the latency of each edge depends on the ratio of the edge flow and the capacity installed. The goal is to find an optimal investment in edge capacities so as to minimize the sum of the routing cost of the induced Wardrop equilibrium and the investment cost. While this problem is considered as challenging in the literature, its complexity status was still unknown. We close this gap showing that CNDP is strongly NP-complete and APX-hard, both ","authors_text":"Martin Gairing, Max Klimm, Tobias Harks","cross_cats":["cs.DS","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-07-16T12:28:11Z","title":"Complexity and Approximation of the Continuous Network Design Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.4258","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:db8a325c0f5a24cdc17e303a3820d81a88ebe90738fbf55f895c56e81c168826","target":"record","created_at":"2026-05-18T03:07:23Z","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":"9b22dc1bb7b83248c6b54c7f62d32d12571fbe6e557032c6b0027e2e5768ad6e","cross_cats_sorted":["cs.DS","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-07-16T12:28:11Z","title_canon_sha256":"8a4b49747d54b3a3196e3fc73d4cdf6f4484b3ad5e826c9d25aa68fa8067fa41"},"schema_version":"1.0","source":{"id":"1307.4258","kind":"arxiv","version":2}},"canonical_sha256":"f529f3370cc7829aeae27c7e1c7301d207899b32c8aa7052ccc2084360d3c600","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f529f3370cc7829aeae27c7e1c7301d207899b32c8aa7052ccc2084360d3c600","first_computed_at":"2026-05-18T03:07:23.126942Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:07:23.126942Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/2GxdxJD3GkCvqWKfKdCOe8Mm8GZnq8/1gunMlQdcRrud3AMouIykpkNspRclvY/QXnLeIY2uko6LH2pXTp3BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:07:23.127640Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.4258","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:db8a325c0f5a24cdc17e303a3820d81a88ebe90738fbf55f895c56e81c168826","sha256:25f0048fb870832ce333e44d4e45319c0ec837f87d24fc033d6cc66462b5032e"],"state_sha256":"789ac376809152662148c4691811438f49ae2055d95844ac1b8df8b516a8349d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oIUCZevIy/F6o0D45ZLeknvMq+C5uqtiUGxssGC4BeLXI/NvcAEq9w/sTrpklOUT4q7soBOlX1uDUARlvFnvCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T11:49:16.516582Z","bundle_sha256":"269416d2bee0928ecaef99b1aed4365d58f5230f522fbc73f133c4e7748cefb8"}}