{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:GZMNRRP45UM37O6RDI4TYWFUBM","short_pith_number":"pith:GZMNRRP4","schema_version":"1.0","canonical_sha256":"3658d8c5fced19bfbbd11a393c58b40b0f8e82a5fc9dd2808494644c3597b666","source":{"kind":"arxiv","id":"1102.5527","version":1},"attestation_state":"computed","paper":{"title":"Permutation Complexity and the Letter Doubling Map","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Steven Widmer","submitted_at":"2011-02-27T17:46:21Z","abstract_excerpt":"Given a countable set X (usually taken to be N or Z), an infinite permutation $\\pi$ of X is a linear ordering $<_\\pi$ of X. This paper investigates the combinatorial complexity of infinite permutations on N associated with the image of uniformly recurrent aperiodic binary words under the letter doubling map. An upper bound for the complexity is found for general words, and a formula for the complexity is established for the Sturmian words and the Thue-Morse word."},"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":"1102.5527","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-27T17:46:21Z","cross_cats_sorted":[],"title_canon_sha256":"34d9599313f4a194d604b0f09adec43616e2310bf24525ed10b310594ccdb498","abstract_canon_sha256":"13839042ae30ba1ab692f68162a6adcc78a758f450ac29e8e1b0128112b4e9fb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:27:46.682689Z","signature_b64":"+h8KEN7yld4T3z+IZl/2EFiC1BO1lLOlBwqSzCI4TUXJPOpgsJ7938Xyim8d/9qWIZEv172Ld+znHfURno+oBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3658d8c5fced19bfbbd11a393c58b40b0f8e82a5fc9dd2808494644c3597b666","last_reissued_at":"2026-05-18T04:27:46.681918Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:27:46.681918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Permutation Complexity and the Letter Doubling Map","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Steven Widmer","submitted_at":"2011-02-27T17:46:21Z","abstract_excerpt":"Given a countable set X (usually taken to be N or Z), an infinite permutation $\\pi$ of X is a linear ordering $<_\\pi$ of X. This paper investigates the combinatorial complexity of infinite permutations on N associated with the image of uniformly recurrent aperiodic binary words under the letter doubling map. An upper bound for the complexity is found for general words, and a formula for the complexity is established for the Sturmian words and the Thue-Morse word."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.5527","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":"1102.5527","created_at":"2026-05-18T04:27:46.682063+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.5527v1","created_at":"2026-05-18T04:27:46.682063+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.5527","created_at":"2026-05-18T04:27:46.682063+00:00"},{"alias_kind":"pith_short_12","alias_value":"GZMNRRP45UM3","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_16","alias_value":"GZMNRRP45UM37O6R","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_8","alias_value":"GZMNRRP4","created_at":"2026-05-18T12:26:30.835961+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/GZMNRRP45UM37O6RDI4TYWFUBM","json":"https://pith.science/pith/GZMNRRP45UM37O6RDI4TYWFUBM.json","graph_json":"https://pith.science/api/pith-number/GZMNRRP45UM37O6RDI4TYWFUBM/graph.json","events_json":"https://pith.science/api/pith-number/GZMNRRP45UM37O6RDI4TYWFUBM/events.json","paper":"https://pith.science/paper/GZMNRRP4"},"agent_actions":{"view_html":"https://pith.science/pith/GZMNRRP45UM37O6RDI4TYWFUBM","download_json":"https://pith.science/pith/GZMNRRP45UM37O6RDI4TYWFUBM.json","view_paper":"https://pith.science/paper/GZMNRRP4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.5527&json=true","fetch_graph":"https://pith.science/api/pith-number/GZMNRRP45UM37O6RDI4TYWFUBM/graph.json","fetch_events":"https://pith.science/api/pith-number/GZMNRRP45UM37O6RDI4TYWFUBM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GZMNRRP45UM37O6RDI4TYWFUBM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GZMNRRP45UM37O6RDI4TYWFUBM/action/storage_attestation","attest_author":"https://pith.science/pith/GZMNRRP45UM37O6RDI4TYWFUBM/action/author_attestation","sign_citation":"https://pith.science/pith/GZMNRRP45UM37O6RDI4TYWFUBM/action/citation_signature","submit_replication":"https://pith.science/pith/GZMNRRP45UM37O6RDI4TYWFUBM/action/replication_record"}},"created_at":"2026-05-18T04:27:46.682063+00:00","updated_at":"2026-05-18T04:27:46.682063+00:00"}