{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:63BHSU5MFDISU5WDT5PMBKMDMO","short_pith_number":"pith:63BHSU5M","canonical_record":{"source":{"id":"2004.12223","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-04-25T19:57:35Z","cross_cats_sorted":[],"title_canon_sha256":"8cb222f25370df4e4ec174499d5422927992df8f42893e2a2f0991cc7a3a69eb","abstract_canon_sha256":"65e845db1a9200f2ad17588f08b058e6f915a87929c89926effef75e9dcfb938"},"schema_version":"1.0"},"canonical_sha256":"f6c27953ac28d12a76c39f5ec0a98363ae56fb7fa5e36581490164b2db1edbd9","source":{"kind":"arxiv","id":"2004.12223","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2004.12223","created_at":"2026-07-05T01:27:03Z"},{"alias_kind":"arxiv_version","alias_value":"2004.12223v2","created_at":"2026-07-05T01:27:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.12223","created_at":"2026-07-05T01:27:03Z"},{"alias_kind":"pith_short_12","alias_value":"63BHSU5MFDIS","created_at":"2026-07-05T01:27:03Z"},{"alias_kind":"pith_short_16","alias_value":"63BHSU5MFDISU5WD","created_at":"2026-07-05T01:27:03Z"},{"alias_kind":"pith_short_8","alias_value":"63BHSU5M","created_at":"2026-07-05T01:27:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:63BHSU5MFDISU5WDT5PMBKMDMO","target":"record","payload":{"canonical_record":{"source":{"id":"2004.12223","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-04-25T19:57:35Z","cross_cats_sorted":[],"title_canon_sha256":"8cb222f25370df4e4ec174499d5422927992df8f42893e2a2f0991cc7a3a69eb","abstract_canon_sha256":"65e845db1a9200f2ad17588f08b058e6f915a87929c89926effef75e9dcfb938"},"schema_version":"1.0"},"canonical_sha256":"f6c27953ac28d12a76c39f5ec0a98363ae56fb7fa5e36581490164b2db1edbd9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:27:03.201962Z","signature_b64":"XePqsUNXFk3RWTjA0W7dqgYc7lHHRHEAdtUQr4oMfHUFHCil/3cXDCuhVIpT7PJIGTTYrjGHY2IfIKm8OP0qAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6c27953ac28d12a76c39f5ec0a98363ae56fb7fa5e36581490164b2db1edbd9","last_reissued_at":"2026-07-05T01:27:03.201576Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:27:03.201576Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2004.12223","source_version":2,"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-07-05T01:27:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7AZ7nD5OhsQ7+BdvWqZ2o7oCwotXkZ+eLXbQoald0XRUavigHDwxaeSuALME7idwJq2ckDL1a7fi4Kc+yhYDDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T12:52:28.706637Z"},"content_sha256":"e36fa556c708ba8f65238c4b1a7729ac25469d2ddf6ef61a900e46175adcd8f5","schema_version":"1.0","event_id":"sha256:e36fa556c708ba8f65238c4b1a7729ac25469d2ddf6ef61a900e46175adcd8f5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:63BHSU5MFDISU5WDT5PMBKMDMO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online MinCut: Competitive and Regret Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Avah Banerjee, Guoli Ding","submitted_at":"2020-04-25T19:57:35Z","abstract_excerpt":"In this paper we study the mincut problem in the online setting. We consider two distinct models: A) competitive analysis and B) regret analysis. In the competitive setting we consider the vertex arrival model; whenever a new vertex arrives it's neighborhood with respect to the set of known vertices is revealed. An online algorithm must make an irrevocable decision to determine the side of the cut that the vertex must belong to in order to minimize the size of the final cut. Various models are considered. 1) For classical and advice models we give tight bounds on the competitive ratio of deter"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.12223","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/2004.12223/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"},"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-07-05T01:27:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oeRXyP9RyJ9JxppwI1uy4yBBKB4jkHvIdjeUQ/6HfsxMKAZ8qqc8uo13d1uDVe17hId0pQ2+OXhEiboICCgpDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T12:52:28.707271Z"},"content_sha256":"f1db14d56c4e3e567c8442034c496f33a98882104fdce61b0330ca1743c2dcaa","schema_version":"1.0","event_id":"sha256:f1db14d56c4e3e567c8442034c496f33a98882104fdce61b0330ca1743c2dcaa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/63BHSU5MFDISU5WDT5PMBKMDMO/bundle.json","state_url":"https://pith.science/pith/63BHSU5MFDISU5WDT5PMBKMDMO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/63BHSU5MFDISU5WDT5PMBKMDMO/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-07-05T12:52:28Z","links":{"resolver":"https://pith.science/pith/63BHSU5MFDISU5WDT5PMBKMDMO","bundle":"https://pith.science/pith/63BHSU5MFDISU5WDT5PMBKMDMO/bundle.json","state":"https://pith.science/pith/63BHSU5MFDISU5WDT5PMBKMDMO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/63BHSU5MFDISU5WDT5PMBKMDMO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:63BHSU5MFDISU5WDT5PMBKMDMO","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":"65e845db1a9200f2ad17588f08b058e6f915a87929c89926effef75e9dcfb938","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-04-25T19:57:35Z","title_canon_sha256":"8cb222f25370df4e4ec174499d5422927992df8f42893e2a2f0991cc7a3a69eb"},"schema_version":"1.0","source":{"id":"2004.12223","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2004.12223","created_at":"2026-07-05T01:27:03Z"},{"alias_kind":"arxiv_version","alias_value":"2004.12223v2","created_at":"2026-07-05T01:27:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.12223","created_at":"2026-07-05T01:27:03Z"},{"alias_kind":"pith_short_12","alias_value":"63BHSU5MFDIS","created_at":"2026-07-05T01:27:03Z"},{"alias_kind":"pith_short_16","alias_value":"63BHSU5MFDISU5WD","created_at":"2026-07-05T01:27:03Z"},{"alias_kind":"pith_short_8","alias_value":"63BHSU5M","created_at":"2026-07-05T01:27:03Z"}],"graph_snapshots":[{"event_id":"sha256:f1db14d56c4e3e567c8442034c496f33a98882104fdce61b0330ca1743c2dcaa","target":"graph","created_at":"2026-07-05T01:27:03Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2004.12223/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper we study the mincut problem in the online setting. We consider two distinct models: A) competitive analysis and B) regret analysis. In the competitive setting we consider the vertex arrival model; whenever a new vertex arrives it's neighborhood with respect to the set of known vertices is revealed. An online algorithm must make an irrevocable decision to determine the side of the cut that the vertex must belong to in order to minimize the size of the final cut. Various models are considered. 1) For classical and advice models we give tight bounds on the competitive ratio of deter","authors_text":"Avah Banerjee, Guoli Ding","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-04-25T19:57:35Z","title":"Online MinCut: Competitive and Regret Analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.12223","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:e36fa556c708ba8f65238c4b1a7729ac25469d2ddf6ef61a900e46175adcd8f5","target":"record","created_at":"2026-07-05T01:27:03Z","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":"65e845db1a9200f2ad17588f08b058e6f915a87929c89926effef75e9dcfb938","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-04-25T19:57:35Z","title_canon_sha256":"8cb222f25370df4e4ec174499d5422927992df8f42893e2a2f0991cc7a3a69eb"},"schema_version":"1.0","source":{"id":"2004.12223","kind":"arxiv","version":2}},"canonical_sha256":"f6c27953ac28d12a76c39f5ec0a98363ae56fb7fa5e36581490164b2db1edbd9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f6c27953ac28d12a76c39f5ec0a98363ae56fb7fa5e36581490164b2db1edbd9","first_computed_at":"2026-07-05T01:27:03.201576Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:27:03.201576Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XePqsUNXFk3RWTjA0W7dqgYc7lHHRHEAdtUQr4oMfHUFHCil/3cXDCuhVIpT7PJIGTTYrjGHY2IfIKm8OP0qAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:27:03.201962Z","signed_message":"canonical_sha256_bytes"},"source_id":"2004.12223","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e36fa556c708ba8f65238c4b1a7729ac25469d2ddf6ef61a900e46175adcd8f5","sha256:f1db14d56c4e3e567c8442034c496f33a98882104fdce61b0330ca1743c2dcaa"],"state_sha256":"6a0e7e836d6382a87c0d6309f088e43470e75b1bec9f3a3bd548c0306409edfb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/y2UiRCzNVqV7E8P1CoT91Bf2VUrCx0o/BZo6cWYC+NdMKSGSZ1mWaLUmRsVAHzhjZ4lhDHzkTjwFOejTCAJDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T12:52:28.710363Z","bundle_sha256":"6681d367bdb2e2589b4f0e6670f2e271e179a88f36795d597a194787b93fa9d3"}}