{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:K4SEDP232ABJUZC677CSOS7BF5","short_pith_number":"pith:K4SEDP23","schema_version":"1.0","canonical_sha256":"572441bf5bd0029a645effc5274be12f5a17b0ceed1dc1cdc8ccf3e78922122b","source":{"kind":"arxiv","id":"2007.08075","version":2},"attestation_state":"computed","paper":{"title":"Augmented Sparsifiers for Generalized Hypergraph Cuts with Applications to Decomposable Submodular Function Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Austin R. Benson, Jon Kleinberg, Nate Veldt","submitted_at":"2020-07-16T02:01:29Z","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|"},"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":"2007.08075","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-07-16T02:01:29Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"fb3fce5a0a4e09a1af1708cea1e37973d6a96cb762fa8f75cbd8335ea43e1a16","abstract_canon_sha256":"9f7cbdb9d4196fddd4d33681fc565f353630db9ab4a55cde9e0829c55dba1351"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:54:28.668401Z","signature_b64":"bhlz7NGSyTX6HNa5WsVDco1adQy4OoptMUl6lk+Pa2emwKttZmxNDZtgA4tyDa2+lnFLQ0Ty3C2xEWTUX6TCBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"572441bf5bd0029a645effc5274be12f5a17b0ceed1dc1cdc8ccf3e78922122b","last_reissued_at":"2026-07-05T02:54:28.668007Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:54:28.668007Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Augmented Sparsifiers for Generalized Hypergraph Cuts with Applications to Decomposable Submodular Function Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Austin R. Benson, Jon Kleinberg, Nate Veldt","submitted_at":"2020-07-16T02:01:29Z","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|"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.08075","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/2007.08075/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2007.08075","created_at":"2026-07-05T02:54:28.668062+00:00"},{"alias_kind":"arxiv_version","alias_value":"2007.08075v2","created_at":"2026-07-05T02:54:28.668062+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.08075","created_at":"2026-07-05T02:54:28.668062+00:00"},{"alias_kind":"pith_short_12","alias_value":"K4SEDP232ABJ","created_at":"2026-07-05T02:54:28.668062+00:00"},{"alias_kind":"pith_short_16","alias_value":"K4SEDP232ABJUZC6","created_at":"2026-07-05T02:54:28.668062+00:00"},{"alias_kind":"pith_short_8","alias_value":"K4SEDP23","created_at":"2026-07-05T02:54:28.668062+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.04251","citing_title":"Modeling Hypergraphs with Diversity and Heterogeneous Popularity","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/K4SEDP232ABJUZC677CSOS7BF5","json":"https://pith.science/pith/K4SEDP232ABJUZC677CSOS7BF5.json","graph_json":"https://pith.science/api/pith-number/K4SEDP232ABJUZC677CSOS7BF5/graph.json","events_json":"https://pith.science/api/pith-number/K4SEDP232ABJUZC677CSOS7BF5/events.json","paper":"https://pith.science/paper/K4SEDP23"},"agent_actions":{"view_html":"https://pith.science/pith/K4SEDP232ABJUZC677CSOS7BF5","download_json":"https://pith.science/pith/K4SEDP232ABJUZC677CSOS7BF5.json","view_paper":"https://pith.science/paper/K4SEDP23","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2007.08075&json=true","fetch_graph":"https://pith.science/api/pith-number/K4SEDP232ABJUZC677CSOS7BF5/graph.json","fetch_events":"https://pith.science/api/pith-number/K4SEDP232ABJUZC677CSOS7BF5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K4SEDP232ABJUZC677CSOS7BF5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K4SEDP232ABJUZC677CSOS7BF5/action/storage_attestation","attest_author":"https://pith.science/pith/K4SEDP232ABJUZC677CSOS7BF5/action/author_attestation","sign_citation":"https://pith.science/pith/K4SEDP232ABJUZC677CSOS7BF5/action/citation_signature","submit_replication":"https://pith.science/pith/K4SEDP232ABJUZC677CSOS7BF5/action/replication_record"}},"created_at":"2026-07-05T02:54:28.668062+00:00","updated_at":"2026-07-05T02:54:28.668062+00:00"}