{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:SQ3JRCJMIJ5T4Q6R5BBJ5WFYK5","short_pith_number":"pith:SQ3JRCJM","canonical_record":{"source":{"id":"1010.3034","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2010-10-14T21:44:35Z","cross_cats_sorted":[],"title_canon_sha256":"4595423e9ae0ddcc9b96639ae0a5aca84db2cfc28bd039d4d7f3031b6ffdcc2e","abstract_canon_sha256":"e0d7b61a2f0b228aeb34390f987c1cfdfb7df9b185067c809f31dead1b6e2d09"},"schema_version":"1.0"},"canonical_sha256":"943698892c427b3e43d1e8429ed8b8575661d31110c996810ce5e4e9b1370bfc","source":{"kind":"arxiv","id":"1010.3034","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.3034","created_at":"2026-05-18T02:23:45Z"},{"alias_kind":"arxiv_version","alias_value":"1010.3034v1","created_at":"2026-05-18T02:23:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.3034","created_at":"2026-05-18T02:23:45Z"},{"alias_kind":"pith_short_12","alias_value":"SQ3JRCJMIJ5T","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"SQ3JRCJMIJ5T4Q6R","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"SQ3JRCJM","created_at":"2026-05-18T12:26:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:SQ3JRCJMIJ5T4Q6R5BBJ5WFYK5","target":"record","payload":{"canonical_record":{"source":{"id":"1010.3034","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2010-10-14T21:44:35Z","cross_cats_sorted":[],"title_canon_sha256":"4595423e9ae0ddcc9b96639ae0a5aca84db2cfc28bd039d4d7f3031b6ffdcc2e","abstract_canon_sha256":"e0d7b61a2f0b228aeb34390f987c1cfdfb7df9b185067c809f31dead1b6e2d09"},"schema_version":"1.0"},"canonical_sha256":"943698892c427b3e43d1e8429ed8b8575661d31110c996810ce5e4e9b1370bfc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:45.662630Z","signature_b64":"OyTtSUjwCzoWwX8gWjUuujfezJ9uvpORgDdYLD2h91j5pluxvkC65xqlGAa2FepQvbTORkFUWGqvo1+bbtH7CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"943698892c427b3e43d1e8429ed8b8575661d31110c996810ce5e4e9b1370bfc","last_reissued_at":"2026-05-18T02:23:45.661895Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:45.661895Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1010.3034","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-05-18T02:23:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i/2OjcdWE3lHrgjFY9by4sSY4S2lOx9Ud6Fi/hDfTrbKAB4+WiODL+Fpb6Tz+EKMGd41O5vjF75IqltUjqvnBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T03:38:57.202467Z"},"content_sha256":"c80bb599368b67204d0cec72e18d2774d888a1eaa6363ec3e27465dd18964e23","schema_version":"1.0","event_id":"sha256:c80bb599368b67204d0cec72e18d2774d888a1eaa6363ec3e27465dd18964e23"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:SQ3JRCJMIJ5T4Q6R5BBJ5WFYK5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Stackelberg Strategy for Routing Flow over Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Elliot Anshelevich, Lisa Fleischer, Umang Bhaskar","submitted_at":"2010-10-14T21:44:35Z","abstract_excerpt":"Routing games are used to to understand the impact of individual users' decisions on network efficiency. Most prior work on routing games uses a simplified model of network flow where all flow exists simultaneously, and users care about either their maximum delay or their total delay. Both of these measures are surrogates for measuring how long it takes to get all of a user's traffic through the network. We attempt a more direct study of how competition affects network efficiency by examining routing games in a flow over time model. We give an efficiently computable Stackelberg strategy for th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.3034","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":""},"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-05-18T02:23:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vm3LmX7YLiIwBFPBe6zqKOQsy5OrQSporTVaAAI47TL5ayrr1A4qZeFtNJ+/k6iOXESr/Dvt65tVObC9ph/FAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T03:38:57.202807Z"},"content_sha256":"c7b65510bace240d45a4a0b39c702b3f6fa6a724746230137a03be0f74e72242","schema_version":"1.0","event_id":"sha256:c7b65510bace240d45a4a0b39c702b3f6fa6a724746230137a03be0f74e72242"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SQ3JRCJMIJ5T4Q6R5BBJ5WFYK5/bundle.json","state_url":"https://pith.science/pith/SQ3JRCJMIJ5T4Q6R5BBJ5WFYK5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SQ3JRCJMIJ5T4Q6R5BBJ5WFYK5/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-28T03:38:57Z","links":{"resolver":"https://pith.science/pith/SQ3JRCJMIJ5T4Q6R5BBJ5WFYK5","bundle":"https://pith.science/pith/SQ3JRCJMIJ5T4Q6R5BBJ5WFYK5/bundle.json","state":"https://pith.science/pith/SQ3JRCJMIJ5T4Q6R5BBJ5WFYK5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SQ3JRCJMIJ5T4Q6R5BBJ5WFYK5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:SQ3JRCJMIJ5T4Q6R5BBJ5WFYK5","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":"e0d7b61a2f0b228aeb34390f987c1cfdfb7df9b185067c809f31dead1b6e2d09","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2010-10-14T21:44:35Z","title_canon_sha256":"4595423e9ae0ddcc9b96639ae0a5aca84db2cfc28bd039d4d7f3031b6ffdcc2e"},"schema_version":"1.0","source":{"id":"1010.3034","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.3034","created_at":"2026-05-18T02:23:45Z"},{"alias_kind":"arxiv_version","alias_value":"1010.3034v1","created_at":"2026-05-18T02:23:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.3034","created_at":"2026-05-18T02:23:45Z"},{"alias_kind":"pith_short_12","alias_value":"SQ3JRCJMIJ5T","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"SQ3JRCJMIJ5T4Q6R","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"SQ3JRCJM","created_at":"2026-05-18T12:26:13Z"}],"graph_snapshots":[{"event_id":"sha256:c7b65510bace240d45a4a0b39c702b3f6fa6a724746230137a03be0f74e72242","target":"graph","created_at":"2026-05-18T02:23:45Z","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"},"paper":{"abstract_excerpt":"Routing games are used to to understand the impact of individual users' decisions on network efficiency. Most prior work on routing games uses a simplified model of network flow where all flow exists simultaneously, and users care about either their maximum delay or their total delay. Both of these measures are surrogates for measuring how long it takes to get all of a user's traffic through the network. We attempt a more direct study of how competition affects network efficiency by examining routing games in a flow over time model. We give an efficiently computable Stackelberg strategy for th","authors_text":"Elliot Anshelevich, Lisa Fleischer, Umang Bhaskar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2010-10-14T21:44:35Z","title":"A Stackelberg Strategy for Routing Flow over Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.3034","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:c80bb599368b67204d0cec72e18d2774d888a1eaa6363ec3e27465dd18964e23","target":"record","created_at":"2026-05-18T02:23:45Z","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":"e0d7b61a2f0b228aeb34390f987c1cfdfb7df9b185067c809f31dead1b6e2d09","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2010-10-14T21:44:35Z","title_canon_sha256":"4595423e9ae0ddcc9b96639ae0a5aca84db2cfc28bd039d4d7f3031b6ffdcc2e"},"schema_version":"1.0","source":{"id":"1010.3034","kind":"arxiv","version":1}},"canonical_sha256":"943698892c427b3e43d1e8429ed8b8575661d31110c996810ce5e4e9b1370bfc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"943698892c427b3e43d1e8429ed8b8575661d31110c996810ce5e4e9b1370bfc","first_computed_at":"2026-05-18T02:23:45.661895Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:23:45.661895Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OyTtSUjwCzoWwX8gWjUuujfezJ9uvpORgDdYLD2h91j5pluxvkC65xqlGAa2FepQvbTORkFUWGqvo1+bbtH7CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:23:45.662630Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.3034","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c80bb599368b67204d0cec72e18d2774d888a1eaa6363ec3e27465dd18964e23","sha256:c7b65510bace240d45a4a0b39c702b3f6fa6a724746230137a03be0f74e72242"],"state_sha256":"5c46f4648b3958e96865d0f333843ef0be1a244a76055663a4cc035dc0e94b92"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wYreMOXExOVk3X5/gw/IEyjIKwKCDMXuTqZ2lqVSS9o8qC7SjTyGAGNHuvYf812B7qDPRKXWllDtlq2sZIQ9Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T03:38:57.204762Z","bundle_sha256":"34b93e1b7140eb5ef23063eb4ddaa1dcdce547664808a9f64d36450914d19b24"}}