{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:GIIBKFPCQA5T22QFADTB3L5GJX","short_pith_number":"pith:GIIBKFPC","schema_version":"1.0","canonical_sha256":"32101515e2803b3d6a0500e61dafa64defb6208af85bda22e62b3f626fe7413f","source":{"kind":"arxiv","id":"2502.02455","version":1},"attestation_state":"computed","paper":{"title":"A note on Ordered Ruzsa-Szemer\\'edi graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Kevin Pratt","submitted_at":"2025-02-04T16:21:02Z","abstract_excerpt":"A recent breakthrough of Behnezhad and Ghafari [FOCS 2024] and subsequent work of Assadi, Khanna, and Kiss [SODA 2025] gave algorithms for the fully dynamic $(1-\\varepsilon)$-approximate maximum matching problem whose runtimes are determined by a purely combinatorial quantity: the maximum density of Ordered Ruzsa-Szemer\\'edi (ORS) graphs. We say a graph $G$ is an $(r,t)$-ORS graph if its edges can be partitioned into $t$ matchings $M_1,M_2, \\ldots, M_t$ each of size $r$, such that for every $i$, $M_i$ is an induced matching in the subgraph $M_{i} \\cup M_{i+1} \\cup \\cdots \\cup M_t$. This is a r"},"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":"2502.02455","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-02-04T16:21:02Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"f7cdbec655a2284130e8dce95e407b259018a8c1130fd855a1202c27fe03905e","abstract_canon_sha256":"c9d0438c7a9e966f7743a35338b3e1348feca2d1f9414b01421c5765dfab140d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:09:28.742835Z","signature_b64":"qwajYvlrZioTbYxSI/D13a7VHCEEwwuNelnKZKDFXe7Y+2R3LN/lj0fTrp8H8xz0qwroTzbUYFkZUIichABsBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32101515e2803b3d6a0500e61dafa64defb6208af85bda22e62b3f626fe7413f","last_reissued_at":"2026-07-05T10:09:28.742485Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:09:28.742485Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A note on Ordered Ruzsa-Szemer\\'edi graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Kevin Pratt","submitted_at":"2025-02-04T16:21:02Z","abstract_excerpt":"A recent breakthrough of Behnezhad and Ghafari [FOCS 2024] and subsequent work of Assadi, Khanna, and Kiss [SODA 2025] gave algorithms for the fully dynamic $(1-\\varepsilon)$-approximate maximum matching problem whose runtimes are determined by a purely combinatorial quantity: the maximum density of Ordered Ruzsa-Szemer\\'edi (ORS) graphs. We say a graph $G$ is an $(r,t)$-ORS graph if its edges can be partitioned into $t$ matchings $M_1,M_2, \\ldots, M_t$ each of size $r$, such that for every $i$, $M_i$ is an induced matching in the subgraph $M_{i} \\cup M_{i+1} \\cup \\cdots \\cup M_t$. This is a r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.02455","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/2502.02455/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":"2502.02455","created_at":"2026-07-05T10:09:28.742541+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.02455v1","created_at":"2026-07-05T10:09:28.742541+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.02455","created_at":"2026-07-05T10:09:28.742541+00:00"},{"alias_kind":"pith_short_12","alias_value":"GIIBKFPCQA5T","created_at":"2026-07-05T10:09:28.742541+00:00"},{"alias_kind":"pith_short_16","alias_value":"GIIBKFPCQA5T22QF","created_at":"2026-07-05T10:09:28.742541+00:00"},{"alias_kind":"pith_short_8","alias_value":"GIIBKFPC","created_at":"2026-07-05T10:09:28.742541+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.05231","citing_title":"An improved construction for the triangle removal lemma","ref_index":16,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GIIBKFPCQA5T22QFADTB3L5GJX","json":"https://pith.science/pith/GIIBKFPCQA5T22QFADTB3L5GJX.json","graph_json":"https://pith.science/api/pith-number/GIIBKFPCQA5T22QFADTB3L5GJX/graph.json","events_json":"https://pith.science/api/pith-number/GIIBKFPCQA5T22QFADTB3L5GJX/events.json","paper":"https://pith.science/paper/GIIBKFPC"},"agent_actions":{"view_html":"https://pith.science/pith/GIIBKFPCQA5T22QFADTB3L5GJX","download_json":"https://pith.science/pith/GIIBKFPCQA5T22QFADTB3L5GJX.json","view_paper":"https://pith.science/paper/GIIBKFPC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.02455&json=true","fetch_graph":"https://pith.science/api/pith-number/GIIBKFPCQA5T22QFADTB3L5GJX/graph.json","fetch_events":"https://pith.science/api/pith-number/GIIBKFPCQA5T22QFADTB3L5GJX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GIIBKFPCQA5T22QFADTB3L5GJX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GIIBKFPCQA5T22QFADTB3L5GJX/action/storage_attestation","attest_author":"https://pith.science/pith/GIIBKFPCQA5T22QFADTB3L5GJX/action/author_attestation","sign_citation":"https://pith.science/pith/GIIBKFPCQA5T22QFADTB3L5GJX/action/citation_signature","submit_replication":"https://pith.science/pith/GIIBKFPCQA5T22QFADTB3L5GJX/action/replication_record"}},"created_at":"2026-07-05T10:09:28.742541+00:00","updated_at":"2026-07-05T10:09:28.742541+00:00"}