{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:GZMNRRP45UM37O6RDI4TYWFUBM","short_pith_number":"pith:GZMNRRP4","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"},"canonical_sha256":"3658d8c5fced19bfbbd11a393c58b40b0f8e82a5fc9dd2808494644c3597b666","source":{"kind":"arxiv","id":"1102.5527","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.5527","created_at":"2026-05-18T04:27:46Z"},{"alias_kind":"arxiv_version","alias_value":"1102.5527v1","created_at":"2026-05-18T04:27:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.5527","created_at":"2026-05-18T04:27:46Z"},{"alias_kind":"pith_short_12","alias_value":"GZMNRRP45UM3","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"GZMNRRP45UM37O6R","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"GZMNRRP4","created_at":"2026-05-18T12:26:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:GZMNRRP45UM37O6RDI4TYWFUBM","target":"record","payload":{"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"},"canonical_sha256":"3658d8c5fced19bfbbd11a393c58b40b0f8e82a5fc9dd2808494644c3597b666","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"},"source_kind":"arxiv","source_id":"1102.5527","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:27:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"46Lw5a0aM8VWps0BcwmAF642UTlUtNIchqmLIEwicJ1pwhBZlm97zJPHhe/rmogCACd0aiHUDp9yk11hoe38BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T19:57:12.757882Z"},"content_sha256":"166549dd65f24b2eaf8cdf8e0c1a6bd726fadefb4ead2e7293ea901999f38357","schema_version":"1.0","event_id":"sha256:166549dd65f24b2eaf8cdf8e0c1a6bd726fadefb4ead2e7293ea901999f38357"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:GZMNRRP45UM37O6RDI4TYWFUBM","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:27:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TIFpykvogIeC/YCFBQY6Tx8hcz+x96zNbffcTGOOyjTTtrIfzwOoZT/er5kYk1OVsRQUJjZdYWUN+TwtxC/DAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T19:57:12.758213Z"},"content_sha256":"0373ae8620ca118f880f102fb4468316aeaeb15b01b8dfbdaf2bb34e19e9b78a","schema_version":"1.0","event_id":"sha256:0373ae8620ca118f880f102fb4468316aeaeb15b01b8dfbdaf2bb34e19e9b78a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GZMNRRP45UM37O6RDI4TYWFUBM/bundle.json","state_url":"https://pith.science/pith/GZMNRRP45UM37O6RDI4TYWFUBM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GZMNRRP45UM37O6RDI4TYWFUBM/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-29T19:57:12Z","links":{"resolver":"https://pith.science/pith/GZMNRRP45UM37O6RDI4TYWFUBM","bundle":"https://pith.science/pith/GZMNRRP45UM37O6RDI4TYWFUBM/bundle.json","state":"https://pith.science/pith/GZMNRRP45UM37O6RDI4TYWFUBM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GZMNRRP45UM37O6RDI4TYWFUBM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:GZMNRRP45UM37O6RDI4TYWFUBM","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"13839042ae30ba1ab692f68162a6adcc78a758f450ac29e8e1b0128112b4e9fb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-27T17:46:21Z","title_canon_sha256":"34d9599313f4a194d604b0f09adec43616e2310bf24525ed10b310594ccdb498"},"schema_version":"1.0","source":{"id":"1102.5527","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.5527","created_at":"2026-05-18T04:27:46Z"},{"alias_kind":"arxiv_version","alias_value":"1102.5527v1","created_at":"2026-05-18T04:27:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.5527","created_at":"2026-05-18T04:27:46Z"},{"alias_kind":"pith_short_12","alias_value":"GZMNRRP45UM3","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"GZMNRRP45UM37O6R","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"GZMNRRP4","created_at":"2026-05-18T12:26:30Z"}],"graph_snapshots":[{"event_id":"sha256:0373ae8620ca118f880f102fb4468316aeaeb15b01b8dfbdaf2bb34e19e9b78a","target":"graph","created_at":"2026-05-18T04:27:46Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"Steven Widmer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-27T17:46:21Z","title":"Permutation Complexity and the Letter Doubling Map"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.5527","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:166549dd65f24b2eaf8cdf8e0c1a6bd726fadefb4ead2e7293ea901999f38357","target":"record","created_at":"2026-05-18T04:27:46Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"13839042ae30ba1ab692f68162a6adcc78a758f450ac29e8e1b0128112b4e9fb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-27T17:46:21Z","title_canon_sha256":"34d9599313f4a194d604b0f09adec43616e2310bf24525ed10b310594ccdb498"},"schema_version":"1.0","source":{"id":"1102.5527","kind":"arxiv","version":1}},"canonical_sha256":"3658d8c5fced19bfbbd11a393c58b40b0f8e82a5fc9dd2808494644c3597b666","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3658d8c5fced19bfbbd11a393c58b40b0f8e82a5fc9dd2808494644c3597b666","first_computed_at":"2026-05-18T04:27:46.681918Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:27:46.681918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+h8KEN7yld4T3z+IZl/2EFiC1BO1lLOlBwqSzCI4TUXJPOpgsJ7938Xyim8d/9qWIZEv172Ld+znHfURno+oBw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:27:46.682689Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.5527","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:166549dd65f24b2eaf8cdf8e0c1a6bd726fadefb4ead2e7293ea901999f38357","sha256:0373ae8620ca118f880f102fb4468316aeaeb15b01b8dfbdaf2bb34e19e9b78a"],"state_sha256":"30f5a58a9ea832419b26731ab798cd274b1ed9929441f30f5ab9ffd08a3478dd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KjDo91YnD2dGIm3ksgSXJkFcPtwuc2o6I7wf2szVAw0tkNxtUpTXBYkyC4Wh4vpSt+1ve90WxzcOX7kNCrXLBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T19:57:12.760033Z","bundle_sha256":"8d70ca6501ad2ad1c2b0b3fee0bb10b2e77a88e6014a5f2dc836ef6a55c239bf"}}