{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:LLENUIH3PVLEXBCC4XFCDNOGUF","short_pith_number":"pith:LLENUIH3","schema_version":"1.0","canonical_sha256":"5ac8da20fb7d564b8442e5ca21b5c6a1516f96d65c64ce8ff57851deb7c808f2","source":{"kind":"arxiv","id":"2105.13202","version":2},"attestation_state":"computed","paper":{"title":"Convergence of a Packet Routing Model to Flows Over Time","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DS","math.OC"],"primary_cat":"cs.GT","authors_text":"Laura Vargas Koch, Leon Sering, Theresa Ziemke","submitted_at":"2021-05-27T14:50:01Z","abstract_excerpt":"The mathematical approaches for modeling dynamic traffic can roughly be divided into two categories: discrete packet routing models and continuous flow over time models. Despite very vital research activities on models in both categories, the connection between these approaches was poorly understood so far. In this work we build this connection by specifying a (competitive) packet routing model, which is discrete in terms of flow and time, and by proving its convergence to the intensively studied model of flows over time with deterministic queuing. More precisely, we prove that the limit of th"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2105.13202","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.GT","submitted_at":"2021-05-27T14:50:01Z","cross_cats_sorted":["cs.DS","math.OC"],"title_canon_sha256":"aab63220e1e9188e33197ebc3a341c6cd33985914e29e31e127f9b88e5fbe830","abstract_canon_sha256":"52f8b80fe9bebf32f7b676806a313410d77765a24f22ea355fe764233431d1d4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:23:28.554684Z","signature_b64":"PumdKXHf6gdLzDg3poZni5di1hzlABHMHfp34VR1KdeN1DzzmI3JnDZ2Dghy8fPNla8FHJQbBTZCQHIGjqjsCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ac8da20fb7d564b8442e5ca21b5c6a1516f96d65c64ce8ff57851deb7c808f2","last_reissued_at":"2026-07-05T05:23:28.554217Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:23:28.554217Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Convergence of a Packet Routing Model to Flows Over Time","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DS","math.OC"],"primary_cat":"cs.GT","authors_text":"Laura Vargas Koch, Leon Sering, Theresa Ziemke","submitted_at":"2021-05-27T14:50:01Z","abstract_excerpt":"The mathematical approaches for modeling dynamic traffic can roughly be divided into two categories: discrete packet routing models and continuous flow over time models. Despite very vital research activities on models in both categories, the connection between these approaches was poorly understood so far. In this work we build this connection by specifying a (competitive) packet routing model, which is discrete in terms of flow and time, and by proving its convergence to the intensively studied model of flows over time with deterministic queuing. More precisely, we prove that the limit of th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.13202","kind":"arxiv","version":2},"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/2105.13202/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2105.13202","created_at":"2026-07-05T05:23:28.554275+00:00"},{"alias_kind":"arxiv_version","alias_value":"2105.13202v2","created_at":"2026-07-05T05:23:28.554275+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.13202","created_at":"2026-07-05T05:23:28.554275+00:00"},{"alias_kind":"pith_short_12","alias_value":"LLENUIH3PVLE","created_at":"2026-07-05T05:23:28.554275+00:00"},{"alias_kind":"pith_short_16","alias_value":"LLENUIH3PVLEXBCC","created_at":"2026-07-05T05:23:28.554275+00:00"},{"alias_kind":"pith_short_8","alias_value":"LLENUIH3","created_at":"2026-07-05T05:23:28.554275+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LLENUIH3PVLEXBCC4XFCDNOGUF","json":"https://pith.science/pith/LLENUIH3PVLEXBCC4XFCDNOGUF.json","graph_json":"https://pith.science/api/pith-number/LLENUIH3PVLEXBCC4XFCDNOGUF/graph.json","events_json":"https://pith.science/api/pith-number/LLENUIH3PVLEXBCC4XFCDNOGUF/events.json","paper":"https://pith.science/paper/LLENUIH3"},"agent_actions":{"view_html":"https://pith.science/pith/LLENUIH3PVLEXBCC4XFCDNOGUF","download_json":"https://pith.science/pith/LLENUIH3PVLEXBCC4XFCDNOGUF.json","view_paper":"https://pith.science/paper/LLENUIH3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2105.13202&json=true","fetch_graph":"https://pith.science/api/pith-number/LLENUIH3PVLEXBCC4XFCDNOGUF/graph.json","fetch_events":"https://pith.science/api/pith-number/LLENUIH3PVLEXBCC4XFCDNOGUF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LLENUIH3PVLEXBCC4XFCDNOGUF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LLENUIH3PVLEXBCC4XFCDNOGUF/action/storage_attestation","attest_author":"https://pith.science/pith/LLENUIH3PVLEXBCC4XFCDNOGUF/action/author_attestation","sign_citation":"https://pith.science/pith/LLENUIH3PVLEXBCC4XFCDNOGUF/action/citation_signature","submit_replication":"https://pith.science/pith/LLENUIH3PVLEXBCC4XFCDNOGUF/action/replication_record"}},"created_at":"2026-07-05T05:23:28.554275+00:00","updated_at":"2026-07-05T05:23:28.554275+00:00"}