{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:5C7KUT7HCGI7ZNTBEBOQ4U5YOW","short_pith_number":"pith:5C7KUT7H","schema_version":"1.0","canonical_sha256":"e8beaa4fe71191fcb661205d0e53b875a4a1e79e27986b1d48d4af8a5e995549","source":{"kind":"arxiv","id":"1406.3289","version":1},"attestation_state":"computed","paper":{"title":"Indeterminate Strings, Prefix Arrays & Undirected Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Manolis Christodoulakis, P. J. Ryan, Shu Wang, W. F. Smyth","submitted_at":"2014-06-12T17:07:36Z","abstract_excerpt":"An integer array y = y[1..n] is said to be feasible if and only if y[1] = n and, for every i \\in 2..n, i \\le i+y[i] \\le n+1. A string is said to be indeterminate if and only if at least one of its elements is a subset of cardinality greater than one of a given alphabet Sigma; otherwise it is said to be regular. A feasible array y is said to be regular if and only if it is the prefix array of some regular string. We show using a graph model that every feasible array of integers is a prefix array of some (indeterminate or regular) string, and for regular strings corresponding to y, we use the mo"},"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":"1406.3289","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-06-12T17:07:36Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"d41b126d252db2441fad290fbc56de69cab616f2b607ee82a8b4f45db3217ce1","abstract_canon_sha256":"f911b8ab68851f87840b937c0e96d11d1108efa2f41bd6750573de239f6886ff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:52.671857Z","signature_b64":"el+1KaKTyjq7wgHYDi79MuI2SHl9hlfTvEPWLX9ofNgktaASRB2IfO1lQryDT+6FFVRV3qRGMuDP23QmbEKMBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e8beaa4fe71191fcb661205d0e53b875a4a1e79e27986b1d48d4af8a5e995549","last_reissued_at":"2026-05-18T02:49:52.671359Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:52.671359Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Indeterminate Strings, Prefix Arrays & Undirected Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Manolis Christodoulakis, P. J. Ryan, Shu Wang, W. F. Smyth","submitted_at":"2014-06-12T17:07:36Z","abstract_excerpt":"An integer array y = y[1..n] is said to be feasible if and only if y[1] = n and, for every i \\in 2..n, i \\le i+y[i] \\le n+1. A string is said to be indeterminate if and only if at least one of its elements is a subset of cardinality greater than one of a given alphabet Sigma; otherwise it is said to be regular. A feasible array y is said to be regular if and only if it is the prefix array of some regular string. We show using a graph model that every feasible array of integers is a prefix array of some (indeterminate or regular) string, and for regular strings corresponding to y, we use the mo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.3289","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":"1406.3289","created_at":"2026-05-18T02:49:52.671440+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.3289v1","created_at":"2026-05-18T02:49:52.671440+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.3289","created_at":"2026-05-18T02:49:52.671440+00:00"},{"alias_kind":"pith_short_12","alias_value":"5C7KUT7HCGI7","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"5C7KUT7HCGI7ZNTB","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"5C7KUT7H","created_at":"2026-05-18T12:28:14.216126+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/5C7KUT7HCGI7ZNTBEBOQ4U5YOW","json":"https://pith.science/pith/5C7KUT7HCGI7ZNTBEBOQ4U5YOW.json","graph_json":"https://pith.science/api/pith-number/5C7KUT7HCGI7ZNTBEBOQ4U5YOW/graph.json","events_json":"https://pith.science/api/pith-number/5C7KUT7HCGI7ZNTBEBOQ4U5YOW/events.json","paper":"https://pith.science/paper/5C7KUT7H"},"agent_actions":{"view_html":"https://pith.science/pith/5C7KUT7HCGI7ZNTBEBOQ4U5YOW","download_json":"https://pith.science/pith/5C7KUT7HCGI7ZNTBEBOQ4U5YOW.json","view_paper":"https://pith.science/paper/5C7KUT7H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.3289&json=true","fetch_graph":"https://pith.science/api/pith-number/5C7KUT7HCGI7ZNTBEBOQ4U5YOW/graph.json","fetch_events":"https://pith.science/api/pith-number/5C7KUT7HCGI7ZNTBEBOQ4U5YOW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5C7KUT7HCGI7ZNTBEBOQ4U5YOW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5C7KUT7HCGI7ZNTBEBOQ4U5YOW/action/storage_attestation","attest_author":"https://pith.science/pith/5C7KUT7HCGI7ZNTBEBOQ4U5YOW/action/author_attestation","sign_citation":"https://pith.science/pith/5C7KUT7HCGI7ZNTBEBOQ4U5YOW/action/citation_signature","submit_replication":"https://pith.science/pith/5C7KUT7HCGI7ZNTBEBOQ4U5YOW/action/replication_record"}},"created_at":"2026-05-18T02:49:52.671440+00:00","updated_at":"2026-05-18T02:49:52.671440+00:00"}