{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:7TTOZUY6VOQOV2M6D2GEBGDXRL","short_pith_number":"pith:7TTOZUY6","schema_version":"1.0","canonical_sha256":"fce6ecd31eaba0eae99e1e8c4098778acf650729ebafb4984ef16b2496c39664","source":{"kind":"arxiv","id":"0910.3503","version":2},"attestation_state":"computed","paper":{"title":"Searching a bitstream in linear time for the longest substring of any given density","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Benjamin A. Burton","submitted_at":"2009-10-19T10:06:34Z","abstract_excerpt":"Given an arbitrary bitstream, we consider the problem of finding the longest substring whose ratio of ones to zeroes equals a given value. The central result of this paper is an algorithm that solves this problem in linear time. The method involves (i) reformulating the problem as a constrained walk through a sparse matrix, and then (ii) developing a data structure for this sparse matrix that allows us to perform each step of the walk in amortised constant time. We also give a linear time algorithm to find the longest substring whose ratio of ones to zeroes is bounded below by a given value. B"},"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":"0910.3503","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-10-19T10:06:34Z","cross_cats_sorted":[],"title_canon_sha256":"afa39b77e3e2564512f5daecee1647b08ec4604710733c3d75fd08f5d768b916","abstract_canon_sha256":"78e004609808b4f89aed6ea34d05cffb206c8fc37b6bd74782957edf586b3d18"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:15:06.812669Z","signature_b64":"vGmPmwzhBOOAhCLIStbSb9mYyU1fB27k47pZN8tGW3648q1743cfq9MEIhwAbXvm9TWwHcxVCCjA1UbcQDvhCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fce6ecd31eaba0eae99e1e8c4098778acf650729ebafb4984ef16b2496c39664","last_reissued_at":"2026-05-18T04:15:06.811962Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:15:06.811962Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Searching a bitstream in linear time for the longest substring of any given density","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Benjamin A. Burton","submitted_at":"2009-10-19T10:06:34Z","abstract_excerpt":"Given an arbitrary bitstream, we consider the problem of finding the longest substring whose ratio of ones to zeroes equals a given value. The central result of this paper is an algorithm that solves this problem in linear time. The method involves (i) reformulating the problem as a constrained walk through a sparse matrix, and then (ii) developing a data structure for this sparse matrix that allows us to perform each step of the walk in amortised constant time. We also give a linear time algorithm to find the longest substring whose ratio of ones to zeroes is bounded below by a given value. B"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0910.3503","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":"0910.3503","created_at":"2026-05-18T04:15:06.812093+00:00"},{"alias_kind":"arxiv_version","alias_value":"0910.3503v2","created_at":"2026-05-18T04:15:06.812093+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0910.3503","created_at":"2026-05-18T04:15:06.812093+00:00"},{"alias_kind":"pith_short_12","alias_value":"7TTOZUY6VOQO","created_at":"2026-05-18T12:25:58.837520+00:00"},{"alias_kind":"pith_short_16","alias_value":"7TTOZUY6VOQOV2M6","created_at":"2026-05-18T12:25:58.837520+00:00"},{"alias_kind":"pith_short_8","alias_value":"7TTOZUY6","created_at":"2026-05-18T12:25:58.837520+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/7TTOZUY6VOQOV2M6D2GEBGDXRL","json":"https://pith.science/pith/7TTOZUY6VOQOV2M6D2GEBGDXRL.json","graph_json":"https://pith.science/api/pith-number/7TTOZUY6VOQOV2M6D2GEBGDXRL/graph.json","events_json":"https://pith.science/api/pith-number/7TTOZUY6VOQOV2M6D2GEBGDXRL/events.json","paper":"https://pith.science/paper/7TTOZUY6"},"agent_actions":{"view_html":"https://pith.science/pith/7TTOZUY6VOQOV2M6D2GEBGDXRL","download_json":"https://pith.science/pith/7TTOZUY6VOQOV2M6D2GEBGDXRL.json","view_paper":"https://pith.science/paper/7TTOZUY6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0910.3503&json=true","fetch_graph":"https://pith.science/api/pith-number/7TTOZUY6VOQOV2M6D2GEBGDXRL/graph.json","fetch_events":"https://pith.science/api/pith-number/7TTOZUY6VOQOV2M6D2GEBGDXRL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7TTOZUY6VOQOV2M6D2GEBGDXRL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7TTOZUY6VOQOV2M6D2GEBGDXRL/action/storage_attestation","attest_author":"https://pith.science/pith/7TTOZUY6VOQOV2M6D2GEBGDXRL/action/author_attestation","sign_citation":"https://pith.science/pith/7TTOZUY6VOQOV2M6D2GEBGDXRL/action/citation_signature","submit_replication":"https://pith.science/pith/7TTOZUY6VOQOV2M6D2GEBGDXRL/action/replication_record"}},"created_at":"2026-05-18T04:15:06.812093+00:00","updated_at":"2026-05-18T04:15:06.812093+00:00"}