{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:IEQ6ZCTNB4RAZKTYED5XBJTLOG","short_pith_number":"pith:IEQ6ZCTN","schema_version":"1.0","canonical_sha256":"4121ec8a6d0f220caa7820fb70a66b7194e5bff0cd049986cae80d1d7dc27c44","source":{"kind":"arxiv","id":"1606.01091","version":2},"attestation_state":"computed","paper":{"title":"Temporal flows in Temporal networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Eleni C. Akrida, Jurek Czyzowicz, Leszek Gasieniec, Lukasz Kuszner, Paul G. Spirakis","submitted_at":"2016-06-03T13:56:54Z","abstract_excerpt":"We introduce temporal flows on temporal networks, i.e., networks the links of which exist only at certain moments of time. Such networks are ephemeral in the sense that no link exists after some time. Our flow model is new and differs from the \"flows over time\" model, also called \"dynamic flows\" in the literature. We show that the problem of finding the maximum amount of flow that can pass from a source vertex s to a sink vertex t up to a given time is solvable in Polynomial time, even when node buffers are bounded. We then examine mainly the case of unbounded node buffers. We provide a simpli"},"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":"1606.01091","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-03T13:56:54Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"6078f7f4e86f9fba75cf1c44ee59aa7b813f08a69d6af598878e45a4de1585ca","abstract_canon_sha256":"c813b4f5ea2e03c61607b4407953b46c3665b41c9a033bfe9e032ecbf0d08ca5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:25.507817Z","signature_b64":"FcSQmSjwS2WHayqhlmu7J4p6Yj5E1luFnmWSiSGAib3cyO29nm7bgRb5PzZaA/Yhm4N13TdIcq7CoHzHXt49Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4121ec8a6d0f220caa7820fb70a66b7194e5bff0cd049986cae80d1d7dc27c44","last_reissued_at":"2026-05-18T00:52:25.507178Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:25.507178Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Temporal flows in Temporal networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Eleni C. Akrida, Jurek Czyzowicz, Leszek Gasieniec, Lukasz Kuszner, Paul G. Spirakis","submitted_at":"2016-06-03T13:56:54Z","abstract_excerpt":"We introduce temporal flows on temporal networks, i.e., networks the links of which exist only at certain moments of time. Such networks are ephemeral in the sense that no link exists after some time. Our flow model is new and differs from the \"flows over time\" model, also called \"dynamic flows\" in the literature. We show that the problem of finding the maximum amount of flow that can pass from a source vertex s to a sink vertex t up to a given time is solvable in Polynomial time, even when node buffers are bounded. We then examine mainly the case of unbounded node buffers. We provide a simpli"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.01091","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":""},"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":"1606.01091","created_at":"2026-05-18T00:52:25.507278+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.01091v2","created_at":"2026-05-18T00:52:25.507278+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.01091","created_at":"2026-05-18T00:52:25.507278+00:00"},{"alias_kind":"pith_short_12","alias_value":"IEQ6ZCTNB4RA","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"IEQ6ZCTNB4RAZKTY","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"IEQ6ZCTN","created_at":"2026-05-18T12:30:22.444734+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/IEQ6ZCTNB4RAZKTYED5XBJTLOG","json":"https://pith.science/pith/IEQ6ZCTNB4RAZKTYED5XBJTLOG.json","graph_json":"https://pith.science/api/pith-number/IEQ6ZCTNB4RAZKTYED5XBJTLOG/graph.json","events_json":"https://pith.science/api/pith-number/IEQ6ZCTNB4RAZKTYED5XBJTLOG/events.json","paper":"https://pith.science/paper/IEQ6ZCTN"},"agent_actions":{"view_html":"https://pith.science/pith/IEQ6ZCTNB4RAZKTYED5XBJTLOG","download_json":"https://pith.science/pith/IEQ6ZCTNB4RAZKTYED5XBJTLOG.json","view_paper":"https://pith.science/paper/IEQ6ZCTN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.01091&json=true","fetch_graph":"https://pith.science/api/pith-number/IEQ6ZCTNB4RAZKTYED5XBJTLOG/graph.json","fetch_events":"https://pith.science/api/pith-number/IEQ6ZCTNB4RAZKTYED5XBJTLOG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IEQ6ZCTNB4RAZKTYED5XBJTLOG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IEQ6ZCTNB4RAZKTYED5XBJTLOG/action/storage_attestation","attest_author":"https://pith.science/pith/IEQ6ZCTNB4RAZKTYED5XBJTLOG/action/author_attestation","sign_citation":"https://pith.science/pith/IEQ6ZCTNB4RAZKTYED5XBJTLOG/action/citation_signature","submit_replication":"https://pith.science/pith/IEQ6ZCTNB4RAZKTYED5XBJTLOG/action/replication_record"}},"created_at":"2026-05-18T00:52:25.507278+00:00","updated_at":"2026-05-18T00:52:25.507278+00:00"}