{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:K4SEDP232ABJUZC677CSOS7BF5","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":"9f7cbdb9d4196fddd4d33681fc565f353630db9ab4a55cde9e0829c55dba1351","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-07-16T02:01:29Z","title_canon_sha256":"fb3fce5a0a4e09a1af1708cea1e37973d6a96cb762fa8f75cbd8335ea43e1a16"},"schema_version":"1.0","source":{"id":"2007.08075","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.08075","created_at":"2026-07-05T02:54:28Z"},{"alias_kind":"arxiv_version","alias_value":"2007.08075v2","created_at":"2026-07-05T02:54:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.08075","created_at":"2026-07-05T02:54:28Z"},{"alias_kind":"pith_short_12","alias_value":"K4SEDP232ABJ","created_at":"2026-07-05T02:54:28Z"},{"alias_kind":"pith_short_16","alias_value":"K4SEDP232ABJUZC6","created_at":"2026-07-05T02:54:28Z"},{"alias_kind":"pith_short_8","alias_value":"K4SEDP23","created_at":"2026-07-05T02:54:28Z"}],"graph_snapshots":[{"event_id":"sha256:9e95dcbfce58192c8f4f0d896ac4a02a3c27b50991d28f300190cd8389aa6391","target":"graph","created_at":"2026-07-05T02:54:28Z","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/2007.08075/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In recent years, hypergraph generalizations of many graph cut problems have been introduced and analyzed as a way to better explore and understand complex systems and datasets characterized by multiway relationships. Recent work has made use of a generalized hypergraph cut function which for a hypergraph $\\mathcal{H} = (V,E)$ can be defined by associating each hyperedge $e \\in E$ with a splitting function ${\\bf w}_e$, which assigns a penalty to each way of separating the nodes of $e$. When each ${\\bf w}_e$ is a submodular cardinality-based splitting function, meaning that ${\\bf w}_e(S) = g(|S|","authors_text":"Austin R. Benson, Jon Kleinberg, Nate Veldt","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-07-16T02:01:29Z","title":"Augmented Sparsifiers for Generalized Hypergraph Cuts with Applications to Decomposable Submodular Function Minimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.08075","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:805b218bc0918b0f40bf06fa8386b61c292b26c620eec7c1645d391fafdb509a","target":"record","created_at":"2026-07-05T02:54:28Z","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":"9f7cbdb9d4196fddd4d33681fc565f353630db9ab4a55cde9e0829c55dba1351","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-07-16T02:01:29Z","title_canon_sha256":"fb3fce5a0a4e09a1af1708cea1e37973d6a96cb762fa8f75cbd8335ea43e1a16"},"schema_version":"1.0","source":{"id":"2007.08075","kind":"arxiv","version":2}},"canonical_sha256":"572441bf5bd0029a645effc5274be12f5a17b0ceed1dc1cdc8ccf3e78922122b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"572441bf5bd0029a645effc5274be12f5a17b0ceed1dc1cdc8ccf3e78922122b","first_computed_at":"2026-07-05T02:54:28.668007Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:54:28.668007Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bhlz7NGSyTX6HNa5WsVDco1adQy4OoptMUl6lk+Pa2emwKttZmxNDZtgA4tyDa2+lnFLQ0Ty3C2xEWTUX6TCBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T02:54:28.668401Z","signed_message":"canonical_sha256_bytes"},"source_id":"2007.08075","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:805b218bc0918b0f40bf06fa8386b61c292b26c620eec7c1645d391fafdb509a","sha256:9e95dcbfce58192c8f4f0d896ac4a02a3c27b50991d28f300190cd8389aa6391"],"state_sha256":"c4c31e3e79f8d985f756065aab306505c126ed335b959b198b667039c7e93d0f"}