{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:IEQ6ZCTNB4RAZKTYED5XBJTLOG","short_pith_number":"pith:IEQ6ZCTN","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"},"canonical_sha256":"4121ec8a6d0f220caa7820fb70a66b7194e5bff0cd049986cae80d1d7dc27c44","source":{"kind":"arxiv","id":"1606.01091","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.01091","created_at":"2026-05-18T00:52:25Z"},{"alias_kind":"arxiv_version","alias_value":"1606.01091v2","created_at":"2026-05-18T00:52:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.01091","created_at":"2026-05-18T00:52:25Z"},{"alias_kind":"pith_short_12","alias_value":"IEQ6ZCTNB4RA","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IEQ6ZCTNB4RAZKTY","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IEQ6ZCTN","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:IEQ6ZCTNB4RAZKTYED5XBJTLOG","target":"record","payload":{"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"},"canonical_sha256":"4121ec8a6d0f220caa7820fb70a66b7194e5bff0cd049986cae80d1d7dc27c44","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"},"source_kind":"arxiv","source_id":"1606.01091","source_version":2,"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-18T00:52:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VcpPxW0bUX5sjt03doZf3CqnHqJo7j7JK+IxCLym+7mRTA/0s+90yJzp5Gf00ie2EitKPJD4qiBWB5x7jsBXBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T22:24:04.154477Z"},"content_sha256":"f25c38114d68361ac9145e90bb4f0f35db4ac6b06b61af5d512c985bec8bcc76","schema_version":"1.0","event_id":"sha256:f25c38114d68361ac9145e90bb4f0f35db4ac6b06b61af5d512c985bec8bcc76"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:IEQ6ZCTNB4RAZKTYED5XBJTLOG","target":"graph","payload":{"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"},"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-18T00:52:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4kydIgqmt13YUNkoN7vhXyNPiZUay3fyVaQLamtJxm1WdRINlx1HeUF7a1LbDzK2ax82vZuwV9C1LcOFJHnvCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T22:24:04.155141Z"},"content_sha256":"02e33847c89be9ab36513c03208500b3c0a3c6eb3ea633eefbb0e2a5d9200d94","schema_version":"1.0","event_id":"sha256:02e33847c89be9ab36513c03208500b3c0a3c6eb3ea633eefbb0e2a5d9200d94"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IEQ6ZCTNB4RAZKTYED5XBJTLOG/bundle.json","state_url":"https://pith.science/pith/IEQ6ZCTNB4RAZKTYED5XBJTLOG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IEQ6ZCTNB4RAZKTYED5XBJTLOG/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-05-30T22:24:04Z","links":{"resolver":"https://pith.science/pith/IEQ6ZCTNB4RAZKTYED5XBJTLOG","bundle":"https://pith.science/pith/IEQ6ZCTNB4RAZKTYED5XBJTLOG/bundle.json","state":"https://pith.science/pith/IEQ6ZCTNB4RAZKTYED5XBJTLOG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IEQ6ZCTNB4RAZKTYED5XBJTLOG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:IEQ6ZCTNB4RAZKTYED5XBJTLOG","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":"c813b4f5ea2e03c61607b4407953b46c3665b41c9a033bfe9e032ecbf0d08ca5","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-03T13:56:54Z","title_canon_sha256":"6078f7f4e86f9fba75cf1c44ee59aa7b813f08a69d6af598878e45a4de1585ca"},"schema_version":"1.0","source":{"id":"1606.01091","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.01091","created_at":"2026-05-18T00:52:25Z"},{"alias_kind":"arxiv_version","alias_value":"1606.01091v2","created_at":"2026-05-18T00:52:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.01091","created_at":"2026-05-18T00:52:25Z"},{"alias_kind":"pith_short_12","alias_value":"IEQ6ZCTNB4RA","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IEQ6ZCTNB4RAZKTY","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IEQ6ZCTN","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:02e33847c89be9ab36513c03208500b3c0a3c6eb3ea633eefbb0e2a5d9200d94","target":"graph","created_at":"2026-05-18T00:52:25Z","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":"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","authors_text":"Eleni C. Akrida, Jurek Czyzowicz, Leszek Gasieniec, Lukasz Kuszner, Paul G. Spirakis","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-03T13:56:54Z","title":"Temporal flows in Temporal networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.01091","kind":"arxiv","version":2},"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:f25c38114d68361ac9145e90bb4f0f35db4ac6b06b61af5d512c985bec8bcc76","target":"record","created_at":"2026-05-18T00:52:25Z","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":"c813b4f5ea2e03c61607b4407953b46c3665b41c9a033bfe9e032ecbf0d08ca5","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-03T13:56:54Z","title_canon_sha256":"6078f7f4e86f9fba75cf1c44ee59aa7b813f08a69d6af598878e45a4de1585ca"},"schema_version":"1.0","source":{"id":"1606.01091","kind":"arxiv","version":2}},"canonical_sha256":"4121ec8a6d0f220caa7820fb70a66b7194e5bff0cd049986cae80d1d7dc27c44","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4121ec8a6d0f220caa7820fb70a66b7194e5bff0cd049986cae80d1d7dc27c44","first_computed_at":"2026-05-18T00:52:25.507178Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:25.507178Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FcSQmSjwS2WHayqhlmu7J4p6Yj5E1luFnmWSiSGAib3cyO29nm7bgRb5PzZaA/Yhm4N13TdIcq7CoHzHXt49Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:25.507817Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.01091","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f25c38114d68361ac9145e90bb4f0f35db4ac6b06b61af5d512c985bec8bcc76","sha256:02e33847c89be9ab36513c03208500b3c0a3c6eb3ea633eefbb0e2a5d9200d94"],"state_sha256":"f1f5270b790af75a7c96c8e2ffa5184f51ca1c848caa24f436c7527bb4498ab9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hkn07Cx7Kpb6XM33jp44ephTDUpZ8tagueZKIrXVFgD5K2RTyxnbIcabrE0Mo0RkTduFRYAIaaRxp1b52S1JCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T22:24:04.158818Z","bundle_sha256":"9b733ee0a0a5b2101ef0aa5157abfc9b2733668c2cfc68c3043563552c7be42f"}}