{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:CXSNL3XZFFAZL2LOPQCTC4TVPM","short_pith_number":"pith:CXSNL3XZ","canonical_record":{"source":{"id":"2404.06069","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-04-09T07:15:53Z","cross_cats_sorted":[],"title_canon_sha256":"d70fcb08a07824413f63762093ee70e16ba9e0281f0aa0a8be006df20eed4d84","abstract_canon_sha256":"3d63c9f46b6e7fe1392e4cf5ca822835f872dec3b478393f692c2d3acb3d5a80"},"schema_version":"1.0"},"canonical_sha256":"15e4d5eef9294195e96e7c053172757b25c0c52d6026c92614967da7dc40a43e","source":{"kind":"arxiv","id":"2404.06069","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.06069","created_at":"2026-07-05T09:11:25Z"},{"alias_kind":"arxiv_version","alias_value":"2404.06069v4","created_at":"2026-07-05T09:11:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.06069","created_at":"2026-07-05T09:11:25Z"},{"alias_kind":"pith_short_12","alias_value":"CXSNL3XZFFAZ","created_at":"2026-07-05T09:11:25Z"},{"alias_kind":"pith_short_16","alias_value":"CXSNL3XZFFAZL2LO","created_at":"2026-07-05T09:11:25Z"},{"alias_kind":"pith_short_8","alias_value":"CXSNL3XZ","created_at":"2026-07-05T09:11:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:CXSNL3XZFFAZL2LOPQCTC4TVPM","target":"record","payload":{"canonical_record":{"source":{"id":"2404.06069","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-04-09T07:15:53Z","cross_cats_sorted":[],"title_canon_sha256":"d70fcb08a07824413f63762093ee70e16ba9e0281f0aa0a8be006df20eed4d84","abstract_canon_sha256":"3d63c9f46b6e7fe1392e4cf5ca822835f872dec3b478393f692c2d3acb3d5a80"},"schema_version":"1.0"},"canonical_sha256":"15e4d5eef9294195e96e7c053172757b25c0c52d6026c92614967da7dc40a43e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:11:25.521800Z","signature_b64":"FYUfv5yNlIg8bbQWA7t13pkB+1XMfuBZ9OI84iU6sEaYb9e2RNy+OV15BnnIOXTYwohRNbL7PuHWBStlkSLqAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"15e4d5eef9294195e96e7c053172757b25c0c52d6026c92614967da7dc40a43e","last_reissued_at":"2026-07-05T09:11:25.521356Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:11:25.521356Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2404.06069","source_version":4,"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-05T09:11:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pcgE/DDTuzltiIwBi1l6SXyWRk/lPQMZk7H2hYrIhUeJq9DSXu3CxwCyLlREpt78HJXJjRXkUBDKGitTlFwRAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T22:30:55.502342Z"},"content_sha256":"3e40e8f5b5b271f9ba544d78e8f89346cda3762575e8d95adc42a1b1e3f8e0c7","schema_version":"1.0","event_id":"sha256:3e40e8f5b5b271f9ba544d78e8f89346cda3762575e8d95adc42a1b1e3f8e0c7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:CXSNL3XZFFAZL2LOPQCTC4TVPM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fully Dynamic Matching and Ordered Ruzsa-Szemer\\'edi Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alma Ghafari, Soheil Behnezhad","submitted_at":"2024-04-09T07:15:53Z","abstract_excerpt":"We study the fully dynamic maximum matching problem. In this problem, the goal is to efficiently maintain an approximate maximum matching of a graph that is subject to edge insertions and deletions. Our focus is on algorithms that maintain the edges of a $(1-\\epsilon)$-approximate maximum matching for an arbitrarily small constant $\\epsilon > 0$. Until recently, the fastest known algorithm for this problem required $\\Theta(n)$ time per update where $n$ is the number of vertices. This bound was slightly improved to $n/(\\log^* n)^{\\Omega(1)}$ by Assadi, Behnezhad, Khanna, and Li [STOC'23] and ve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.06069","kind":"arxiv","version":4},"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/2404.06069/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-05T09:11:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RTaQxVuo0I4ueBB/YjylikHHjsN4T8MLmQbNZHX/06Ou2eN1Lc11iIWeumZUj4xlu2svYDrN+lRDjtrZhpHkCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T22:30:55.503074Z"},"content_sha256":"a6cbdc27f875d84fa887eacd6ee3a013bc10f0b830c9ab00b2d5f6f803785218","schema_version":"1.0","event_id":"sha256:a6cbdc27f875d84fa887eacd6ee3a013bc10f0b830c9ab00b2d5f6f803785218"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CXSNL3XZFFAZL2LOPQCTC4TVPM/bundle.json","state_url":"https://pith.science/pith/CXSNL3XZFFAZL2LOPQCTC4TVPM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CXSNL3XZFFAZL2LOPQCTC4TVPM/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-07-31T22:30:55Z","links":{"resolver":"https://pith.science/pith/CXSNL3XZFFAZL2LOPQCTC4TVPM","bundle":"https://pith.science/pith/CXSNL3XZFFAZL2LOPQCTC4TVPM/bundle.json","state":"https://pith.science/pith/CXSNL3XZFFAZL2LOPQCTC4TVPM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CXSNL3XZFFAZL2LOPQCTC4TVPM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:CXSNL3XZFFAZL2LOPQCTC4TVPM","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":"3d63c9f46b6e7fe1392e4cf5ca822835f872dec3b478393f692c2d3acb3d5a80","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-04-09T07:15:53Z","title_canon_sha256":"d70fcb08a07824413f63762093ee70e16ba9e0281f0aa0a8be006df20eed4d84"},"schema_version":"1.0","source":{"id":"2404.06069","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.06069","created_at":"2026-07-05T09:11:25Z"},{"alias_kind":"arxiv_version","alias_value":"2404.06069v4","created_at":"2026-07-05T09:11:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.06069","created_at":"2026-07-05T09:11:25Z"},{"alias_kind":"pith_short_12","alias_value":"CXSNL3XZFFAZ","created_at":"2026-07-05T09:11:25Z"},{"alias_kind":"pith_short_16","alias_value":"CXSNL3XZFFAZL2LO","created_at":"2026-07-05T09:11:25Z"},{"alias_kind":"pith_short_8","alias_value":"CXSNL3XZ","created_at":"2026-07-05T09:11:25Z"}],"graph_snapshots":[{"event_id":"sha256:a6cbdc27f875d84fa887eacd6ee3a013bc10f0b830c9ab00b2d5f6f803785218","target":"graph","created_at":"2026-07-05T09:11:25Z","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/2404.06069/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the fully dynamic maximum matching problem. In this problem, the goal is to efficiently maintain an approximate maximum matching of a graph that is subject to edge insertions and deletions. Our focus is on algorithms that maintain the edges of a $(1-\\epsilon)$-approximate maximum matching for an arbitrarily small constant $\\epsilon > 0$. Until recently, the fastest known algorithm for this problem required $\\Theta(n)$ time per update where $n$ is the number of vertices. This bound was slightly improved to $n/(\\log^* n)^{\\Omega(1)}$ by Assadi, Behnezhad, Khanna, and Li [STOC'23] and ve","authors_text":"Alma Ghafari, Soheil Behnezhad","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-04-09T07:15:53Z","title":"Fully Dynamic Matching and Ordered Ruzsa-Szemer\\'edi Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.06069","kind":"arxiv","version":4},"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:3e40e8f5b5b271f9ba544d78e8f89346cda3762575e8d95adc42a1b1e3f8e0c7","target":"record","created_at":"2026-07-05T09:11:25Z","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":"3d63c9f46b6e7fe1392e4cf5ca822835f872dec3b478393f692c2d3acb3d5a80","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-04-09T07:15:53Z","title_canon_sha256":"d70fcb08a07824413f63762093ee70e16ba9e0281f0aa0a8be006df20eed4d84"},"schema_version":"1.0","source":{"id":"2404.06069","kind":"arxiv","version":4}},"canonical_sha256":"15e4d5eef9294195e96e7c053172757b25c0c52d6026c92614967da7dc40a43e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"15e4d5eef9294195e96e7c053172757b25c0c52d6026c92614967da7dc40a43e","first_computed_at":"2026-07-05T09:11:25.521356Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:11:25.521356Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FYUfv5yNlIg8bbQWA7t13pkB+1XMfuBZ9OI84iU6sEaYb9e2RNy+OV15BnnIOXTYwohRNbL7PuHWBStlkSLqAA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:11:25.521800Z","signed_message":"canonical_sha256_bytes"},"source_id":"2404.06069","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3e40e8f5b5b271f9ba544d78e8f89346cda3762575e8d95adc42a1b1e3f8e0c7","sha256:a6cbdc27f875d84fa887eacd6ee3a013bc10f0b830c9ab00b2d5f6f803785218"],"state_sha256":"216014a406fc5b83878be0351829d2de0c17f3f3ca80158118fd3d126b13a5a4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bog673ObKPIwyOQJXojRFBBhl5ugnla9L5j3yGBxMbXobZVcecb5lhtKOnhmhCbYq9xwLuV7oEKI2xLnoiAUDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-31T22:30:55.507602Z","bundle_sha256":"77af8fe2faf34006c12475e4e9ed33a191fb6a0cd975a628a6b7a8d10b70c245"}}