{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:FR4KY5CPJOBNEZ66ZUGG3JSL2Z","short_pith_number":"pith:FR4KY5CP","canonical_record":{"source":{"id":"1911.11868","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-11-26T22:31:42Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"ecee049754e432fb02f58a2ec7b87c1e2222c9d6270b2b814f6ff2d768f10ce8","abstract_canon_sha256":"b0097db4ac3acd741125bc59574bb6e5e04d94d515bf4e4a181797c616805929"},"schema_version":"1.0"},"canonical_sha256":"2c78ac744f4b82d267decd0c6da64bd66713986130e9e7dc4badf9122d3e7e62","source":{"kind":"arxiv","id":"1911.11868","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:FR4KY5CPJOBNEZ66ZUGG3JSL2Z","target":"record","payload":{"canonical_record":{"source":{"id":"1911.11868","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-11-26T22:31:42Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"ecee049754e432fb02f58a2ec7b87c1e2222c9d6270b2b814f6ff2d768f10ce8","abstract_canon_sha256":"b0097db4ac3acd741125bc59574bb6e5e04d94d515bf4e4a181797c616805929"},"schema_version":"1.0"},"canonical_sha256":"2c78ac744f4b82d267decd0c6da64bd66713986130e9e7dc4badf9122d3e7e62","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:11:28.648360Z","signature_b64":"7Y6F2wVsMiGGjFL+nL6uMDkqVEFaGafrNFIcVzus1DWQUXR3vqnufSF/WWnUG4rqk6r1Nt3Bg1r6eJTn95g5Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c78ac744f4b82d267decd0c6da64bd66713986130e9e7dc4badf9122d3e7e62","last_reissued_at":"2026-07-05T11:11:28.647843Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:11:28.647843Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1911.11868","source_version":5,"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-05T11:11:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tJzcqAbmxT8jCzt1Ev9hxW2LxYdFtf3c70rF0hOSsK4UvWmVetRzfWBkNzUb3WiNNaM2DCnAANUZFL1kgTkrDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T17:26:52.262962Z"},"content_sha256":"02fc37955e23459ffb4af6c6e9da694b472e703058fc4404e84b91b5325bfbb9","schema_version":"1.0","event_id":"sha256:02fc37955e23459ffb4af6c6e9da694b472e703058fc4404e84b91b5325bfbb9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:FR4KY5CPJOBNEZ66ZUGG3JSL2Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Unified View of Graph Regularity via Matrix Decompositions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Greg Bodwin, Santosh Vempala","submitted_at":"2019-11-26T22:31:42Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.11868","kind":"arxiv","version":5},"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/1911.11868/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-05T11:11:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e/YTo+8os/NNnCXxydEdbm2pner04KKV+gSBm8tWjjkw8KoIYyBkRxO8Ivz9/B3u/Oe7lPvD43Lb27l/+EA4Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T17:26:52.264294Z"},"content_sha256":"ea38811551ee49471e7e2882dcab77810ba4bae2a35acad747565af4d7b4bf25","schema_version":"1.0","event_id":"sha256:ea38811551ee49471e7e2882dcab77810ba4bae2a35acad747565af4d7b4bf25"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FR4KY5CPJOBNEZ66ZUGG3JSL2Z/bundle.json","state_url":"https://pith.science/pith/FR4KY5CPJOBNEZ66ZUGG3JSL2Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FR4KY5CPJOBNEZ66ZUGG3JSL2Z/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-08-17T17:26:52Z","links":{"resolver":"https://pith.science/pith/FR4KY5CPJOBNEZ66ZUGG3JSL2Z","bundle":"https://pith.science/pith/FR4KY5CPJOBNEZ66ZUGG3JSL2Z/bundle.json","state":"https://pith.science/pith/FR4KY5CPJOBNEZ66ZUGG3JSL2Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FR4KY5CPJOBNEZ66ZUGG3JSL2Z/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"II+fmycXDLL+brFlts1HcAWdyfwOQf7GJKP1+YIekwBwoq/5GzbRz+Evf3ezKCY7G24hhLaiiEwq+pd6zislAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T17:26:52.275011Z","bundle_sha256":"076b8071ed76ed9361102898a7cd2f07251341c78d2518761cc390fc3cc8a299"}}