{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:HWCDQMKQEYF7PU2XXWR6YOYB3N","short_pith_number":"pith:HWCDQMKQ","canonical_record":{"source":{"id":"1105.0654","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-05-03T19:11:54Z","cross_cats_sorted":[],"title_canon_sha256":"e54b4b7444a4fd9084da20b5488ba49ee7c18cae03b4f0fc5e74e97e36a262de","abstract_canon_sha256":"c3fd07d5358039efa91269685801337feb412fa7c5e727adb8336d1dcb87f8a6"},"schema_version":"1.0"},"canonical_sha256":"3d84383150260bf7d357bda3ec3b01db5606836b709eab9653de31cfc05cab24","source":{"kind":"arxiv","id":"1105.0654","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.0654","created_at":"2026-05-18T04:21:52Z"},{"alias_kind":"arxiv_version","alias_value":"1105.0654v2","created_at":"2026-05-18T04:21:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.0654","created_at":"2026-05-18T04:21:52Z"},{"alias_kind":"pith_short_12","alias_value":"HWCDQMKQEYF7","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"HWCDQMKQEYF7PU2X","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"HWCDQMKQ","created_at":"2026-05-18T12:26:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:HWCDQMKQEYF7PU2XXWR6YOYB3N","target":"record","payload":{"canonical_record":{"source":{"id":"1105.0654","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-05-03T19:11:54Z","cross_cats_sorted":[],"title_canon_sha256":"e54b4b7444a4fd9084da20b5488ba49ee7c18cae03b4f0fc5e74e97e36a262de","abstract_canon_sha256":"c3fd07d5358039efa91269685801337feb412fa7c5e727adb8336d1dcb87f8a6"},"schema_version":"1.0"},"canonical_sha256":"3d84383150260bf7d357bda3ec3b01db5606836b709eab9653de31cfc05cab24","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:21:52.585915Z","signature_b64":"lEnnMGUz9m2KqwFaQ/IjzYIVefDNOhZBVsMcKMGP4P/neTTEEb/ZeskhJK8Uy48UCjPuHCJ5wrcDUattU8jTAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d84383150260bf7d357bda3ec3b01db5606836b709eab9653de31cfc05cab24","last_reissued_at":"2026-05-18T04:21:52.585188Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:21:52.585188Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1105.0654","source_version":2,"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:21:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kh9F9V7tM9t7hKb+Z6f/fUi+Jbys6PoB3gviC0iGs4EYZwWvhf6vIyuccZodvdlgKIMb1CaSds+AreV8JoxLDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T02:44:24.528962Z"},"content_sha256":"4800b0456ab975d7619e9b75ec05582390cab4b6de9a3b7d2077157bf6c66c7f","schema_version":"1.0","event_id":"sha256:4800b0456ab975d7619e9b75ec05582390cab4b6de9a3b7d2077157bf6c66c7f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:HWCDQMKQEYF7PU2XXWR6YOYB3N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Constructions of asymptotically shortest k-radius sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jerzy W. Jaromczyk, Miroslaw Truszczynski, Zbigniew Lonc","submitted_at":"2011-05-03T19:11:54Z","abstract_excerpt":"Let k be a positive integer. A sequence s over an n-element alphabet A is called a k-radius sequence if every two symbols from A occur in s at distance of at most k. Let f_k(n) denote the length of a shortest k-radius sequence over A. We provide constructions demonstrating that (1) for every fixed k and for every fixed e>0, f_k(n) = n^2/(2k) +O(n^(1+e)) and (2) for every k, where k is the integer part of n^a for some fixed real a such that 0 < a <1, f_k(n) = n^2/(2k) +O(n^b), for some b <2-a. Since f_k(n) >= n^2/(2k) - n/(2k), the constructions give asymptotically optimal k-radius sequences. F"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.0654","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":""},"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:21:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6Bm76DH0Rd6vxlixWgq6tsbo+rOTez/y5qX3JT1s0OOkJ0zE1+eldyMMnCzoLV+bV9pPUHB+ojYsR9FTmMZQBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T02:44:24.529686Z"},"content_sha256":"bad21b70dcec4f3762c50d844737c7e4e349b0bf3dec41cab6857cc0364d49c7","schema_version":"1.0","event_id":"sha256:bad21b70dcec4f3762c50d844737c7e4e349b0bf3dec41cab6857cc0364d49c7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HWCDQMKQEYF7PU2XXWR6YOYB3N/bundle.json","state_url":"https://pith.science/pith/HWCDQMKQEYF7PU2XXWR6YOYB3N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HWCDQMKQEYF7PU2XXWR6YOYB3N/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-01T02:44:24Z","links":{"resolver":"https://pith.science/pith/HWCDQMKQEYF7PU2XXWR6YOYB3N","bundle":"https://pith.science/pith/HWCDQMKQEYF7PU2XXWR6YOYB3N/bundle.json","state":"https://pith.science/pith/HWCDQMKQEYF7PU2XXWR6YOYB3N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HWCDQMKQEYF7PU2XXWR6YOYB3N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:HWCDQMKQEYF7PU2XXWR6YOYB3N","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":"c3fd07d5358039efa91269685801337feb412fa7c5e727adb8336d1dcb87f8a6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-05-03T19:11:54Z","title_canon_sha256":"e54b4b7444a4fd9084da20b5488ba49ee7c18cae03b4f0fc5e74e97e36a262de"},"schema_version":"1.0","source":{"id":"1105.0654","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.0654","created_at":"2026-05-18T04:21:52Z"},{"alias_kind":"arxiv_version","alias_value":"1105.0654v2","created_at":"2026-05-18T04:21:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.0654","created_at":"2026-05-18T04:21:52Z"},{"alias_kind":"pith_short_12","alias_value":"HWCDQMKQEYF7","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"HWCDQMKQEYF7PU2X","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"HWCDQMKQ","created_at":"2026-05-18T12:26:30Z"}],"graph_snapshots":[{"event_id":"sha256:bad21b70dcec4f3762c50d844737c7e4e349b0bf3dec41cab6857cc0364d49c7","target":"graph","created_at":"2026-05-18T04:21:52Z","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":"Let k be a positive integer. A sequence s over an n-element alphabet A is called a k-radius sequence if every two symbols from A occur in s at distance of at most k. Let f_k(n) denote the length of a shortest k-radius sequence over A. We provide constructions demonstrating that (1) for every fixed k and for every fixed e>0, f_k(n) = n^2/(2k) +O(n^(1+e)) and (2) for every k, where k is the integer part of n^a for some fixed real a such that 0 < a <1, f_k(n) = n^2/(2k) +O(n^b), for some b <2-a. Since f_k(n) >= n^2/(2k) - n/(2k), the constructions give asymptotically optimal k-radius sequences. F","authors_text":"Jerzy W. Jaromczyk, Miroslaw Truszczynski, Zbigniew Lonc","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-05-03T19:11:54Z","title":"Constructions of asymptotically shortest k-radius sequences"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.0654","kind":"arxiv","version":2},"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:4800b0456ab975d7619e9b75ec05582390cab4b6de9a3b7d2077157bf6c66c7f","target":"record","created_at":"2026-05-18T04:21:52Z","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":"c3fd07d5358039efa91269685801337feb412fa7c5e727adb8336d1dcb87f8a6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-05-03T19:11:54Z","title_canon_sha256":"e54b4b7444a4fd9084da20b5488ba49ee7c18cae03b4f0fc5e74e97e36a262de"},"schema_version":"1.0","source":{"id":"1105.0654","kind":"arxiv","version":2}},"canonical_sha256":"3d84383150260bf7d357bda3ec3b01db5606836b709eab9653de31cfc05cab24","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3d84383150260bf7d357bda3ec3b01db5606836b709eab9653de31cfc05cab24","first_computed_at":"2026-05-18T04:21:52.585188Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:21:52.585188Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lEnnMGUz9m2KqwFaQ/IjzYIVefDNOhZBVsMcKMGP4P/neTTEEb/ZeskhJK8Uy48UCjPuHCJ5wrcDUattU8jTAw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:21:52.585915Z","signed_message":"canonical_sha256_bytes"},"source_id":"1105.0654","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4800b0456ab975d7619e9b75ec05582390cab4b6de9a3b7d2077157bf6c66c7f","sha256:bad21b70dcec4f3762c50d844737c7e4e349b0bf3dec41cab6857cc0364d49c7"],"state_sha256":"0fd6393d79e3bf6a4fc99970424337e36a7ae882bbb50ef2e9155c28eac5fd2c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PXrBIiNT1dLgxfbdYSKWJEU+BRkJDoJ65L0Wuokn+QlSA/m7+qCSjfsHeDwTp8huEfJ946KGh4r4NtXIAaCfDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T02:44:24.532940Z","bundle_sha256":"cacb72297ae87ffa844973e62b82cb44eba347ae1140024f64668c19e560df90"}}