{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:GYIF6PLEVEDH7NLMSZZ7JPZUI6","short_pith_number":"pith:GYIF6PLE","canonical_record":{"source":{"id":"2508.07159","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-08-10T03:15:03Z","cross_cats_sorted":[],"title_canon_sha256":"ca4fde3322a625dcde1fb800efe7a7df5be7a5da9bf6d61fcf17f83a9c0ef445","abstract_canon_sha256":"b9566a422051202d37250c6daf8d2ff723a2fdba66e34c18c8ea3001f29df32d"},"schema_version":"1.0"},"canonical_sha256":"36105f3d64a9067fb56c9673f4bf344790458af6de541c16dbbed41e419568f6","source":{"kind":"arxiv","id":"2508.07159","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.07159","created_at":"2026-06-08T01:03:47Z"},{"alias_kind":"arxiv_version","alias_value":"2508.07159v4","created_at":"2026-06-08T01:03:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.07159","created_at":"2026-06-08T01:03:47Z"},{"alias_kind":"pith_short_12","alias_value":"GYIF6PLEVEDH","created_at":"2026-06-08T01:03:47Z"},{"alias_kind":"pith_short_16","alias_value":"GYIF6PLEVEDH7NLM","created_at":"2026-06-08T01:03:47Z"},{"alias_kind":"pith_short_8","alias_value":"GYIF6PLE","created_at":"2026-06-08T01:03:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:GYIF6PLEVEDH7NLMSZZ7JPZUI6","target":"record","payload":{"canonical_record":{"source":{"id":"2508.07159","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-08-10T03:15:03Z","cross_cats_sorted":[],"title_canon_sha256":"ca4fde3322a625dcde1fb800efe7a7df5be7a5da9bf6d61fcf17f83a9c0ef445","abstract_canon_sha256":"b9566a422051202d37250c6daf8d2ff723a2fdba66e34c18c8ea3001f29df32d"},"schema_version":"1.0"},"canonical_sha256":"36105f3d64a9067fb56c9673f4bf344790458af6de541c16dbbed41e419568f6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-08T01:03:47.380686Z","signature_b64":"UKnU2TVhs2D/CQCs01mc/yViPAdqpWVN1sG+0C69klg1qqTJ7viUW0WlvXK3FcM7daeZJMs/tnZa3G+GhGk6Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36105f3d64a9067fb56c9673f4bf344790458af6de541c16dbbed41e419568f6","last_reissued_at":"2026-06-08T01:03:47.379714Z","signature_status":"signed_v1","first_computed_at":"2026-06-08T01:03:47.379714Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2508.07159","source_version":4,"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-08T01:03:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VkZzUch9hlZlD1PpD5Bv4bPQhvUgRRd2D0gNf6gmo56+T4R4bkznOpM33hhb2l+/wZ6Z69QJitGcSmwKOKALBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-02T17:06:38.271348Z"},"content_sha256":"77049efdf38d5ebb9410038593354db4fdd5f78c1a698802e4f2615cf3af1df4","schema_version":"1.0","event_id":"sha256:77049efdf38d5ebb9410038593354db4fdd5f78c1a698802e4f2615cf3af1df4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:GYIF6PLEVEDH7NLMSZZ7JPZUI6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Queue Replacement Approach to Dynamic User Equilibrium Assignment with Route and Departure Time Choice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"The generalized queue replacement principle equates the equilibrium queueing-delay pattern to the solution of a relaxed linear program.","cross_cats":[],"primary_cat":"math.OC","authors_text":"Koki Satsukawa, Takara Sakai, Takashi Akamatsu","submitted_at":"2025-08-10T03:15:03Z","abstract_excerpt":"This study develops a hybrid analytical and numerical approach for dynamic user equilibrium (DUE) assignment with simultaneous route and departure time choice (RDTC) for homogeneous users. The core concept of the proposed approach is the generalized queue replacement principle (GQRP), which establishes an equivalence between the equilibrium queueing-delay pattern and the solution to a linear programming (LP) problem obtained by relaxing some conditions in the original DUE-RDTC problem. We first present a method for determining whether the GQRP holds. Based on the GQRP, we then develop a system"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"The generalized queue replacement principle (GQRP) establishes an equivalence between the equilibrium queueing-delay pattern and the solution to a linear programming (LP) problem obtained by relaxing some conditions in the original DUE-RDTC problem.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the GQRP holds for the given network and demand pattern; the paper supplies a method to check this, but the entire solution procedure rests on the equivalence being valid.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Introduces the generalized queue replacement principle to obtain exact DUE solutions with route and departure time choice by sequentially solving two linear programs.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"The generalized queue replacement principle equates the equilibrium queueing-delay pattern to the solution of a relaxed linear program.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"a3e30bfee9cdb079ce41aff1defdcbe58f23eed227a4f10a692cedf8a99e820b"},"source":{"id":"2508.07159","kind":"arxiv","version":4},"verdict":{"id":"d97b5f93-bfcd-462d-9911-45bf2a152350","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T00:09:29.810689Z","strongest_claim":"The generalized queue replacement principle (GQRP) establishes an equivalence between the equilibrium queueing-delay pattern and the solution to a linear programming (LP) problem obtained by relaxing some conditions in the original DUE-RDTC problem.","one_line_summary":"Introduces the generalized queue replacement principle to obtain exact DUE solutions with route and departure time choice by sequentially solving two linear programs.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the GQRP holds for the given network and demand pattern; the paper supplies a method to check this, but the entire solution procedure rests on the equivalence being valid.","pith_extraction_headline":"The generalized queue replacement principle equates the equilibrium queueing-delay pattern to the solution of a relaxed linear program."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2508.07159/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":2,"snapshot_sha256":"1ee4fa738898b950617b9e211c9734f55958c30af1c2871d8a855de4f94f0382"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"d97b5f93-bfcd-462d-9911-45bf2a152350"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-08T01:03:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pK1Q8n0Eg9n3ZiEjF7AjwX/08MkF4aySQ5lo08be8Wm5FoETHi7Mz3nef2BNVpeaoKgO+Ga1xzkKP5g+T/fcBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-02T17:06:38.271968Z"},"content_sha256":"0e14c5d1432b504c618ef5d3d55d6c6b194db590b3ae38a344e4db6d7c4b160e","schema_version":"1.0","event_id":"sha256:0e14c5d1432b504c618ef5d3d55d6c6b194db590b3ae38a344e4db6d7c4b160e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GYIF6PLEVEDH7NLMSZZ7JPZUI6/bundle.json","state_url":"https://pith.science/pith/GYIF6PLEVEDH7NLMSZZ7JPZUI6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GYIF6PLEVEDH7NLMSZZ7JPZUI6/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-08-02T17:06:38Z","links":{"resolver":"https://pith.science/pith/GYIF6PLEVEDH7NLMSZZ7JPZUI6","bundle":"https://pith.science/pith/GYIF6PLEVEDH7NLMSZZ7JPZUI6/bundle.json","state":"https://pith.science/pith/GYIF6PLEVEDH7NLMSZZ7JPZUI6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GYIF6PLEVEDH7NLMSZZ7JPZUI6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:GYIF6PLEVEDH7NLMSZZ7JPZUI6","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":"b9566a422051202d37250c6daf8d2ff723a2fdba66e34c18c8ea3001f29df32d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-08-10T03:15:03Z","title_canon_sha256":"ca4fde3322a625dcde1fb800efe7a7df5be7a5da9bf6d61fcf17f83a9c0ef445"},"schema_version":"1.0","source":{"id":"2508.07159","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.07159","created_at":"2026-06-08T01:03:47Z"},{"alias_kind":"arxiv_version","alias_value":"2508.07159v4","created_at":"2026-06-08T01:03:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.07159","created_at":"2026-06-08T01:03:47Z"},{"alias_kind":"pith_short_12","alias_value":"GYIF6PLEVEDH","created_at":"2026-06-08T01:03:47Z"},{"alias_kind":"pith_short_16","alias_value":"GYIF6PLEVEDH7NLM","created_at":"2026-06-08T01:03:47Z"},{"alias_kind":"pith_short_8","alias_value":"GYIF6PLE","created_at":"2026-06-08T01:03:47Z"}],"graph_snapshots":[{"event_id":"sha256:0e14c5d1432b504c618ef5d3d55d6c6b194db590b3ae38a344e4db6d7c4b160e","target":"graph","created_at":"2026-06-08T01:03:47Z","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":"The generalized queue replacement principle (GQRP) establishes an equivalence between the equilibrium queueing-delay pattern and the solution to a linear programming (LP) problem obtained by relaxing some conditions in the original DUE-RDTC problem."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the GQRP holds for the given network and demand pattern; the paper supplies a method to check this, but the entire solution procedure rests on the equivalence being valid."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Introduces the generalized queue replacement principle to obtain exact DUE solutions with route and departure time choice by sequentially solving two linear programs."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"The generalized queue replacement principle equates the equilibrium queueing-delay pattern to the solution of a relaxed linear program."}],"snapshot_sha256":"a3e30bfee9cdb079ce41aff1defdcbe58f23eed227a4f10a692cedf8a99e820b"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"1ee4fa738898b950617b9e211c9734f55958c30af1c2871d8a855de4f94f0382"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2508.07159/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This study develops a hybrid analytical and numerical approach for dynamic user equilibrium (DUE) assignment with simultaneous route and departure time choice (RDTC) for homogeneous users. The core concept of the proposed approach is the generalized queue replacement principle (GQRP), which establishes an equivalence between the equilibrium queueing-delay pattern and the solution to a linear programming (LP) problem obtained by relaxing some conditions in the original DUE-RDTC problem. We first present a method for determining whether the GQRP holds. Based on the GQRP, we then develop a system","authors_text":"Koki Satsukawa, Takara Sakai, Takashi Akamatsu","cross_cats":[],"headline":"The generalized queue replacement principle equates the equilibrium queueing-delay pattern to the solution of a relaxed linear program.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-08-10T03:15:03Z","title":"Queue Replacement Approach to Dynamic User Equilibrium Assignment with Route and Departure Time Choice"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.07159","kind":"arxiv","version":4},"verdict":{"created_at":"2026-05-19T00:09:29.810689Z","id":"d97b5f93-bfcd-462d-9911-45bf2a152350","model_set":{"reader":"grok-4.3"},"one_line_summary":"Introduces the generalized queue replacement principle to obtain exact DUE solutions with route and departure time choice by sequentially solving two linear programs.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"The generalized queue replacement principle equates the equilibrium queueing-delay pattern to the solution of a relaxed linear program.","strongest_claim":"The generalized queue replacement principle (GQRP) establishes an equivalence between the equilibrium queueing-delay pattern and the solution to a linear programming (LP) problem obtained by relaxing some conditions in the original DUE-RDTC problem.","weakest_assumption":"That the GQRP holds for the given network and demand pattern; the paper supplies a method to check this, but the entire solution procedure rests on the equivalence being valid."}},"verdict_id":"d97b5f93-bfcd-462d-9911-45bf2a152350"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:77049efdf38d5ebb9410038593354db4fdd5f78c1a698802e4f2615cf3af1df4","target":"record","created_at":"2026-06-08T01:03:47Z","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":"b9566a422051202d37250c6daf8d2ff723a2fdba66e34c18c8ea3001f29df32d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-08-10T03:15:03Z","title_canon_sha256":"ca4fde3322a625dcde1fb800efe7a7df5be7a5da9bf6d61fcf17f83a9c0ef445"},"schema_version":"1.0","source":{"id":"2508.07159","kind":"arxiv","version":4}},"canonical_sha256":"36105f3d64a9067fb56c9673f4bf344790458af6de541c16dbbed41e419568f6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"36105f3d64a9067fb56c9673f4bf344790458af6de541c16dbbed41e419568f6","first_computed_at":"2026-06-08T01:03:47.379714Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-08T01:03:47.379714Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UKnU2TVhs2D/CQCs01mc/yViPAdqpWVN1sG+0C69klg1qqTJ7viUW0WlvXK3FcM7daeZJMs/tnZa3G+GhGk6Bw==","signature_status":"signed_v1","signed_at":"2026-06-08T01:03:47.380686Z","signed_message":"canonical_sha256_bytes"},"source_id":"2508.07159","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:77049efdf38d5ebb9410038593354db4fdd5f78c1a698802e4f2615cf3af1df4","sha256:0e14c5d1432b504c618ef5d3d55d6c6b194db590b3ae38a344e4db6d7c4b160e"],"state_sha256":"9ecbf09500ff4206e4a51b20dc3ddd2ec0816f541aff9f7486ba3cda6f7b1d07"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pWnki7p0+tfqAo1Jt6or9Wba+29kOvEL8hBauE+YAIjOTK7MiBT6OXIe7dVJPGz8qrq/sFlCMOgOM2jYTFeCAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-02T17:06:38.276604Z","bundle_sha256":"1da145245534e0bb5d25a7d1161d0a3c75383353636ab3c971bfb1ce8597596c"}}