{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:F5HV4MXAI3D2YSNNUKZBQYUSNL","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":"8c316db789c0d98bc4f2cd3b15363d47fe68040f6c30e60f139a0c3f5d85e0bf","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-02T07:56:41Z","title_canon_sha256":"eb284d85c16a6d2665123ef92c88e143de7457142dddd44ee17f4b96549c6632"},"schema_version":"1.0","source":{"id":"1201.0435","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.0435","created_at":"2026-05-18T04:04:43Z"},{"alias_kind":"arxiv_version","alias_value":"1201.0435v2","created_at":"2026-05-18T04:04:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.0435","created_at":"2026-05-18T04:04:43Z"},{"alias_kind":"pith_short_12","alias_value":"F5HV4MXAI3D2","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"F5HV4MXAI3D2YSNN","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"F5HV4MXA","created_at":"2026-05-18T12:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:8894c156b4e07fa9f084337bd6ee0af7f49652d313846394377b19c98828d06c","target":"graph","created_at":"2026-05-18T04:04:43Z","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":"In this paper, we investigate some properties on capacity factors, which were proposed to investigate the link failure problem from network coding. A capacity factor (CF) of a network is an edge set, deleting which will cause the maximum flow to decrease while deleting any proper subset will not. Generally, a $k$-CF is a minimal (not minimum) edge set which will cause the network maximum flow decrease by $k$.\n  Under point to point acyclic scenario, we characterize all the edges which are contained in some CF, and propose an efficient algorithm to classify. And we show that all edges on some $","authors_text":"Haibin Kan, Yuan Li, Yue Zhao","cross_cats":["cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-02T07:56:41Z","title":"Capacity Factors of a Point-to-point Network"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.0435","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:68cf469c975b452c3049d3582b39180fa4df6e19f99e0c55387e10916150cd07","target":"record","created_at":"2026-05-18T04:04:43Z","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":"8c316db789c0d98bc4f2cd3b15363d47fe68040f6c30e60f139a0c3f5d85e0bf","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-02T07:56:41Z","title_canon_sha256":"eb284d85c16a6d2665123ef92c88e143de7457142dddd44ee17f4b96549c6632"},"schema_version":"1.0","source":{"id":"1201.0435","kind":"arxiv","version":2}},"canonical_sha256":"2f4f5e32e046c7ac49ada2b21862926ad5868cf43785827956a4c12ffb032741","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2f4f5e32e046c7ac49ada2b21862926ad5868cf43785827956a4c12ffb032741","first_computed_at":"2026-05-18T04:04:43.334197Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:04:43.334197Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OS81UbzXoXv8Dp9j5T/lAr48lfmadCV+rvfZzhu+0mPyeDMZnUZ6tFM+5N6z1HlDBCXDiGcbfRhvuOUvE/QSBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:04:43.334676Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.0435","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:68cf469c975b452c3049d3582b39180fa4df6e19f99e0c55387e10916150cd07","sha256:8894c156b4e07fa9f084337bd6ee0af7f49652d313846394377b19c98828d06c"],"state_sha256":"a53ba1aa94e1f3ec2ed9efe2abfafb2163ebb935ceb784a807c560e6abc01722"}