{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:V2RE6HP3NXJJ7BID4X22SEPIW3","short_pith_number":"pith:V2RE6HP3","canonical_record":{"source":{"id":"1609.06583","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-09-21T14:31:26Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"0e24dc73fc1571e8fecc54e675769c4a02cf3e37cdccd9471609bdff0cdfee23","abstract_canon_sha256":"8a2247c29cb76a71445c68404a8f8d04229f75bcc22425b3f13290784181e52f"},"schema_version":"1.0"},"canonical_sha256":"aea24f1dfb6dd29f8503e5f5a911e8b6f9a2cf82a4e95e74c6ae18c46c977a91","source":{"kind":"arxiv","id":"1609.06583","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.06583","created_at":"2026-05-18T01:04:07Z"},{"alias_kind":"arxiv_version","alias_value":"1609.06583v1","created_at":"2026-05-18T01:04:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.06583","created_at":"2026-05-18T01:04:07Z"},{"alias_kind":"pith_short_12","alias_value":"V2RE6HP3NXJJ","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"V2RE6HP3NXJJ7BID","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"V2RE6HP3","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:V2RE6HP3NXJJ7BID4X22SEPIW3","target":"record","payload":{"canonical_record":{"source":{"id":"1609.06583","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-09-21T14:31:26Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"0e24dc73fc1571e8fecc54e675769c4a02cf3e37cdccd9471609bdff0cdfee23","abstract_canon_sha256":"8a2247c29cb76a71445c68404a8f8d04229f75bcc22425b3f13290784181e52f"},"schema_version":"1.0"},"canonical_sha256":"aea24f1dfb6dd29f8503e5f5a911e8b6f9a2cf82a4e95e74c6ae18c46c977a91","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:07.834250Z","signature_b64":"gWHmmJS/NFwMSoGkXSBCccG/HMfzzOqHa4fq71bvgAiBQ/NTFTvVgLh/UwkOJs6t5NmPwhaWXTe7jlLXSgxBBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aea24f1dfb6dd29f8503e5f5a911e8b6f9a2cf82a4e95e74c6ae18c46c977a91","last_reissued_at":"2026-05-18T01:04:07.833716Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:07.833716Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.06583","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-18T01:04:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KPkbKpI0t28EcpgyttEuS8/IerTXe+wzBe56vsvyaAxGEllGLhsGWjUv59EaKosN7443d6uL8l1+QXJV3yYUAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T01:37:28.909731Z"},"content_sha256":"e39b3754f53aa8a532df2187446786dd049ba32266547071358d82e86ac5faec","schema_version":"1.0","event_id":"sha256:e39b3754f53aa8a532df2187446786dd049ba32266547071358d82e86ac5faec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:V2RE6HP3NXJJ7BID4X22SEPIW3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Revealing Structure in Large Graphs: Szemer\\'edi's Regularity Lemma and its Use in Pattern Recognition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CV","authors_text":"Ismail Elezi, Marcello Pelillo, Marco Fiorucci","submitted_at":"2016-09-21T14:31:26Z","abstract_excerpt":"Introduced in the mid-1970's as an intermediate step in proving a long-standing conjecture on arithmetic progressions, Szemer\\'edi's regularity lemma has emerged over time as a fundamental tool in different branches of graph theory, combinatorics and theoretical computer science. Roughly, it states that every graph can be approximated by the union of a small number of random-like bipartite graphs called regular pairs. In other words, the result provides us a way to obtain a good description of a large graph using a small amount of data, and can be regarded as a manifestation of the all-pervadi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.06583","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-18T01:04:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IUY8hRt4zjp1WFjaNtTNzN8Y0A2D16CtK3D9+39nYgifhJqfvp7lxNFLa0fWORSGI/MbHZYQYQr51Zx6VfGcDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T01:37:28.910388Z"},"content_sha256":"a6ee3ee16f50ce17c61603e49c08410ac3e0308e6f1e5363d55e5910e867b3e8","schema_version":"1.0","event_id":"sha256:a6ee3ee16f50ce17c61603e49c08410ac3e0308e6f1e5363d55e5910e867b3e8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V2RE6HP3NXJJ7BID4X22SEPIW3/bundle.json","state_url":"https://pith.science/pith/V2RE6HP3NXJJ7BID4X22SEPIW3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V2RE6HP3NXJJ7BID4X22SEPIW3/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-01T01:37:28Z","links":{"resolver":"https://pith.science/pith/V2RE6HP3NXJJ7BID4X22SEPIW3","bundle":"https://pith.science/pith/V2RE6HP3NXJJ7BID4X22SEPIW3/bundle.json","state":"https://pith.science/pith/V2RE6HP3NXJJ7BID4X22SEPIW3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V2RE6HP3NXJJ7BID4X22SEPIW3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:V2RE6HP3NXJJ7BID4X22SEPIW3","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":"8a2247c29cb76a71445c68404a8f8d04229f75bcc22425b3f13290784181e52f","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-09-21T14:31:26Z","title_canon_sha256":"0e24dc73fc1571e8fecc54e675769c4a02cf3e37cdccd9471609bdff0cdfee23"},"schema_version":"1.0","source":{"id":"1609.06583","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.06583","created_at":"2026-05-18T01:04:07Z"},{"alias_kind":"arxiv_version","alias_value":"1609.06583v1","created_at":"2026-05-18T01:04:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.06583","created_at":"2026-05-18T01:04:07Z"},{"alias_kind":"pith_short_12","alias_value":"V2RE6HP3NXJJ","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"V2RE6HP3NXJJ7BID","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"V2RE6HP3","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:a6ee3ee16f50ce17c61603e49c08410ac3e0308e6f1e5363d55e5910e867b3e8","target":"graph","created_at":"2026-05-18T01:04:07Z","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":"Introduced in the mid-1970's as an intermediate step in proving a long-standing conjecture on arithmetic progressions, Szemer\\'edi's regularity lemma has emerged over time as a fundamental tool in different branches of graph theory, combinatorics and theoretical computer science. Roughly, it states that every graph can be approximated by the union of a small number of random-like bipartite graphs called regular pairs. In other words, the result provides us a way to obtain a good description of a large graph using a small amount of data, and can be regarded as a manifestation of the all-pervadi","authors_text":"Ismail Elezi, Marcello Pelillo, Marco Fiorucci","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-09-21T14:31:26Z","title":"Revealing Structure in Large Graphs: Szemer\\'edi's Regularity Lemma and its Use in Pattern Recognition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.06583","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:e39b3754f53aa8a532df2187446786dd049ba32266547071358d82e86ac5faec","target":"record","created_at":"2026-05-18T01:04:07Z","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":"8a2247c29cb76a71445c68404a8f8d04229f75bcc22425b3f13290784181e52f","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-09-21T14:31:26Z","title_canon_sha256":"0e24dc73fc1571e8fecc54e675769c4a02cf3e37cdccd9471609bdff0cdfee23"},"schema_version":"1.0","source":{"id":"1609.06583","kind":"arxiv","version":1}},"canonical_sha256":"aea24f1dfb6dd29f8503e5f5a911e8b6f9a2cf82a4e95e74c6ae18c46c977a91","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aea24f1dfb6dd29f8503e5f5a911e8b6f9a2cf82a4e95e74c6ae18c46c977a91","first_computed_at":"2026-05-18T01:04:07.833716Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:07.833716Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gWHmmJS/NFwMSoGkXSBCccG/HMfzzOqHa4fq71bvgAiBQ/NTFTvVgLh/UwkOJs6t5NmPwhaWXTe7jlLXSgxBBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:07.834250Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.06583","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e39b3754f53aa8a532df2187446786dd049ba32266547071358d82e86ac5faec","sha256:a6ee3ee16f50ce17c61603e49c08410ac3e0308e6f1e5363d55e5910e867b3e8"],"state_sha256":"dc1c737f2e0e1f2cca5d7a375855413ced21163a982a72ca9aee48d6bf483e0a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H+jQqk3Wk0hQiC8O2vyfiqctVqGoBp1vExq1PIWb8/W72bsLH+j3rcAdbjV58qY/eK997Cf4jtQqtxlZQJahCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T01:37:28.913624Z","bundle_sha256":"75b90aa1b4515898121561d7a99b69cfc6156e3666939980efe79f63a0349b49"}}