{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:MP2HET37WU76VBGV6DMMVUE73K","short_pith_number":"pith:MP2HET37","canonical_record":{"source":{"id":"2505.11230","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-05-16T13:25:22Z","cross_cats_sorted":[],"title_canon_sha256":"770d02599c0cb4acc80895dea0b956d24843e0aea8fbaab8a264efdc3c4f5064","abstract_canon_sha256":"bfe72472a46a8adc878636e7da43cb0de27d59a6fb1fa6c6eb2e7bb8a7c610c3"},"schema_version":"1.0"},"canonical_sha256":"63f4724f7fb53fea84d5f0d8cad09fdaa1c6211f07fd8679850a223ae913391d","source":{"kind":"arxiv","id":"2505.11230","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.11230","created_at":"2026-07-05T11:04:13Z"},{"alias_kind":"arxiv_version","alias_value":"2505.11230v1","created_at":"2026-07-05T11:04:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.11230","created_at":"2026-07-05T11:04:13Z"},{"alias_kind":"pith_short_12","alias_value":"MP2HET37WU76","created_at":"2026-07-05T11:04:13Z"},{"alias_kind":"pith_short_16","alias_value":"MP2HET37WU76VBGV","created_at":"2026-07-05T11:04:13Z"},{"alias_kind":"pith_short_8","alias_value":"MP2HET37","created_at":"2026-07-05T11:04:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:MP2HET37WU76VBGV6DMMVUE73K","target":"record","payload":{"canonical_record":{"source":{"id":"2505.11230","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-05-16T13:25:22Z","cross_cats_sorted":[],"title_canon_sha256":"770d02599c0cb4acc80895dea0b956d24843e0aea8fbaab8a264efdc3c4f5064","abstract_canon_sha256":"bfe72472a46a8adc878636e7da43cb0de27d59a6fb1fa6c6eb2e7bb8a7c610c3"},"schema_version":"1.0"},"canonical_sha256":"63f4724f7fb53fea84d5f0d8cad09fdaa1c6211f07fd8679850a223ae913391d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:04:13.075261Z","signature_b64":"aLvHY4kKTsJl40A31/tXOAB6GAs1QyfIF3bPfWr+E1UbuPmz7ppAbf76Wl0/0Vu0Elfd3UkL8yUf6OlYKbprBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63f4724f7fb53fea84d5f0d8cad09fdaa1c6211f07fd8679850a223ae913391d","last_reissued_at":"2026-07-05T11:04:13.074711Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:04:13.074711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.11230","source_version":1,"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-07-05T11:04:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gt2hAjFYlA/3/vfam5fzoiFEG0G6JgiH10eTCw6mnx9haxWIO0jPhUcBS/eihAGOedIToPczfS0G1AXJAAcmAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T03:50:53.403742Z"},"content_sha256":"8f47a9ff27a9cbbb3c4c8e2cb702d017ad8da0910c2c3dbdf4fd30585f0ca049","schema_version":"1.0","event_id":"sha256:8f47a9ff27a9cbbb3c4c8e2cb702d017ad8da0910c2c3dbdf4fd30585f0ca049"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:MP2HET37WU76VBGV6DMMVUE73K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning traffic flows: Graph Neural Networks for Metamodelling Traffic Assignment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Daniele Gammelli, Francisco Camara Pereira, Guido Cantelmo, Guido Gentile, Mohamed Eldafrawi, Oskar Bohn Lassen, Serio Agriesti","submitted_at":"2025-05-16T13:25:22Z","abstract_excerpt":"The Traffic Assignment Problem is a fundamental, yet computationally expensive, task in transportation modeling, especially for large-scale networks. Traditional methods require iterative simulations to reach equilibrium, making real-time or large-scale scenario analysis challenging. In this paper, we propose a learning-based approach using Message-Passing Neural Networks as a metamodel to approximate the equilibrium flow of the Stochastic User Equilibrium assignment. Our model is designed to mimic the algorithmic structure used in conventional traffic simulators allowing it to better capture "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.11230","kind":"arxiv","version":1},"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/2505.11230/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"},"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-07-05T11:04:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Dt8E3T0H4pw8CaG1WLY6qJjifhQaTwQgmq90OfuzZgRPS9qpjSMnZO7hk6szeTaEbNR5JVXIdoiIv1QZNjdfAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T03:50:53.404109Z"},"content_sha256":"add1297f92fbd2b0b23e3c17441eb975204c0129fb6148c6de3249c6ecd8cdc6","schema_version":"1.0","event_id":"sha256:add1297f92fbd2b0b23e3c17441eb975204c0129fb6148c6de3249c6ecd8cdc6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MP2HET37WU76VBGV6DMMVUE73K/bundle.json","state_url":"https://pith.science/pith/MP2HET37WU76VBGV6DMMVUE73K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MP2HET37WU76VBGV6DMMVUE73K/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-07-06T03:50:53Z","links":{"resolver":"https://pith.science/pith/MP2HET37WU76VBGV6DMMVUE73K","bundle":"https://pith.science/pith/MP2HET37WU76VBGV6DMMVUE73K/bundle.json","state":"https://pith.science/pith/MP2HET37WU76VBGV6DMMVUE73K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MP2HET37WU76VBGV6DMMVUE73K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:MP2HET37WU76VBGV6DMMVUE73K","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":"bfe72472a46a8adc878636e7da43cb0de27d59a6fb1fa6c6eb2e7bb8a7c610c3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-05-16T13:25:22Z","title_canon_sha256":"770d02599c0cb4acc80895dea0b956d24843e0aea8fbaab8a264efdc3c4f5064"},"schema_version":"1.0","source":{"id":"2505.11230","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.11230","created_at":"2026-07-05T11:04:13Z"},{"alias_kind":"arxiv_version","alias_value":"2505.11230v1","created_at":"2026-07-05T11:04:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.11230","created_at":"2026-07-05T11:04:13Z"},{"alias_kind":"pith_short_12","alias_value":"MP2HET37WU76","created_at":"2026-07-05T11:04:13Z"},{"alias_kind":"pith_short_16","alias_value":"MP2HET37WU76VBGV","created_at":"2026-07-05T11:04:13Z"},{"alias_kind":"pith_short_8","alias_value":"MP2HET37","created_at":"2026-07-05T11:04:13Z"}],"graph_snapshots":[{"event_id":"sha256:add1297f92fbd2b0b23e3c17441eb975204c0129fb6148c6de3249c6ecd8cdc6","target":"graph","created_at":"2026-07-05T11:04:13Z","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/2505.11230/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Traffic Assignment Problem is a fundamental, yet computationally expensive, task in transportation modeling, especially for large-scale networks. Traditional methods require iterative simulations to reach equilibrium, making real-time or large-scale scenario analysis challenging. In this paper, we propose a learning-based approach using Message-Passing Neural Networks as a metamodel to approximate the equilibrium flow of the Stochastic User Equilibrium assignment. Our model is designed to mimic the algorithmic structure used in conventional traffic simulators allowing it to better capture ","authors_text":"Daniele Gammelli, Francisco Camara Pereira, Guido Cantelmo, Guido Gentile, Mohamed Eldafrawi, Oskar Bohn Lassen, Serio Agriesti","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-05-16T13:25:22Z","title":"Learning traffic flows: Graph Neural Networks for Metamodelling Traffic Assignment"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.11230","kind":"arxiv","version":1},"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:8f47a9ff27a9cbbb3c4c8e2cb702d017ad8da0910c2c3dbdf4fd30585f0ca049","target":"record","created_at":"2026-07-05T11:04:13Z","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":"bfe72472a46a8adc878636e7da43cb0de27d59a6fb1fa6c6eb2e7bb8a7c610c3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-05-16T13:25:22Z","title_canon_sha256":"770d02599c0cb4acc80895dea0b956d24843e0aea8fbaab8a264efdc3c4f5064"},"schema_version":"1.0","source":{"id":"2505.11230","kind":"arxiv","version":1}},"canonical_sha256":"63f4724f7fb53fea84d5f0d8cad09fdaa1c6211f07fd8679850a223ae913391d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"63f4724f7fb53fea84d5f0d8cad09fdaa1c6211f07fd8679850a223ae913391d","first_computed_at":"2026-07-05T11:04:13.074711Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:04:13.074711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aLvHY4kKTsJl40A31/tXOAB6GAs1QyfIF3bPfWr+E1UbuPmz7ppAbf76Wl0/0Vu0Elfd3UkL8yUf6OlYKbprBA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:04:13.075261Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.11230","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8f47a9ff27a9cbbb3c4c8e2cb702d017ad8da0910c2c3dbdf4fd30585f0ca049","sha256:add1297f92fbd2b0b23e3c17441eb975204c0129fb6148c6de3249c6ecd8cdc6"],"state_sha256":"15252ca7c01106b71316dc0f675019d241a1ac96ad59dad91fb254be8685b26c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g3t7rliRB9eoxw/ZhxCJhyxYM2+TeYs43z0QQ68ozpSfipWR2rF0OaWGqWrITqMVwNSRc20UwYBNVDtlpAd9AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T03:50:53.406152Z","bundle_sha256":"1baad06248cd86b549f3da0978495ca53ce5fa28f5a80d52b7305db5e4c1c285"}}