{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:ONBUESLGWSL5TSZ73JK7L76FW3","short_pith_number":"pith:ONBUESLG","schema_version":"1.0","canonical_sha256":"7343424966b497d9cb3fda55f5ffc5b6c1266b943131eb0dd869879c1cbad5e5","source":{"kind":"arxiv","id":"1106.2871","version":2},"attestation_state":"computed","paper":{"title":"A version of Szemer\\'edi's regularity lemma for multicolored graphs and directed graphs that is suitable for induced graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Maria Axenovich, Ryan R. Martin","submitted_at":"2011-06-15T04:48:14Z","abstract_excerpt":"In this manuscript we develop a version of Szemer\\'edi's regularity lemma that is suitable for analyzing multicolorings of complete graphs and directed graphs. In this, we follow the proof of Alon, Fischer, Krivelevich and M. Szegedy [Combinatorica, 20(4) (2000), 451--476] who prove a similar result for graphs.\n  The purpose is to extend classical results on dense hereditary properties, such as the speed of the property or edit distance, to the above-mentioned combinatorial objects."},"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":"1106.2871","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-15T04:48:14Z","cross_cats_sorted":[],"title_canon_sha256":"e137c6313466af898339b361046336037ff3b24e9fafe25fdab7ff4fb7577363","abstract_canon_sha256":"cf661ff7060cd3cd351221f072bed746527f950c8eae336b239e6b94c5f87369"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:18.643213Z","signature_b64":"uqv80lPQre/Z5PX7/n0xHSrZNQpEkKWqpzGVha83RGZp7+Vmfx7lpLE3nfnTeDsfB5T/qPkCs+xQdtfLdi8oAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7343424966b497d9cb3fda55f5ffc5b6c1266b943131eb0dd869879c1cbad5e5","last_reissued_at":"2026-05-18T01:14:18.642638Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:18.642638Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A version of Szemer\\'edi's regularity lemma for multicolored graphs and directed graphs that is suitable for induced graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Maria Axenovich, Ryan R. Martin","submitted_at":"2011-06-15T04:48:14Z","abstract_excerpt":"In this manuscript we develop a version of Szemer\\'edi's regularity lemma that is suitable for analyzing multicolorings of complete graphs and directed graphs. In this, we follow the proof of Alon, Fischer, Krivelevich and M. Szegedy [Combinatorica, 20(4) (2000), 451--476] who prove a similar result for graphs.\n  The purpose is to extend classical results on dense hereditary properties, such as the speed of the property or edit distance, to the above-mentioned combinatorial objects."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.2871","kind":"arxiv","version":2},"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":"1106.2871","created_at":"2026-05-18T01:14:18.642714+00:00"},{"alias_kind":"arxiv_version","alias_value":"1106.2871v2","created_at":"2026-05-18T01:14:18.642714+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.2871","created_at":"2026-05-18T01:14:18.642714+00:00"},{"alias_kind":"pith_short_12","alias_value":"ONBUESLGWSL5","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_16","alias_value":"ONBUESLGWSL5TSZ7","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_8","alias_value":"ONBUESLG","created_at":"2026-05-18T12:26:37.096874+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/ONBUESLGWSL5TSZ73JK7L76FW3","json":"https://pith.science/pith/ONBUESLGWSL5TSZ73JK7L76FW3.json","graph_json":"https://pith.science/api/pith-number/ONBUESLGWSL5TSZ73JK7L76FW3/graph.json","events_json":"https://pith.science/api/pith-number/ONBUESLGWSL5TSZ73JK7L76FW3/events.json","paper":"https://pith.science/paper/ONBUESLG"},"agent_actions":{"view_html":"https://pith.science/pith/ONBUESLGWSL5TSZ73JK7L76FW3","download_json":"https://pith.science/pith/ONBUESLGWSL5TSZ73JK7L76FW3.json","view_paper":"https://pith.science/paper/ONBUESLG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1106.2871&json=true","fetch_graph":"https://pith.science/api/pith-number/ONBUESLGWSL5TSZ73JK7L76FW3/graph.json","fetch_events":"https://pith.science/api/pith-number/ONBUESLGWSL5TSZ73JK7L76FW3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ONBUESLGWSL5TSZ73JK7L76FW3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ONBUESLGWSL5TSZ73JK7L76FW3/action/storage_attestation","attest_author":"https://pith.science/pith/ONBUESLGWSL5TSZ73JK7L76FW3/action/author_attestation","sign_citation":"https://pith.science/pith/ONBUESLGWSL5TSZ73JK7L76FW3/action/citation_signature","submit_replication":"https://pith.science/pith/ONBUESLGWSL5TSZ73JK7L76FW3/action/replication_record"}},"created_at":"2026-05-18T01:14:18.642714+00:00","updated_at":"2026-05-18T01:14:18.642714+00:00"}