{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:PRQRLSLBAEZUAF5E3VGSLZMF5C","short_pith_number":"pith:PRQRLSLB","schema_version":"1.0","canonical_sha256":"7c6115c96101334017a4dd4d25e585e8a8c58778543fd59fbcf1d8909607f990","source":{"kind":"arxiv","id":"2402.08775","version":1},"attestation_state":"computed","paper":{"title":"Almost Tight Bounds for Online Hypergraph Matching","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Rajan Udwani, Thorben Tr\\\"obst","submitted_at":"2024-02-13T20:17:24Z","abstract_excerpt":"In the online hypergraph matching problem, hyperedges of size $k$ over a common ground set arrive online in adversarial order. The goal is to obtain a maximum matching (disjoint set of hyperedges). A na\\\"ive greedy algorithm for this problem achieves a competitive ratio of $\\frac{1}{k}$. We show that no (randomized) online algorithm has competitive ratio better than $\\frac{2+o(1)}{k}$. If edges are allowed to be assigned fractionally, we give a deterministic online algorithm with competitive ratio $\\frac{1-o(1)}{\\ln(k)}$ and show that no online algorithm can have competitive ratio strictly bet"},"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":"2402.08775","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-02-13T20:17:24Z","cross_cats_sorted":[],"title_canon_sha256":"b7c902276d9ec8f1d1ed11f4643b66087d2b4a8f33d9120b8f4403f4dfca3cdd","abstract_canon_sha256":"23d82d6bb9dbddb3e8c3ae4a967fa758512fc104ecac998ff11416bc5a34178f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:45:02.308577Z","signature_b64":"tbytIArrHRMZWCsebpQ1tzVBchHRjX4/P56NM0sTnvjT9X/71u0VvD1bJ9Zp1OZbbXeP23NITaidQHS+FUhNDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c6115c96101334017a4dd4d25e585e8a8c58778543fd59fbcf1d8909607f990","last_reissued_at":"2026-07-05T07:45:02.308142Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:45:02.308142Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Almost Tight Bounds for Online Hypergraph Matching","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Rajan Udwani, Thorben Tr\\\"obst","submitted_at":"2024-02-13T20:17:24Z","abstract_excerpt":"In the online hypergraph matching problem, hyperedges of size $k$ over a common ground set arrive online in adversarial order. The goal is to obtain a maximum matching (disjoint set of hyperedges). A na\\\"ive greedy algorithm for this problem achieves a competitive ratio of $\\frac{1}{k}$. We show that no (randomized) online algorithm has competitive ratio better than $\\frac{2+o(1)}{k}$. If edges are allowed to be assigned fractionally, we give a deterministic online algorithm with competitive ratio $\\frac{1-o(1)}{\\ln(k)}$ and show that no online algorithm can have competitive ratio strictly bet"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.08775","kind":"arxiv","version":1},"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/2402.08775/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":"2402.08775","created_at":"2026-07-05T07:45:02.308195+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.08775v1","created_at":"2026-07-05T07:45:02.308195+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.08775","created_at":"2026-07-05T07:45:02.308195+00:00"},{"alias_kind":"pith_short_12","alias_value":"PRQRLSLBAEZU","created_at":"2026-07-05T07:45:02.308195+00:00"},{"alias_kind":"pith_short_16","alias_value":"PRQRLSLBAEZUAF5E","created_at":"2026-07-05T07:45:02.308195+00:00"},{"alias_kind":"pith_short_8","alias_value":"PRQRLSLB","created_at":"2026-07-05T07:45:02.308195+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.14812","citing_title":"A Black-Box Approach for Exogenous Replenishment in Online Resource Allocation","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PRQRLSLBAEZUAF5E3VGSLZMF5C","json":"https://pith.science/pith/PRQRLSLBAEZUAF5E3VGSLZMF5C.json","graph_json":"https://pith.science/api/pith-number/PRQRLSLBAEZUAF5E3VGSLZMF5C/graph.json","events_json":"https://pith.science/api/pith-number/PRQRLSLBAEZUAF5E3VGSLZMF5C/events.json","paper":"https://pith.science/paper/PRQRLSLB"},"agent_actions":{"view_html":"https://pith.science/pith/PRQRLSLBAEZUAF5E3VGSLZMF5C","download_json":"https://pith.science/pith/PRQRLSLBAEZUAF5E3VGSLZMF5C.json","view_paper":"https://pith.science/paper/PRQRLSLB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.08775&json=true","fetch_graph":"https://pith.science/api/pith-number/PRQRLSLBAEZUAF5E3VGSLZMF5C/graph.json","fetch_events":"https://pith.science/api/pith-number/PRQRLSLBAEZUAF5E3VGSLZMF5C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PRQRLSLBAEZUAF5E3VGSLZMF5C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PRQRLSLBAEZUAF5E3VGSLZMF5C/action/storage_attestation","attest_author":"https://pith.science/pith/PRQRLSLBAEZUAF5E3VGSLZMF5C/action/author_attestation","sign_citation":"https://pith.science/pith/PRQRLSLBAEZUAF5E3VGSLZMF5C/action/citation_signature","submit_replication":"https://pith.science/pith/PRQRLSLBAEZUAF5E3VGSLZMF5C/action/replication_record"}},"created_at":"2026-07-05T07:45:02.308195+00:00","updated_at":"2026-07-05T07:45:02.308195+00:00"}