{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:7TTOZUY6VOQOV2M6D2GEBGDXRL","short_pith_number":"pith:7TTOZUY6","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"},"canonical_sha256":"fce6ecd31eaba0eae99e1e8c4098778acf650729ebafb4984ef16b2496c39664","source":{"kind":"arxiv","id":"0910.3503","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0910.3503","created_at":"2026-05-18T04:15:06Z"},{"alias_kind":"arxiv_version","alias_value":"0910.3503v2","created_at":"2026-05-18T04:15:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0910.3503","created_at":"2026-05-18T04:15:06Z"},{"alias_kind":"pith_short_12","alias_value":"7TTOZUY6VOQO","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"7TTOZUY6VOQOV2M6","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"7TTOZUY6","created_at":"2026-05-18T12:25:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:7TTOZUY6VOQOV2M6D2GEBGDXRL","target":"record","payload":{"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"},"canonical_sha256":"fce6ecd31eaba0eae99e1e8c4098778acf650729ebafb4984ef16b2496c39664","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"},"source_kind":"arxiv","source_id":"0910.3503","source_version":2,"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-05-18T04:15:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qEGGKZoRYkKouiHIs2XYb1deJ7WBGYed+TcXWePU4gTKpf29CnsXHAye+FJhwHpV9M5zgoTjURXamzLS+MB2Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T23:35:09.563545Z"},"content_sha256":"66fcb02972d9cf9ad83a6404aadae9db6f7826b44374c73e50d259bcd06ca8f7","schema_version":"1.0","event_id":"sha256:66fcb02972d9cf9ad83a6404aadae9db6f7826b44374c73e50d259bcd06ca8f7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:7TTOZUY6VOQOV2M6D2GEBGDXRL","target":"graph","payload":{"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"},"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-05-18T04:15:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/i5WcFOd7ooLnTqcv+8rIE6if2nauUzj4n8eOQK7mCRRSrCrqVivuT7Q+agkARgVym0RrS+1V5gG6msaAzYeBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T23:35:09.564306Z"},"content_sha256":"aa8277fd5eceef5b1886409965b7e843d6d061b24dc4d248bf0fc850bb0fa89e","schema_version":"1.0","event_id":"sha256:aa8277fd5eceef5b1886409965b7e843d6d061b24dc4d248bf0fc850bb0fa89e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7TTOZUY6VOQOV2M6D2GEBGDXRL/bundle.json","state_url":"https://pith.science/pith/7TTOZUY6VOQOV2M6D2GEBGDXRL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7TTOZUY6VOQOV2M6D2GEBGDXRL/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-06-11T23:35:09Z","links":{"resolver":"https://pith.science/pith/7TTOZUY6VOQOV2M6D2GEBGDXRL","bundle":"https://pith.science/pith/7TTOZUY6VOQOV2M6D2GEBGDXRL/bundle.json","state":"https://pith.science/pith/7TTOZUY6VOQOV2M6D2GEBGDXRL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7TTOZUY6VOQOV2M6D2GEBGDXRL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:7TTOZUY6VOQOV2M6D2GEBGDXRL","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":"78e004609808b4f89aed6ea34d05cffb206c8fc37b6bd74782957edf586b3d18","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-10-19T10:06:34Z","title_canon_sha256":"afa39b77e3e2564512f5daecee1647b08ec4604710733c3d75fd08f5d768b916"},"schema_version":"1.0","source":{"id":"0910.3503","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0910.3503","created_at":"2026-05-18T04:15:06Z"},{"alias_kind":"arxiv_version","alias_value":"0910.3503v2","created_at":"2026-05-18T04:15:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0910.3503","created_at":"2026-05-18T04:15:06Z"},{"alias_kind":"pith_short_12","alias_value":"7TTOZUY6VOQO","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"7TTOZUY6VOQOV2M6","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"7TTOZUY6","created_at":"2026-05-18T12:25:58Z"}],"graph_snapshots":[{"event_id":"sha256:aa8277fd5eceef5b1886409965b7e843d6d061b24dc4d248bf0fc850bb0fa89e","target":"graph","created_at":"2026-05-18T04:15:06Z","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"},"paper":{"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","authors_text":"Benjamin A. Burton","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-10-19T10:06:34Z","title":"Searching a bitstream in linear time for the longest substring of any given density"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0910.3503","kind":"arxiv","version":2},"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:66fcb02972d9cf9ad83a6404aadae9db6f7826b44374c73e50d259bcd06ca8f7","target":"record","created_at":"2026-05-18T04:15:06Z","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":"78e004609808b4f89aed6ea34d05cffb206c8fc37b6bd74782957edf586b3d18","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-10-19T10:06:34Z","title_canon_sha256":"afa39b77e3e2564512f5daecee1647b08ec4604710733c3d75fd08f5d768b916"},"schema_version":"1.0","source":{"id":"0910.3503","kind":"arxiv","version":2}},"canonical_sha256":"fce6ecd31eaba0eae99e1e8c4098778acf650729ebafb4984ef16b2496c39664","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fce6ecd31eaba0eae99e1e8c4098778acf650729ebafb4984ef16b2496c39664","first_computed_at":"2026-05-18T04:15:06.811962Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:15:06.811962Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vGmPmwzhBOOAhCLIStbSb9mYyU1fB27k47pZN8tGW3648q1743cfq9MEIhwAbXvm9TWwHcxVCCjA1UbcQDvhCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:15:06.812669Z","signed_message":"canonical_sha256_bytes"},"source_id":"0910.3503","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:66fcb02972d9cf9ad83a6404aadae9db6f7826b44374c73e50d259bcd06ca8f7","sha256:aa8277fd5eceef5b1886409965b7e843d6d061b24dc4d248bf0fc850bb0fa89e"],"state_sha256":"4abf9bb3ee848f7570341b07f5dcaef0e7dd2eba7ea63c40545e83f12c557f09"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+3akCqgIsDa/EPt/pwq1+mK3QsRBVjHLGRmc7zqs2NUV/HjWgZ3GmokEYGok+SQv80JvZWO8zHDpI7XpxxZ8DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T23:35:09.569094Z","bundle_sha256":"ab18819bb3eb80c7e51e317770d7c53d92213e322d363c5838d719eb90f4da27"}}