{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:P47PWCW2IH6A2FVEXOQO4N53Z4","short_pith_number":"pith:P47PWCW2","schema_version":"1.0","canonical_sha256":"7f3efb0ada41fc0d16a4bba0ee37bbcf257b6794a026405bf6cf60940934077b","source":{"kind":"arxiv","id":"1908.06541","version":2},"attestation_state":"computed","paper":{"title":"The Landscape of Minimum Label Cut (Hedge Connectivity) Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.OC"],"primary_cat":"cs.DS","authors_text":"Andr\\'as Farag\\'o, Rupei Xu","submitted_at":"2019-08-19T00:12:06Z","abstract_excerpt":"Minimum Label Cut (or Hedge Connectivity) problem is defined as follows: given an undirected graph $G=(V, E)$ with $n$ vertices and $m$ edges, in which, each edge is labeled (with one or multiple labels) from a label set $L=\\{\\ell_1,\\ell_2, ..., \\ell_{|L|}\\}$, the edges may be weighted with weight set $W =\\{w_1, w_2, ..., w_m\\}$, the label cut problem(hedge connectivity) problem asks for the minimum number of edge sets(each edge set (or hedge) is the edges with the same label) whose removal disconnects the source-sink pair of vertices or the whole graph with minimum total weights(minimum cardi"},"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":"1908.06541","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-19T00:12:06Z","cross_cats_sorted":["math.CO","math.OC"],"title_canon_sha256":"43e1c14f122e51e6ed6aa1c8e3ff343400f8bcd7ecbde9e675a0c5d5586025fe","abstract_canon_sha256":"b0a4cae1a49de08d711bc7b57f96c049ac475655d7f056397f246496f5bdb521"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:58:29.378969Z","signature_b64":"zmquLrOzgU4HJY+WGqAnxdSRsjNl77CJxwhGH/h9H3/UZhV5hXs5xI13qzPwsTA0oK976MlhL36Hs8XXFhduBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f3efb0ada41fc0d16a4bba0ee37bbcf257b6794a026405bf6cf60940934077b","last_reissued_at":"2026-07-04T23:58:29.378588Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:58:29.378588Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Landscape of Minimum Label Cut (Hedge Connectivity) Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.OC"],"primary_cat":"cs.DS","authors_text":"Andr\\'as Farag\\'o, Rupei Xu","submitted_at":"2019-08-19T00:12:06Z","abstract_excerpt":"Minimum Label Cut (or Hedge Connectivity) problem is defined as follows: given an undirected graph $G=(V, E)$ with $n$ vertices and $m$ edges, in which, each edge is labeled (with one or multiple labels) from a label set $L=\\{\\ell_1,\\ell_2, ..., \\ell_{|L|}\\}$, the edges may be weighted with weight set $W =\\{w_1, w_2, ..., w_m\\}$, the label cut problem(hedge connectivity) problem asks for the minimum number of edge sets(each edge set (or hedge) is the edges with the same label) whose removal disconnects the source-sink pair of vertices or the whole graph with minimum total weights(minimum cardi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.06541","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.06541/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1908.06541","created_at":"2026-07-04T23:58:29.378645+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.06541v2","created_at":"2026-07-04T23:58:29.378645+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.06541","created_at":"2026-07-04T23:58:29.378645+00:00"},{"alias_kind":"pith_short_12","alias_value":"P47PWCW2IH6A","created_at":"2026-07-04T23:58:29.378645+00:00"},{"alias_kind":"pith_short_16","alias_value":"P47PWCW2IH6A2FVE","created_at":"2026-07-04T23:58:29.378645+00:00"},{"alias_kind":"pith_short_8","alias_value":"P47PWCW2","created_at":"2026-07-04T23:58:29.378645+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.05143","citing_title":"Color-avoiding connected colorings and orientations","ref_index":51,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/P47PWCW2IH6A2FVEXOQO4N53Z4","json":"https://pith.science/pith/P47PWCW2IH6A2FVEXOQO4N53Z4.json","graph_json":"https://pith.science/api/pith-number/P47PWCW2IH6A2FVEXOQO4N53Z4/graph.json","events_json":"https://pith.science/api/pith-number/P47PWCW2IH6A2FVEXOQO4N53Z4/events.json","paper":"https://pith.science/paper/P47PWCW2"},"agent_actions":{"view_html":"https://pith.science/pith/P47PWCW2IH6A2FVEXOQO4N53Z4","download_json":"https://pith.science/pith/P47PWCW2IH6A2FVEXOQO4N53Z4.json","view_paper":"https://pith.science/paper/P47PWCW2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.06541&json=true","fetch_graph":"https://pith.science/api/pith-number/P47PWCW2IH6A2FVEXOQO4N53Z4/graph.json","fetch_events":"https://pith.science/api/pith-number/P47PWCW2IH6A2FVEXOQO4N53Z4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P47PWCW2IH6A2FVEXOQO4N53Z4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P47PWCW2IH6A2FVEXOQO4N53Z4/action/storage_attestation","attest_author":"https://pith.science/pith/P47PWCW2IH6A2FVEXOQO4N53Z4/action/author_attestation","sign_citation":"https://pith.science/pith/P47PWCW2IH6A2FVEXOQO4N53Z4/action/citation_signature","submit_replication":"https://pith.science/pith/P47PWCW2IH6A2FVEXOQO4N53Z4/action/replication_record"}},"created_at":"2026-07-04T23:58:29.378645+00:00","updated_at":"2026-07-04T23:58:29.378645+00:00"}