{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:2EFDMUXIR3PCO67VJLALR6XG6G","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":"11adfbe4b3c4beda3029f663c606e049962a73b9e5739d9d10488c0525adf56b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-04-27T10:09:42Z","title_canon_sha256":"737b5a5eab12c85f6e7d1c0cecf88007f5e844f61e1a1eb0c1a097d98405a0ef"},"schema_version":"1.0","source":{"id":"2604.24275","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.24275","created_at":"2026-06-02T02:04:18Z"},{"alias_kind":"arxiv_version","alias_value":"2604.24275v2","created_at":"2026-06-02T02:04:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.24275","created_at":"2026-06-02T02:04:18Z"},{"alias_kind":"pith_short_12","alias_value":"2EFDMUXIR3PC","created_at":"2026-06-02T02:04:18Z"},{"alias_kind":"pith_short_16","alias_value":"2EFDMUXIR3PCO67V","created_at":"2026-06-02T02:04:18Z"},{"alias_kind":"pith_short_8","alias_value":"2EFDMUXI","created_at":"2026-06-02T02:04:18Z"}],"graph_snapshots":[{"event_id":"sha256:dcac58b2004f0d636bd2f2d74b7b933899d98664c45bffc1f66edf8cb71473f9","target":"graph","created_at":"2026-06-02T02:04:18Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We show that we can construct a maximum matching in general graphs in CL, and, in fact, in CLP. We first show that the size of a maximum matching in general graphs can be determined in CL."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The linear-algebraic algorithm for maximum matching by Geelen (2000) and the PTAS for rank approximation can be implemented or simulated inside catalytic logspace without exceeding the space or catalytic restoration constraints."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Maximum matching in general graphs and several related matroid problems are placed in catalytic logspace or CLP."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"The size of a maximum matching in general graphs can be determined in catalytic logspace, and the matching itself can be constructed in CLP."}],"snapshot_sha256":"81db34f9cc27b5d4c3775c46edf336b3b538fcf8b166a1f87b419ac23d94100f"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-21T07:35:05.055353Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T22:16:39.812153Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2604.24275/integrity.json","findings":[],"snapshot_sha256":"31017b3a6bab7ac3ef1726ef36e1921098e2eb2a8dd5f9df231337e6b5ed5df0","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Understanding the power of space-bounded computation with access to catalytic space has been an important theme in complexity theory over the recent years. One of the key algorithmic results in this area is that bipartite maximum matching can be computed in catalytic logspace with a polynomial-time bound, Agarwala and Mertz (2025).\n  In this paper, we show that we can construct a \\emph{maximum matching} in \\emph{general graphs} in CL, and, in fact, in CLP. We first show that the size of a \\emph{maximum matching} in \\emph{general graphs} can be determined in CL. Our algorithm is based on the li","authors_text":"Amit Sinhababu, Aryan Kusre, Partha Mukhopadhyay, Samir Datta, Srijan Chakraborty","cross_cats":[],"headline":"The size of a maximum matching in general graphs can be determined in catalytic logspace, and the matching itself can be constructed in CLP.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-04-27T10:09:42Z","title":"Maximum Matching and Related Problems in Catalytic Logspace"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.24275","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-07T17:10:54.076072Z","id":"af1a60b6-85ac-4d7e-9d60-83b5baf54fd8","model_set":{"reader":"grok-4.3"},"one_line_summary":"Maximum matching in general graphs and several related matroid problems are placed in catalytic logspace or CLP.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"The size of a maximum matching in general graphs can be determined in catalytic logspace, and the matching itself can be constructed in CLP.","strongest_claim":"We show that we can construct a maximum matching in general graphs in CL, and, in fact, in CLP. We first show that the size of a maximum matching in general graphs can be determined in CL.","weakest_assumption":"The linear-algebraic algorithm for maximum matching by Geelen (2000) and the PTAS for rank approximation can be implemented or simulated inside catalytic logspace without exceeding the space or catalytic restoration constraints."}},"verdict_id":"af1a60b6-85ac-4d7e-9d60-83b5baf54fd8"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e742ab4c1a095be82d118a3c8d5dffaaa8949939446791aa7cf157e048d6fd0a","target":"record","created_at":"2026-06-02T02:04:18Z","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":"11adfbe4b3c4beda3029f663c606e049962a73b9e5739d9d10488c0525adf56b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-04-27T10:09:42Z","title_canon_sha256":"737b5a5eab12c85f6e7d1c0cecf88007f5e844f61e1a1eb0c1a097d98405a0ef"},"schema_version":"1.0","source":{"id":"2604.24275","kind":"arxiv","version":2}},"canonical_sha256":"d10a3652e88ede277bf54ac0b8fae6f1b85e8b5980683783121f7ced57c5388f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d10a3652e88ede277bf54ac0b8fae6f1b85e8b5980683783121f7ced57c5388f","first_computed_at":"2026-06-02T02:04:18.041062Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-02T02:04:18.041062Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KYEU4chQaddZBeSQt7kf2FtikksXImQ6Z9O6x4fZK+NczbtEluiwo25YBmsJ/RtQ5Az0l0+Wn2XnHRJF0rnrAQ==","signature_status":"signed_v1","signed_at":"2026-06-02T02:04:18.041712Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.24275","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e742ab4c1a095be82d118a3c8d5dffaaa8949939446791aa7cf157e048d6fd0a","sha256:dcac58b2004f0d636bd2f2d74b7b933899d98664c45bffc1f66edf8cb71473f9"],"state_sha256":"c136352a54328e53b848a7cf8073175f60fddacd882aa8889886c0fb5858b08c"}