{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:GZOAL6JJGIOSFLUOIAX4K26DVY","short_pith_number":"pith:GZOAL6JJ","canonical_record":{"source":{"id":"1209.6540","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-28T15:01:22Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"1758973ad28389881e4c002ebe229bfe97cf808cccd790c093cb1741db4d1f18","abstract_canon_sha256":"333c6c6002c2d7df7202fe134531faa5c7dc08ba2b6ad6ea5675bb73268b9ffc"},"schema_version":"1.0"},"canonical_sha256":"365c05f929321d22ae8e402fc56bc3ae33201e13ba5ab28182b8598a8b0ee5de","source":{"kind":"arxiv","id":"1209.6540","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.6540","created_at":"2026-05-18T03:44:25Z"},{"alias_kind":"arxiv_version","alias_value":"1209.6540v1","created_at":"2026-05-18T03:44:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.6540","created_at":"2026-05-18T03:44:25Z"},{"alias_kind":"pith_short_12","alias_value":"GZOAL6JJGIOS","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"GZOAL6JJGIOSFLUO","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"GZOAL6JJ","created_at":"2026-05-18T12:27:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:GZOAL6JJGIOSFLUOIAX4K26DVY","target":"record","payload":{"canonical_record":{"source":{"id":"1209.6540","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-28T15:01:22Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"1758973ad28389881e4c002ebe229bfe97cf808cccd790c093cb1741db4d1f18","abstract_canon_sha256":"333c6c6002c2d7df7202fe134531faa5c7dc08ba2b6ad6ea5675bb73268b9ffc"},"schema_version":"1.0"},"canonical_sha256":"365c05f929321d22ae8e402fc56bc3ae33201e13ba5ab28182b8598a8b0ee5de","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:44:25.182649Z","signature_b64":"14rYYJyGbHgLBo9QLZV7swcN6cq+xW45kpDXzQ/4YTldSkD4KXSwNq5HU3p1LzIS2ac8eQ1Q9+zbBtPUoC0yDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"365c05f929321d22ae8e402fc56bc3ae33201e13ba5ab28182b8598a8b0ee5de","last_reissued_at":"2026-05-18T03:44:25.182059Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:44:25.182059Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1209.6540","source_version":1,"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-05-18T03:44:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OCV7e/jKJeeYfgdGAgBoJ2rze0Uf2RDj/irlm6D/yUmqlie1kezXGJwJNBxMSakwKH+FfVSO9PgdwyIQo33bCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T07:44:44.756257Z"},"content_sha256":"c09d8aa37f2f41d9c6ceb89fcc41218da7fbbf70e3580c26773a5c3992193705","schema_version":"1.0","event_id":"sha256:c09d8aa37f2f41d9c6ceb89fcc41218da7fbbf70e3580c26773a5c3992193705"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:GZOAL6JJGIOSFLUOIAX4K26DVY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Practical Regularity Partitioning Algorithm and its Applications in Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.CO","authors_text":"Endre Szemer\\'edi, Fei Song, G\\'abor N. S\\'ark\\\"ozy, Shubhendu Trivedi","submitted_at":"2012-09-28T15:01:22Z","abstract_excerpt":"In this paper we introduce a new clustering technique called Regularity Clustering. This new technique is based on the practical variants of the two constructive versions of the Regularity Lemma, a very useful tool in graph theory. The lemma claims that every graph can be partitioned into pseudo-random graphs. While the Regularity Lemma has become very important in proving theoretical results, it has no direct practical applications so far. An important reason for this lack of practical applications is that the graph under consideration has to be astronomically large. This requirement makes it"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.6540","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-05-18T03:44:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t8NHPUxMujF28twsqZK+ZDN4Y+SPyLMq4PAGJ66IrpFS3K81jm6WBHlQbLEr5lrUfYl8r+7aGJNN2VpzEA07AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T07:44:44.756788Z"},"content_sha256":"08db46e60219ec43f814be95a13904ca8a540aeccaa0a3abc24964168b83812b","schema_version":"1.0","event_id":"sha256:08db46e60219ec43f814be95a13904ca8a540aeccaa0a3abc24964168b83812b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GZOAL6JJGIOSFLUOIAX4K26DVY/bundle.json","state_url":"https://pith.science/pith/GZOAL6JJGIOSFLUOIAX4K26DVY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GZOAL6JJGIOSFLUOIAX4K26DVY/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-06-10T07:44:44Z","links":{"resolver":"https://pith.science/pith/GZOAL6JJGIOSFLUOIAX4K26DVY","bundle":"https://pith.science/pith/GZOAL6JJGIOSFLUOIAX4K26DVY/bundle.json","state":"https://pith.science/pith/GZOAL6JJGIOSFLUOIAX4K26DVY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GZOAL6JJGIOSFLUOIAX4K26DVY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:GZOAL6JJGIOSFLUOIAX4K26DVY","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":"333c6c6002c2d7df7202fe134531faa5c7dc08ba2b6ad6ea5675bb73268b9ffc","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-28T15:01:22Z","title_canon_sha256":"1758973ad28389881e4c002ebe229bfe97cf808cccd790c093cb1741db4d1f18"},"schema_version":"1.0","source":{"id":"1209.6540","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.6540","created_at":"2026-05-18T03:44:25Z"},{"alias_kind":"arxiv_version","alias_value":"1209.6540v1","created_at":"2026-05-18T03:44:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.6540","created_at":"2026-05-18T03:44:25Z"},{"alias_kind":"pith_short_12","alias_value":"GZOAL6JJGIOS","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"GZOAL6JJGIOSFLUO","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"GZOAL6JJ","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:08db46e60219ec43f814be95a13904ca8a540aeccaa0a3abc24964168b83812b","target":"graph","created_at":"2026-05-18T03:44:25Z","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"},"paper":{"abstract_excerpt":"In this paper we introduce a new clustering technique called Regularity Clustering. This new technique is based on the practical variants of the two constructive versions of the Regularity Lemma, a very useful tool in graph theory. The lemma claims that every graph can be partitioned into pseudo-random graphs. While the Regularity Lemma has become very important in proving theoretical results, it has no direct practical applications so far. An important reason for this lack of practical applications is that the graph under consideration has to be astronomically large. This requirement makes it","authors_text":"Endre Szemer\\'edi, Fei Song, G\\'abor N. S\\'ark\\\"ozy, Shubhendu Trivedi","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-28T15:01:22Z","title":"A Practical Regularity Partitioning Algorithm and its Applications in Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.6540","kind":"arxiv","version":1},"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:c09d8aa37f2f41d9c6ceb89fcc41218da7fbbf70e3580c26773a5c3992193705","target":"record","created_at":"2026-05-18T03:44:25Z","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":"333c6c6002c2d7df7202fe134531faa5c7dc08ba2b6ad6ea5675bb73268b9ffc","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-28T15:01:22Z","title_canon_sha256":"1758973ad28389881e4c002ebe229bfe97cf808cccd790c093cb1741db4d1f18"},"schema_version":"1.0","source":{"id":"1209.6540","kind":"arxiv","version":1}},"canonical_sha256":"365c05f929321d22ae8e402fc56bc3ae33201e13ba5ab28182b8598a8b0ee5de","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"365c05f929321d22ae8e402fc56bc3ae33201e13ba5ab28182b8598a8b0ee5de","first_computed_at":"2026-05-18T03:44:25.182059Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:44:25.182059Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"14rYYJyGbHgLBo9QLZV7swcN6cq+xW45kpDXzQ/4YTldSkD4KXSwNq5HU3p1LzIS2ac8eQ1Q9+zbBtPUoC0yDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:44:25.182649Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.6540","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c09d8aa37f2f41d9c6ceb89fcc41218da7fbbf70e3580c26773a5c3992193705","sha256:08db46e60219ec43f814be95a13904ca8a540aeccaa0a3abc24964168b83812b"],"state_sha256":"851c1703cdf472cb7a13ee219d17665dbcb937b662b6d0a58512fac9f1f42e4b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r+hqJ8vpANOjHRlNdWZzQ9uhsEnkmF8N/koEFt6q3p0xed+I35OFgmEEAoYv7N+8krH/aBK8dYFhhbPxZ7nxCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T07:44:44.760686Z","bundle_sha256":"812c76c33d37921730f99bb5afb307098db37a0d001d26305cb7977822df1c46"}}