{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ZYF2EPXMH7Z3XFQZGEHCM5PRIH","short_pith_number":"pith:ZYF2EPXM","schema_version":"1.0","canonical_sha256":"ce0ba23eec3ff3bb9619310e2675f141c5eb2ffc79b1aed48189bb7722e75806","source":{"kind":"arxiv","id":"1808.00674","version":1},"attestation_state":"computed","paper":{"title":"Reconstructing Strings from Substrings: Optimal Randomized and Average-Case Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Junichi Teruyama, Kazuo Iwama, Shuntaro Tsuyama","submitted_at":"2018-08-02T05:53:17Z","abstract_excerpt":"The problem called \"String reconstruction from substrings\" is a mathematical model of sequencing by hybridization that plays an important role in DNA sequencing. In this problem, we are given a blackbox oracle holding an unknown string ${\\mathcal X}$ and are required to obtain (reconstruct) ${\\mathcal X}$ through \"substring queries\" $Q(S)$. $Q(S)$ is given to the oracle with a string $S$ and the answer of the oracle is Yes if ${\\mathcal X}$ includes $S$ as a substring and No otherwise. Our goal is to minimize the number of queries for the reconstruction. In this paper, we deal with only binary"},"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":"1808.00674","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-02T05:53:17Z","cross_cats_sorted":[],"title_canon_sha256":"216523d6e3250bc643805b8e7fd065471efb25cd48f19296a91307746855da98","abstract_canon_sha256":"5fb5a277b384c75b2d54dfe25b80276a1a2182d454e45f6c772d088311527731"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:04.523368Z","signature_b64":"ubMw+i1+Iw6krVRqWvS76I6/eUfOxylncMIU17gWvFzAtGWql1Jbxy3dEatY5DLwyVjCet5zVy4Y4drCaJSpBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce0ba23eec3ff3bb9619310e2675f141c5eb2ffc79b1aed48189bb7722e75806","last_reissued_at":"2026-05-18T00:09:04.522686Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:04.522686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reconstructing Strings from Substrings: Optimal Randomized and Average-Case Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Junichi Teruyama, Kazuo Iwama, Shuntaro Tsuyama","submitted_at":"2018-08-02T05:53:17Z","abstract_excerpt":"The problem called \"String reconstruction from substrings\" is a mathematical model of sequencing by hybridization that plays an important role in DNA sequencing. In this problem, we are given a blackbox oracle holding an unknown string ${\\mathcal X}$ and are required to obtain (reconstruct) ${\\mathcal X}$ through \"substring queries\" $Q(S)$. $Q(S)$ is given to the oracle with a string $S$ and the answer of the oracle is Yes if ${\\mathcal X}$ includes $S$ as a substring and No otherwise. Our goal is to minimize the number of queries for the reconstruction. In this paper, we deal with only binary"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.00674","kind":"arxiv","version":1},"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":"1808.00674","created_at":"2026-05-18T00:09:04.522789+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.00674v1","created_at":"2026-05-18T00:09:04.522789+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.00674","created_at":"2026-05-18T00:09:04.522789+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZYF2EPXMH7Z3","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZYF2EPXMH7Z3XFQZ","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZYF2EPXM","created_at":"2026-05-18T12:33:07.085635+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/ZYF2EPXMH7Z3XFQZGEHCM5PRIH","json":"https://pith.science/pith/ZYF2EPXMH7Z3XFQZGEHCM5PRIH.json","graph_json":"https://pith.science/api/pith-number/ZYF2EPXMH7Z3XFQZGEHCM5PRIH/graph.json","events_json":"https://pith.science/api/pith-number/ZYF2EPXMH7Z3XFQZGEHCM5PRIH/events.json","paper":"https://pith.science/paper/ZYF2EPXM"},"agent_actions":{"view_html":"https://pith.science/pith/ZYF2EPXMH7Z3XFQZGEHCM5PRIH","download_json":"https://pith.science/pith/ZYF2EPXMH7Z3XFQZGEHCM5PRIH.json","view_paper":"https://pith.science/paper/ZYF2EPXM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.00674&json=true","fetch_graph":"https://pith.science/api/pith-number/ZYF2EPXMH7Z3XFQZGEHCM5PRIH/graph.json","fetch_events":"https://pith.science/api/pith-number/ZYF2EPXMH7Z3XFQZGEHCM5PRIH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZYF2EPXMH7Z3XFQZGEHCM5PRIH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZYF2EPXMH7Z3XFQZGEHCM5PRIH/action/storage_attestation","attest_author":"https://pith.science/pith/ZYF2EPXMH7Z3XFQZGEHCM5PRIH/action/author_attestation","sign_citation":"https://pith.science/pith/ZYF2EPXMH7Z3XFQZGEHCM5PRIH/action/citation_signature","submit_replication":"https://pith.science/pith/ZYF2EPXMH7Z3XFQZGEHCM5PRIH/action/replication_record"}},"created_at":"2026-05-18T00:09:04.522789+00:00","updated_at":"2026-05-18T00:09:04.522789+00:00"}