{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:N7CEPA2DDI4TZY4EEAMPULKEA5","short_pith_number":"pith:N7CEPA2D","canonical_record":{"source":{"id":"1903.05833","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-03-14T06:46:18Z","cross_cats_sorted":[],"title_canon_sha256":"5b3e234acc50b61ca39fefa8e97cd86dabfd1459cf2d9915a1400162ee5609d3","abstract_canon_sha256":"b384c77fc201fa6fa4add25e3be3d07858c0beab5f23a9d42bf95d39a5418979"},"schema_version":"1.0"},"canonical_sha256":"6fc44783431a393ce3842018fa2d44074aaf43dbaf9ad384b0c333307c364b56","source":{"kind":"arxiv","id":"1903.05833","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.05833","created_at":"2026-05-17T23:51:16Z"},{"alias_kind":"arxiv_version","alias_value":"1903.05833v1","created_at":"2026-05-17T23:51:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.05833","created_at":"2026-05-17T23:51:16Z"},{"alias_kind":"pith_short_12","alias_value":"N7CEPA2DDI4T","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"N7CEPA2DDI4TZY4E","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"N7CEPA2D","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:N7CEPA2DDI4TZY4EEAMPULKEA5","target":"record","payload":{"canonical_record":{"source":{"id":"1903.05833","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-03-14T06:46:18Z","cross_cats_sorted":[],"title_canon_sha256":"5b3e234acc50b61ca39fefa8e97cd86dabfd1459cf2d9915a1400162ee5609d3","abstract_canon_sha256":"b384c77fc201fa6fa4add25e3be3d07858c0beab5f23a9d42bf95d39a5418979"},"schema_version":"1.0"},"canonical_sha256":"6fc44783431a393ce3842018fa2d44074aaf43dbaf9ad384b0c333307c364b56","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:16.028852Z","signature_b64":"JExswZY8s02ymwfumUQKB/GErIW4pT3hYVDppV3tdEh0/PufZl4KIfi5apoOi/GI5wKA5uTiFJlZQWEYA45eAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6fc44783431a393ce3842018fa2d44074aaf43dbaf9ad384b0c333307c364b56","last_reissued_at":"2026-05-17T23:51:16.028436Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:16.028436Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.05833","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-17T23:51:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hs/H+IdXUHUa9zguWKUB1oWCoPFXo5G/xlGIwAXSpjba5UliHreZq+w0UdpnR4huf9e6QDjphbzubLBbl6csDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T10:22:18.841228Z"},"content_sha256":"62894e97afc9a6b5f2a952074b3da8e408e926cf8fbdca997518a6796221035d","schema_version":"1.0","event_id":"sha256:62894e97afc9a6b5f2a952074b3da8e408e926cf8fbdca997518a6796221035d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:N7CEPA2DDI4TZY4EEAMPULKEA5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"FAVE: A fast and efficient network Flow AVailability Estimation method with bounded relative error","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"John C.S. Lui, TingWei Liu","submitted_at":"2019-03-14T06:46:18Z","abstract_excerpt":"This paper focuses on helping network providers to carry out network capacity planning and sales projection by answering the question: For a given topology and capacity, whether the network can serve current flow demands with high probabilities? We name such probability as \"{\\it flow availability}\", and present the \\underline{f}low \\underline{av}ailability \\underline{e}stimation (FAVE) problem, which is a generalisation of network connectivity or maximum flow reliability estimations. Realistic networks are often large and dynamic, so flow availabilities cannot be evaluated analytically and sim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.05833","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-17T23:51:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LhSjJMRmyrAiogJRKg6zz2G85LPN9EigqYSWSUHQqomlsjbKt9NLpNPxa0RQqQ+PQjoLFMyi92afPLDWneXYBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T10:22:18.841877Z"},"content_sha256":"019a4704fba6701cf0fb1ca7bd9fea4257ca4b9d29adcb9d3d1f498133aa2bae","schema_version":"1.0","event_id":"sha256:019a4704fba6701cf0fb1ca7bd9fea4257ca4b9d29adcb9d3d1f498133aa2bae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N7CEPA2DDI4TZY4EEAMPULKEA5/bundle.json","state_url":"https://pith.science/pith/N7CEPA2DDI4TZY4EEAMPULKEA5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N7CEPA2DDI4TZY4EEAMPULKEA5/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-07T10:22:18Z","links":{"resolver":"https://pith.science/pith/N7CEPA2DDI4TZY4EEAMPULKEA5","bundle":"https://pith.science/pith/N7CEPA2DDI4TZY4EEAMPULKEA5/bundle.json","state":"https://pith.science/pith/N7CEPA2DDI4TZY4EEAMPULKEA5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N7CEPA2DDI4TZY4EEAMPULKEA5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:N7CEPA2DDI4TZY4EEAMPULKEA5","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":"b384c77fc201fa6fa4add25e3be3d07858c0beab5f23a9d42bf95d39a5418979","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-03-14T06:46:18Z","title_canon_sha256":"5b3e234acc50b61ca39fefa8e97cd86dabfd1459cf2d9915a1400162ee5609d3"},"schema_version":"1.0","source":{"id":"1903.05833","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.05833","created_at":"2026-05-17T23:51:16Z"},{"alias_kind":"arxiv_version","alias_value":"1903.05833v1","created_at":"2026-05-17T23:51:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.05833","created_at":"2026-05-17T23:51:16Z"},{"alias_kind":"pith_short_12","alias_value":"N7CEPA2DDI4T","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"N7CEPA2DDI4TZY4E","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"N7CEPA2D","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:019a4704fba6701cf0fb1ca7bd9fea4257ca4b9d29adcb9d3d1f498133aa2bae","target":"graph","created_at":"2026-05-17T23:51:16Z","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":"This paper focuses on helping network providers to carry out network capacity planning and sales projection by answering the question: For a given topology and capacity, whether the network can serve current flow demands with high probabilities? We name such probability as \"{\\it flow availability}\", and present the \\underline{f}low \\underline{av}ailability \\underline{e}stimation (FAVE) problem, which is a generalisation of network connectivity or maximum flow reliability estimations. Realistic networks are often large and dynamic, so flow availabilities cannot be evaluated analytically and sim","authors_text":"John C.S. Lui, TingWei Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-03-14T06:46:18Z","title":"FAVE: A fast and efficient network Flow AVailability Estimation method with bounded relative error"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.05833","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:62894e97afc9a6b5f2a952074b3da8e408e926cf8fbdca997518a6796221035d","target":"record","created_at":"2026-05-17T23:51:16Z","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":"b384c77fc201fa6fa4add25e3be3d07858c0beab5f23a9d42bf95d39a5418979","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-03-14T06:46:18Z","title_canon_sha256":"5b3e234acc50b61ca39fefa8e97cd86dabfd1459cf2d9915a1400162ee5609d3"},"schema_version":"1.0","source":{"id":"1903.05833","kind":"arxiv","version":1}},"canonical_sha256":"6fc44783431a393ce3842018fa2d44074aaf43dbaf9ad384b0c333307c364b56","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6fc44783431a393ce3842018fa2d44074aaf43dbaf9ad384b0c333307c364b56","first_computed_at":"2026-05-17T23:51:16.028436Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:16.028436Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JExswZY8s02ymwfumUQKB/GErIW4pT3hYVDppV3tdEh0/PufZl4KIfi5apoOi/GI5wKA5uTiFJlZQWEYA45eAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:16.028852Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.05833","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:62894e97afc9a6b5f2a952074b3da8e408e926cf8fbdca997518a6796221035d","sha256:019a4704fba6701cf0fb1ca7bd9fea4257ca4b9d29adcb9d3d1f498133aa2bae"],"state_sha256":"6af51cb9aaa5f4a9e65e2c906914f46dfe1b844c14e56ace75a60783c9d6422a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U+VzJTJ1eFLymWFRP2i0Np+UNxSzhLU7ugXQAhEJiw/A7kPSfS1nUAL7/nehRRwNz69HInllunSTYM+Ql7KRCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T10:22:18.844829Z","bundle_sha256":"55c8d4770559ee49f2cbb04c59daa3fd5d10d19a5db6c3ec0e9c4c07d98f19f2"}}