{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:BEYS6HCK4HORZ7UR254LSY6T6Y","short_pith_number":"pith:BEYS6HCK","canonical_record":{"source":{"id":"2506.20216","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.OC","submitted_at":"2025-06-25T07:59:27Z","cross_cats_sorted":[],"title_canon_sha256":"79b14403e627296c7dd6dc322d859ab6e759fe470dbfb7e541d006c6610a428d","abstract_canon_sha256":"040a488c31d14f348accb9fe5e1df442bb79bb232c67befdff20db72f9aa0bc2"},"schema_version":"1.0"},"canonical_sha256":"09312f1c4ae1dd1cfe91d778b963d3f639280f69d4cede537e1ae9b47d2f0c47","source":{"kind":"arxiv","id":"2506.20216","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.20216","created_at":"2026-07-05T11:27:02Z"},{"alias_kind":"arxiv_version","alias_value":"2506.20216v1","created_at":"2026-07-05T11:27:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.20216","created_at":"2026-07-05T11:27:02Z"},{"alias_kind":"pith_short_12","alias_value":"BEYS6HCK4HOR","created_at":"2026-07-05T11:27:02Z"},{"alias_kind":"pith_short_16","alias_value":"BEYS6HCK4HORZ7UR","created_at":"2026-07-05T11:27:02Z"},{"alias_kind":"pith_short_8","alias_value":"BEYS6HCK","created_at":"2026-07-05T11:27:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:BEYS6HCK4HORZ7UR254LSY6T6Y","target":"record","payload":{"canonical_record":{"source":{"id":"2506.20216","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.OC","submitted_at":"2025-06-25T07:59:27Z","cross_cats_sorted":[],"title_canon_sha256":"79b14403e627296c7dd6dc322d859ab6e759fe470dbfb7e541d006c6610a428d","abstract_canon_sha256":"040a488c31d14f348accb9fe5e1df442bb79bb232c67befdff20db72f9aa0bc2"},"schema_version":"1.0"},"canonical_sha256":"09312f1c4ae1dd1cfe91d778b963d3f639280f69d4cede537e1ae9b47d2f0c47","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:27:02.032013Z","signature_b64":"q6vOPsGFQaxsC7PumhF77Pm7UHVkU4lfyx9QbRdC1L3jrfVpRMjD9XWbPgP2Wdkx7617NSdCS/zrcdGUZdJlAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"09312f1c4ae1dd1cfe91d778b963d3f639280f69d4cede537e1ae9b47d2f0c47","last_reissued_at":"2026-07-05T11:27:02.031605Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:27:02.031605Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.20216","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:27:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/PrpSn+frKjIaxtmB4Jx20adEO4akDCsHhl0fFwAamgbwOpVCqHCSXTKisTV79rIpi405yihepffn+DPp1nsCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T14:23:06.174349Z"},"content_sha256":"9c3a514ff33583b43921a697a966c395c9d3889e33e55a2d56476ed69708de78","schema_version":"1.0","event_id":"sha256:9c3a514ff33583b43921a697a966c395c9d3889e33e55a2d56476ed69708de78"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:BEYS6HCK4HORZ7UR254LSY6T6Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Speed-Aware Network Design: A Parametric Optimization Approach","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"George Iosifidis, Georgios Paschos, Marc Bataillou Almagro, Martin Gross, Ugo Rosolia","submitted_at":"2025-06-25T07:59:27Z","abstract_excerpt":"Network design problems have been studied from the 1950s, as they can be used in a wide range of real-world applications, e.g., design of communication and transportation networks. In classical network design problems, the objective is to minimize the cost of routing the demand flow through a graph. In this paper, we introduce a generalized version of such a problem, where the objective is to tradeoff routing costs and delivery speed; we introduce the concept of speed-coverage, which is defined as the number of unique items that can be sent to destinations in less than 1-day. Speed-coverage is"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.20216","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/2506.20216/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:27:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yToEFexq9N8gRzE2i9mzNxV0h51eNcpJ4SPeDabAnpqnLeD4maKlX61eB5qdqgMzjo0OHvksiVd43TZSsUz7BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T14:23:06.174836Z"},"content_sha256":"ca9260c5fdceda04e505f80a713679de3b71b03cd6f88c68a4918f3ff02fbe8d","schema_version":"1.0","event_id":"sha256:ca9260c5fdceda04e505f80a713679de3b71b03cd6f88c68a4918f3ff02fbe8d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BEYS6HCK4HORZ7UR254LSY6T6Y/bundle.json","state_url":"https://pith.science/pith/BEYS6HCK4HORZ7UR254LSY6T6Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BEYS6HCK4HORZ7UR254LSY6T6Y/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-22T14:23:06Z","links":{"resolver":"https://pith.science/pith/BEYS6HCK4HORZ7UR254LSY6T6Y","bundle":"https://pith.science/pith/BEYS6HCK4HORZ7UR254LSY6T6Y/bundle.json","state":"https://pith.science/pith/BEYS6HCK4HORZ7UR254LSY6T6Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BEYS6HCK4HORZ7UR254LSY6T6Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:BEYS6HCK4HORZ7UR254LSY6T6Y","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":"040a488c31d14f348accb9fe5e1df442bb79bb232c67befdff20db72f9aa0bc2","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.OC","submitted_at":"2025-06-25T07:59:27Z","title_canon_sha256":"79b14403e627296c7dd6dc322d859ab6e759fe470dbfb7e541d006c6610a428d"},"schema_version":"1.0","source":{"id":"2506.20216","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.20216","created_at":"2026-07-05T11:27:02Z"},{"alias_kind":"arxiv_version","alias_value":"2506.20216v1","created_at":"2026-07-05T11:27:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.20216","created_at":"2026-07-05T11:27:02Z"},{"alias_kind":"pith_short_12","alias_value":"BEYS6HCK4HOR","created_at":"2026-07-05T11:27:02Z"},{"alias_kind":"pith_short_16","alias_value":"BEYS6HCK4HORZ7UR","created_at":"2026-07-05T11:27:02Z"},{"alias_kind":"pith_short_8","alias_value":"BEYS6HCK","created_at":"2026-07-05T11:27:02Z"}],"graph_snapshots":[{"event_id":"sha256:ca9260c5fdceda04e505f80a713679de3b71b03cd6f88c68a4918f3ff02fbe8d","target":"graph","created_at":"2026-07-05T11:27:02Z","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/2506.20216/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Network design problems have been studied from the 1950s, as they can be used in a wide range of real-world applications, e.g., design of communication and transportation networks. In classical network design problems, the objective is to minimize the cost of routing the demand flow through a graph. In this paper, we introduce a generalized version of such a problem, where the objective is to tradeoff routing costs and delivery speed; we introduce the concept of speed-coverage, which is defined as the number of unique items that can be sent to destinations in less than 1-day. Speed-coverage is","authors_text":"George Iosifidis, Georgios Paschos, Marc Bataillou Almagro, Martin Gross, Ugo Rosolia","cross_cats":[],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.OC","submitted_at":"2025-06-25T07:59:27Z","title":"Speed-Aware Network Design: A Parametric Optimization Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.20216","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:9c3a514ff33583b43921a697a966c395c9d3889e33e55a2d56476ed69708de78","target":"record","created_at":"2026-07-05T11:27:02Z","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":"040a488c31d14f348accb9fe5e1df442bb79bb232c67befdff20db72f9aa0bc2","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.OC","submitted_at":"2025-06-25T07:59:27Z","title_canon_sha256":"79b14403e627296c7dd6dc322d859ab6e759fe470dbfb7e541d006c6610a428d"},"schema_version":"1.0","source":{"id":"2506.20216","kind":"arxiv","version":1}},"canonical_sha256":"09312f1c4ae1dd1cfe91d778b963d3f639280f69d4cede537e1ae9b47d2f0c47","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"09312f1c4ae1dd1cfe91d778b963d3f639280f69d4cede537e1ae9b47d2f0c47","first_computed_at":"2026-07-05T11:27:02.031605Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:27:02.031605Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"q6vOPsGFQaxsC7PumhF77Pm7UHVkU4lfyx9QbRdC1L3jrfVpRMjD9XWbPgP2Wdkx7617NSdCS/zrcdGUZdJlAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:27:02.032013Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.20216","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9c3a514ff33583b43921a697a966c395c9d3889e33e55a2d56476ed69708de78","sha256:ca9260c5fdceda04e505f80a713679de3b71b03cd6f88c68a4918f3ff02fbe8d"],"state_sha256":"e3600477f2803f13254dfb1f4cc2bac152d670dd5d0eb10bd987e4560f9d69f9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6Nrpq4R3JPCTWVXydHUeYL6JZimxS2NEu7QsANkaOJ7UGbc4AcZ0ChOZvsNO/+U3jDf0582080FGL5uHhfU4Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T14:23:06.179612Z","bundle_sha256":"80c126674dcd37ff467911d01b93132a97fb76dab64a837d1068a380839dee91"}}