{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:KZZORQTEKEEBNATBU7BJCWTYYL","short_pith_number":"pith:KZZORQTE","schema_version":"1.0","canonical_sha256":"5672e8c2645108168261a7c2915a78c2fde341ba446a78845c6fa07675557a3c","source":{"kind":"arxiv","id":"2502.13636","version":2},"attestation_state":"computed","paper":{"title":"Semi-Streaming Algorithms for Hypergraph Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alex Pothen, Bora U\\c{c}ar, Christian Schulz, Henrik Reinst\\\"adtler, S M Ferdous","submitted_at":"2025-02-19T11:15:20Z","abstract_excerpt":"We propose two one-pass streaming algorithms for the $\\mathcal{NP}$-hard hypergraph matching problem. The first algorithm stores a small subset of potential matching edges in a stack using dual variables to select edges. It has an approximation guarantee of $\\frac{1}{d(1+\\varepsilon)}$ and requires $\\mathcal{O}((\\frac{n}{\\varepsilon}) \\log^2{n})$ bits of memory, where $n$ is the number of vertices in the hypergraph, $d$ is the maximum number of vertices in a hyperedge, and $\\epsilon > 0$ is a parameter to be chosen. The second algorithm computes, stores, and updates a single matching as the ed"},"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":"2502.13636","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-02-19T11:15:20Z","cross_cats_sorted":[],"title_canon_sha256":"08f56e431b5037702cc8a880139633a6c22773c24d93ca7ef4637f8b153e3581","abstract_canon_sha256":"ed08662b9ea092fa69a8e4a946902568042c741da468f5c05028dc2d07df3148"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:33:20.225954Z","signature_b64":"s7fInflePKxFb7deoIfgKyBOo+BxRGJ0ugianQE17oqVO8RfGleIN5+sy0bnJWVuOYuPniC+XQb/Hx89QL8vBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5672e8c2645108168261a7c2915a78c2fde341ba446a78845c6fa07675557a3c","last_reissued_at":"2026-07-05T11:33:20.225502Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:33:20.225502Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Semi-Streaming Algorithms for Hypergraph Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alex Pothen, Bora U\\c{c}ar, Christian Schulz, Henrik Reinst\\\"adtler, S M Ferdous","submitted_at":"2025-02-19T11:15:20Z","abstract_excerpt":"We propose two one-pass streaming algorithms for the $\\mathcal{NP}$-hard hypergraph matching problem. The first algorithm stores a small subset of potential matching edges in a stack using dual variables to select edges. It has an approximation guarantee of $\\frac{1}{d(1+\\varepsilon)}$ and requires $\\mathcal{O}((\\frac{n}{\\varepsilon}) \\log^2{n})$ bits of memory, where $n$ is the number of vertices in the hypergraph, $d$ is the maximum number of vertices in a hyperedge, and $\\epsilon > 0$ is a parameter to be chosen. The second algorithm computes, stores, and updates a single matching as the ed"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.13636","kind":"arxiv","version":2},"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.13636/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":"2502.13636","created_at":"2026-07-05T11:33:20.225568+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.13636v2","created_at":"2026-07-05T11:33:20.225568+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.13636","created_at":"2026-07-05T11:33:20.225568+00:00"},{"alias_kind":"pith_short_12","alias_value":"KZZORQTEKEEB","created_at":"2026-07-05T11:33:20.225568+00:00"},{"alias_kind":"pith_short_16","alias_value":"KZZORQTEKEEBNATB","created_at":"2026-07-05T11:33:20.225568+00:00"},{"alias_kind":"pith_short_8","alias_value":"KZZORQTE","created_at":"2026-07-05T11:33:20.225568+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.00674","citing_title":"Triangle Counting in Hypergraph Streams: A Complete and Practical Approach","ref_index":55,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KZZORQTEKEEBNATBU7BJCWTYYL","json":"https://pith.science/pith/KZZORQTEKEEBNATBU7BJCWTYYL.json","graph_json":"https://pith.science/api/pith-number/KZZORQTEKEEBNATBU7BJCWTYYL/graph.json","events_json":"https://pith.science/api/pith-number/KZZORQTEKEEBNATBU7BJCWTYYL/events.json","paper":"https://pith.science/paper/KZZORQTE"},"agent_actions":{"view_html":"https://pith.science/pith/KZZORQTEKEEBNATBU7BJCWTYYL","download_json":"https://pith.science/pith/KZZORQTEKEEBNATBU7BJCWTYYL.json","view_paper":"https://pith.science/paper/KZZORQTE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.13636&json=true","fetch_graph":"https://pith.science/api/pith-number/KZZORQTEKEEBNATBU7BJCWTYYL/graph.json","fetch_events":"https://pith.science/api/pith-number/KZZORQTEKEEBNATBU7BJCWTYYL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KZZORQTEKEEBNATBU7BJCWTYYL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KZZORQTEKEEBNATBU7BJCWTYYL/action/storage_attestation","attest_author":"https://pith.science/pith/KZZORQTEKEEBNATBU7BJCWTYYL/action/author_attestation","sign_citation":"https://pith.science/pith/KZZORQTEKEEBNATBU7BJCWTYYL/action/citation_signature","submit_replication":"https://pith.science/pith/KZZORQTEKEEBNATBU7BJCWTYYL/action/replication_record"}},"created_at":"2026-07-05T11:33:20.225568+00:00","updated_at":"2026-07-05T11:33:20.225568+00:00"}