{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:AGVPFEGHSLAC52LOKUUJHQXUVY","short_pith_number":"pith:AGVPFEGH","schema_version":"1.0","canonical_sha256":"01aaf290c792c02ee96e552893c2f4ae2cbdba65eba5c5b7b4fe11ec2d5af8fd","source":{"kind":"arxiv","id":"1110.5084","version":1},"attestation_state":"computed","paper":{"title":"A cactus theorem for end cuts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anastasia Evangelidou, Panos Papasoglu","submitted_at":"2011-10-23T20:30:38Z","abstract_excerpt":"Dinits-Karzanov-Lomonosov showed that it is possible to encode all minimal edge cuts of a graph by a tree-like structure called a cactus. We show here that minimal edge cuts separating ends of the graph rather than vertices can be `encoded' also by a cactus. We apply our methods to finite graphs as well and we show that several types of cuts can be encoded by cacti."},"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":"1110.5084","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-23T20:30:38Z","cross_cats_sorted":[],"title_canon_sha256":"d0cb9878aaa63ace1f68870d8ba2f8278ef8832956370bb66dd695a8ae8923ca","abstract_canon_sha256":"3e38b67a917f9b71e95da5cff5051fa534bc8bb2a47a0b26fafcc0870eae5a84"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:10:24.748789Z","signature_b64":"tXN6DnmhEqLnLPtnEi3b/rTMOnDALL50vX1Hp6cnaWpvV3+mh543U+i0hNE2RsyraHzOfHX8ETO/MHniK2f+Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01aaf290c792c02ee96e552893c2f4ae2cbdba65eba5c5b7b4fe11ec2d5af8fd","last_reissued_at":"2026-05-18T04:10:24.748278Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:10:24.748278Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A cactus theorem for end cuts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anastasia Evangelidou, Panos Papasoglu","submitted_at":"2011-10-23T20:30:38Z","abstract_excerpt":"Dinits-Karzanov-Lomonosov showed that it is possible to encode all minimal edge cuts of a graph by a tree-like structure called a cactus. We show here that minimal edge cuts separating ends of the graph rather than vertices can be `encoded' also by a cactus. We apply our methods to finite graphs as well and we show that several types of cuts can be encoded by cacti."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.5084","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":"1110.5084","created_at":"2026-05-18T04:10:24.748356+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.5084v1","created_at":"2026-05-18T04:10:24.748356+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.5084","created_at":"2026-05-18T04:10:24.748356+00:00"},{"alias_kind":"pith_short_12","alias_value":"AGVPFEGHSLAC","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_16","alias_value":"AGVPFEGHSLAC52LO","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_8","alias_value":"AGVPFEGH","created_at":"2026-05-18T12:26:24.575870+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/AGVPFEGHSLAC52LOKUUJHQXUVY","json":"https://pith.science/pith/AGVPFEGHSLAC52LOKUUJHQXUVY.json","graph_json":"https://pith.science/api/pith-number/AGVPFEGHSLAC52LOKUUJHQXUVY/graph.json","events_json":"https://pith.science/api/pith-number/AGVPFEGHSLAC52LOKUUJHQXUVY/events.json","paper":"https://pith.science/paper/AGVPFEGH"},"agent_actions":{"view_html":"https://pith.science/pith/AGVPFEGHSLAC52LOKUUJHQXUVY","download_json":"https://pith.science/pith/AGVPFEGHSLAC52LOKUUJHQXUVY.json","view_paper":"https://pith.science/paper/AGVPFEGH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.5084&json=true","fetch_graph":"https://pith.science/api/pith-number/AGVPFEGHSLAC52LOKUUJHQXUVY/graph.json","fetch_events":"https://pith.science/api/pith-number/AGVPFEGHSLAC52LOKUUJHQXUVY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AGVPFEGHSLAC52LOKUUJHQXUVY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AGVPFEGHSLAC52LOKUUJHQXUVY/action/storage_attestation","attest_author":"https://pith.science/pith/AGVPFEGHSLAC52LOKUUJHQXUVY/action/author_attestation","sign_citation":"https://pith.science/pith/AGVPFEGHSLAC52LOKUUJHQXUVY/action/citation_signature","submit_replication":"https://pith.science/pith/AGVPFEGHSLAC52LOKUUJHQXUVY/action/replication_record"}},"created_at":"2026-05-18T04:10:24.748356+00:00","updated_at":"2026-05-18T04:10:24.748356+00:00"}