{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:P3NVAVFEBNDPMU67VXODNZL52R","short_pith_number":"pith:P3NVAVFE","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"},"canonical_sha256":"7edb5054a40b46f653dfaddc36e57dd446a8743529ff5a1f7ffc1103136c94ee","source":{"kind":"arxiv","id":"1112.0278","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.0278","created_at":"2026-05-18T04:05:26Z"},{"alias_kind":"arxiv_version","alias_value":"1112.0278v2","created_at":"2026-05-18T04:05:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.0278","created_at":"2026-05-18T04:05:26Z"},{"alias_kind":"pith_short_12","alias_value":"P3NVAVFEBNDP","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"P3NVAVFEBNDPMU67","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"P3NVAVFE","created_at":"2026-05-18T12:26:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:P3NVAVFEBNDPMU67VXODNZL52R","target":"record","payload":{"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"},"canonical_sha256":"7edb5054a40b46f653dfaddc36e57dd446a8743529ff5a1f7ffc1103136c94ee","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"},"source_kind":"arxiv","source_id":"1112.0278","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:05:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4bFoFI1pl4s42wLAITVh8AlwSgdlFnH2R4CC+qQy/EqQOGX8efWDqrWdG6qJBhJLkxWXH06BJzGeWh5+0G2fDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T15:40:42.686356Z"},"content_sha256":"acc7642e53e51733ee8a72630a2798fe17b4c87111f47354251dad2ab2dba3da","schema_version":"1.0","event_id":"sha256:acc7642e53e51733ee8a72630a2798fe17b4c87111f47354251dad2ab2dba3da"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:P3NVAVFEBNDPMU67VXODNZL52R","target":"graph","payload":{"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"},"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:05:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ehPlNiRj9F45sv1FWrwWV2Fb4JwQQCxP+sLEBdByLc/V5T5JI2RnSRy3fnyYiFTA3cxhbbrgc7yW8mzjrrPZDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T15:40:42.686708Z"},"content_sha256":"bd989d2fbaa76917cd29be720f049486738dce3e310e3355135e114fa9ec3f44","schema_version":"1.0","event_id":"sha256:bd989d2fbaa76917cd29be720f049486738dce3e310e3355135e114fa9ec3f44"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P3NVAVFEBNDPMU67VXODNZL52R/bundle.json","state_url":"https://pith.science/pith/P3NVAVFEBNDPMU67VXODNZL52R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P3NVAVFEBNDPMU67VXODNZL52R/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-20T15:40:42Z","links":{"resolver":"https://pith.science/pith/P3NVAVFEBNDPMU67VXODNZL52R","bundle":"https://pith.science/pith/P3NVAVFEBNDPMU67VXODNZL52R/bundle.json","state":"https://pith.science/pith/P3NVAVFEBNDPMU67VXODNZL52R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P3NVAVFEBNDPMU67VXODNZL52R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:P3NVAVFEBNDPMU67VXODNZL52R","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":"8654838a879cb346385a726d430a0cd7a4b21dd8a853ced516c946349abdd5e8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-01T19:24:16Z","title_canon_sha256":"3a4b117457a43816535cdd4507127a774ef5ddda7d7537e6f8b876795484e896"},"schema_version":"1.0","source":{"id":"1112.0278","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.0278","created_at":"2026-05-18T04:05:26Z"},{"alias_kind":"arxiv_version","alias_value":"1112.0278v2","created_at":"2026-05-18T04:05:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.0278","created_at":"2026-05-18T04:05:26Z"},{"alias_kind":"pith_short_12","alias_value":"P3NVAVFEBNDP","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"P3NVAVFEBNDPMU67","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"P3NVAVFE","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:bd989d2fbaa76917cd29be720f049486738dce3e310e3355135e114fa9ec3f44","target":"graph","created_at":"2026-05-18T04:05:26Z","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":"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","authors_text":"Chen Yuan, Peng Zhang, Tian-Ming Bu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-01T19:24:16Z","title":"Computing on Binary Strings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.0278","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:acc7642e53e51733ee8a72630a2798fe17b4c87111f47354251dad2ab2dba3da","target":"record","created_at":"2026-05-18T04:05:26Z","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":"8654838a879cb346385a726d430a0cd7a4b21dd8a853ced516c946349abdd5e8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-01T19:24:16Z","title_canon_sha256":"3a4b117457a43816535cdd4507127a774ef5ddda7d7537e6f8b876795484e896"},"schema_version":"1.0","source":{"id":"1112.0278","kind":"arxiv","version":2}},"canonical_sha256":"7edb5054a40b46f653dfaddc36e57dd446a8743529ff5a1f7ffc1103136c94ee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7edb5054a40b46f653dfaddc36e57dd446a8743529ff5a1f7ffc1103136c94ee","first_computed_at":"2026-05-18T04:05:26.723708Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:05:26.723708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Fhwyng0fFCa6Ay1OxfRBLlXoeG8TmnH8uYTM3ZAOakHsizcZlQ8Yh6J/m2V2CGHvmCC1hqk/8jmToDHMKNvlCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:05:26.724388Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.0278","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:acc7642e53e51733ee8a72630a2798fe17b4c87111f47354251dad2ab2dba3da","sha256:bd989d2fbaa76917cd29be720f049486738dce3e310e3355135e114fa9ec3f44"],"state_sha256":"efc8236c00c75cbe865656343e099481b172b98cf6b9d73500391f08a729dab7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MxZJKTA1He3PHFK+ruf3ee7D979U9rcTQ+aE9EFZqsh8wPPEBE6c1erXyz2G04HuIhazovRvG8Oc7FBKuRgNBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T15:40:42.688598Z","bundle_sha256":"d84f5e6ea23935a44f7df4428005efcd9878ecf2e9bdf7081cf95f26fe163331"}}