{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:UXHEBKXIXAGDQ622JHPTUSSPXE","short_pith_number":"pith:UXHEBKXI","canonical_record":{"source":{"id":"2105.08215","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-05-18T00:55:57Z","cross_cats_sorted":[],"title_canon_sha256":"119f42716de6de6595f84ff33cac90a09194cc443d4c2262586f21fc717d751b","abstract_canon_sha256":"b47931c21938bdce9a7b5a08b0adbd657bdc8ff7f404c0355c5a33a43ade477d"},"schema_version":"1.0"},"canonical_sha256":"a5ce40aae8b80c387b5a49df3a4a4fb93eabde1d08ce5576f20fce375cfe1560","source":{"kind":"arxiv","id":"2105.08215","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2105.08215","created_at":"2026-07-05T02:40:52Z"},{"alias_kind":"arxiv_version","alias_value":"2105.08215v1","created_at":"2026-07-05T02:40:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.08215","created_at":"2026-07-05T02:40:52Z"},{"alias_kind":"pith_short_12","alias_value":"UXHEBKXIXAGD","created_at":"2026-07-05T02:40:52Z"},{"alias_kind":"pith_short_16","alias_value":"UXHEBKXIXAGDQ622","created_at":"2026-07-05T02:40:52Z"},{"alias_kind":"pith_short_8","alias_value":"UXHEBKXI","created_at":"2026-07-05T02:40:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:UXHEBKXIXAGDQ622JHPTUSSPXE","target":"record","payload":{"canonical_record":{"source":{"id":"2105.08215","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-05-18T00:55:57Z","cross_cats_sorted":[],"title_canon_sha256":"119f42716de6de6595f84ff33cac90a09194cc443d4c2262586f21fc717d751b","abstract_canon_sha256":"b47931c21938bdce9a7b5a08b0adbd657bdc8ff7f404c0355c5a33a43ade477d"},"schema_version":"1.0"},"canonical_sha256":"a5ce40aae8b80c387b5a49df3a4a4fb93eabde1d08ce5576f20fce375cfe1560","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:40:52.809204Z","signature_b64":"xCqj2fjyx3xvBRhk4hCcJm/XDwH5V7Nggvls92JHpRvP4l2akv3gH29WjLYCCDcCCg+y7dPMJF3QZltS68t1Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a5ce40aae8b80c387b5a49df3a4a4fb93eabde1d08ce5576f20fce375cfe1560","last_reissued_at":"2026-07-05T02:40:52.808789Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:40:52.808789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2105.08215","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-05T02:40:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/XMNglHsOjxAMcu8+f97VAVcuiIrLhPmzh3uXELkOg+zLZm4CQ9lxGv5+3yt4LQtNVqaCZxGWBoWQ2O39IEvDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T05:15:42.792858Z"},"content_sha256":"c27d4934f1fdb9d000678dd7b3d409aeeebe0f107b52ef0ab2f7cb6330873ad0","schema_version":"1.0","event_id":"sha256:c27d4934f1fdb9d000678dd7b3d409aeeebe0f107b52ef0ab2f7cb6330873ad0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:UXHEBKXIXAGDQ622JHPTUSSPXE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Vertex Ordering Problems in Directed Graph Streams","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amit Chakrabarti, Andrew McGregor, Prantar Ghosh, Sofya Vorotnikova","submitted_at":"2021-05-18T00:55:57Z","abstract_excerpt":"We consider directed graph algorithms in a streaming setting, focusing on problems concerning orderings of the vertices. This includes such fundamental problems as topological sorting and acyclicity testing. We also study the related problems of finding a minimum feedback arc set (edges whose removal yields an acyclic graph), and finding a sink vertex. We are interested in both adversarially-ordered and randomly-ordered streams. For arbitrary input graphs with edges ordered adversarially, we show that most of these problems have high space complexity, precluding sublinear-space solutions. Some"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.08215","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/2105.08215/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-05T02:40:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GStQf5NET6fNy99znaOZjVyWiZFI3FXfFSjPx3MhSXPxmaL5GH1v1kH2yhOyzJQBoBukKx4xfTigXyfvd0s3Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T05:15:42.793233Z"},"content_sha256":"97a7212ed462662e60e878862294649653d3a81e53624a785f93b9ab9c1112d6","schema_version":"1.0","event_id":"sha256:97a7212ed462662e60e878862294649653d3a81e53624a785f93b9ab9c1112d6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UXHEBKXIXAGDQ622JHPTUSSPXE/bundle.json","state_url":"https://pith.science/pith/UXHEBKXIXAGDQ622JHPTUSSPXE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UXHEBKXIXAGDQ622JHPTUSSPXE/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-07T05:15:42Z","links":{"resolver":"https://pith.science/pith/UXHEBKXIXAGDQ622JHPTUSSPXE","bundle":"https://pith.science/pith/UXHEBKXIXAGDQ622JHPTUSSPXE/bundle.json","state":"https://pith.science/pith/UXHEBKXIXAGDQ622JHPTUSSPXE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UXHEBKXIXAGDQ622JHPTUSSPXE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:UXHEBKXIXAGDQ622JHPTUSSPXE","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":"b47931c21938bdce9a7b5a08b0adbd657bdc8ff7f404c0355c5a33a43ade477d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-05-18T00:55:57Z","title_canon_sha256":"119f42716de6de6595f84ff33cac90a09194cc443d4c2262586f21fc717d751b"},"schema_version":"1.0","source":{"id":"2105.08215","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2105.08215","created_at":"2026-07-05T02:40:52Z"},{"alias_kind":"arxiv_version","alias_value":"2105.08215v1","created_at":"2026-07-05T02:40:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.08215","created_at":"2026-07-05T02:40:52Z"},{"alias_kind":"pith_short_12","alias_value":"UXHEBKXIXAGD","created_at":"2026-07-05T02:40:52Z"},{"alias_kind":"pith_short_16","alias_value":"UXHEBKXIXAGDQ622","created_at":"2026-07-05T02:40:52Z"},{"alias_kind":"pith_short_8","alias_value":"UXHEBKXI","created_at":"2026-07-05T02:40:52Z"}],"graph_snapshots":[{"event_id":"sha256:97a7212ed462662e60e878862294649653d3a81e53624a785f93b9ab9c1112d6","target":"graph","created_at":"2026-07-05T02:40:52Z","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/2105.08215/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider directed graph algorithms in a streaming setting, focusing on problems concerning orderings of the vertices. This includes such fundamental problems as topological sorting and acyclicity testing. We also study the related problems of finding a minimum feedback arc set (edges whose removal yields an acyclic graph), and finding a sink vertex. We are interested in both adversarially-ordered and randomly-ordered streams. For arbitrary input graphs with edges ordered adversarially, we show that most of these problems have high space complexity, precluding sublinear-space solutions. Some","authors_text":"Amit Chakrabarti, Andrew McGregor, Prantar Ghosh, Sofya Vorotnikova","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-05-18T00:55:57Z","title":"Vertex Ordering Problems in Directed Graph Streams"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.08215","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:c27d4934f1fdb9d000678dd7b3d409aeeebe0f107b52ef0ab2f7cb6330873ad0","target":"record","created_at":"2026-07-05T02:40:52Z","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":"b47931c21938bdce9a7b5a08b0adbd657bdc8ff7f404c0355c5a33a43ade477d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-05-18T00:55:57Z","title_canon_sha256":"119f42716de6de6595f84ff33cac90a09194cc443d4c2262586f21fc717d751b"},"schema_version":"1.0","source":{"id":"2105.08215","kind":"arxiv","version":1}},"canonical_sha256":"a5ce40aae8b80c387b5a49df3a4a4fb93eabde1d08ce5576f20fce375cfe1560","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a5ce40aae8b80c387b5a49df3a4a4fb93eabde1d08ce5576f20fce375cfe1560","first_computed_at":"2026-07-05T02:40:52.808789Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:40:52.808789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xCqj2fjyx3xvBRhk4hCcJm/XDwH5V7Nggvls92JHpRvP4l2akv3gH29WjLYCCDcCCg+y7dPMJF3QZltS68t1Ag==","signature_status":"signed_v1","signed_at":"2026-07-05T02:40:52.809204Z","signed_message":"canonical_sha256_bytes"},"source_id":"2105.08215","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c27d4934f1fdb9d000678dd7b3d409aeeebe0f107b52ef0ab2f7cb6330873ad0","sha256:97a7212ed462662e60e878862294649653d3a81e53624a785f93b9ab9c1112d6"],"state_sha256":"82a999f520ec2b748dd46f6c2c51d214fe57fd1d453b02b219feded13b9bb49c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aQrDiCcw/u0MfLINO+MA4yy9dk6cX/9wv4voLX13uk+BGKl6NspbOnheQB3EzDCSz+qrnWw8FRv1U2sI+7H9Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T05:15:42.795612Z","bundle_sha256":"3a67f3808184b94740a928273e7713abfe19b213f180b3c0b3588c788c84d862"}}