{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:GIIBKFPCQA5T22QFADTB3L5GJX","short_pith_number":"pith:GIIBKFPC","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"},"canonical_sha256":"32101515e2803b3d6a0500e61dafa64defb6208af85bda22e62b3f626fe7413f","source":{"kind":"arxiv","id":"2502.02455","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.02455","created_at":"2026-07-05T10:09:28Z"},{"alias_kind":"arxiv_version","alias_value":"2502.02455v1","created_at":"2026-07-05T10:09:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.02455","created_at":"2026-07-05T10:09:28Z"},{"alias_kind":"pith_short_12","alias_value":"GIIBKFPCQA5T","created_at":"2026-07-05T10:09:28Z"},{"alias_kind":"pith_short_16","alias_value":"GIIBKFPCQA5T22QF","created_at":"2026-07-05T10:09:28Z"},{"alias_kind":"pith_short_8","alias_value":"GIIBKFPC","created_at":"2026-07-05T10:09:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:GIIBKFPCQA5T22QFADTB3L5GJX","target":"record","payload":{"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"},"canonical_sha256":"32101515e2803b3d6a0500e61dafa64defb6208af85bda22e62b3f626fe7413f","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"},"source_kind":"arxiv","source_id":"2502.02455","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-07-05T10:09:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+QLns5Y9LwFw2v8a3Af13N6HCcLkfeO5H7TTUtAcyuY9WBjPmTb5Nsi4kg9AEM1MKpinjvhTmucmIfN/cRC0AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T12:09:03.508763Z"},"content_sha256":"275ef9f8a18480b6ae35510c2260b4d6fab68a2aacab362f411af394dbfb1e83","schema_version":"1.0","event_id":"sha256:275ef9f8a18480b6ae35510c2260b4d6fab68a2aacab362f411af394dbfb1e83"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:GIIBKFPCQA5T22QFADTB3L5GJX","target":"graph","payload":{"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"},"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-07-05T10:09:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c21VXlEEXuLZ/jdbZwjsuY2TNzqNp9AE4+bECwGDF4SpM72Zvr+gPAonP96FQPXnCSIdTvvfJqbQCCgt0uKwBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T12:09:03.509304Z"},"content_sha256":"881bba832a23ae86739dc43df87c65a739c0749eda90e0f670177fa14c63e6e8","schema_version":"1.0","event_id":"sha256:881bba832a23ae86739dc43df87c65a739c0749eda90e0f670177fa14c63e6e8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GIIBKFPCQA5T22QFADTB3L5GJX/bundle.json","state_url":"https://pith.science/pith/GIIBKFPCQA5T22QFADTB3L5GJX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GIIBKFPCQA5T22QFADTB3L5GJX/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-08-09T12:09:03Z","links":{"resolver":"https://pith.science/pith/GIIBKFPCQA5T22QFADTB3L5GJX","bundle":"https://pith.science/pith/GIIBKFPCQA5T22QFADTB3L5GJX/bundle.json","state":"https://pith.science/pith/GIIBKFPCQA5T22QFADTB3L5GJX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GIIBKFPCQA5T22QFADTB3L5GJX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:GIIBKFPCQA5T22QFADTB3L5GJX","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":"c9d0438c7a9e966f7743a35338b3e1348feca2d1f9414b01421c5765dfab140d","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-02-04T16:21:02Z","title_canon_sha256":"f7cdbec655a2284130e8dce95e407b259018a8c1130fd855a1202c27fe03905e"},"schema_version":"1.0","source":{"id":"2502.02455","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.02455","created_at":"2026-07-05T10:09:28Z"},{"alias_kind":"arxiv_version","alias_value":"2502.02455v1","created_at":"2026-07-05T10:09:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.02455","created_at":"2026-07-05T10:09:28Z"},{"alias_kind":"pith_short_12","alias_value":"GIIBKFPCQA5T","created_at":"2026-07-05T10:09:28Z"},{"alias_kind":"pith_short_16","alias_value":"GIIBKFPCQA5T22QF","created_at":"2026-07-05T10:09:28Z"},{"alias_kind":"pith_short_8","alias_value":"GIIBKFPC","created_at":"2026-07-05T10:09:28Z"}],"graph_snapshots":[{"event_id":"sha256:881bba832a23ae86739dc43df87c65a739c0749eda90e0f670177fa14c63e6e8","target":"graph","created_at":"2026-07-05T10:09:28Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2502.02455/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Kevin Pratt","cross_cats":["math.CO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-02-04T16:21:02Z","title":"A note on Ordered Ruzsa-Szemer\\'edi graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.02455","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:275ef9f8a18480b6ae35510c2260b4d6fab68a2aacab362f411af394dbfb1e83","target":"record","created_at":"2026-07-05T10:09:28Z","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":"c9d0438c7a9e966f7743a35338b3e1348feca2d1f9414b01421c5765dfab140d","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-02-04T16:21:02Z","title_canon_sha256":"f7cdbec655a2284130e8dce95e407b259018a8c1130fd855a1202c27fe03905e"},"schema_version":"1.0","source":{"id":"2502.02455","kind":"arxiv","version":1}},"canonical_sha256":"32101515e2803b3d6a0500e61dafa64defb6208af85bda22e62b3f626fe7413f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"32101515e2803b3d6a0500e61dafa64defb6208af85bda22e62b3f626fe7413f","first_computed_at":"2026-07-05T10:09:28.742485Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:09:28.742485Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qwajYvlrZioTbYxSI/D13a7VHCEEwwuNelnKZKDFXe7Y+2R3LN/lj0fTrp8H8xz0qwroTzbUYFkZUIichABsBw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:09:28.742835Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.02455","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:275ef9f8a18480b6ae35510c2260b4d6fab68a2aacab362f411af394dbfb1e83","sha256:881bba832a23ae86739dc43df87c65a739c0749eda90e0f670177fa14c63e6e8"],"state_sha256":"e4bb78267cbe148cf049cb56053378e5b790a096587c2d0fd55365159883ade9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ySqjTEIjsgZsJOtGmaqpsyPnRqfsYLL4Q7pOt0HxMBIyx2Y9qKWNSQYNV8BFJTbkQzK/dSs02qUb9egvMjojCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T12:09:03.514220Z","bundle_sha256":"4022b89eb1969093eb18f55c0871a892908ca4a6a9f0cb3c88e3f29750e1c8ee"}}