{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:5YTOZ6CHW4GH6WDRKDCU73R5MC","short_pith_number":"pith:5YTOZ6CH","schema_version":"1.0","canonical_sha256":"ee26ecf847b70c7f587150c54fee3d609f382f146d79d60faca8b13f74cf9fd4","source":{"kind":"arxiv","id":"2602.22976","version":3},"attestation_state":"computed","paper":{"title":"Efficient Parallel Algorithms for Hypergraph Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christian Schulz, Fabian Walliser, Henrik Reinst\\\"adtler, Nodari Sitchinava","submitted_at":"2026-02-26T13:16:38Z","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 $"},"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":"2602.22976","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-02-26T13:16:38Z","cross_cats_sorted":[],"title_canon_sha256":"583ff8417e29f1c34ee9dacb244a3dfd37ec380ab028921616a526257a7e7051","abstract_canon_sha256":"a507bd949ccf3f86a54c300f518d8c3bd7b4da641f9fbce2c9b125c6dfe9fc8c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-08T01:03:59.762649Z","signature_b64":"B3ufQtaanjOSydc4B6SBS6+H4aeHCGvFe6qFvejxTfa2pCk5HfkqxinSNcktT807oVgW5Fa+jfTc+0npkeZ4BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee26ecf847b70c7f587150c54fee3d609f382f146d79d60faca8b13f74cf9fd4","last_reissued_at":"2026-06-08T01:03:59.761677Z","signature_status":"signed_v1","first_computed_at":"2026-06-08T01:03:59.761677Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Parallel Algorithms for Hypergraph Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christian Schulz, Fabian Walliser, Henrik Reinst\\\"adtler, Nodari Sitchinava","submitted_at":"2026-02-26T13:16:38Z","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 $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.22976","kind":"arxiv","version":3},"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/2602.22976/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":"2602.22976","created_at":"2026-06-08T01:03:59.761793+00:00"},{"alias_kind":"arxiv_version","alias_value":"2602.22976v3","created_at":"2026-06-08T01:03:59.761793+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.22976","created_at":"2026-06-08T01:03:59.761793+00:00"},{"alias_kind":"pith_short_12","alias_value":"5YTOZ6CHW4GH","created_at":"2026-06-08T01:03:59.761793+00:00"},{"alias_kind":"pith_short_16","alias_value":"5YTOZ6CHW4GH6WDR","created_at":"2026-06-08T01:03:59.761793+00:00"},{"alias_kind":"pith_short_8","alias_value":"5YTOZ6CH","created_at":"2026-06-08T01:03:59.761793+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5YTOZ6CHW4GH6WDRKDCU73R5MC","json":"https://pith.science/pith/5YTOZ6CHW4GH6WDRKDCU73R5MC.json","graph_json":"https://pith.science/api/pith-number/5YTOZ6CHW4GH6WDRKDCU73R5MC/graph.json","events_json":"https://pith.science/api/pith-number/5YTOZ6CHW4GH6WDRKDCU73R5MC/events.json","paper":"https://pith.science/paper/5YTOZ6CH"},"agent_actions":{"view_html":"https://pith.science/pith/5YTOZ6CHW4GH6WDRKDCU73R5MC","download_json":"https://pith.science/pith/5YTOZ6CHW4GH6WDRKDCU73R5MC.json","view_paper":"https://pith.science/paper/5YTOZ6CH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2602.22976&json=true","fetch_graph":"https://pith.science/api/pith-number/5YTOZ6CHW4GH6WDRKDCU73R5MC/graph.json","fetch_events":"https://pith.science/api/pith-number/5YTOZ6CHW4GH6WDRKDCU73R5MC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5YTOZ6CHW4GH6WDRKDCU73R5MC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5YTOZ6CHW4GH6WDRKDCU73R5MC/action/storage_attestation","attest_author":"https://pith.science/pith/5YTOZ6CHW4GH6WDRKDCU73R5MC/action/author_attestation","sign_citation":"https://pith.science/pith/5YTOZ6CHW4GH6WDRKDCU73R5MC/action/citation_signature","submit_replication":"https://pith.science/pith/5YTOZ6CHW4GH6WDRKDCU73R5MC/action/replication_record"}},"created_at":"2026-06-08T01:03:59.761793+00:00","updated_at":"2026-06-08T01:03:59.761793+00:00"}