{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:TGJZJ5ZPDE7D2XI7VM4ARYDACX","short_pith_number":"pith:TGJZJ5ZP","schema_version":"1.0","canonical_sha256":"999394f72f193e3d5d1fab3808e06015cacea215ae7d8007860dead131cd5190","source":{"kind":"arxiv","id":"1404.1323","version":2},"attestation_state":"computed","paper":{"title":"Lower bounds for testing digraph connectivity with one-pass streaming algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Claire Mathieu, Glencora Borradaile, Theresa Migler","submitted_at":"2014-04-04T17:50:49Z","abstract_excerpt":"In this note, we show that three graph properties - strong connectivity, acyclicity, and reachability from a vertex $s$ to all vertices - each require a working memory of $\\Omega (\\epsilon m)$ on a graph with $m$ edges to be determined correctly with probability greater than $(1+\\epsilon)/2$."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1404.1323","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-04T17:50:49Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"ecbc2159d6c9730b62a726c0b63d73911b25ecdcc088b38a94ef82ae0c32a2d6","abstract_canon_sha256":"29b3399042cb57d346fe676fc1777b56eb26a64b65a2e2534c23607fc39efa55"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:39.069936Z","signature_b64":"V949eWY2fPRojYcXITbExxRZ6an2GnnXWflqlGD9XIMKu4g81sZt+XgalvO39uaT5xuvgdp2IENWMOd02ICRDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"999394f72f193e3d5d1fab3808e06015cacea215ae7d8007860dead131cd5190","last_reissued_at":"2026-05-18T02:54:39.069335Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:39.069335Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower bounds for testing digraph connectivity with one-pass streaming algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Claire Mathieu, Glencora Borradaile, Theresa Migler","submitted_at":"2014-04-04T17:50:49Z","abstract_excerpt":"In this note, we show that three graph properties - strong connectivity, acyclicity, and reachability from a vertex $s$ to all vertices - each require a working memory of $\\Omega (\\epsilon m)$ on a graph with $m$ edges to be determined correctly with probability greater than $(1+\\epsilon)/2$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.1323","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":""},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1404.1323","created_at":"2026-05-18T02:54:39.069442+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.1323v2","created_at":"2026-05-18T02:54:39.069442+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.1323","created_at":"2026-05-18T02:54:39.069442+00:00"},{"alias_kind":"pith_short_12","alias_value":"TGJZJ5ZPDE7D","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"TGJZJ5ZPDE7D2XI7","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"TGJZJ5ZP","created_at":"2026-05-18T12:28:49.207871+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TGJZJ5ZPDE7D2XI7VM4ARYDACX","json":"https://pith.science/pith/TGJZJ5ZPDE7D2XI7VM4ARYDACX.json","graph_json":"https://pith.science/api/pith-number/TGJZJ5ZPDE7D2XI7VM4ARYDACX/graph.json","events_json":"https://pith.science/api/pith-number/TGJZJ5ZPDE7D2XI7VM4ARYDACX/events.json","paper":"https://pith.science/paper/TGJZJ5ZP"},"agent_actions":{"view_html":"https://pith.science/pith/TGJZJ5ZPDE7D2XI7VM4ARYDACX","download_json":"https://pith.science/pith/TGJZJ5ZPDE7D2XI7VM4ARYDACX.json","view_paper":"https://pith.science/paper/TGJZJ5ZP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.1323&json=true","fetch_graph":"https://pith.science/api/pith-number/TGJZJ5ZPDE7D2XI7VM4ARYDACX/graph.json","fetch_events":"https://pith.science/api/pith-number/TGJZJ5ZPDE7D2XI7VM4ARYDACX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TGJZJ5ZPDE7D2XI7VM4ARYDACX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TGJZJ5ZPDE7D2XI7VM4ARYDACX/action/storage_attestation","attest_author":"https://pith.science/pith/TGJZJ5ZPDE7D2XI7VM4ARYDACX/action/author_attestation","sign_citation":"https://pith.science/pith/TGJZJ5ZPDE7D2XI7VM4ARYDACX/action/citation_signature","submit_replication":"https://pith.science/pith/TGJZJ5ZPDE7D2XI7VM4ARYDACX/action/replication_record"}},"created_at":"2026-05-18T02:54:39.069442+00:00","updated_at":"2026-05-18T02:54:39.069442+00:00"}