{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:FR4KY5CPJOBNEZ66ZUGG3JSL2Z","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":"b0097db4ac3acd741125bc59574bb6e5e04d94d515bf4e4a181797c616805929","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-11-26T22:31:42Z","title_canon_sha256":"ecee049754e432fb02f58a2ec7b87c1e2222c9d6270b2b814f6ff2d768f10ce8"},"schema_version":"1.0","source":{"id":"1911.11868","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.11868","created_at":"2026-07-05T11:11:28Z"},{"alias_kind":"arxiv_version","alias_value":"1911.11868v5","created_at":"2026-07-05T11:11:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.11868","created_at":"2026-07-05T11:11:28Z"},{"alias_kind":"pith_short_12","alias_value":"FR4KY5CPJOBN","created_at":"2026-07-05T11:11:28Z"},{"alias_kind":"pith_short_16","alias_value":"FR4KY5CPJOBNEZ66","created_at":"2026-07-05T11:11:28Z"},{"alias_kind":"pith_short_8","alias_value":"FR4KY5CP","created_at":"2026-07-05T11:11:28Z"}],"graph_snapshots":[{"event_id":"sha256:ea38811551ee49471e7e2882dcab77810ba4bae2a35acad747565af4d7b4bf25","target":"graph","created_at":"2026-07-05T11:11: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/1911.11868/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We prove algorithmic weak and \\Szemeredi{} regularity lemmas for several classes of sparse graphs in the literature, for which only weak regularity lemmas were previously known. These include core-dense graphs, low threshold rank graphs, and (a version of) $L^p$ upper regular graphs. More precisely, we define \\emph{cut pseudorandom graphs}, we prove our regularity lemmas for these graphs, and then we show that cut pseudorandomness captures all of the above graph classes as special cases.\n  The core of our approach is an abstracted matrix decomposition, roughly following Frieze and Kannan [Comb","authors_text":"Greg Bodwin, Santosh Vempala","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-11-26T22:31:42Z","title":"A Unified View of Graph Regularity via Matrix Decompositions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.11868","kind":"arxiv","version":5},"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:02fc37955e23459ffb4af6c6e9da694b472e703058fc4404e84b91b5325bfbb9","target":"record","created_at":"2026-07-05T11:11: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":"b0097db4ac3acd741125bc59574bb6e5e04d94d515bf4e4a181797c616805929","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-11-26T22:31:42Z","title_canon_sha256":"ecee049754e432fb02f58a2ec7b87c1e2222c9d6270b2b814f6ff2d768f10ce8"},"schema_version":"1.0","source":{"id":"1911.11868","kind":"arxiv","version":5}},"canonical_sha256":"2c78ac744f4b82d267decd0c6da64bd66713986130e9e7dc4badf9122d3e7e62","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2c78ac744f4b82d267decd0c6da64bd66713986130e9e7dc4badf9122d3e7e62","first_computed_at":"2026-07-05T11:11:28.647843Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:11:28.647843Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7Y6F2wVsMiGGjFL+nL6uMDkqVEFaGafrNFIcVzus1DWQUXR3vqnufSF/WWnUG4rqk6r1Nt3Bg1r6eJTn95g5Ag==","signature_status":"signed_v1","signed_at":"2026-07-05T11:11:28.648360Z","signed_message":"canonical_sha256_bytes"},"source_id":"1911.11868","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:02fc37955e23459ffb4af6c6e9da694b472e703058fc4404e84b91b5325bfbb9","sha256:ea38811551ee49471e7e2882dcab77810ba4bae2a35acad747565af4d7b4bf25"],"state_sha256":"f4b85f1110550fe152784ab928b19f06500f31050204e6addb93af2439af84e8"}