{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:ZSSQKSDB3SO2XO2UZP7VPKPHFX","short_pith_number":"pith:ZSSQKSDB","canonical_record":{"source":{"id":"2107.02578","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-07-06T12:34:46Z","cross_cats_sorted":[],"title_canon_sha256":"e29edddfa7950d3e8abbd830043e9819929a7d526ae0e807c116677d759fdb7b","abstract_canon_sha256":"302a2d16107cb5497ae71c6b3c9d25eeae7aaf76b255afe9788282f54243319f"},"schema_version":"1.0"},"canonical_sha256":"cca5054861dc9dabbb54cbff57a9e72dc85f3fb4b558da4bf7f83c9b2be2b7f8","source":{"kind":"arxiv","id":"2107.02578","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2107.02578","created_at":"2026-07-05T03:52:13Z"},{"alias_kind":"arxiv_version","alias_value":"2107.02578v2","created_at":"2026-07-05T03:52:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.02578","created_at":"2026-07-05T03:52:13Z"},{"alias_kind":"pith_short_12","alias_value":"ZSSQKSDB3SO2","created_at":"2026-07-05T03:52:13Z"},{"alias_kind":"pith_short_16","alias_value":"ZSSQKSDB3SO2XO2U","created_at":"2026-07-05T03:52:13Z"},{"alias_kind":"pith_short_8","alias_value":"ZSSQKSDB","created_at":"2026-07-05T03:52:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:ZSSQKSDB3SO2XO2UZP7VPKPHFX","target":"record","payload":{"canonical_record":{"source":{"id":"2107.02578","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-07-06T12:34:46Z","cross_cats_sorted":[],"title_canon_sha256":"e29edddfa7950d3e8abbd830043e9819929a7d526ae0e807c116677d759fdb7b","abstract_canon_sha256":"302a2d16107cb5497ae71c6b3c9d25eeae7aaf76b255afe9788282f54243319f"},"schema_version":"1.0"},"canonical_sha256":"cca5054861dc9dabbb54cbff57a9e72dc85f3fb4b558da4bf7f83c9b2be2b7f8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:52:13.639340Z","signature_b64":"mN3HOBWfF/lWILG9jGFRwQzudr+o2qgbiIVmFdwHbF/Vty9/PnshL/grobl0uJM7gHJWDYgSIv0oMvbWiEPIBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cca5054861dc9dabbb54cbff57a9e72dc85f3fb4b558da4bf7f83c9b2be2b7f8","last_reissued_at":"2026-07-05T03:52:13.638925Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:52:13.638925Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2107.02578","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-05T03:52:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GGUtsfQlXV2ghUCKacURL4nFWgUExBdla7tGpDfVXQeMKKvlwhNKtQKwgtCSlHCYqN3Jg4gytYP91gW1SZbvDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T08:13:22.016099Z"},"content_sha256":"fd4d0c71589c26420459404446c6afc2db696915ec248dfefdb77bcbeeed9dbc","schema_version":"1.0","event_id":"sha256:fd4d0c71589c26420459404446c6afc2db696915ec248dfefdb77bcbeeed9dbc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:ZSSQKSDB3SO2XO2UZP7VPKPHFX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Noisy Boolean Hidden Matching with Applications","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amulya Musipatla, David P. Woodruff, Jakab Tardos, Michael Kapralov, Samson Zhou","submitted_at":"2021-07-06T12:34:46Z","abstract_excerpt":"The Boolean Hidden Matching (BHM) problem, introduced in a seminal paper of Gavinsky et. al. [STOC'07], has played an important role in the streaming lower bounds for graph problems such as triangle and subgraph counting, maximum matching, MAX-CUT, Schatten $p$-norm approximation, maximum acyclic subgraph, testing bipartiteness, $k$-connectivity, and cycle-freeness. The one-way communication complexity of the Boolean Hidden Matching problem on a universe of size $n$ is $\\Theta(\\sqrt{n})$, resulting in $\\Omega(\\sqrt{n})$ lower bounds for constant factor approximations to several of the aforemen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.02578","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/2107.02578/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-05T03:52:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KXHmnjvt9rreYKGiFCXxOwhnkdR7sK9U1Mz2DxRFm4jzaIO5WsWO16qom7hbdXxlJyiNyXzEr9Z+gd7E4oNZCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T08:13:22.016965Z"},"content_sha256":"97e90286db2253998112f8f550342239728d97abd9c606458cb8619f1e05e49d","schema_version":"1.0","event_id":"sha256:97e90286db2253998112f8f550342239728d97abd9c606458cb8619f1e05e49d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZSSQKSDB3SO2XO2UZP7VPKPHFX/bundle.json","state_url":"https://pith.science/pith/ZSSQKSDB3SO2XO2UZP7VPKPHFX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZSSQKSDB3SO2XO2UZP7VPKPHFX/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-08T08:13:22Z","links":{"resolver":"https://pith.science/pith/ZSSQKSDB3SO2XO2UZP7VPKPHFX","bundle":"https://pith.science/pith/ZSSQKSDB3SO2XO2UZP7VPKPHFX/bundle.json","state":"https://pith.science/pith/ZSSQKSDB3SO2XO2UZP7VPKPHFX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZSSQKSDB3SO2XO2UZP7VPKPHFX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:ZSSQKSDB3SO2XO2UZP7VPKPHFX","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":"302a2d16107cb5497ae71c6b3c9d25eeae7aaf76b255afe9788282f54243319f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-07-06T12:34:46Z","title_canon_sha256":"e29edddfa7950d3e8abbd830043e9819929a7d526ae0e807c116677d759fdb7b"},"schema_version":"1.0","source":{"id":"2107.02578","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2107.02578","created_at":"2026-07-05T03:52:13Z"},{"alias_kind":"arxiv_version","alias_value":"2107.02578v2","created_at":"2026-07-05T03:52:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.02578","created_at":"2026-07-05T03:52:13Z"},{"alias_kind":"pith_short_12","alias_value":"ZSSQKSDB3SO2","created_at":"2026-07-05T03:52:13Z"},{"alias_kind":"pith_short_16","alias_value":"ZSSQKSDB3SO2XO2U","created_at":"2026-07-05T03:52:13Z"},{"alias_kind":"pith_short_8","alias_value":"ZSSQKSDB","created_at":"2026-07-05T03:52:13Z"}],"graph_snapshots":[{"event_id":"sha256:97e90286db2253998112f8f550342239728d97abd9c606458cb8619f1e05e49d","target":"graph","created_at":"2026-07-05T03:52:13Z","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/2107.02578/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Boolean Hidden Matching (BHM) problem, introduced in a seminal paper of Gavinsky et. al. [STOC'07], has played an important role in the streaming lower bounds for graph problems such as triangle and subgraph counting, maximum matching, MAX-CUT, Schatten $p$-norm approximation, maximum acyclic subgraph, testing bipartiteness, $k$-connectivity, and cycle-freeness. The one-way communication complexity of the Boolean Hidden Matching problem on a universe of size $n$ is $\\Theta(\\sqrt{n})$, resulting in $\\Omega(\\sqrt{n})$ lower bounds for constant factor approximations to several of the aforemen","authors_text":"Amulya Musipatla, David P. Woodruff, Jakab Tardos, Michael Kapralov, Samson Zhou","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-07-06T12:34:46Z","title":"Noisy Boolean Hidden Matching with Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.02578","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:fd4d0c71589c26420459404446c6afc2db696915ec248dfefdb77bcbeeed9dbc","target":"record","created_at":"2026-07-05T03:52:13Z","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":"302a2d16107cb5497ae71c6b3c9d25eeae7aaf76b255afe9788282f54243319f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-07-06T12:34:46Z","title_canon_sha256":"e29edddfa7950d3e8abbd830043e9819929a7d526ae0e807c116677d759fdb7b"},"schema_version":"1.0","source":{"id":"2107.02578","kind":"arxiv","version":2}},"canonical_sha256":"cca5054861dc9dabbb54cbff57a9e72dc85f3fb4b558da4bf7f83c9b2be2b7f8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cca5054861dc9dabbb54cbff57a9e72dc85f3fb4b558da4bf7f83c9b2be2b7f8","first_computed_at":"2026-07-05T03:52:13.638925Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:52:13.638925Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mN3HOBWfF/lWILG9jGFRwQzudr+o2qgbiIVmFdwHbF/Vty9/PnshL/grobl0uJM7gHJWDYgSIv0oMvbWiEPIBA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:52:13.639340Z","signed_message":"canonical_sha256_bytes"},"source_id":"2107.02578","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fd4d0c71589c26420459404446c6afc2db696915ec248dfefdb77bcbeeed9dbc","sha256:97e90286db2253998112f8f550342239728d97abd9c606458cb8619f1e05e49d"],"state_sha256":"54227f08a1e91f8a75a14963a9bfd70fa9a6240dba2a6de7665dee7b838a8b96"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DJEYjehQoEGUFfZNjcVZDb1WDGBYsGuFrt76bMSoNb53Iud69TM+qZBKiBJbjbahCt3JbCj+3XW2um6uFMfjAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T08:13:22.023514Z","bundle_sha256":"8971a4a371f6aa394adca0aa415c1ad72dc4a4e271f6c096c3a29ac685d42103"}}