{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:UVGFCR3SSVJ3XZ44ZPV5YMYFL6","short_pith_number":"pith:UVGFCR3S","canonical_record":{"source":{"id":"1301.0458","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2013-01-03T13:57:16Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"0a7ec745641d3b47c840cc755b3700df30861a10a1a959d38078baa088a1eb11","abstract_canon_sha256":"67bd7d4fb48fc01fd6e423a730ecdccbe3ce46cf5327bf5b47da931b7a75dd0d"},"schema_version":"1.0"},"canonical_sha256":"a54c5147729553bbe79ccbebdc33055f99ac6f2502b0352194a314466e19b0e1","source":{"kind":"arxiv","id":"1301.0458","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.0458","created_at":"2026-05-18T01:28:06Z"},{"alias_kind":"arxiv_version","alias_value":"1301.0458v3","created_at":"2026-05-18T01:28:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.0458","created_at":"2026-05-18T01:28:06Z"},{"alias_kind":"pith_short_12","alias_value":"UVGFCR3SSVJ3","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"UVGFCR3SSVJ3XZ44","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"UVGFCR3S","created_at":"2026-05-18T12:28:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:UVGFCR3SSVJ3XZ44ZPV5YMYFL6","target":"record","payload":{"canonical_record":{"source":{"id":"1301.0458","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2013-01-03T13:57:16Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"0a7ec745641d3b47c840cc755b3700df30861a10a1a959d38078baa088a1eb11","abstract_canon_sha256":"67bd7d4fb48fc01fd6e423a730ecdccbe3ce46cf5327bf5b47da931b7a75dd0d"},"schema_version":"1.0"},"canonical_sha256":"a54c5147729553bbe79ccbebdc33055f99ac6f2502b0352194a314466e19b0e1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:28:06.298206Z","signature_b64":"3JAD+NhHZHWvVudcrArPFrA/5a13ubuJCO964/Y+nAYta9bArbUGawEk+bYPZOWW+/R6iwEHqDq8+R6ips8BAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a54c5147729553bbe79ccbebdc33055f99ac6f2502b0352194a314466e19b0e1","last_reissued_at":"2026-05-18T01:28:06.297524Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:28:06.297524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.0458","source_version":3,"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-18T01:28:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XqwFvBeUUdekb9kr25u79zejeKKlPFrAsPpRsnaQrTRd45/9j+IIOfwOyNJp7qQj01Rh2veWu6v5YjBmXbLBCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T09:27:35.344334Z"},"content_sha256":"4828f7cfb930afda69c45927efe6942ba1294a87f70b7c95709e355c2bf5ea40","schema_version":"1.0","event_id":"sha256:4828f7cfb930afda69c45927efe6942ba1294a87f70b7c95709e355c2bf5ea40"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:UVGFCR3SSVJ3XZ44ZPV5YMYFL6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Symbol ratio minimax sequences in the lexicographic order","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.DS","authors_text":"Andr\\'e de Carvalho, Philip Boyland, Toby Hall","submitted_at":"2013-01-03T13:57:16Z","abstract_excerpt":"Consider the space of sequences of k letters ordered lexicographically. We study the set M({\\alpha}) of all maximal sequences for which the asymptotic proportions {\\alpha} of the letters are prescribed, where a sequence is said to be maximal if it is at least as great as all of its tails. The infimum of M({\\alpha}) is called the {\\alpha}-infimax sequence, or the {\\alpha}-minimax sequence if the infimum is a minimum. We give an algorithm which yields all infimax sequences, and show that the infimax is not a minimax if and only if it is the {\\alpha}-infimax for every {\\alpha} in a simplex of dim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.0458","kind":"arxiv","version":3},"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-18T01:28:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GVY0Qsk/PCTmtTzwGtXfGIAk3DYy25QCiGJS32KrOLcv+xwVD1PHKsolH8yGyvg3nDET8W6Afxj6/bmggExvBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T09:27:35.344990Z"},"content_sha256":"3f1f3e47101b7fc4150c4d12bd8c903433a1b21b51a38840968f314f87dd2b99","schema_version":"1.0","event_id":"sha256:3f1f3e47101b7fc4150c4d12bd8c903433a1b21b51a38840968f314f87dd2b99"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UVGFCR3SSVJ3XZ44ZPV5YMYFL6/bundle.json","state_url":"https://pith.science/pith/UVGFCR3SSVJ3XZ44ZPV5YMYFL6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UVGFCR3SSVJ3XZ44ZPV5YMYFL6/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-05-28T09:27:35Z","links":{"resolver":"https://pith.science/pith/UVGFCR3SSVJ3XZ44ZPV5YMYFL6","bundle":"https://pith.science/pith/UVGFCR3SSVJ3XZ44ZPV5YMYFL6/bundle.json","state":"https://pith.science/pith/UVGFCR3SSVJ3XZ44ZPV5YMYFL6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UVGFCR3SSVJ3XZ44ZPV5YMYFL6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:UVGFCR3SSVJ3XZ44ZPV5YMYFL6","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":"67bd7d4fb48fc01fd6e423a730ecdccbe3ce46cf5327bf5b47da931b7a75dd0d","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2013-01-03T13:57:16Z","title_canon_sha256":"0a7ec745641d3b47c840cc755b3700df30861a10a1a959d38078baa088a1eb11"},"schema_version":"1.0","source":{"id":"1301.0458","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.0458","created_at":"2026-05-18T01:28:06Z"},{"alias_kind":"arxiv_version","alias_value":"1301.0458v3","created_at":"2026-05-18T01:28:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.0458","created_at":"2026-05-18T01:28:06Z"},{"alias_kind":"pith_short_12","alias_value":"UVGFCR3SSVJ3","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"UVGFCR3SSVJ3XZ44","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"UVGFCR3S","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:3f1f3e47101b7fc4150c4d12bd8c903433a1b21b51a38840968f314f87dd2b99","target":"graph","created_at":"2026-05-18T01:28:06Z","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":"Consider the space of sequences of k letters ordered lexicographically. We study the set M({\\alpha}) of all maximal sequences for which the asymptotic proportions {\\alpha} of the letters are prescribed, where a sequence is said to be maximal if it is at least as great as all of its tails. The infimum of M({\\alpha}) is called the {\\alpha}-infimax sequence, or the {\\alpha}-minimax sequence if the infimum is a minimum. We give an algorithm which yields all infimax sequences, and show that the infimax is not a minimax if and only if it is the {\\alpha}-infimax for every {\\alpha} in a simplex of dim","authors_text":"Andr\\'e de Carvalho, Philip Boyland, Toby Hall","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2013-01-03T13:57:16Z","title":"Symbol ratio minimax sequences in the lexicographic order"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.0458","kind":"arxiv","version":3},"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:4828f7cfb930afda69c45927efe6942ba1294a87f70b7c95709e355c2bf5ea40","target":"record","created_at":"2026-05-18T01:28:06Z","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":"67bd7d4fb48fc01fd6e423a730ecdccbe3ce46cf5327bf5b47da931b7a75dd0d","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2013-01-03T13:57:16Z","title_canon_sha256":"0a7ec745641d3b47c840cc755b3700df30861a10a1a959d38078baa088a1eb11"},"schema_version":"1.0","source":{"id":"1301.0458","kind":"arxiv","version":3}},"canonical_sha256":"a54c5147729553bbe79ccbebdc33055f99ac6f2502b0352194a314466e19b0e1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a54c5147729553bbe79ccbebdc33055f99ac6f2502b0352194a314466e19b0e1","first_computed_at":"2026-05-18T01:28:06.297524Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:28:06.297524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3JAD+NhHZHWvVudcrArPFrA/5a13ubuJCO964/Y+nAYta9bArbUGawEk+bYPZOWW+/R6iwEHqDq8+R6ips8BAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:28:06.298206Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.0458","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4828f7cfb930afda69c45927efe6942ba1294a87f70b7c95709e355c2bf5ea40","sha256:3f1f3e47101b7fc4150c4d12bd8c903433a1b21b51a38840968f314f87dd2b99"],"state_sha256":"c5d5208eae7d701853bc0781709a827c410af38031d2c63c2fd2f763ab445334"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1Ai+NcLa1JnimEspaFODGvVDMe4RHi0LvISP7+F1bTawu0zz6NnqOEDuWl8XGxOBaP0nwpdxeR4y1tHW/LbyDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T09:27:35.348024Z","bundle_sha256":"f4da70426f609e2060630037c1aaacf0a2f83ab6bb85b652fd463571c410c0f1"}}