{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:5YTOZ6CHW4GH6WDRKDCU73R5MC","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":"a507bd949ccf3f86a54c300f518d8c3bd7b4da641f9fbce2c9b125c6dfe9fc8c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-02-26T13:16:38Z","title_canon_sha256":"583ff8417e29f1c34ee9dacb244a3dfd37ec380ab028921616a526257a7e7051"},"schema_version":"1.0","source":{"id":"2602.22976","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.22976","created_at":"2026-06-08T01:03:59Z"},{"alias_kind":"arxiv_version","alias_value":"2602.22976v3","created_at":"2026-06-08T01:03:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.22976","created_at":"2026-06-08T01:03:59Z"},{"alias_kind":"pith_short_12","alias_value":"5YTOZ6CHW4GH","created_at":"2026-06-08T01:03:59Z"},{"alias_kind":"pith_short_16","alias_value":"5YTOZ6CHW4GH6WDR","created_at":"2026-06-08T01:03:59Z"},{"alias_kind":"pith_short_8","alias_value":"5YTOZ6CH","created_at":"2026-06-08T01:03:59Z"}],"graph_snapshots":[{"event_id":"sha256:c43af35f97d95dff2cf95a6c4d134b30bd3e7b62bec30c45f2fd5b8f28e4088b","target":"graph","created_at":"2026-06-08T01:03:59Z","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/2602.22976/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present efficient parallel algorithms for computing maximal matchings in hypergraphs. Our algorithm finds locally maximal edges in the hypergraph and adds them in parallel to the matching. In the CRCW PRAM models our algorithms achieve $O(\\log{\\log{\\Delta}}\\log{m})$ time with $O(\\kappa\\log {m})$ work w.h.p. where $m$ is the number of hyperedges, and $\\kappa$ is the sum and $\\Delta$ is the maximum of all vertex degrees. The CREW PRAM model algorithm has a running time of $O((\\log{\\Delta}+\\log{d})\\log{m})$ and requires $O(\\kappa \\log {m})$ work w.h.p. It can be implemented work-optimal with $","authors_text":"Christian Schulz, Fabian Walliser, Henrik Reinst\\\"adtler, Nodari Sitchinava","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-02-26T13:16:38Z","title":"Efficient Parallel Algorithms for Hypergraph Matching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.22976","kind":"arxiv","version":3},"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:a73824c5f874a43d3a74aabc7fe17065d6bfd22e21bebf47c5da3125d5c04515","target":"record","created_at":"2026-06-08T01:03:59Z","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":"a507bd949ccf3f86a54c300f518d8c3bd7b4da641f9fbce2c9b125c6dfe9fc8c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-02-26T13:16:38Z","title_canon_sha256":"583ff8417e29f1c34ee9dacb244a3dfd37ec380ab028921616a526257a7e7051"},"schema_version":"1.0","source":{"id":"2602.22976","kind":"arxiv","version":3}},"canonical_sha256":"ee26ecf847b70c7f587150c54fee3d609f382f146d79d60faca8b13f74cf9fd4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ee26ecf847b70c7f587150c54fee3d609f382f146d79d60faca8b13f74cf9fd4","first_computed_at":"2026-06-08T01:03:59.761677Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-08T01:03:59.761677Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"B3ufQtaanjOSydc4B6SBS6+H4aeHCGvFe6qFvejxTfa2pCk5HfkqxinSNcktT807oVgW5Fa+jfTc+0npkeZ4BA==","signature_status":"signed_v1","signed_at":"2026-06-08T01:03:59.762649Z","signed_message":"canonical_sha256_bytes"},"source_id":"2602.22976","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a73824c5f874a43d3a74aabc7fe17065d6bfd22e21bebf47c5da3125d5c04515","sha256:c43af35f97d95dff2cf95a6c4d134b30bd3e7b62bec30c45f2fd5b8f28e4088b"],"state_sha256":"e628732488fe2e4bd880a1c0a1224734479700132ed365190a20bb08fa4d5271"}