{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:AGVPFEGHSLAC52LOKUUJHQXUVY","short_pith_number":"pith:AGVPFEGH","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"},"canonical_sha256":"01aaf290c792c02ee96e552893c2f4ae2cbdba65eba5c5b7b4fe11ec2d5af8fd","source":{"kind":"arxiv","id":"1110.5084","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.5084","created_at":"2026-05-18T04:10:24Z"},{"alias_kind":"arxiv_version","alias_value":"1110.5084v1","created_at":"2026-05-18T04:10:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.5084","created_at":"2026-05-18T04:10:24Z"},{"alias_kind":"pith_short_12","alias_value":"AGVPFEGHSLAC","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"AGVPFEGHSLAC52LO","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"AGVPFEGH","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:AGVPFEGHSLAC52LOKUUJHQXUVY","target":"record","payload":{"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"},"canonical_sha256":"01aaf290c792c02ee96e552893c2f4ae2cbdba65eba5c5b7b4fe11ec2d5af8fd","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"},"source_kind":"arxiv","source_id":"1110.5084","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:10:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8/A986gW9TYQIUtnJzAxEo+3AVON7yi1RPup47QnL8samhleyEVDeyGmglBCTASF/d7PsN8jBIZ38q3UYWHKDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T17:35:00.066478Z"},"content_sha256":"c1fd2a7b51ebaa86e8562e9ed7e83a58e854696a79da287771db934d8095471b","schema_version":"1.0","event_id":"sha256:c1fd2a7b51ebaa86e8562e9ed7e83a58e854696a79da287771db934d8095471b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:AGVPFEGHSLAC52LOKUUJHQXUVY","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:10:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BX66JpA3EMLcUhdrz5J8ygJ8lfC+WeEjmqFLOHtC6FevNTKaOW8R/Op0pw+y5EiCRi/ZrM068ImbaFpjtAoiBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T17:35:00.066821Z"},"content_sha256":"87082f0411b1af83c966a9e808fd6548294d81d5acd6e1870fd8855ddfac11f0","schema_version":"1.0","event_id":"sha256:87082f0411b1af83c966a9e808fd6548294d81d5acd6e1870fd8855ddfac11f0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AGVPFEGHSLAC52LOKUUJHQXUVY/bundle.json","state_url":"https://pith.science/pith/AGVPFEGHSLAC52LOKUUJHQXUVY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AGVPFEGHSLAC52LOKUUJHQXUVY/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-27T17:35:00Z","links":{"resolver":"https://pith.science/pith/AGVPFEGHSLAC52LOKUUJHQXUVY","bundle":"https://pith.science/pith/AGVPFEGHSLAC52LOKUUJHQXUVY/bundle.json","state":"https://pith.science/pith/AGVPFEGHSLAC52LOKUUJHQXUVY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AGVPFEGHSLAC52LOKUUJHQXUVY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:AGVPFEGHSLAC52LOKUUJHQXUVY","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":"3e38b67a917f9b71e95da5cff5051fa534bc8bb2a47a0b26fafcc0870eae5a84","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-23T20:30:38Z","title_canon_sha256":"d0cb9878aaa63ace1f68870d8ba2f8278ef8832956370bb66dd695a8ae8923ca"},"schema_version":"1.0","source":{"id":"1110.5084","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.5084","created_at":"2026-05-18T04:10:24Z"},{"alias_kind":"arxiv_version","alias_value":"1110.5084v1","created_at":"2026-05-18T04:10:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.5084","created_at":"2026-05-18T04:10:24Z"},{"alias_kind":"pith_short_12","alias_value":"AGVPFEGHSLAC","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"AGVPFEGHSLAC52LO","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"AGVPFEGH","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:87082f0411b1af83c966a9e808fd6548294d81d5acd6e1870fd8855ddfac11f0","target":"graph","created_at":"2026-05-18T04:10:24Z","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":"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.","authors_text":"Anastasia Evangelidou, Panos Papasoglu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-23T20:30:38Z","title":"A cactus theorem for end cuts"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.5084","kind":"arxiv","version":1},"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:c1fd2a7b51ebaa86e8562e9ed7e83a58e854696a79da287771db934d8095471b","target":"record","created_at":"2026-05-18T04:10:24Z","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":"3e38b67a917f9b71e95da5cff5051fa534bc8bb2a47a0b26fafcc0870eae5a84","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-23T20:30:38Z","title_canon_sha256":"d0cb9878aaa63ace1f68870d8ba2f8278ef8832956370bb66dd695a8ae8923ca"},"schema_version":"1.0","source":{"id":"1110.5084","kind":"arxiv","version":1}},"canonical_sha256":"01aaf290c792c02ee96e552893c2f4ae2cbdba65eba5c5b7b4fe11ec2d5af8fd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"01aaf290c792c02ee96e552893c2f4ae2cbdba65eba5c5b7b4fe11ec2d5af8fd","first_computed_at":"2026-05-18T04:10:24.748278Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:10:24.748278Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tXN6DnmhEqLnLPtnEi3b/rTMOnDALL50vX1Hp6cnaWpvV3+mh543U+i0hNE2RsyraHzOfHX8ETO/MHniK2f+Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:10:24.748789Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.5084","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c1fd2a7b51ebaa86e8562e9ed7e83a58e854696a79da287771db934d8095471b","sha256:87082f0411b1af83c966a9e808fd6548294d81d5acd6e1870fd8855ddfac11f0"],"state_sha256":"0e214c2b2faa5fc4179ca43b4a2e8d40dc562975f2a9c5e342b556351190d4a9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G8B0FN3zUqQZi7YK6nPhNSZOVwHXK9sGTVqZpQdno/IQ6norwP5vC37whRw83AwnJVuvKJC5hXffRqhaBtcmAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T17:35:00.068689Z","bundle_sha256":"fa8b8d4177479282a8f89adf044573791863372d7531444c46470031fc5f0b95"}}