{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:FJYCK2GBKOVHQZQSQUXJL4P4CF","short_pith_number":"pith:FJYCK2GB","canonical_record":{"source":{"id":"2305.16815","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2023-05-26T10:49:25Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"327e308c1252ff79e476dc4cfbd431be6a05ff11fff3df83605a91fd6f9012e1","abstract_canon_sha256":"ad4166a8a1cc9414c3b87579d30b582a4255cda31337fb5fde1201fba8ed0476"},"schema_version":"1.0"},"canonical_sha256":"2a702568c153aa786612852e95f1fc115ce86755847dc0a08a2b895fdbb179bd","source":{"kind":"arxiv","id":"2305.16815","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.16815","created_at":"2026-07-05T06:14:17Z"},{"alias_kind":"arxiv_version","alias_value":"2305.16815v1","created_at":"2026-07-05T06:14:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.16815","created_at":"2026-07-05T06:14:17Z"},{"alias_kind":"pith_short_12","alias_value":"FJYCK2GBKOVH","created_at":"2026-07-05T06:14:17Z"},{"alias_kind":"pith_short_16","alias_value":"FJYCK2GBKOVHQZQS","created_at":"2026-07-05T06:14:17Z"},{"alias_kind":"pith_short_8","alias_value":"FJYCK2GB","created_at":"2026-07-05T06:14:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:FJYCK2GBKOVHQZQSQUXJL4P4CF","target":"record","payload":{"canonical_record":{"source":{"id":"2305.16815","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2023-05-26T10:49:25Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"327e308c1252ff79e476dc4cfbd431be6a05ff11fff3df83605a91fd6f9012e1","abstract_canon_sha256":"ad4166a8a1cc9414c3b87579d30b582a4255cda31337fb5fde1201fba8ed0476"},"schema_version":"1.0"},"canonical_sha256":"2a702568c153aa786612852e95f1fc115ce86755847dc0a08a2b895fdbb179bd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:14:17.736837Z","signature_b64":"pL2rD1qsMrxzumPMuhexnKJ5Zjz0po1Rg0uJA5sMFtjylREtVRCzcQ+5A/5ESEHtZCz3kp7yPDMjXRC7HQXKBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a702568c153aa786612852e95f1fc115ce86755847dc0a08a2b895fdbb179bd","last_reissued_at":"2026-07-05T06:14:17.736411Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:14:17.736411Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2305.16815","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-05T06:14:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EWlb9+6JD3uu/H7KIc5StCXtauz+sLHxnwE/osETic48G83ztTnQCDP5Y6ipQ26Fuck+NY2e/D31lxBxIlCtAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T02:44:28.637280Z"},"content_sha256":"2a1ca54ef8b735905b6d79668496038ea1140aff691878db98f515b6193e367c","schema_version":"1.0","event_id":"sha256:2a1ca54ef8b735905b6d79668496038ea1140aff691878db98f515b6193e367c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:FJYCK2GBKOVHQZQSQUXJL4P4CF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sublinear-Space Streaming Algorithms for Estimating Graph Parameters on Sparse Graphs","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.DS","authors_text":"Anthony Wirth, Patrick Eades, Rajesh Chitnis, Xiuge Chen","submitted_at":"2023-05-26T10:49:25Z","abstract_excerpt":"In this paper, we design sub-linear space streaming algorithms for estimating three fundamental parameters -- maximum independent set, minimum dominating set and maximum matching -- on sparse graph classes, i.e., graphs which satisfy $m=O(n)$ where $m,n$ is the number of edges, vertices respectively. Each of the three graph parameters we consider can have size $\\Omega(n)$ even on sparse graph classes, and hence for sublinear-space algorithms we are restricted to parameter estimation instead of attempting to find a solution."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.16815","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/2305.16815/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-05T06:14:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mo66YqLujfSRDqvFgiOcOG71fcwPkJTHbV4WtzRwn26kIPiW84rQWPaOk7tiP/DfNuIabosSqaWyFz6rjxLDBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T02:44:28.637665Z"},"content_sha256":"63db4f0fd609295e7a52698e3ad374cdc0e86c0434f71a54777ab38127e4047b","schema_version":"1.0","event_id":"sha256:63db4f0fd609295e7a52698e3ad374cdc0e86c0434f71a54777ab38127e4047b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FJYCK2GBKOVHQZQSQUXJL4P4CF/bundle.json","state_url":"https://pith.science/pith/FJYCK2GBKOVHQZQSQUXJL4P4CF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FJYCK2GBKOVHQZQSQUXJL4P4CF/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-07-08T02:44:28Z","links":{"resolver":"https://pith.science/pith/FJYCK2GBKOVHQZQSQUXJL4P4CF","bundle":"https://pith.science/pith/FJYCK2GBKOVHQZQSQUXJL4P4CF/bundle.json","state":"https://pith.science/pith/FJYCK2GBKOVHQZQSQUXJL4P4CF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FJYCK2GBKOVHQZQSQUXJL4P4CF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:FJYCK2GBKOVHQZQSQUXJL4P4CF","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":"ad4166a8a1cc9414c3b87579d30b582a4255cda31337fb5fde1201fba8ed0476","cross_cats_sorted":["cs.DB"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2023-05-26T10:49:25Z","title_canon_sha256":"327e308c1252ff79e476dc4cfbd431be6a05ff11fff3df83605a91fd6f9012e1"},"schema_version":"1.0","source":{"id":"2305.16815","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.16815","created_at":"2026-07-05T06:14:17Z"},{"alias_kind":"arxiv_version","alias_value":"2305.16815v1","created_at":"2026-07-05T06:14:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.16815","created_at":"2026-07-05T06:14:17Z"},{"alias_kind":"pith_short_12","alias_value":"FJYCK2GBKOVH","created_at":"2026-07-05T06:14:17Z"},{"alias_kind":"pith_short_16","alias_value":"FJYCK2GBKOVHQZQS","created_at":"2026-07-05T06:14:17Z"},{"alias_kind":"pith_short_8","alias_value":"FJYCK2GB","created_at":"2026-07-05T06:14:17Z"}],"graph_snapshots":[{"event_id":"sha256:63db4f0fd609295e7a52698e3ad374cdc0e86c0434f71a54777ab38127e4047b","target":"graph","created_at":"2026-07-05T06:14:17Z","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/2305.16815/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we design sub-linear space streaming algorithms for estimating three fundamental parameters -- maximum independent set, minimum dominating set and maximum matching -- on sparse graph classes, i.e., graphs which satisfy $m=O(n)$ where $m,n$ is the number of edges, vertices respectively. Each of the three graph parameters we consider can have size $\\Omega(n)$ even on sparse graph classes, and hence for sublinear-space algorithms we are restricted to parameter estimation instead of attempting to find a solution.","authors_text":"Anthony Wirth, Patrick Eades, Rajesh Chitnis, Xiuge Chen","cross_cats":["cs.DB"],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2023-05-26T10:49:25Z","title":"Sublinear-Space Streaming Algorithms for Estimating Graph Parameters on Sparse Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.16815","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:2a1ca54ef8b735905b6d79668496038ea1140aff691878db98f515b6193e367c","target":"record","created_at":"2026-07-05T06:14:17Z","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":"ad4166a8a1cc9414c3b87579d30b582a4255cda31337fb5fde1201fba8ed0476","cross_cats_sorted":["cs.DB"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2023-05-26T10:49:25Z","title_canon_sha256":"327e308c1252ff79e476dc4cfbd431be6a05ff11fff3df83605a91fd6f9012e1"},"schema_version":"1.0","source":{"id":"2305.16815","kind":"arxiv","version":1}},"canonical_sha256":"2a702568c153aa786612852e95f1fc115ce86755847dc0a08a2b895fdbb179bd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2a702568c153aa786612852e95f1fc115ce86755847dc0a08a2b895fdbb179bd","first_computed_at":"2026-07-05T06:14:17.736411Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:14:17.736411Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pL2rD1qsMrxzumPMuhexnKJ5Zjz0po1Rg0uJA5sMFtjylREtVRCzcQ+5A/5ESEHtZCz3kp7yPDMjXRC7HQXKBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T06:14:17.736837Z","signed_message":"canonical_sha256_bytes"},"source_id":"2305.16815","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2a1ca54ef8b735905b6d79668496038ea1140aff691878db98f515b6193e367c","sha256:63db4f0fd609295e7a52698e3ad374cdc0e86c0434f71a54777ab38127e4047b"],"state_sha256":"b391eb9b82551b0774181eb14ae4844e4cd43d42b985f3347b73cdcae4e2f49d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"is5ewltzM1aI9AeY59H1kjwCzx8JH0KVNCz/+Zi40MWUX6LMTAhb1ru0lfBWVwuty95mhUGsfB9j8yieboptDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-08T02:44:28.639927Z","bundle_sha256":"f0b3674952e10749d9f479cdc003fb03e97c8cdd85c49cb224b1e138a9f886c8"}}