{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:6ASBKTJTEFRAZ4IINOWMDMKUTM","short_pith_number":"pith:6ASBKTJT","canonical_record":{"source":{"id":"2505.01763","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-05-03T09:33:46Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"78c26e8d7f804194d3c04dfde015f15f352b698dea2db5e7b00908132c393e91","abstract_canon_sha256":"d192b42e64d7c60758afbf7edf7202ea0f24185e7f9e5baa03ac2d82226cfded"},"schema_version":"1.0"},"canonical_sha256":"f024154d3321620cf1086bacc1b1549b0ed0d0a9b42920d0eaf97d58fa718761","source":{"kind":"arxiv","id":"2505.01763","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.01763","created_at":"2026-07-05T10:58:03Z"},{"alias_kind":"arxiv_version","alias_value":"2505.01763v1","created_at":"2026-07-05T10:58:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.01763","created_at":"2026-07-05T10:58:03Z"},{"alias_kind":"pith_short_12","alias_value":"6ASBKTJTEFRA","created_at":"2026-07-05T10:58:03Z"},{"alias_kind":"pith_short_16","alias_value":"6ASBKTJTEFRAZ4II","created_at":"2026-07-05T10:58:03Z"},{"alias_kind":"pith_short_8","alias_value":"6ASBKTJT","created_at":"2026-07-05T10:58:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:6ASBKTJTEFRAZ4IINOWMDMKUTM","target":"record","payload":{"canonical_record":{"source":{"id":"2505.01763","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-05-03T09:33:46Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"78c26e8d7f804194d3c04dfde015f15f352b698dea2db5e7b00908132c393e91","abstract_canon_sha256":"d192b42e64d7c60758afbf7edf7202ea0f24185e7f9e5baa03ac2d82226cfded"},"schema_version":"1.0"},"canonical_sha256":"f024154d3321620cf1086bacc1b1549b0ed0d0a9b42920d0eaf97d58fa718761","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:58:03.728879Z","signature_b64":"CKYYjEhB7qZ1bD5saRor6vAA+6FvlQI7ogDeJnFFQUbfyK8iGKMdGCt3I1u+S7kHm4HsjWwEaxkx88sItac7Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f024154d3321620cf1086bacc1b1549b0ed0d0a9b42920d0eaf97d58fa718761","last_reissued_at":"2026-07-05T10:58:03.728365Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:58:03.728365Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.01763","source_version":1,"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-05T10:58:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7P0XXqifENCG4bwzftUGK12pBPUsCeF54y+O5oqExVYbsNyZGF9waHAlvPyfRTmxYDSolVdMsayIlGQqrvqACg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T15:00:53.367881Z"},"content_sha256":"e8f058c44c481b8fc16562171d52d98951c8a096c287e8964e90d4a863abf97f","schema_version":"1.0","event_id":"sha256:e8f058c44c481b8fc16562171d52d98951c8a096c287e8964e90d4a863abf97f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:6ASBKTJTEFRAZ4IINOWMDMKUTM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum Speedup for Hypergraph Sparsification","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Chenghua Liu, Minbo Gao, Mingsheng Ying, Zhengfeng Ji","submitted_at":"2025-05-03T09:33:46Z","abstract_excerpt":"Graph sparsification serves as a foundation for many algorithms, such as approximation algorithms for graph cuts and Laplacian system solvers. As its natural generalization, hypergraph sparsification has recently gained increasing attention, with broad applications in graph machine learning and other areas. In this work, we propose the first quantum algorithm for hypergraph sparsification, addressing an open problem proposed by Apers and de Wolf (FOCS'20). For a weighted hypergraph with $n$ vertices, $m$ hyperedges, and rank $r$, our algorithm outputs a near-linear size $\\varepsilon$-spectral "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.01763","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/2505.01763/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-05T10:58:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BYWxkgk0ymRz9OT1IUcm1h9UQDaixEt6CFyg3DtEAL3MHi2hbndO4/3qZEB5ZlpxZ5MndIdKBIySQs/EDygvDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T15:00:53.368434Z"},"content_sha256":"32172cce7e6db3547f9e5c3e4473195295f639c18dc453b57f827dc8203be08b","schema_version":"1.0","event_id":"sha256:32172cce7e6db3547f9e5c3e4473195295f639c18dc453b57f827dc8203be08b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6ASBKTJTEFRAZ4IINOWMDMKUTM/bundle.json","state_url":"https://pith.science/pith/6ASBKTJTEFRAZ4IINOWMDMKUTM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6ASBKTJTEFRAZ4IINOWMDMKUTM/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-04T15:00:53Z","links":{"resolver":"https://pith.science/pith/6ASBKTJTEFRAZ4IINOWMDMKUTM","bundle":"https://pith.science/pith/6ASBKTJTEFRAZ4IINOWMDMKUTM/bundle.json","state":"https://pith.science/pith/6ASBKTJTEFRAZ4IINOWMDMKUTM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6ASBKTJTEFRAZ4IINOWMDMKUTM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:6ASBKTJTEFRAZ4IINOWMDMKUTM","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":"d192b42e64d7c60758afbf7edf7202ea0f24185e7f9e5baa03ac2d82226cfded","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-05-03T09:33:46Z","title_canon_sha256":"78c26e8d7f804194d3c04dfde015f15f352b698dea2db5e7b00908132c393e91"},"schema_version":"1.0","source":{"id":"2505.01763","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.01763","created_at":"2026-07-05T10:58:03Z"},{"alias_kind":"arxiv_version","alias_value":"2505.01763v1","created_at":"2026-07-05T10:58:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.01763","created_at":"2026-07-05T10:58:03Z"},{"alias_kind":"pith_short_12","alias_value":"6ASBKTJTEFRA","created_at":"2026-07-05T10:58:03Z"},{"alias_kind":"pith_short_16","alias_value":"6ASBKTJTEFRAZ4II","created_at":"2026-07-05T10:58:03Z"},{"alias_kind":"pith_short_8","alias_value":"6ASBKTJT","created_at":"2026-07-05T10:58:03Z"}],"graph_snapshots":[{"event_id":"sha256:32172cce7e6db3547f9e5c3e4473195295f639c18dc453b57f827dc8203be08b","target":"graph","created_at":"2026-07-05T10:58:03Z","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/2505.01763/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph sparsification serves as a foundation for many algorithms, such as approximation algorithms for graph cuts and Laplacian system solvers. As its natural generalization, hypergraph sparsification has recently gained increasing attention, with broad applications in graph machine learning and other areas. In this work, we propose the first quantum algorithm for hypergraph sparsification, addressing an open problem proposed by Apers and de Wolf (FOCS'20). For a weighted hypergraph with $n$ vertices, $m$ hyperedges, and rank $r$, our algorithm outputs a near-linear size $\\varepsilon$-spectral ","authors_text":"Chenghua Liu, Minbo Gao, Mingsheng Ying, Zhengfeng Ji","cross_cats":["cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-05-03T09:33:46Z","title":"Quantum Speedup for Hypergraph Sparsification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.01763","kind":"arxiv","version":1},"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:e8f058c44c481b8fc16562171d52d98951c8a096c287e8964e90d4a863abf97f","target":"record","created_at":"2026-07-05T10:58:03Z","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":"d192b42e64d7c60758afbf7edf7202ea0f24185e7f9e5baa03ac2d82226cfded","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-05-03T09:33:46Z","title_canon_sha256":"78c26e8d7f804194d3c04dfde015f15f352b698dea2db5e7b00908132c393e91"},"schema_version":"1.0","source":{"id":"2505.01763","kind":"arxiv","version":1}},"canonical_sha256":"f024154d3321620cf1086bacc1b1549b0ed0d0a9b42920d0eaf97d58fa718761","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f024154d3321620cf1086bacc1b1549b0ed0d0a9b42920d0eaf97d58fa718761","first_computed_at":"2026-07-05T10:58:03.728365Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:58:03.728365Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CKYYjEhB7qZ1bD5saRor6vAA+6FvlQI7ogDeJnFFQUbfyK8iGKMdGCt3I1u+S7kHm4HsjWwEaxkx88sItac7Dw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:58:03.728879Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.01763","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e8f058c44c481b8fc16562171d52d98951c8a096c287e8964e90d4a863abf97f","sha256:32172cce7e6db3547f9e5c3e4473195295f639c18dc453b57f827dc8203be08b"],"state_sha256":"219865b9c68df75c5e3487444a50e863ca6c43d803921f4d4f0bd9a0d63e2744"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zESQj6MTL9ATbOB65YFlcaditibMxTIWR/wz5X5yWIBuTN2KrCHvQNqCNR71R584eS4ifaZQq1lrb69nyWSnBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T15:00:53.428864Z","bundle_sha256":"8edc9fcd08283b764fa0c682b942170e0e59f990e480fbdd19d01e11143a51fb"}}