{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:RF4DLVF5SBFNHTEIDTPK2KBCWS","short_pith_number":"pith:RF4DLVF5","schema_version":"1.0","canonical_sha256":"897835d4bd904ad3cc881cdead2822b4a6654b2a98912b76ae208db50f61d818","source":{"kind":"arxiv","id":"1401.6053","version":1},"attestation_state":"computed","paper":{"title":"Flows over time in time-varying networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Ebrahim Nasrabadi, Ronald Koch","submitted_at":"2014-01-23T16:59:40Z","abstract_excerpt":"There has been much research on network flows over time due to their important role in real world applications. This has led to many results, but the more challenging continuous time model still lacks some of the key concepts and techniques that are the cornerstones of static network flows. The aim of this paper is to advance the state of the art for dynamic network flows by developing the continuous time analogues of the theory for static network flows. Specifically, we make use of ideas from the static case to establish a reduced cost optimality condition, a negative cycle optimality conditi"},"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":"1401.6053","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-01-23T16:59:40Z","cross_cats_sorted":[],"title_canon_sha256":"c0bf2d51a4263643e2dd9e3dae89a1235070da042228dd4eac9c039dce36e263","abstract_canon_sha256":"b979ac0e62bfd96ce12731f38537e6754ac1bf06d9759bceaa057568d7fde3af"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:22.997792Z","signature_b64":"16bD16wNzaA+9DxOPb+yJnJWxnfvtgh7YnCVkxnodxz9SsxVWIi2F62Wu72xvt8UtceZ2neIyqDZIkcsET38Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"897835d4bd904ad3cc881cdead2822b4a6654b2a98912b76ae208db50f61d818","last_reissued_at":"2026-05-18T03:01:22.997054Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:22.997054Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Flows over time in time-varying networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Ebrahim Nasrabadi, Ronald Koch","submitted_at":"2014-01-23T16:59:40Z","abstract_excerpt":"There has been much research on network flows over time due to their important role in real world applications. This has led to many results, but the more challenging continuous time model still lacks some of the key concepts and techniques that are the cornerstones of static network flows. The aim of this paper is to advance the state of the art for dynamic network flows by developing the continuous time analogues of the theory for static network flows. Specifically, we make use of ideas from the static case to establish a reduced cost optimality condition, a negative cycle optimality conditi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.6053","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1401.6053","created_at":"2026-05-18T03:01:22.997139+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.6053v1","created_at":"2026-05-18T03:01:22.997139+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6053","created_at":"2026-05-18T03:01:22.997139+00:00"},{"alias_kind":"pith_short_12","alias_value":"RF4DLVF5SBFN","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"RF4DLVF5SBFNHTEI","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"RF4DLVF5","created_at":"2026-05-18T12:28:46.137349+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/RF4DLVF5SBFNHTEIDTPK2KBCWS","json":"https://pith.science/pith/RF4DLVF5SBFNHTEIDTPK2KBCWS.json","graph_json":"https://pith.science/api/pith-number/RF4DLVF5SBFNHTEIDTPK2KBCWS/graph.json","events_json":"https://pith.science/api/pith-number/RF4DLVF5SBFNHTEIDTPK2KBCWS/events.json","paper":"https://pith.science/paper/RF4DLVF5"},"agent_actions":{"view_html":"https://pith.science/pith/RF4DLVF5SBFNHTEIDTPK2KBCWS","download_json":"https://pith.science/pith/RF4DLVF5SBFNHTEIDTPK2KBCWS.json","view_paper":"https://pith.science/paper/RF4DLVF5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.6053&json=true","fetch_graph":"https://pith.science/api/pith-number/RF4DLVF5SBFNHTEIDTPK2KBCWS/graph.json","fetch_events":"https://pith.science/api/pith-number/RF4DLVF5SBFNHTEIDTPK2KBCWS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RF4DLVF5SBFNHTEIDTPK2KBCWS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RF4DLVF5SBFNHTEIDTPK2KBCWS/action/storage_attestation","attest_author":"https://pith.science/pith/RF4DLVF5SBFNHTEIDTPK2KBCWS/action/author_attestation","sign_citation":"https://pith.science/pith/RF4DLVF5SBFNHTEIDTPK2KBCWS/action/citation_signature","submit_replication":"https://pith.science/pith/RF4DLVF5SBFNHTEIDTPK2KBCWS/action/replication_record"}},"created_at":"2026-05-18T03:01:22.997139+00:00","updated_at":"2026-05-18T03:01:22.997139+00:00"}