{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:LPEGRBIKLH5O6462EBK2YVTW4F","short_pith_number":"pith:LPEGRBIK","schema_version":"1.0","canonical_sha256":"5bc868850a59faef73da2055ac5676e15f900459fcd426f76b9644aeb04d92cd","source":{"kind":"arxiv","id":"1108.2758","version":1},"attestation_state":"computed","paper":{"title":"Absoluteness of subword inequality is undecidable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Shinnosuke Seki","submitted_at":"2011-08-13T04:59:10Z","abstract_excerpt":"Mateescu, Salomaa, and Yu asked: is it decidable whether a given subword history assumes only non-negative values for all words over a given alphabet. In this paper, we solve this open problem by proving that this problem is undecidable even under stronger conditions than supposed originally."},"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":"1108.2758","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-08-13T04:59:10Z","cross_cats_sorted":[],"title_canon_sha256":"c3f12afd8cb1fc1385e6fefec4ac74befcaa2ddf44bc62eed799c97a1a73e815","abstract_canon_sha256":"c898fb1a4e05dd87118b8a5a8fdb866d7f798ff3f7bda8946b1fb9a39fe4deaa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:15:35.662482Z","signature_b64":"WPBHX0zAxz6C5NzXybDOZ3YY5wHN7AZ6iJtyOZT1KEn1Us8sU2Kkw2iQGENevZbq+BMoubYL55v1U80PTYW+Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5bc868850a59faef73da2055ac5676e15f900459fcd426f76b9644aeb04d92cd","last_reissued_at":"2026-05-18T04:15:35.662031Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:15:35.662031Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Absoluteness of subword inequality is undecidable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Shinnosuke Seki","submitted_at":"2011-08-13T04:59:10Z","abstract_excerpt":"Mateescu, Salomaa, and Yu asked: is it decidable whether a given subword history assumes only non-negative values for all words over a given alphabet. In this paper, we solve this open problem by proving that this problem is undecidable even under stronger conditions than supposed originally."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.2758","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":"1108.2758","created_at":"2026-05-18T04:15:35.662114+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.2758v1","created_at":"2026-05-18T04:15:35.662114+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.2758","created_at":"2026-05-18T04:15:35.662114+00:00"},{"alias_kind":"pith_short_12","alias_value":"LPEGRBIKLH5O","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_16","alias_value":"LPEGRBIKLH5O6462","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_8","alias_value":"LPEGRBIK","created_at":"2026-05-18T12:26:34.985390+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/LPEGRBIKLH5O6462EBK2YVTW4F","json":"https://pith.science/pith/LPEGRBIKLH5O6462EBK2YVTW4F.json","graph_json":"https://pith.science/api/pith-number/LPEGRBIKLH5O6462EBK2YVTW4F/graph.json","events_json":"https://pith.science/api/pith-number/LPEGRBIKLH5O6462EBK2YVTW4F/events.json","paper":"https://pith.science/paper/LPEGRBIK"},"agent_actions":{"view_html":"https://pith.science/pith/LPEGRBIKLH5O6462EBK2YVTW4F","download_json":"https://pith.science/pith/LPEGRBIKLH5O6462EBK2YVTW4F.json","view_paper":"https://pith.science/paper/LPEGRBIK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.2758&json=true","fetch_graph":"https://pith.science/api/pith-number/LPEGRBIKLH5O6462EBK2YVTW4F/graph.json","fetch_events":"https://pith.science/api/pith-number/LPEGRBIKLH5O6462EBK2YVTW4F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LPEGRBIKLH5O6462EBK2YVTW4F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LPEGRBIKLH5O6462EBK2YVTW4F/action/storage_attestation","attest_author":"https://pith.science/pith/LPEGRBIKLH5O6462EBK2YVTW4F/action/author_attestation","sign_citation":"https://pith.science/pith/LPEGRBIKLH5O6462EBK2YVTW4F/action/citation_signature","submit_replication":"https://pith.science/pith/LPEGRBIKLH5O6462EBK2YVTW4F/action/replication_record"}},"created_at":"2026-05-18T04:15:35.662114+00:00","updated_at":"2026-05-18T04:15:35.662114+00:00"}