{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:IU6LRVV7MQPLYGDROWWLBJZFTT","short_pith_number":"pith:IU6LRVV7","schema_version":"1.0","canonical_sha256":"453cb8d6bf641ebc187175acb0a7259cf5875e8dfa28c257bd5f8b35eb5906f1","source":{"kind":"arxiv","id":"1710.01965","version":4},"attestation_state":"computed","paper":{"title":"Max flow vitality in general and $st$-planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andrea Ribichini, Giorgio Ausiello, Isabella Lari, Paolo Giulio Franciosa","submitted_at":"2017-10-05T11:12:33Z","abstract_excerpt":"The \\emph{vitality} of an arc/node of a graph with respect to the maximum flow between two fixed nodes $s$ and $t$ is defined as the reduction of the maximum flow caused by the removal of that arc/node. In this paper we address the issue of determining the vitality of arcs and/or nodes for the maximum flow problem. We show how to compute the vitality of all arcs in a general undirected graph by solving only $2(n-1)$ max flow instances and, In $st$-planar graphs (directed or undirected) we show how to compute the vitality of all arcs and all nodes in $O(n)$ worst-case time. Moreover, after dete"},"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":"1710.01965","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-05T11:12:33Z","cross_cats_sorted":[],"title_canon_sha256":"8293a81c8d96a03fd635a44bba26bfcdc7d6f39d55c01be8e9a303f1113f5f0b","abstract_canon_sha256":"2274e538bf3e485b3e29849f476224999e2007ff173c993b4bb7986be68746e9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:50.913045Z","signature_b64":"FcRpyVZxCfDJgnJf7iV+JxbCh4fcA5qEJwQCXOGOM07RCIUh8cqTTsM0HhlvR5w7t651JnLlZ4VNngDmrtAPDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"453cb8d6bf641ebc187175acb0a7259cf5875e8dfa28c257bd5f8b35eb5906f1","last_reissued_at":"2026-05-17T23:57:50.912422Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:50.912422Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Max flow vitality in general and $st$-planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andrea Ribichini, Giorgio Ausiello, Isabella Lari, Paolo Giulio Franciosa","submitted_at":"2017-10-05T11:12:33Z","abstract_excerpt":"The \\emph{vitality} of an arc/node of a graph with respect to the maximum flow between two fixed nodes $s$ and $t$ is defined as the reduction of the maximum flow caused by the removal of that arc/node. In this paper we address the issue of determining the vitality of arcs and/or nodes for the maximum flow problem. We show how to compute the vitality of all arcs in a general undirected graph by solving only $2(n-1)$ max flow instances and, In $st$-planar graphs (directed or undirected) we show how to compute the vitality of all arcs and all nodes in $O(n)$ worst-case time. Moreover, after dete"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.01965","kind":"arxiv","version":4},"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":"1710.01965","created_at":"2026-05-17T23:57:50.912520+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.01965v4","created_at":"2026-05-17T23:57:50.912520+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.01965","created_at":"2026-05-17T23:57:50.912520+00:00"},{"alias_kind":"pith_short_12","alias_value":"IU6LRVV7MQPL","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"IU6LRVV7MQPLYGDR","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"IU6LRVV7","created_at":"2026-05-18T12:31:21.493067+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/IU6LRVV7MQPLYGDROWWLBJZFTT","json":"https://pith.science/pith/IU6LRVV7MQPLYGDROWWLBJZFTT.json","graph_json":"https://pith.science/api/pith-number/IU6LRVV7MQPLYGDROWWLBJZFTT/graph.json","events_json":"https://pith.science/api/pith-number/IU6LRVV7MQPLYGDROWWLBJZFTT/events.json","paper":"https://pith.science/paper/IU6LRVV7"},"agent_actions":{"view_html":"https://pith.science/pith/IU6LRVV7MQPLYGDROWWLBJZFTT","download_json":"https://pith.science/pith/IU6LRVV7MQPLYGDROWWLBJZFTT.json","view_paper":"https://pith.science/paper/IU6LRVV7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.01965&json=true","fetch_graph":"https://pith.science/api/pith-number/IU6LRVV7MQPLYGDROWWLBJZFTT/graph.json","fetch_events":"https://pith.science/api/pith-number/IU6LRVV7MQPLYGDROWWLBJZFTT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IU6LRVV7MQPLYGDROWWLBJZFTT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IU6LRVV7MQPLYGDROWWLBJZFTT/action/storage_attestation","attest_author":"https://pith.science/pith/IU6LRVV7MQPLYGDROWWLBJZFTT/action/author_attestation","sign_citation":"https://pith.science/pith/IU6LRVV7MQPLYGDROWWLBJZFTT/action/citation_signature","submit_replication":"https://pith.science/pith/IU6LRVV7MQPLYGDROWWLBJZFTT/action/replication_record"}},"created_at":"2026-05-17T23:57:50.912520+00:00","updated_at":"2026-05-17T23:57:50.912520+00:00"}