{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:32TPRAW4MQWMXH5VUOSVWSQR3O","short_pith_number":"pith:32TPRAW4","canonical_record":{"source":{"id":"2405.05952","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-05-09T17:44:29Z","cross_cats_sorted":[],"title_canon_sha256":"ab0f94a9cd16218a8c48c6eeff04ecedabe85585c1e628a78f852d3bf1e752e5","abstract_canon_sha256":"b871230d58068747922c3377799c4828fe5c2ccb6bd25395e9cf91840871c207"},"schema_version":"1.0"},"canonical_sha256":"dea6f882dc642ccb9fb5a3a55b4a11dba71264397548ddb3a78f7c40fd361f3a","source":{"kind":"arxiv","id":"2405.05952","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.05952","created_at":"2026-07-05T08:17:25Z"},{"alias_kind":"arxiv_version","alias_value":"2405.05952v1","created_at":"2026-07-05T08:17:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.05952","created_at":"2026-07-05T08:17:25Z"},{"alias_kind":"pith_short_12","alias_value":"32TPRAW4MQWM","created_at":"2026-07-05T08:17:25Z"},{"alias_kind":"pith_short_16","alias_value":"32TPRAW4MQWMXH5V","created_at":"2026-07-05T08:17:25Z"},{"alias_kind":"pith_short_8","alias_value":"32TPRAW4","created_at":"2026-07-05T08:17:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:32TPRAW4MQWMXH5VUOSVWSQR3O","target":"record","payload":{"canonical_record":{"source":{"id":"2405.05952","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-05-09T17:44:29Z","cross_cats_sorted":[],"title_canon_sha256":"ab0f94a9cd16218a8c48c6eeff04ecedabe85585c1e628a78f852d3bf1e752e5","abstract_canon_sha256":"b871230d58068747922c3377799c4828fe5c2ccb6bd25395e9cf91840871c207"},"schema_version":"1.0"},"canonical_sha256":"dea6f882dc642ccb9fb5a3a55b4a11dba71264397548ddb3a78f7c40fd361f3a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:17:25.244759Z","signature_b64":"ssv1Wdj3ia3WFOOCPQY3QZ6ZyhQTjyw5mfvN3XzhNKA/kZq/HfupqWB6S79kXfTRoUqiglNMvwVdZQQDgZ5RDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dea6f882dc642ccb9fb5a3a55b4a11dba71264397548ddb3a78f7c40fd361f3a","last_reissued_at":"2026-07-05T08:17:25.244295Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:17:25.244295Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2405.05952","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-05T08:17:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZS4eICd0dRWvYHE9MdJLO/SW7WAB1hlVK2EqnKpcfhofXaZJnAaa46Kc+yNTqj9d1GY5KL6fUKLhGE8IhYpMDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T08:19:11.351645Z"},"content_sha256":"3dc322122e1bf28e667d859f8f64c51d6338d44c720edaab97462bf4a927f070","schema_version":"1.0","event_id":"sha256:3dc322122e1bf28e667d859f8f64c51d6338d44c720edaab97462bf4a927f070"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:32TPRAW4MQWMXH5VUOSVWSQR3O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"New Algorithms and Lower Bounds for Streaming Tournaments","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Prantar Ghosh, Sahil Kuchlous","submitted_at":"2024-05-09T17:44:29Z","abstract_excerpt":"We study fundamental directed graph (digraph) problems in the streaming model. An initial investigation by Chakrabarti, Ghosh, McGregor, and Vorotnikova [SODA'20] on streaming digraphs showed that while most of these problems are provably hard in general, some of them become tractable when restricted to the well-studied class of tournament graphs where every pair of nodes shares exactly one directed edge. Thus, we focus on tournaments and improve the state of the art for multiple problems in terms of both upper and lower bounds.\n  Our primary upper bound is a deterministic single-pass semi-str"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.05952","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/2405.05952/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-05T08:17:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h4BQp+CWlbBEq5j5rUNL7tcDc3BZN21gv0RJxmiGGU7LegdKo/ldnXpQVpMHhDcgVcIPoWsg2kQTEIn/GNTkCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T08:19:11.352021Z"},"content_sha256":"4611fa531f22b0fc0d3b63a73f0186afaf83f0af5d379d38863973579cb5937a","schema_version":"1.0","event_id":"sha256:4611fa531f22b0fc0d3b63a73f0186afaf83f0af5d379d38863973579cb5937a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/32TPRAW4MQWMXH5VUOSVWSQR3O/bundle.json","state_url":"https://pith.science/pith/32TPRAW4MQWMXH5VUOSVWSQR3O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/32TPRAW4MQWMXH5VUOSVWSQR3O/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-07T08:19:11Z","links":{"resolver":"https://pith.science/pith/32TPRAW4MQWMXH5VUOSVWSQR3O","bundle":"https://pith.science/pith/32TPRAW4MQWMXH5VUOSVWSQR3O/bundle.json","state":"https://pith.science/pith/32TPRAW4MQWMXH5VUOSVWSQR3O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/32TPRAW4MQWMXH5VUOSVWSQR3O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:32TPRAW4MQWMXH5VUOSVWSQR3O","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":"b871230d58068747922c3377799c4828fe5c2ccb6bd25395e9cf91840871c207","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-05-09T17:44:29Z","title_canon_sha256":"ab0f94a9cd16218a8c48c6eeff04ecedabe85585c1e628a78f852d3bf1e752e5"},"schema_version":"1.0","source":{"id":"2405.05952","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.05952","created_at":"2026-07-05T08:17:25Z"},{"alias_kind":"arxiv_version","alias_value":"2405.05952v1","created_at":"2026-07-05T08:17:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.05952","created_at":"2026-07-05T08:17:25Z"},{"alias_kind":"pith_short_12","alias_value":"32TPRAW4MQWM","created_at":"2026-07-05T08:17:25Z"},{"alias_kind":"pith_short_16","alias_value":"32TPRAW4MQWMXH5V","created_at":"2026-07-05T08:17:25Z"},{"alias_kind":"pith_short_8","alias_value":"32TPRAW4","created_at":"2026-07-05T08:17:25Z"}],"graph_snapshots":[{"event_id":"sha256:4611fa531f22b0fc0d3b63a73f0186afaf83f0af5d379d38863973579cb5937a","target":"graph","created_at":"2026-07-05T08:17:25Z","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/2405.05952/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study fundamental directed graph (digraph) problems in the streaming model. An initial investigation by Chakrabarti, Ghosh, McGregor, and Vorotnikova [SODA'20] on streaming digraphs showed that while most of these problems are provably hard in general, some of them become tractable when restricted to the well-studied class of tournament graphs where every pair of nodes shares exactly one directed edge. Thus, we focus on tournaments and improve the state of the art for multiple problems in terms of both upper and lower bounds.\n  Our primary upper bound is a deterministic single-pass semi-str","authors_text":"Prantar Ghosh, Sahil Kuchlous","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-05-09T17:44:29Z","title":"New Algorithms and Lower Bounds for Streaming Tournaments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.05952","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:3dc322122e1bf28e667d859f8f64c51d6338d44c720edaab97462bf4a927f070","target":"record","created_at":"2026-07-05T08:17:25Z","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":"b871230d58068747922c3377799c4828fe5c2ccb6bd25395e9cf91840871c207","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-05-09T17:44:29Z","title_canon_sha256":"ab0f94a9cd16218a8c48c6eeff04ecedabe85585c1e628a78f852d3bf1e752e5"},"schema_version":"1.0","source":{"id":"2405.05952","kind":"arxiv","version":1}},"canonical_sha256":"dea6f882dc642ccb9fb5a3a55b4a11dba71264397548ddb3a78f7c40fd361f3a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dea6f882dc642ccb9fb5a3a55b4a11dba71264397548ddb3a78f7c40fd361f3a","first_computed_at":"2026-07-05T08:17:25.244295Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:17:25.244295Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ssv1Wdj3ia3WFOOCPQY3QZ6ZyhQTjyw5mfvN3XzhNKA/kZq/HfupqWB6S79kXfTRoUqiglNMvwVdZQQDgZ5RDA==","signature_status":"signed_v1","signed_at":"2026-07-05T08:17:25.244759Z","signed_message":"canonical_sha256_bytes"},"source_id":"2405.05952","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3dc322122e1bf28e667d859f8f64c51d6338d44c720edaab97462bf4a927f070","sha256:4611fa531f22b0fc0d3b63a73f0186afaf83f0af5d379d38863973579cb5937a"],"state_sha256":"3872b204b5a4507874b8e54389ef683be20138afc5dedca1c541c7e18c495d43"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LUx5/V7Q9pONR4wnBnmbgCBIdXgHUDBRXfHhTYh0kjJh4tFeMkmvNrOwcOO2lt2B+rtXcTtLOnJ4R2KVKYBRCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T08:19:11.353971Z","bundle_sha256":"1589676053b9f8900047031c054619321d05946c874422ccedd2f8a6b95b6763"}}