{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:7TYCBMDTXOVNXCOIEPV7PYZ6ZT","short_pith_number":"pith:7TYCBMDT","schema_version":"1.0","canonical_sha256":"fcf020b073bbaadb89c823ebf7e33eccdff52adc5d29b676e5e8757f0d7486fd","source":{"kind":"arxiv","id":"2605.24940","version":1},"attestation_state":"computed","paper":{"title":"Decomposition of degree-regular graphs into quasi-random pairs without the Regularity lemma","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"B\\'ela Csaba","submitted_at":"2026-05-24T08:38:51Z","abstract_excerpt":"The Szemer\\'edi Regularity Lemma, in combination with the Blow-up Lemma, form the Regularity Method, a fundamental tool in graph embeddings, albeit restricted to very large and dense graphs. We propose an alternative vertex-partitioning framework that remains effective even as the density tends to zero and without requiring astronomically large vertex sets. This approach, while narrower in scope, extends regularity-type techniques to relatively small graphs previously inaccessible to the Regularity Method. As an application, we use this novel vertex-partitioning method for bipartite packing pr"},"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":"2605.24940","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-24T08:38:51Z","cross_cats_sorted":[],"title_canon_sha256":"1b2f89c0be55422f0fba3e277e2ab1627ac602045da25a1801b698e02546e9dd","abstract_canon_sha256":"3191cb4c5046b527a7731b8143e92fef26aa386460815e8a835bd3121a00d97b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T01:04:06.766008Z","signature_b64":"iZNQ26likPx6ztfC1hC8cDrDuT6h/J7dAep66TlRdMSZwgOff5KcwTdRpoVM498zyw3X80W+AvULPatmVS4OCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fcf020b073bbaadb89c823ebf7e33eccdff52adc5d29b676e5e8757f0d7486fd","last_reissued_at":"2026-05-26T01:04:06.765180Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T01:04:06.765180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decomposition of degree-regular graphs into quasi-random pairs without the Regularity lemma","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"B\\'ela Csaba","submitted_at":"2026-05-24T08:38:51Z","abstract_excerpt":"The Szemer\\'edi Regularity Lemma, in combination with the Blow-up Lemma, form the Regularity Method, a fundamental tool in graph embeddings, albeit restricted to very large and dense graphs. We propose an alternative vertex-partitioning framework that remains effective even as the density tends to zero and without requiring astronomically large vertex sets. This approach, while narrower in scope, extends regularity-type techniques to relatively small graphs previously inaccessible to the Regularity Method. As an application, we use this novel vertex-partitioning method for bipartite packing pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.24940","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.24940/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2605.24940","created_at":"2026-05-26T01:04:06.765312+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.24940v1","created_at":"2026-05-26T01:04:06.765312+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.24940","created_at":"2026-05-26T01:04:06.765312+00:00"},{"alias_kind":"pith_short_12","alias_value":"7TYCBMDTXOVN","created_at":"2026-05-26T01:04:06.765312+00:00"},{"alias_kind":"pith_short_16","alias_value":"7TYCBMDTXOVNXCOI","created_at":"2026-05-26T01:04:06.765312+00:00"},{"alias_kind":"pith_short_8","alias_value":"7TYCBMDT","created_at":"2026-05-26T01:04:06.765312+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/7TYCBMDTXOVNXCOIEPV7PYZ6ZT","json":"https://pith.science/pith/7TYCBMDTXOVNXCOIEPV7PYZ6ZT.json","graph_json":"https://pith.science/api/pith-number/7TYCBMDTXOVNXCOIEPV7PYZ6ZT/graph.json","events_json":"https://pith.science/api/pith-number/7TYCBMDTXOVNXCOIEPV7PYZ6ZT/events.json","paper":"https://pith.science/paper/7TYCBMDT"},"agent_actions":{"view_html":"https://pith.science/pith/7TYCBMDTXOVNXCOIEPV7PYZ6ZT","download_json":"https://pith.science/pith/7TYCBMDTXOVNXCOIEPV7PYZ6ZT.json","view_paper":"https://pith.science/paper/7TYCBMDT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.24940&json=true","fetch_graph":"https://pith.science/api/pith-number/7TYCBMDTXOVNXCOIEPV7PYZ6ZT/graph.json","fetch_events":"https://pith.science/api/pith-number/7TYCBMDTXOVNXCOIEPV7PYZ6ZT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7TYCBMDTXOVNXCOIEPV7PYZ6ZT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7TYCBMDTXOVNXCOIEPV7PYZ6ZT/action/storage_attestation","attest_author":"https://pith.science/pith/7TYCBMDTXOVNXCOIEPV7PYZ6ZT/action/author_attestation","sign_citation":"https://pith.science/pith/7TYCBMDTXOVNXCOIEPV7PYZ6ZT/action/citation_signature","submit_replication":"https://pith.science/pith/7TYCBMDTXOVNXCOIEPV7PYZ6ZT/action/replication_record"}},"created_at":"2026-05-26T01:04:06.765312+00:00","updated_at":"2026-05-26T01:04:06.765312+00:00"}