{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:RR3G2AXN2KDVJ6LWJ4N7HY3WRE","short_pith_number":"pith:RR3G2AXN","canonical_record":{"source":{"id":"2606.23536","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-22T16:13:17Z","cross_cats_sorted":[],"title_canon_sha256":"aeabcc2c022a139c99b111d9d74643fe50b901df7e49c361fa1615dfeba20214","abstract_canon_sha256":"5897c5d6ae98ca0bc0e8a2a2ef71894a5cbce1add39bc24e022409953719dcfb"},"schema_version":"1.0"},"canonical_sha256":"8c766d02edd28754f9764f1bf3e3768900e54ee865b595c833b662b3b19b0e3b","source":{"kind":"arxiv","id":"2606.23536","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.23536","created_at":"2026-06-23T03:14:29Z"},{"alias_kind":"arxiv_version","alias_value":"2606.23536v1","created_at":"2026-06-23T03:14:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.23536","created_at":"2026-06-23T03:14:29Z"},{"alias_kind":"pith_short_12","alias_value":"RR3G2AXN2KDV","created_at":"2026-06-23T03:14:29Z"},{"alias_kind":"pith_short_16","alias_value":"RR3G2AXN2KDVJ6LW","created_at":"2026-06-23T03:14:29Z"},{"alias_kind":"pith_short_8","alias_value":"RR3G2AXN","created_at":"2026-06-23T03:14:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:RR3G2AXN2KDVJ6LWJ4N7HY3WRE","target":"record","payload":{"canonical_record":{"source":{"id":"2606.23536","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-22T16:13:17Z","cross_cats_sorted":[],"title_canon_sha256":"aeabcc2c022a139c99b111d9d74643fe50b901df7e49c361fa1615dfeba20214","abstract_canon_sha256":"5897c5d6ae98ca0bc0e8a2a2ef71894a5cbce1add39bc24e022409953719dcfb"},"schema_version":"1.0"},"canonical_sha256":"8c766d02edd28754f9764f1bf3e3768900e54ee865b595c833b662b3b19b0e3b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T03:14:29.409134Z","signature_b64":"/uZ4n7vPqar4dlGCB4ZtaLSAcpGw5IwjghPhET8AX/orAtUQlsagpP2DE+2ASthg9ueCQlemPNRcFLpVJoG9Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c766d02edd28754f9764f1bf3e3768900e54ee865b595c833b662b3b19b0e3b","last_reissued_at":"2026-06-23T03:14:29.408724Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T03:14:29.408724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.23536","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-06-23T03:14:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YKw4KRlgawh0c2HZ0aQmWWSRx1t1lffmmFWkvSDbAwy5ZnqvmbhUCbDUp/J4rskbFDWo9sQv4O9JH39Fe/78DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T01:22:18.376615Z"},"content_sha256":"85e630c07be2c116144fca5d0372857bd77358642658ea1871ba15dc63678116","schema_version":"1.0","event_id":"sha256:85e630c07be2c116144fca5d0372857bd77358642658ea1871ba15dc63678116"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:RR3G2AXN2KDVJ6LWJ4N7HY3WRE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Simulation-Free Estimation of Traffic Flows from Sparse Count Data","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Davide Guastella, Gianluca Bontempi","submitted_at":"2026-06-22T16:13:17Z","abstract_excerpt":"We propose a method for estimating time-varying traffic flow patterns from sparse aggregated vehicle counts. The method partitions the study area into spatial regions, constructs a set of feasible region-to-region routes, and solves a weighted least-squares optimization problem to determine the number of vehicles to allocate on each route. A weighted contribution matrix encodes sensor coverage, steering the optimizer toward flow configurations that are directly observable by sensors. Edge-level trajectories are then derived by scoring candidate routes against the temporal and volumetric profil"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.23536","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/2606.23536/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-06-23T03:14:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/gzm3W6Rb9Vxz7SVIgGqAO/GQQJddObq+qekSbq8VUm9VEMaW/rb1K0a5wZwlnNf8GrkYd+extjFM0YVus/PDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T01:22:18.377255Z"},"content_sha256":"32267061e664afbaa0bbd2830654fbdfcf68e524bc431db84a94f7e663ce3c26","schema_version":"1.0","event_id":"sha256:32267061e664afbaa0bbd2830654fbdfcf68e524bc431db84a94f7e663ce3c26"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RR3G2AXN2KDVJ6LWJ4N7HY3WRE/bundle.json","state_url":"https://pith.science/pith/RR3G2AXN2KDVJ6LWJ4N7HY3WRE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RR3G2AXN2KDVJ6LWJ4N7HY3WRE/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-30T01:22:18Z","links":{"resolver":"https://pith.science/pith/RR3G2AXN2KDVJ6LWJ4N7HY3WRE","bundle":"https://pith.science/pith/RR3G2AXN2KDVJ6LWJ4N7HY3WRE/bundle.json","state":"https://pith.science/pith/RR3G2AXN2KDVJ6LWJ4N7HY3WRE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RR3G2AXN2KDVJ6LWJ4N7HY3WRE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:RR3G2AXN2KDVJ6LWJ4N7HY3WRE","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":"5897c5d6ae98ca0bc0e8a2a2ef71894a5cbce1add39bc24e022409953719dcfb","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-22T16:13:17Z","title_canon_sha256":"aeabcc2c022a139c99b111d9d74643fe50b901df7e49c361fa1615dfeba20214"},"schema_version":"1.0","source":{"id":"2606.23536","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.23536","created_at":"2026-06-23T03:14:29Z"},{"alias_kind":"arxiv_version","alias_value":"2606.23536v1","created_at":"2026-06-23T03:14:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.23536","created_at":"2026-06-23T03:14:29Z"},{"alias_kind":"pith_short_12","alias_value":"RR3G2AXN2KDV","created_at":"2026-06-23T03:14:29Z"},{"alias_kind":"pith_short_16","alias_value":"RR3G2AXN2KDVJ6LW","created_at":"2026-06-23T03:14:29Z"},{"alias_kind":"pith_short_8","alias_value":"RR3G2AXN","created_at":"2026-06-23T03:14:29Z"}],"graph_snapshots":[{"event_id":"sha256:32267061e664afbaa0bbd2830654fbdfcf68e524bc431db84a94f7e663ce3c26","target":"graph","created_at":"2026-06-23T03:14:29Z","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/2606.23536/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose a method for estimating time-varying traffic flow patterns from sparse aggregated vehicle counts. The method partitions the study area into spatial regions, constructs a set of feasible region-to-region routes, and solves a weighted least-squares optimization problem to determine the number of vehicles to allocate on each route. A weighted contribution matrix encodes sensor coverage, steering the optimizer toward flow configurations that are directly observable by sensors. Edge-level trajectories are then derived by scoring candidate routes against the temporal and volumetric profil","authors_text":"Davide Guastella, Gianluca Bontempi","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-22T16:13:17Z","title":"Simulation-Free Estimation of Traffic Flows from Sparse Count Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.23536","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:85e630c07be2c116144fca5d0372857bd77358642658ea1871ba15dc63678116","target":"record","created_at":"2026-06-23T03:14:29Z","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":"5897c5d6ae98ca0bc0e8a2a2ef71894a5cbce1add39bc24e022409953719dcfb","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-22T16:13:17Z","title_canon_sha256":"aeabcc2c022a139c99b111d9d74643fe50b901df7e49c361fa1615dfeba20214"},"schema_version":"1.0","source":{"id":"2606.23536","kind":"arxiv","version":1}},"canonical_sha256":"8c766d02edd28754f9764f1bf3e3768900e54ee865b595c833b662b3b19b0e3b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8c766d02edd28754f9764f1bf3e3768900e54ee865b595c833b662b3b19b0e3b","first_computed_at":"2026-06-23T03:14:29.408724Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-23T03:14:29.408724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/uZ4n7vPqar4dlGCB4ZtaLSAcpGw5IwjghPhET8AX/orAtUQlsagpP2DE+2ASthg9ueCQlemPNRcFLpVJoG9Cg==","signature_status":"signed_v1","signed_at":"2026-06-23T03:14:29.409134Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.23536","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:85e630c07be2c116144fca5d0372857bd77358642658ea1871ba15dc63678116","sha256:32267061e664afbaa0bbd2830654fbdfcf68e524bc431db84a94f7e663ce3c26"],"state_sha256":"82ebc3a9b335ec020fc1cbb1fc22369694a6375909a5dc68458f85299a7e098c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/EyAFslkFITooSOKJxUBEl2QwcdlAuJpEWPt5PYRmOF2MPEYMqAxaqzvWHpTjZJ41b/EcLs75cKPWs43JokWBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T01:22:18.380806Z","bundle_sha256":"aa468faf084d24c94283c181d89089559865c6dc64e571e284e7018d67ba2f13"}}