{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:2FQ7JCTFK7ZXIFLOXE2IS2WA5U","short_pith_number":"pith:2FQ7JCTF","schema_version":"1.0","canonical_sha256":"d161f48a6557f374156eb934896ac0ed19ee1a3de991f97f23e5e21868d40b9d","source":{"kind":"arxiv","id":"2211.14229","version":2},"attestation_state":"computed","paper":{"title":"On fractal patterns in Ulam words","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrei Mandelshtam","submitted_at":"2022-11-23T09:43:55Z","abstract_excerpt":"Ulam words are binary words defined recursively as follows: the length-$1$ Ulam words are $0$ and $1$, and a binary word of length $n$ is Ulam if and only if it is expressible uniquely as a concatenation of two shorter, distinct Ulam words. We discover, fully describe, and prove a surprisingly rich structure already in the set of Ulam words containing exactly two $1$'s. In particular, this leads to a complete description of such words and a logarithmic-time algorithm to determine whether a binary word with two $1$'s is Ulam. Along the way, we uncover delicate parity and biperiodicity propertie"},"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":"2211.14229","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-11-23T09:43:55Z","cross_cats_sorted":[],"title_canon_sha256":"d708b5222ec11c0f7ad6fc3a1eb299b6064f07ca255d6f1df45959f954f5649e","abstract_canon_sha256":"23310939160c2bd458121d16253ebe5768bc26413c21e5f4743791f119d7295f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:28:44.540417Z","signature_b64":"VdRfVI0nD6URzNDeT+w5xzknWiRXdryUQn82vPblCFISvCaUYeZXUR5hLaAMdD+ttpXJGq6Hpn4sh44DatqHDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d161f48a6557f374156eb934896ac0ed19ee1a3de991f97f23e5e21868d40b9d","last_reissued_at":"2026-07-05T09:28:44.540063Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:28:44.540063Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On fractal patterns in Ulam words","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrei Mandelshtam","submitted_at":"2022-11-23T09:43:55Z","abstract_excerpt":"Ulam words are binary words defined recursively as follows: the length-$1$ Ulam words are $0$ and $1$, and a binary word of length $n$ is Ulam if and only if it is expressible uniquely as a concatenation of two shorter, distinct Ulam words. We discover, fully describe, and prove a surprisingly rich structure already in the set of Ulam words containing exactly two $1$'s. In particular, this leads to a complete description of such words and a logarithmic-time algorithm to determine whether a binary word with two $1$'s is Ulam. Along the way, we uncover delicate parity and biperiodicity propertie"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.14229","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2211.14229/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2211.14229","created_at":"2026-07-05T09:28:44.540118+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.14229v2","created_at":"2026-07-05T09:28:44.540118+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.14229","created_at":"2026-07-05T09:28:44.540118+00:00"},{"alias_kind":"pith_short_12","alias_value":"2FQ7JCTFK7ZX","created_at":"2026-07-05T09:28:44.540118+00:00"},{"alias_kind":"pith_short_16","alias_value":"2FQ7JCTFK7ZXIFLO","created_at":"2026-07-05T09:28:44.540118+00:00"},{"alias_kind":"pith_short_8","alias_value":"2FQ7JCTF","created_at":"2026-07-05T09:28:44.540118+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.16285","citing_title":"Small gaps in the Ulam sequence","ref_index":15,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2FQ7JCTFK7ZXIFLOXE2IS2WA5U","json":"https://pith.science/pith/2FQ7JCTFK7ZXIFLOXE2IS2WA5U.json","graph_json":"https://pith.science/api/pith-number/2FQ7JCTFK7ZXIFLOXE2IS2WA5U/graph.json","events_json":"https://pith.science/api/pith-number/2FQ7JCTFK7ZXIFLOXE2IS2WA5U/events.json","paper":"https://pith.science/paper/2FQ7JCTF"},"agent_actions":{"view_html":"https://pith.science/pith/2FQ7JCTFK7ZXIFLOXE2IS2WA5U","download_json":"https://pith.science/pith/2FQ7JCTFK7ZXIFLOXE2IS2WA5U.json","view_paper":"https://pith.science/paper/2FQ7JCTF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.14229&json=true","fetch_graph":"https://pith.science/api/pith-number/2FQ7JCTFK7ZXIFLOXE2IS2WA5U/graph.json","fetch_events":"https://pith.science/api/pith-number/2FQ7JCTFK7ZXIFLOXE2IS2WA5U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2FQ7JCTFK7ZXIFLOXE2IS2WA5U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2FQ7JCTFK7ZXIFLOXE2IS2WA5U/action/storage_attestation","attest_author":"https://pith.science/pith/2FQ7JCTFK7ZXIFLOXE2IS2WA5U/action/author_attestation","sign_citation":"https://pith.science/pith/2FQ7JCTFK7ZXIFLOXE2IS2WA5U/action/citation_signature","submit_replication":"https://pith.science/pith/2FQ7JCTFK7ZXIFLOXE2IS2WA5U/action/replication_record"}},"created_at":"2026-07-05T09:28:44.540118+00:00","updated_at":"2026-07-05T09:28:44.540118+00:00"}