{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:NRSB3URF7AEAWOYBGQ4MQIMHSB","short_pith_number":"pith:NRSB3URF","schema_version":"1.0","canonical_sha256":"6c641dd225f8080b3b013438c8218790708f676a7afa6e7bfa440b1d5be1e586","source":{"kind":"arxiv","id":"1502.07870","version":1},"attestation_state":"computed","paper":{"title":"Inferring an Indeterminate String from a Prefix Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ali Alatabbi, M. Sohel Rahman, W. F. Smyth","submitted_at":"2015-02-27T11:59:01Z","abstract_excerpt":"An \\itbf{indeterminate string} (or, more simply, just a \\itbf{string}) $\\s{x} = \\s{x}[1..n]$ on an alphabet $\\Sigma$ is a sequence of nonempty subsets of $\\Sigma$. We say that $\\s{x}[i_1]$ and $\\s{x}[i_2]$ \\itbf{match} (written $\\s{x}[i_1] \\match \\s{x}[i_2]$) if and only if $\\s{x}[i_1] \\cap \\s{x}[i_2] \\ne \\emptyset$. A \\itbf{feasible array} is an array $\\s{y} = \\s{y}[1..n]$ of integers such that $\\s{y}[1] = n$ and for every $i \\in 2..n$, $\\s{y}[i] \\in 0..n\\- i\\+ 1$. A \\itbf{prefix table} of a string $\\s{x}$ is an array $\\s{\\pi} = \\s{\\pi}[1..n]$ of integers such that, for every $i \\in 1..n$, $\\"},"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":"1502.07870","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-27T11:59:01Z","cross_cats_sorted":[],"title_canon_sha256":"acfab25c505265f50ee7953327224b700affffa9421354684bee4571e6c85480","abstract_canon_sha256":"087665b0be52731f9352ac4219a7c1f3a99fb9195acd8ec3a6c133f949278ba9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:01.961980Z","signature_b64":"EKumQ1t9NdbsmO8HsI8AmFryq1k7D2xV/Nyl7CKV7MIg3ezw3M2cCV9+WQHk3Bh7UnwkisdUDrW9HiqbI0sKDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c641dd225f8080b3b013438c8218790708f676a7afa6e7bfa440b1d5be1e586","last_reissued_at":"2026-05-18T02:26:01.961401Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:01.961401Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Inferring an Indeterminate String from a Prefix Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ali Alatabbi, M. Sohel Rahman, W. F. Smyth","submitted_at":"2015-02-27T11:59:01Z","abstract_excerpt":"An \\itbf{indeterminate string} (or, more simply, just a \\itbf{string}) $\\s{x} = \\s{x}[1..n]$ on an alphabet $\\Sigma$ is a sequence of nonempty subsets of $\\Sigma$. We say that $\\s{x}[i_1]$ and $\\s{x}[i_2]$ \\itbf{match} (written $\\s{x}[i_1] \\match \\s{x}[i_2]$) if and only if $\\s{x}[i_1] \\cap \\s{x}[i_2] \\ne \\emptyset$. A \\itbf{feasible array} is an array $\\s{y} = \\s{y}[1..n]$ of integers such that $\\s{y}[1] = n$ and for every $i \\in 2..n$, $\\s{y}[i] \\in 0..n\\- i\\+ 1$. A \\itbf{prefix table} of a string $\\s{x}$ is an array $\\s{\\pi} = \\s{\\pi}[1..n]$ of integers such that, for every $i \\in 1..n$, $\\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.07870","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":"1502.07870","created_at":"2026-05-18T02:26:01.961488+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.07870v1","created_at":"2026-05-18T02:26:01.961488+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.07870","created_at":"2026-05-18T02:26:01.961488+00:00"},{"alias_kind":"pith_short_12","alias_value":"NRSB3URF7AEA","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_16","alias_value":"NRSB3URF7AEAWOYB","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_8","alias_value":"NRSB3URF","created_at":"2026-05-18T12:29:34.919912+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/NRSB3URF7AEAWOYBGQ4MQIMHSB","json":"https://pith.science/pith/NRSB3URF7AEAWOYBGQ4MQIMHSB.json","graph_json":"https://pith.science/api/pith-number/NRSB3URF7AEAWOYBGQ4MQIMHSB/graph.json","events_json":"https://pith.science/api/pith-number/NRSB3URF7AEAWOYBGQ4MQIMHSB/events.json","paper":"https://pith.science/paper/NRSB3URF"},"agent_actions":{"view_html":"https://pith.science/pith/NRSB3URF7AEAWOYBGQ4MQIMHSB","download_json":"https://pith.science/pith/NRSB3URF7AEAWOYBGQ4MQIMHSB.json","view_paper":"https://pith.science/paper/NRSB3URF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.07870&json=true","fetch_graph":"https://pith.science/api/pith-number/NRSB3URF7AEAWOYBGQ4MQIMHSB/graph.json","fetch_events":"https://pith.science/api/pith-number/NRSB3URF7AEAWOYBGQ4MQIMHSB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NRSB3URF7AEAWOYBGQ4MQIMHSB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NRSB3URF7AEAWOYBGQ4MQIMHSB/action/storage_attestation","attest_author":"https://pith.science/pith/NRSB3URF7AEAWOYBGQ4MQIMHSB/action/author_attestation","sign_citation":"https://pith.science/pith/NRSB3URF7AEAWOYBGQ4MQIMHSB/action/citation_signature","submit_replication":"https://pith.science/pith/NRSB3URF7AEAWOYBGQ4MQIMHSB/action/replication_record"}},"created_at":"2026-05-18T02:26:01.961488+00:00","updated_at":"2026-05-18T02:26:01.961488+00:00"}