{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:V2RE6HP3NXJJ7BID4X22SEPIW3","short_pith_number":"pith:V2RE6HP3","schema_version":"1.0","canonical_sha256":"aea24f1dfb6dd29f8503e5f5a911e8b6f9a2cf82a4e95e74c6ae18c46c977a91","source":{"kind":"arxiv","id":"1609.06583","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1609.06583","created_at":"2026-05-18T01:04:07.833798+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.06583v1","created_at":"2026-05-18T01:04:07.833798+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.06583","created_at":"2026-05-18T01:04:07.833798+00:00"},{"alias_kind":"pith_short_12","alias_value":"V2RE6HP3NXJJ","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"V2RE6HP3NXJJ7BID","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"V2RE6HP3","created_at":"2026-05-18T12:30:46.583412+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/V2RE6HP3NXJJ7BID4X22SEPIW3","json":"https://pith.science/pith/V2RE6HP3NXJJ7BID4X22SEPIW3.json","graph_json":"https://pith.science/api/pith-number/V2RE6HP3NXJJ7BID4X22SEPIW3/graph.json","events_json":"https://pith.science/api/pith-number/V2RE6HP3NXJJ7BID4X22SEPIW3/events.json","paper":"https://pith.science/paper/V2RE6HP3"},"agent_actions":{"view_html":"https://pith.science/pith/V2RE6HP3NXJJ7BID4X22SEPIW3","download_json":"https://pith.science/pith/V2RE6HP3NXJJ7BID4X22SEPIW3.json","view_paper":"https://pith.science/paper/V2RE6HP3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.06583&json=true","fetch_graph":"https://pith.science/api/pith-number/V2RE6HP3NXJJ7BID4X22SEPIW3/graph.json","fetch_events":"https://pith.science/api/pith-number/V2RE6HP3NXJJ7BID4X22SEPIW3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V2RE6HP3NXJJ7BID4X22SEPIW3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V2RE6HP3NXJJ7BID4X22SEPIW3/action/storage_attestation","attest_author":"https://pith.science/pith/V2RE6HP3NXJJ7BID4X22SEPIW3/action/author_attestation","sign_citation":"https://pith.science/pith/V2RE6HP3NXJJ7BID4X22SEPIW3/action/citation_signature","submit_replication":"https://pith.science/pith/V2RE6HP3NXJJ7BID4X22SEPIW3/action/replication_record"}},"created_at":"2026-05-18T01:04:07.833798+00:00","updated_at":"2026-05-18T01:04:07.833798+00:00"}