{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:KZZORQTEKEEBNATBU7BJCWTYYL","short_pith_number":"pith:KZZORQTE","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"},"canonical_sha256":"5672e8c2645108168261a7c2915a78c2fde341ba446a78845c6fa07675557a3c","source":{"kind":"arxiv","id":"2502.13636","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.13636","created_at":"2026-07-05T11:33:20Z"},{"alias_kind":"arxiv_version","alias_value":"2502.13636v2","created_at":"2026-07-05T11:33:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.13636","created_at":"2026-07-05T11:33:20Z"},{"alias_kind":"pith_short_12","alias_value":"KZZORQTEKEEB","created_at":"2026-07-05T11:33:20Z"},{"alias_kind":"pith_short_16","alias_value":"KZZORQTEKEEBNATB","created_at":"2026-07-05T11:33:20Z"},{"alias_kind":"pith_short_8","alias_value":"KZZORQTE","created_at":"2026-07-05T11:33:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:KZZORQTEKEEBNATBU7BJCWTYYL","target":"record","payload":{"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"},"canonical_sha256":"5672e8c2645108168261a7c2915a78c2fde341ba446a78845c6fa07675557a3c","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"},"source_kind":"arxiv","source_id":"2502.13636","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:33:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OAftK8E1QC/zuml1+P51AnFIR7UjuhSc2IHBT/dW1ET73zvgtxlXCxaStxmgMcFYZV3NnFSZXeh1fkeEJbaxDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T15:46:14.126298Z"},"content_sha256":"0da0e07c068f0a4a2083fde50568697c87bb8ed01abc8f79755cdb87f18ad773","schema_version":"1.0","event_id":"sha256:0da0e07c068f0a4a2083fde50568697c87bb8ed01abc8f79755cdb87f18ad773"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:KZZORQTEKEEBNATBU7BJCWTYYL","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:33:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Uot1dFWQfDHyTuiyjg5IkB6fpFN3sVHLkAdtJy94yZQpgBKErnTo+2gfkUH4RlLyzmfiuKP2ks5999PQfabKBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T15:46:14.126834Z"},"content_sha256":"1922fd603c6d23de8b812ae3ebb37a100f26f9a605287cd9fba3ca61c83789ef","schema_version":"1.0","event_id":"sha256:1922fd603c6d23de8b812ae3ebb37a100f26f9a605287cd9fba3ca61c83789ef"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KZZORQTEKEEBNATBU7BJCWTYYL/bundle.json","state_url":"https://pith.science/pith/KZZORQTEKEEBNATBU7BJCWTYYL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KZZORQTEKEEBNATBU7BJCWTYYL/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-12T15:46:14Z","links":{"resolver":"https://pith.science/pith/KZZORQTEKEEBNATBU7BJCWTYYL","bundle":"https://pith.science/pith/KZZORQTEKEEBNATBU7BJCWTYYL/bundle.json","state":"https://pith.science/pith/KZZORQTEKEEBNATBU7BJCWTYYL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KZZORQTEKEEBNATBU7BJCWTYYL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:KZZORQTEKEEBNATBU7BJCWTYYL","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":"ed08662b9ea092fa69a8e4a946902568042c741da468f5c05028dc2d07df3148","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-02-19T11:15:20Z","title_canon_sha256":"08f56e431b5037702cc8a880139633a6c22773c24d93ca7ef4637f8b153e3581"},"schema_version":"1.0","source":{"id":"2502.13636","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.13636","created_at":"2026-07-05T11:33:20Z"},{"alias_kind":"arxiv_version","alias_value":"2502.13636v2","created_at":"2026-07-05T11:33:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.13636","created_at":"2026-07-05T11:33:20Z"},{"alias_kind":"pith_short_12","alias_value":"KZZORQTEKEEB","created_at":"2026-07-05T11:33:20Z"},{"alias_kind":"pith_short_16","alias_value":"KZZORQTEKEEBNATB","created_at":"2026-07-05T11:33:20Z"},{"alias_kind":"pith_short_8","alias_value":"KZZORQTE","created_at":"2026-07-05T11:33:20Z"}],"graph_snapshots":[{"event_id":"sha256:1922fd603c6d23de8b812ae3ebb37a100f26f9a605287cd9fba3ca61c83789ef","target":"graph","created_at":"2026-07-05T11:33:20Z","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/2502.13636/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Alex Pothen, Bora U\\c{c}ar, Christian Schulz, Henrik Reinst\\\"adtler, S M Ferdous","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-02-19T11:15:20Z","title":"Semi-Streaming Algorithms for Hypergraph Matching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.13636","kind":"arxiv","version":2},"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:0da0e07c068f0a4a2083fde50568697c87bb8ed01abc8f79755cdb87f18ad773","target":"record","created_at":"2026-07-05T11:33:20Z","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":"ed08662b9ea092fa69a8e4a946902568042c741da468f5c05028dc2d07df3148","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-02-19T11:15:20Z","title_canon_sha256":"08f56e431b5037702cc8a880139633a6c22773c24d93ca7ef4637f8b153e3581"},"schema_version":"1.0","source":{"id":"2502.13636","kind":"arxiv","version":2}},"canonical_sha256":"5672e8c2645108168261a7c2915a78c2fde341ba446a78845c6fa07675557a3c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5672e8c2645108168261a7c2915a78c2fde341ba446a78845c6fa07675557a3c","first_computed_at":"2026-07-05T11:33:20.225502Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:33:20.225502Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s7fInflePKxFb7deoIfgKyBOo+BxRGJ0ugianQE17oqVO8RfGleIN5+sy0bnJWVuOYuPniC+XQb/Hx89QL8vBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:33:20.225954Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.13636","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0da0e07c068f0a4a2083fde50568697c87bb8ed01abc8f79755cdb87f18ad773","sha256:1922fd603c6d23de8b812ae3ebb37a100f26f9a605287cd9fba3ca61c83789ef"],"state_sha256":"39830bb950b77379cc50e054673cf7a1dbd4542073db1c3d1177db8421cfd3f5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0NBIWpsSG/9uspkfJGYpHEsoLf87DOP53qV2E10raSbBRJM1kMit0y4OPgdKR8bJkE/IZN/dwexGWyM4hgwqAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T15:46:14.131262Z","bundle_sha256":"00842b270f4798f8fd37f41f6972a1510b0ff68743dc86f9517f36eac8899efb"}}