{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:SF3DNGV6WDYIY3ANDS5CY2FTEQ","short_pith_number":"pith:SF3DNGV6","canonical_record":{"source":{"id":"1304.7632","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-29T12:08:32Z","cross_cats_sorted":[],"title_canon_sha256":"0bb5a9355670a1cd5cbed2e69750a4a30e04617866c8f45b7e223e186cd4537c","abstract_canon_sha256":"91429b9a8a4319d4d7cd4e297ce6d431b592342dd6903f99965b48a5d9eefebd"},"schema_version":"1.0"},"canonical_sha256":"9176369abeb0f08c6c0d1cba2c68b3243ae0c29d078c116a1bca96abc1f15347","source":{"kind":"arxiv","id":"1304.7632","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.7632","created_at":"2026-05-18T03:26:53Z"},{"alias_kind":"arxiv_version","alias_value":"1304.7632v1","created_at":"2026-05-18T03:26:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.7632","created_at":"2026-05-18T03:26:53Z"},{"alias_kind":"pith_short_12","alias_value":"SF3DNGV6WDYI","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SF3DNGV6WDYIY3AN","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SF3DNGV6","created_at":"2026-05-18T12:27:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:SF3DNGV6WDYIY3ANDS5CY2FTEQ","target":"record","payload":{"canonical_record":{"source":{"id":"1304.7632","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-29T12:08:32Z","cross_cats_sorted":[],"title_canon_sha256":"0bb5a9355670a1cd5cbed2e69750a4a30e04617866c8f45b7e223e186cd4537c","abstract_canon_sha256":"91429b9a8a4319d4d7cd4e297ce6d431b592342dd6903f99965b48a5d9eefebd"},"schema_version":"1.0"},"canonical_sha256":"9176369abeb0f08c6c0d1cba2c68b3243ae0c29d078c116a1bca96abc1f15347","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:53.442489Z","signature_b64":"5LkAfnew6KJA8z+25yvEnjRjgvaEtYamoml2bU+Tu1Nw6UcFzRHayV2KFLFRW+nMiFB1+ZrHLgaJx9qvtT7SDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9176369abeb0f08c6c0d1cba2c68b3243ae0c29d078c116a1bca96abc1f15347","last_reissued_at":"2026-05-18T03:26:53.442069Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:53.442069Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.7632","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-18T03:26:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sI+FksYEOwYPPuUaCiRzHXXErYNQ6Tlo4rugAUwVz7Xy19MjVR+w18pqQolBCvK006h7+s8mzDyNuGOYkJq3DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T19:14:13.987797Z"},"content_sha256":"1739abbd264dd47425096eb0eb9bd12f5077dd7a36dd0f1bae42cc160cb6938a","schema_version":"1.0","event_id":"sha256:1739abbd264dd47425096eb0eb9bd12f5077dd7a36dd0f1bae42cc160cb6938a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:SF3DNGV6WDYIY3ANDS5CY2FTEQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Counting small cuts in a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Barbara Geissmann, Rastislav \\v{S}r\\'amek","submitted_at":"2013-04-29T12:08:32Z","abstract_excerpt":"We study the minimum cut problem in the presence of uncertainty and show how to apply a novel robust optimization approach, which aims to exploit the similarity in subsequent graph measurements or similar graph instances, without posing any assumptions on the way they have been obtained. With experiments we show that the approach works well when compared to other approaches that are also oblivious towards the relationship between the input datasets."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.7632","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-18T03:26:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LFYEgBWMyFsuuC54L+oPm9zK1B2P4YsG2ZHDg0/CRQbkfhCqp+HqKoEHXwxwM/VLqlsXcv+g+hFa9fTaGaBoAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T19:14:13.988511Z"},"content_sha256":"fde9e4d95a7b976ddcaee1b3dab221edf33a1e932e7aefb13909334dacf69aea","schema_version":"1.0","event_id":"sha256:fde9e4d95a7b976ddcaee1b3dab221edf33a1e932e7aefb13909334dacf69aea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SF3DNGV6WDYIY3ANDS5CY2FTEQ/bundle.json","state_url":"https://pith.science/pith/SF3DNGV6WDYIY3ANDS5CY2FTEQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SF3DNGV6WDYIY3ANDS5CY2FTEQ/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-05-26T19:14:13Z","links":{"resolver":"https://pith.science/pith/SF3DNGV6WDYIY3ANDS5CY2FTEQ","bundle":"https://pith.science/pith/SF3DNGV6WDYIY3ANDS5CY2FTEQ/bundle.json","state":"https://pith.science/pith/SF3DNGV6WDYIY3ANDS5CY2FTEQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SF3DNGV6WDYIY3ANDS5CY2FTEQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:SF3DNGV6WDYIY3ANDS5CY2FTEQ","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":"91429b9a8a4319d4d7cd4e297ce6d431b592342dd6903f99965b48a5d9eefebd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-29T12:08:32Z","title_canon_sha256":"0bb5a9355670a1cd5cbed2e69750a4a30e04617866c8f45b7e223e186cd4537c"},"schema_version":"1.0","source":{"id":"1304.7632","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.7632","created_at":"2026-05-18T03:26:53Z"},{"alias_kind":"arxiv_version","alias_value":"1304.7632v1","created_at":"2026-05-18T03:26:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.7632","created_at":"2026-05-18T03:26:53Z"},{"alias_kind":"pith_short_12","alias_value":"SF3DNGV6WDYI","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SF3DNGV6WDYIY3AN","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SF3DNGV6","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:fde9e4d95a7b976ddcaee1b3dab221edf33a1e932e7aefb13909334dacf69aea","target":"graph","created_at":"2026-05-18T03:26:53Z","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":"We study the minimum cut problem in the presence of uncertainty and show how to apply a novel robust optimization approach, which aims to exploit the similarity in subsequent graph measurements or similar graph instances, without posing any assumptions on the way they have been obtained. With experiments we show that the approach works well when compared to other approaches that are also oblivious towards the relationship between the input datasets.","authors_text":"Barbara Geissmann, Rastislav \\v{S}r\\'amek","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-29T12:08:32Z","title":"Counting small cuts in a graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.7632","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:1739abbd264dd47425096eb0eb9bd12f5077dd7a36dd0f1bae42cc160cb6938a","target":"record","created_at":"2026-05-18T03:26:53Z","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":"91429b9a8a4319d4d7cd4e297ce6d431b592342dd6903f99965b48a5d9eefebd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-29T12:08:32Z","title_canon_sha256":"0bb5a9355670a1cd5cbed2e69750a4a30e04617866c8f45b7e223e186cd4537c"},"schema_version":"1.0","source":{"id":"1304.7632","kind":"arxiv","version":1}},"canonical_sha256":"9176369abeb0f08c6c0d1cba2c68b3243ae0c29d078c116a1bca96abc1f15347","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9176369abeb0f08c6c0d1cba2c68b3243ae0c29d078c116a1bca96abc1f15347","first_computed_at":"2026-05-18T03:26:53.442069Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:26:53.442069Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5LkAfnew6KJA8z+25yvEnjRjgvaEtYamoml2bU+Tu1Nw6UcFzRHayV2KFLFRW+nMiFB1+ZrHLgaJx9qvtT7SDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:26:53.442489Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.7632","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1739abbd264dd47425096eb0eb9bd12f5077dd7a36dd0f1bae42cc160cb6938a","sha256:fde9e4d95a7b976ddcaee1b3dab221edf33a1e932e7aefb13909334dacf69aea"],"state_sha256":"44614da41bb96e1c75618269fd8596cb794c911e399889bcc8694a2060021b93"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d1Wvvt85L0Je75vIxrTzr7RFG3uJcEBOrlMjBAct48wZnhh3jj0FkkJZxrqgUjWZsCsRkp1NiUpIILN9X+IcDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T19:14:13.991984Z","bundle_sha256":"b508b3920f79e4f4d2deb5c0b0a898d25d522e81d6834ac610ed0570184f01e8"}}