{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:NG2QGCDF46EQIRWG3AHKTMJ3US","short_pith_number":"pith:NG2QGCDF","schema_version":"1.0","canonical_sha256":"69b5030865e7890446c6d80ea9b13ba4901fc792c2614f05ba611b9834b62905","source":{"kind":"arxiv","id":"1203.3758","version":2},"attestation_state":"computed","paper":{"title":"Automatic Theorem-Proving in Combinatorics on Words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Dane Henshall, Jeffrey Shallit","submitted_at":"2012-03-16T16:32:09Z","abstract_excerpt":"We describe a technique for mechanically proving certain kinds of theorems in combinatorics on words, using automata and a package for manipulating them. We illustrate our technique by solving, purely mechanically, an open problem of Currie and Saari on the lengths of unbordered factors in the Thue-Morse sequence."},"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":"1203.3758","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2012-03-16T16:32:09Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"33f45001f5f546a5e881f1333d863296b3d4224827bdf6a7b4bea92346f6c7a4","abstract_canon_sha256":"a09a88a830bada22485dc1e0a489031f75162969e1386729f5dce6b210ca7a55"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:59:02.778139Z","signature_b64":"CL/4+nRy4UbCY5jvbk4WPVFIKxM50s3JrL3wsLcArlPyZd732YKzha0hNgf/pOeZhKQUR+lhHYKY9awyE39eBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"69b5030865e7890446c6d80ea9b13ba4901fc792c2614f05ba611b9834b62905","last_reissued_at":"2026-05-18T03:59:02.777551Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:59:02.777551Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Automatic Theorem-Proving in Combinatorics on Words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Dane Henshall, Jeffrey Shallit","submitted_at":"2012-03-16T16:32:09Z","abstract_excerpt":"We describe a technique for mechanically proving certain kinds of theorems in combinatorics on words, using automata and a package for manipulating them. We illustrate our technique by solving, purely mechanically, an open problem of Currie and Saari on the lengths of unbordered factors in the Thue-Morse sequence."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.3758","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1203.3758","created_at":"2026-05-18T03:59:02.777644+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.3758v2","created_at":"2026-05-18T03:59:02.777644+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.3758","created_at":"2026-05-18T03:59:02.777644+00:00"},{"alias_kind":"pith_short_12","alias_value":"NG2QGCDF46EQ","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_16","alias_value":"NG2QGCDF46EQIRWG","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_8","alias_value":"NG2QGCDF","created_at":"2026-05-18T12:27:16.716162+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/NG2QGCDF46EQIRWG3AHKTMJ3US","json":"https://pith.science/pith/NG2QGCDF46EQIRWG3AHKTMJ3US.json","graph_json":"https://pith.science/api/pith-number/NG2QGCDF46EQIRWG3AHKTMJ3US/graph.json","events_json":"https://pith.science/api/pith-number/NG2QGCDF46EQIRWG3AHKTMJ3US/events.json","paper":"https://pith.science/paper/NG2QGCDF"},"agent_actions":{"view_html":"https://pith.science/pith/NG2QGCDF46EQIRWG3AHKTMJ3US","download_json":"https://pith.science/pith/NG2QGCDF46EQIRWG3AHKTMJ3US.json","view_paper":"https://pith.science/paper/NG2QGCDF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.3758&json=true","fetch_graph":"https://pith.science/api/pith-number/NG2QGCDF46EQIRWG3AHKTMJ3US/graph.json","fetch_events":"https://pith.science/api/pith-number/NG2QGCDF46EQIRWG3AHKTMJ3US/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NG2QGCDF46EQIRWG3AHKTMJ3US/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NG2QGCDF46EQIRWG3AHKTMJ3US/action/storage_attestation","attest_author":"https://pith.science/pith/NG2QGCDF46EQIRWG3AHKTMJ3US/action/author_attestation","sign_citation":"https://pith.science/pith/NG2QGCDF46EQIRWG3AHKTMJ3US/action/citation_signature","submit_replication":"https://pith.science/pith/NG2QGCDF46EQIRWG3AHKTMJ3US/action/replication_record"}},"created_at":"2026-05-18T03:59:02.777644+00:00","updated_at":"2026-05-18T03:59:02.777644+00:00"}