{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:R4CWPNNGTGTHHSO5I452LPCGVK","short_pith_number":"pith:R4CWPNNG","canonical_record":{"source":{"id":"1606.00835","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-02T03:10:48Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"33465acb81e7b8b36d133ddde98f62c6958cbe8025ab4d2c53b6375a0c8bcc06","abstract_canon_sha256":"357570726f32a1fda8c344da14bdd8313e1ef6db99a616fe826c357bd9dd7146"},"schema_version":"1.0"},"canonical_sha256":"8f0567b5a699a673c9dd473ba5bc46aaa6e17a847a2eb79c2e6a69162208619d","source":{"kind":"arxiv","id":"1606.00835","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.00835","created_at":"2026-05-18T01:12:54Z"},{"alias_kind":"arxiv_version","alias_value":"1606.00835v2","created_at":"2026-05-18T01:12:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.00835","created_at":"2026-05-18T01:12:54Z"},{"alias_kind":"pith_short_12","alias_value":"R4CWPNNGTGTH","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"R4CWPNNGTGTHHSO5","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"R4CWPNNG","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:R4CWPNNGTGTHHSO5I452LPCGVK","target":"record","payload":{"canonical_record":{"source":{"id":"1606.00835","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-02T03:10:48Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"33465acb81e7b8b36d133ddde98f62c6958cbe8025ab4d2c53b6375a0c8bcc06","abstract_canon_sha256":"357570726f32a1fda8c344da14bdd8313e1ef6db99a616fe826c357bd9dd7146"},"schema_version":"1.0"},"canonical_sha256":"8f0567b5a699a673c9dd473ba5bc46aaa6e17a847a2eb79c2e6a69162208619d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:54.519484Z","signature_b64":"FSPBfntGKVW+/3j5JsFGVU2ii5LCOoReT83NjhaDP5xbS475XT+6PIX4agBPMFeT1Ivt+W8UJX7FNUyZTSpJAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f0567b5a699a673c9dd473ba5bc46aaa6e17a847a2eb79c2e6a69162208619d","last_reissued_at":"2026-05-18T01:12:54.519153Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:54.519153Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.00835","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-18T01:12:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iPuFBQUM03mYh/ME5xkw/GameZvLhzqWcNKY9jOtXRVK8qCOS52Mn+Ils5wexwAdMelpm+E77mx1fmoa/ma1DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:24:35.267168Z"},"content_sha256":"40f5ec3a06af8979fb5eba3975d4eecb20390fcd0589ec009bb0ff43fc6b1314","schema_version":"1.0","event_id":"sha256:40f5ec3a06af8979fb5eba3975d4eecb20390fcd0589ec009bb0ff43fc6b1314"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:R4CWPNNGTGTHHSO5I452LPCGVK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Improved Lower Bound for $n$-Brinkhuis $k$-Triples","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"math.CO","authors_text":"Craig C. Douglas, Manfred Liebmann, Michael Sollami","submitted_at":"2016-06-02T03:10:48Z","abstract_excerpt":"Let $s_n$ be the number of words consisting of the ternary alphabet consisting of the digits 0, 1, and 2 such that no subword (or factor) is a square (a word concatenated with itself, e.g., $11$, $1212$, or $102102$). From computational evidence, $s_n$ grows exponentially at a rate of about $1.317277^n$. While known upper bounds are already relatively close to the conjectured rate, effective lower bounds are much more difficult to obtain. In this paper, we construct a $54$-Brinkhuis $952$-triple, which leads to an improved lower bound on the number of $n$-letter ternary squarefree words: $952^"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.00835","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-18T01:12:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CPFbY9iFjF0BPTq89EQJVyQepnzMSg8oslNnsgnHENCK0sQgyKrbE74TEDItBeMdX6zEhiZ8YDebWNn55AGRDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:24:35.267968Z"},"content_sha256":"8216375a83bdd7b94eaf1928379c79af28e196da1a808571aa9547ca25d7ad42","schema_version":"1.0","event_id":"sha256:8216375a83bdd7b94eaf1928379c79af28e196da1a808571aa9547ca25d7ad42"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R4CWPNNGTGTHHSO5I452LPCGVK/bundle.json","state_url":"https://pith.science/pith/R4CWPNNGTGTHHSO5I452LPCGVK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R4CWPNNGTGTHHSO5I452LPCGVK/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-27T13:24:35Z","links":{"resolver":"https://pith.science/pith/R4CWPNNGTGTHHSO5I452LPCGVK","bundle":"https://pith.science/pith/R4CWPNNGTGTHHSO5I452LPCGVK/bundle.json","state":"https://pith.science/pith/R4CWPNNGTGTHHSO5I452LPCGVK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R4CWPNNGTGTHHSO5I452LPCGVK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:R4CWPNNGTGTHHSO5I452LPCGVK","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":"357570726f32a1fda8c344da14bdd8313e1ef6db99a616fe826c357bd9dd7146","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-02T03:10:48Z","title_canon_sha256":"33465acb81e7b8b36d133ddde98f62c6958cbe8025ab4d2c53b6375a0c8bcc06"},"schema_version":"1.0","source":{"id":"1606.00835","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.00835","created_at":"2026-05-18T01:12:54Z"},{"alias_kind":"arxiv_version","alias_value":"1606.00835v2","created_at":"2026-05-18T01:12:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.00835","created_at":"2026-05-18T01:12:54Z"},{"alias_kind":"pith_short_12","alias_value":"R4CWPNNGTGTH","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"R4CWPNNGTGTHHSO5","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"R4CWPNNG","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:8216375a83bdd7b94eaf1928379c79af28e196da1a808571aa9547ca25d7ad42","target":"graph","created_at":"2026-05-18T01:12:54Z","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 $s_n$ be the number of words consisting of the ternary alphabet consisting of the digits 0, 1, and 2 such that no subword (or factor) is a square (a word concatenated with itself, e.g., $11$, $1212$, or $102102$). From computational evidence, $s_n$ grows exponentially at a rate of about $1.317277^n$. While known upper bounds are already relatively close to the conjectured rate, effective lower bounds are much more difficult to obtain. In this paper, we construct a $54$-Brinkhuis $952$-triple, which leads to an improved lower bound on the number of $n$-letter ternary squarefree words: $952^","authors_text":"Craig C. Douglas, Manfred Liebmann, Michael Sollami","cross_cats":["cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-02T03:10:48Z","title":"An Improved Lower Bound for $n$-Brinkhuis $k$-Triples"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.00835","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:40f5ec3a06af8979fb5eba3975d4eecb20390fcd0589ec009bb0ff43fc6b1314","target":"record","created_at":"2026-05-18T01:12:54Z","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":"357570726f32a1fda8c344da14bdd8313e1ef6db99a616fe826c357bd9dd7146","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-02T03:10:48Z","title_canon_sha256":"33465acb81e7b8b36d133ddde98f62c6958cbe8025ab4d2c53b6375a0c8bcc06"},"schema_version":"1.0","source":{"id":"1606.00835","kind":"arxiv","version":2}},"canonical_sha256":"8f0567b5a699a673c9dd473ba5bc46aaa6e17a847a2eb79c2e6a69162208619d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8f0567b5a699a673c9dd473ba5bc46aaa6e17a847a2eb79c2e6a69162208619d","first_computed_at":"2026-05-18T01:12:54.519153Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:54.519153Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FSPBfntGKVW+/3j5JsFGVU2ii5LCOoReT83NjhaDP5xbS475XT+6PIX4agBPMFeT1Ivt+W8UJX7FNUyZTSpJAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:54.519484Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.00835","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:40f5ec3a06af8979fb5eba3975d4eecb20390fcd0589ec009bb0ff43fc6b1314","sha256:8216375a83bdd7b94eaf1928379c79af28e196da1a808571aa9547ca25d7ad42"],"state_sha256":"de32a65f2cefc3f6d98b19dcff8df2f0bd4430790e0d737083b73749ce1dd7f7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gww54I7IpdsPgNZDR51arCwP/rGmgnrI5DZ0FA6rIqlmRn2mMpFiUx3xcEEHg+IphsQjsKYWVzaXcev/HIH0Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T13:24:35.271702Z","bundle_sha256":"921117ddf97f521fe523d4afb375f505fecc6bc40c46b7f8c8ae4cccf3561410"}}