{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:454ZE6M6R3R3USVWNDKAIM5YJK","short_pith_number":"pith:454ZE6M6","canonical_record":{"source":{"id":"2607.14644","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-16T07:12:52Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"f451a07f107f79a344e8da918167be3fd208166a91e9f1e471703cc29cf15d6f","abstract_canon_sha256":"006b787ceb55a3941d92ebbcd89ed13655cb456f00966489feb36b7f368ba052"},"schema_version":"1.0"},"canonical_sha256":"e77992799e8ee3ba4ab668d40433b84a82d604c113bc110560319447ac6c2f67","source":{"kind":"arxiv","id":"2607.14644","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.14644","created_at":"2026-07-17T01:21:22Z"},{"alias_kind":"arxiv_version","alias_value":"2607.14644v1","created_at":"2026-07-17T01:21:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.14644","created_at":"2026-07-17T01:21:22Z"},{"alias_kind":"pith_short_12","alias_value":"454ZE6M6R3R3","created_at":"2026-07-17T01:21:22Z"},{"alias_kind":"pith_short_16","alias_value":"454ZE6M6R3R3USVW","created_at":"2026-07-17T01:21:22Z"},{"alias_kind":"pith_short_8","alias_value":"454ZE6M6","created_at":"2026-07-17T01:21:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:454ZE6M6R3R3USVWNDKAIM5YJK","target":"record","payload":{"canonical_record":{"source":{"id":"2607.14644","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-16T07:12:52Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"f451a07f107f79a344e8da918167be3fd208166a91e9f1e471703cc29cf15d6f","abstract_canon_sha256":"006b787ceb55a3941d92ebbcd89ed13655cb456f00966489feb36b7f368ba052"},"schema_version":"1.0"},"canonical_sha256":"e77992799e8ee3ba4ab668d40433b84a82d604c113bc110560319447ac6c2f67","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-17T01:21:22.617943Z","signature_b64":"suYmtRw8nE+s/M0kNNqYn9NNSY7hpBQ1kl5qQ1D7fzUiRM4yyifuqYzFq3NGStkZHxfC1uJ4VIxzuDAPxo/nBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e77992799e8ee3ba4ab668d40433b84a82d604c113bc110560319447ac6c2f67","last_reissued_at":"2026-07-17T01:21:22.616668Z","signature_status":"signed_v1","first_computed_at":"2026-07-17T01:21:22.616668Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.14644","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-17T01:21:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sd5bjae7X3uc1ffIZv492cm834+snPEL1BiZNES6rxAw4C3oUTitiUODXpOMuvreAIPWa6Ex5FqExkTUudBIAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T03:24:42.544225Z"},"content_sha256":"f60f59c6fe70c885f4ba1b9f75017cda4a126ae55812739c15fe4b84c94747d2","schema_version":"1.0","event_id":"sha256:f60f59c6fe70c885f4ba1b9f75017cda4a126ae55812739c15fe4b84c94747d2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:454ZE6M6R3R3USVWNDKAIM5YJK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Semi-Streaming Matching in a Single Pass I: A New Framework for Lower Bounds via Blueprints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Mars Xiang, Max Jiang, Sepehr Assadi","submitted_at":"2026-07-16T07:12:52Z","abstract_excerpt":"In the semi-streaming model, we have an $n$-vertex graph $G=(V,E)$ whose edges arrive in an arbitrary order in a stream. The goal is to make one or a few passes over the stream, use a limited memory of $\\tilde O(n)$ bits, and output a solution to the problem at hand at the end. A central open question in this area is to determine the best approximation ratio possible for the maximum matching problem via single-pass semi-streaming algorithms.\n  This problem admits a simple $0.5$-approximation algorithm, by maintaining a maximal matching greedily, which, despite extensive efforts, has remained t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.14644","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/2607.14644/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-17T01:21:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vXOiPNtjX2hH/KAMiZHPWzTpx1BbfAfmyIVht/ef5oN13E6Ixmg6FFxmhLx/UOmhR53NeLqUmgNMv7zsg01uCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T03:24:42.544731Z"},"content_sha256":"778f2ce504dac1265bfc512b713d0f2fd0ac357bede40a3d8b455f581d08c38d","schema_version":"1.0","event_id":"sha256:778f2ce504dac1265bfc512b713d0f2fd0ac357bede40a3d8b455f581d08c38d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/454ZE6M6R3R3USVWNDKAIM5YJK/bundle.json","state_url":"https://pith.science/pith/454ZE6M6R3R3USVWNDKAIM5YJK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/454ZE6M6R3R3USVWNDKAIM5YJK/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-09T03:24:42Z","links":{"resolver":"https://pith.science/pith/454ZE6M6R3R3USVWNDKAIM5YJK","bundle":"https://pith.science/pith/454ZE6M6R3R3USVWNDKAIM5YJK/bundle.json","state":"https://pith.science/pith/454ZE6M6R3R3USVWNDKAIM5YJK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/454ZE6M6R3R3USVWNDKAIM5YJK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:454ZE6M6R3R3USVWNDKAIM5YJK","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":"006b787ceb55a3941d92ebbcd89ed13655cb456f00966489feb36b7f368ba052","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-16T07:12:52Z","title_canon_sha256":"f451a07f107f79a344e8da918167be3fd208166a91e9f1e471703cc29cf15d6f"},"schema_version":"1.0","source":{"id":"2607.14644","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.14644","created_at":"2026-07-17T01:21:22Z"},{"alias_kind":"arxiv_version","alias_value":"2607.14644v1","created_at":"2026-07-17T01:21:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.14644","created_at":"2026-07-17T01:21:22Z"},{"alias_kind":"pith_short_12","alias_value":"454ZE6M6R3R3","created_at":"2026-07-17T01:21:22Z"},{"alias_kind":"pith_short_16","alias_value":"454ZE6M6R3R3USVW","created_at":"2026-07-17T01:21:22Z"},{"alias_kind":"pith_short_8","alias_value":"454ZE6M6","created_at":"2026-07-17T01:21:22Z"}],"graph_snapshots":[{"event_id":"sha256:778f2ce504dac1265bfc512b713d0f2fd0ac357bede40a3d8b455f581d08c38d","target":"graph","created_at":"2026-07-17T01:21:22Z","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/2607.14644/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In the semi-streaming model, we have an $n$-vertex graph $G=(V,E)$ whose edges arrive in an arbitrary order in a stream. The goal is to make one or a few passes over the stream, use a limited memory of $\\tilde O(n)$ bits, and output a solution to the problem at hand at the end. A central open question in this area is to determine the best approximation ratio possible for the maximum matching problem via single-pass semi-streaming algorithms.\n  This problem admits a simple $0.5$-approximation algorithm, by maintaining a maximal matching greedily, which, despite extensive efforts, has remained t","authors_text":"Mars Xiang, Max Jiang, Sepehr Assadi","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-16T07:12:52Z","title":"Semi-Streaming Matching in a Single Pass I: A New Framework for Lower Bounds via Blueprints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.14644","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:f60f59c6fe70c885f4ba1b9f75017cda4a126ae55812739c15fe4b84c94747d2","target":"record","created_at":"2026-07-17T01:21:22Z","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":"006b787ceb55a3941d92ebbcd89ed13655cb456f00966489feb36b7f368ba052","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-16T07:12:52Z","title_canon_sha256":"f451a07f107f79a344e8da918167be3fd208166a91e9f1e471703cc29cf15d6f"},"schema_version":"1.0","source":{"id":"2607.14644","kind":"arxiv","version":1}},"canonical_sha256":"e77992799e8ee3ba4ab668d40433b84a82d604c113bc110560319447ac6c2f67","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e77992799e8ee3ba4ab668d40433b84a82d604c113bc110560319447ac6c2f67","first_computed_at":"2026-07-17T01:21:22.616668Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-17T01:21:22.616668Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"suYmtRw8nE+s/M0kNNqYn9NNSY7hpBQ1kl5qQ1D7fzUiRM4yyifuqYzFq3NGStkZHxfC1uJ4VIxzuDAPxo/nBg==","signature_status":"signed_v1","signed_at":"2026-07-17T01:21:22.617943Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.14644","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f60f59c6fe70c885f4ba1b9f75017cda4a126ae55812739c15fe4b84c94747d2","sha256:778f2ce504dac1265bfc512b713d0f2fd0ac357bede40a3d8b455f581d08c38d"],"state_sha256":"35cb92a4b041b3523ef2028dc4ac0c5ac787839cd00b84d3c0db3f7b5ff84240"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zYgoC6ffPsdtDn3C1GUpFeYA0MtE/H5jLwUtQZBbL7dFuUNLGJDHSK/bN1K/aHuf4vemqwhgEYjhyxW0+ujcBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T03:24:42.548406Z","bundle_sha256":"a09a5227f19413bc20db51560be565daa64c1c4f908ed86a5d567f8085712332"}}