{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:N7CEPA2DDI4TZY4EEAMPULKEA5","short_pith_number":"pith:N7CEPA2D","schema_version":"1.0","canonical_sha256":"6fc44783431a393ce3842018fa2d44074aaf43dbaf9ad384b0c333307c364b56","source":{"kind":"arxiv","id":"1903.05833","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1903.05833","created_at":"2026-05-17T23:51:16.028491+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.05833v1","created_at":"2026-05-17T23:51:16.028491+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.05833","created_at":"2026-05-17T23:51:16.028491+00:00"},{"alias_kind":"pith_short_12","alias_value":"N7CEPA2DDI4T","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"N7CEPA2DDI4TZY4E","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"N7CEPA2D","created_at":"2026-05-18T12:33:24.271573+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/N7CEPA2DDI4TZY4EEAMPULKEA5","json":"https://pith.science/pith/N7CEPA2DDI4TZY4EEAMPULKEA5.json","graph_json":"https://pith.science/api/pith-number/N7CEPA2DDI4TZY4EEAMPULKEA5/graph.json","events_json":"https://pith.science/api/pith-number/N7CEPA2DDI4TZY4EEAMPULKEA5/events.json","paper":"https://pith.science/paper/N7CEPA2D"},"agent_actions":{"view_html":"https://pith.science/pith/N7CEPA2DDI4TZY4EEAMPULKEA5","download_json":"https://pith.science/pith/N7CEPA2DDI4TZY4EEAMPULKEA5.json","view_paper":"https://pith.science/paper/N7CEPA2D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.05833&json=true","fetch_graph":"https://pith.science/api/pith-number/N7CEPA2DDI4TZY4EEAMPULKEA5/graph.json","fetch_events":"https://pith.science/api/pith-number/N7CEPA2DDI4TZY4EEAMPULKEA5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N7CEPA2DDI4TZY4EEAMPULKEA5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N7CEPA2DDI4TZY4EEAMPULKEA5/action/storage_attestation","attest_author":"https://pith.science/pith/N7CEPA2DDI4TZY4EEAMPULKEA5/action/author_attestation","sign_citation":"https://pith.science/pith/N7CEPA2DDI4TZY4EEAMPULKEA5/action/citation_signature","submit_replication":"https://pith.science/pith/N7CEPA2DDI4TZY4EEAMPULKEA5/action/replication_record"}},"created_at":"2026-05-17T23:51:16.028491+00:00","updated_at":"2026-05-17T23:51:16.028491+00:00"}