{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:YLQBCMERETX3TNTDC3YMUJMIAI","short_pith_number":"pith:YLQBCMER","canonical_record":{"source":{"id":"2405.10763","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2024-05-17T13:21:23Z","cross_cats_sorted":["cs.DM","math.OC","stat.CO"],"title_canon_sha256":"e0af724e9e0e337e284c64f13e3ddfa1940a072de9fea5370a2bd00204bbb6e4","abstract_canon_sha256":"d8bd21d0ebeb118026e2bd4bd54dd8be70df5de537ac95ed1679152b7f13c5a1"},"schema_version":"1.0"},"canonical_sha256":"c2e011309124efb9b66316f0ca25880209931523ccdbb679427d3d934ace456a","source":{"kind":"arxiv","id":"2405.10763","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.10763","created_at":"2026-07-05T10:50:42Z"},{"alias_kind":"arxiv_version","alias_value":"2405.10763v1","created_at":"2026-07-05T10:50:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.10763","created_at":"2026-07-05T10:50:42Z"},{"alias_kind":"pith_short_12","alias_value":"YLQBCMERETX3","created_at":"2026-07-05T10:50:42Z"},{"alias_kind":"pith_short_16","alias_value":"YLQBCMERETX3TNTD","created_at":"2026-07-05T10:50:42Z"},{"alias_kind":"pith_short_8","alias_value":"YLQBCMER","created_at":"2026-07-05T10:50:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:YLQBCMERETX3TNTDC3YMUJMIAI","target":"record","payload":{"canonical_record":{"source":{"id":"2405.10763","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2024-05-17T13:21:23Z","cross_cats_sorted":["cs.DM","math.OC","stat.CO"],"title_canon_sha256":"e0af724e9e0e337e284c64f13e3ddfa1940a072de9fea5370a2bd00204bbb6e4","abstract_canon_sha256":"d8bd21d0ebeb118026e2bd4bd54dd8be70df5de537ac95ed1679152b7f13c5a1"},"schema_version":"1.0"},"canonical_sha256":"c2e011309124efb9b66316f0ca25880209931523ccdbb679427d3d934ace456a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:50:42.118302Z","signature_b64":"egHJkmx9/OfUdsw/ihemxTvjRCs2hST1qqa+BIpNRffS7KMrSxe06ZqmfGE4VDPYlAMV45+nsPm6wXTxXhr7Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2e011309124efb9b66316f0ca25880209931523ccdbb679427d3d934ace456a","last_reissued_at":"2026-07-05T10:50:42.117808Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:50:42.117808Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2405.10763","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-05T10:50:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a/dxjD6saUuTpoyMaYMDMbMYEvxiZG1D1ScVON8JjP0yRlxFF7/uYPd8jzEnkA2Nb/+5MZZLLtU4gIc5yEfNCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-24T03:07:20.221688Z"},"content_sha256":"9fddb8bba63b635c92097b59cea7fe7923397e10fc55fd3529e50d4b80c10abd","schema_version":"1.0","event_id":"sha256:9fddb8bba63b635c92097b59cea7fe7923397e10fc55fd3529e50d4b80c10abd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:YLQBCMERETX3TNTDC3YMUJMIAI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Integer Traffic Assignment Problem: Algorithms and Insights on Random Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","math.OC","stat.CO"],"primary_cat":"cond-mat.dis-nn","authors_text":"Giovanni Piccioli, Lenka Zdeborov\\'a, Rayan Harfouche","submitted_at":"2024-05-17T13:21:23Z","abstract_excerpt":"Path optimization is a fundamental concern across various real-world scenarios, ranging from traffic congestion issues to efficient data routing over the internet. The Traffic Assignment Problem (TAP) is a classic continuous optimization problem in this field. This study considers the Integer Traffic Assignment Problem (ITAP), a discrete variant of TAP. ITAP involves determining optimal routes for commuters in a city represented by a graph, aiming to minimize congestion while adhering to integer flow constraints on paths. This restriction makes ITAP an NP-hard problem. While conventional TAP p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.10763","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/2405.10763/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-05T10:50:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4vlzzzCU4+9cBy4QuB7bTJ26A8gJ4HD6YpnibZVf+9H73MSlJHWEBlhr7nJTpMsC4K9hU9dVnoRqMlQjoMhGBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-24T03:07:20.222195Z"},"content_sha256":"c5d9e501fd7d2f2f187b8af5148b48f1f32bc4b1ed38102c0701eddc1331f537","schema_version":"1.0","event_id":"sha256:c5d9e501fd7d2f2f187b8af5148b48f1f32bc4b1ed38102c0701eddc1331f537"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YLQBCMERETX3TNTDC3YMUJMIAI/bundle.json","state_url":"https://pith.science/pith/YLQBCMERETX3TNTDC3YMUJMIAI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YLQBCMERETX3TNTDC3YMUJMIAI/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-24T03:07:20Z","links":{"resolver":"https://pith.science/pith/YLQBCMERETX3TNTDC3YMUJMIAI","bundle":"https://pith.science/pith/YLQBCMERETX3TNTDC3YMUJMIAI/bundle.json","state":"https://pith.science/pith/YLQBCMERETX3TNTDC3YMUJMIAI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YLQBCMERETX3TNTDC3YMUJMIAI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:YLQBCMERETX3TNTDC3YMUJMIAI","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":"d8bd21d0ebeb118026e2bd4bd54dd8be70df5de537ac95ed1679152b7f13c5a1","cross_cats_sorted":["cs.DM","math.OC","stat.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2024-05-17T13:21:23Z","title_canon_sha256":"e0af724e9e0e337e284c64f13e3ddfa1940a072de9fea5370a2bd00204bbb6e4"},"schema_version":"1.0","source":{"id":"2405.10763","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.10763","created_at":"2026-07-05T10:50:42Z"},{"alias_kind":"arxiv_version","alias_value":"2405.10763v1","created_at":"2026-07-05T10:50:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.10763","created_at":"2026-07-05T10:50:42Z"},{"alias_kind":"pith_short_12","alias_value":"YLQBCMERETX3","created_at":"2026-07-05T10:50:42Z"},{"alias_kind":"pith_short_16","alias_value":"YLQBCMERETX3TNTD","created_at":"2026-07-05T10:50:42Z"},{"alias_kind":"pith_short_8","alias_value":"YLQBCMER","created_at":"2026-07-05T10:50:42Z"}],"graph_snapshots":[{"event_id":"sha256:c5d9e501fd7d2f2f187b8af5148b48f1f32bc4b1ed38102c0701eddc1331f537","target":"graph","created_at":"2026-07-05T10:50:42Z","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/2405.10763/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Path optimization is a fundamental concern across various real-world scenarios, ranging from traffic congestion issues to efficient data routing over the internet. The Traffic Assignment Problem (TAP) is a classic continuous optimization problem in this field. This study considers the Integer Traffic Assignment Problem (ITAP), a discrete variant of TAP. ITAP involves determining optimal routes for commuters in a city represented by a graph, aiming to minimize congestion while adhering to integer flow constraints on paths. This restriction makes ITAP an NP-hard problem. While conventional TAP p","authors_text":"Giovanni Piccioli, Lenka Zdeborov\\'a, Rayan Harfouche","cross_cats":["cs.DM","math.OC","stat.CO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2024-05-17T13:21:23Z","title":"Integer Traffic Assignment Problem: Algorithms and Insights on Random Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.10763","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:9fddb8bba63b635c92097b59cea7fe7923397e10fc55fd3529e50d4b80c10abd","target":"record","created_at":"2026-07-05T10:50:42Z","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":"d8bd21d0ebeb118026e2bd4bd54dd8be70df5de537ac95ed1679152b7f13c5a1","cross_cats_sorted":["cs.DM","math.OC","stat.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2024-05-17T13:21:23Z","title_canon_sha256":"e0af724e9e0e337e284c64f13e3ddfa1940a072de9fea5370a2bd00204bbb6e4"},"schema_version":"1.0","source":{"id":"2405.10763","kind":"arxiv","version":1}},"canonical_sha256":"c2e011309124efb9b66316f0ca25880209931523ccdbb679427d3d934ace456a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c2e011309124efb9b66316f0ca25880209931523ccdbb679427d3d934ace456a","first_computed_at":"2026-07-05T10:50:42.117808Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:50:42.117808Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"egHJkmx9/OfUdsw/ihemxTvjRCs2hST1qqa+BIpNRffS7KMrSxe06ZqmfGE4VDPYlAMV45+nsPm6wXTxXhr7Ag==","signature_status":"signed_v1","signed_at":"2026-07-05T10:50:42.118302Z","signed_message":"canonical_sha256_bytes"},"source_id":"2405.10763","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9fddb8bba63b635c92097b59cea7fe7923397e10fc55fd3529e50d4b80c10abd","sha256:c5d9e501fd7d2f2f187b8af5148b48f1f32bc4b1ed38102c0701eddc1331f537"],"state_sha256":"62bc8e10e81aea62690890569b8b33a3e9e4ce5669bdc0d969026c7290f30463"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rsK952O/sL61Kvq1/DcuMs89YgXZ7ND0bq3B/I1r3jS/D4rBMZjVNPBNqEIqiw81v0TmAH2wHO9lGvxH/srHDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-24T03:07:20.227249Z","bundle_sha256":"645eb4f28c76df941fb5758bf8bee7ac70b306d29446f44a714fb59f285c9bf2"}}