{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:P3NVAVFEBNDPMU67VXODNZL52R","short_pith_number":"pith:P3NVAVFE","schema_version":"1.0","canonical_sha256":"7edb5054a40b46f653dfaddc36e57dd446a8743529ff5a1f7ffc1103136c94ee","source":{"kind":"arxiv","id":"1112.0278","version":2},"attestation_state":"computed","paper":{"title":"Computing on Binary Strings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Chen Yuan, Peng Zhang, Tian-Ming Bu","submitted_at":"2011-12-01T19:24:16Z","abstract_excerpt":"Many problems in Computer Science can be abstracted to the following question: given a set of objects and rules respectively, which new objects can be produced? In the paper, we consider a succinct version of the question: given a set of binary strings and several operations like conjunction and disjunction, which new binary strings can be generated? Although it is a fundamental problem, to the best of our knowledge, the problem hasn't been studied yet. In this paper, an O(m^2n) algorithm is presented to determine whether a string s is representable by a set W, where n is the number of strings"},"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":"1112.0278","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-01T19:24:16Z","cross_cats_sorted":[],"title_canon_sha256":"3a4b117457a43816535cdd4507127a774ef5ddda7d7537e6f8b876795484e896","abstract_canon_sha256":"8654838a879cb346385a726d430a0cd7a4b21dd8a853ced516c946349abdd5e8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:05:26.724388Z","signature_b64":"Fhwyng0fFCa6Ay1OxfRBLlXoeG8TmnH8uYTM3ZAOakHsizcZlQ8Yh6J/m2V2CGHvmCC1hqk/8jmToDHMKNvlCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7edb5054a40b46f653dfaddc36e57dd446a8743529ff5a1f7ffc1103136c94ee","last_reissued_at":"2026-05-18T04:05:26.723708Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:05:26.723708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing on Binary Strings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Chen Yuan, Peng Zhang, Tian-Ming Bu","submitted_at":"2011-12-01T19:24:16Z","abstract_excerpt":"Many problems in Computer Science can be abstracted to the following question: given a set of objects and rules respectively, which new objects can be produced? In the paper, we consider a succinct version of the question: given a set of binary strings and several operations like conjunction and disjunction, which new binary strings can be generated? Although it is a fundamental problem, to the best of our knowledge, the problem hasn't been studied yet. In this paper, an O(m^2n) algorithm is presented to determine whether a string s is representable by a set W, where n is the number of strings"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.0278","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":"1112.0278","created_at":"2026-05-18T04:05:26.723809+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.0278v2","created_at":"2026-05-18T04:05:26.723809+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.0278","created_at":"2026-05-18T04:05:26.723809+00:00"},{"alias_kind":"pith_short_12","alias_value":"P3NVAVFEBNDP","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_16","alias_value":"P3NVAVFEBNDPMU67","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_8","alias_value":"P3NVAVFE","created_at":"2026-05-18T12:26:39.201973+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/P3NVAVFEBNDPMU67VXODNZL52R","json":"https://pith.science/pith/P3NVAVFEBNDPMU67VXODNZL52R.json","graph_json":"https://pith.science/api/pith-number/P3NVAVFEBNDPMU67VXODNZL52R/graph.json","events_json":"https://pith.science/api/pith-number/P3NVAVFEBNDPMU67VXODNZL52R/events.json","paper":"https://pith.science/paper/P3NVAVFE"},"agent_actions":{"view_html":"https://pith.science/pith/P3NVAVFEBNDPMU67VXODNZL52R","download_json":"https://pith.science/pith/P3NVAVFEBNDPMU67VXODNZL52R.json","view_paper":"https://pith.science/paper/P3NVAVFE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.0278&json=true","fetch_graph":"https://pith.science/api/pith-number/P3NVAVFEBNDPMU67VXODNZL52R/graph.json","fetch_events":"https://pith.science/api/pith-number/P3NVAVFEBNDPMU67VXODNZL52R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P3NVAVFEBNDPMU67VXODNZL52R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P3NVAVFEBNDPMU67VXODNZL52R/action/storage_attestation","attest_author":"https://pith.science/pith/P3NVAVFEBNDPMU67VXODNZL52R/action/author_attestation","sign_citation":"https://pith.science/pith/P3NVAVFEBNDPMU67VXODNZL52R/action/citation_signature","submit_replication":"https://pith.science/pith/P3NVAVFEBNDPMU67VXODNZL52R/action/replication_record"}},"created_at":"2026-05-18T04:05:26.723809+00:00","updated_at":"2026-05-18T04:05:26.723809+00:00"}