{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:522P2R64474TZW5Q2G6QGUBZPF","short_pith_number":"pith:522P2R64","schema_version":"1.0","canonical_sha256":"eeb4fd47dce7f93cdbb0d1bd035039797108cc724d32f20049a7cc6588a23c3a","source":{"kind":"arxiv","id":"1205.1467","version":3},"attestation_state":"computed","paper":{"title":"On the Maximum Number of Colors for Links","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Louis H. Kauffman, Pedro Lopes, Slavik Jablan","submitted_at":"2012-05-07T17:38:25Z","abstract_excerpt":"For each odd prime p, and for each non-split link admitting non-trivial p-colorings, we prove that the maximum number of Fox colors is p. We also prove that we can assemble a non-trivial p-coloring with any number of colors, from the minimum to the maximum number of colors. Furthermore, for any rational link, we prove that there exists a non-trivial coloring of any Schubert Normal Form of it, modulo its determinant, which uses all colors available. If this determinant is an odd prime, then any non-trivial coloring of this Schubert Normal Form, modulo the determinant, uses all available colors."},"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":"1205.1467","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2012-05-07T17:38:25Z","cross_cats_sorted":[],"title_canon_sha256":"e3df0e6c4a0785d49ef5a8ecf731ee89785671fece78bae7a4c7a5b6657f92f2","abstract_canon_sha256":"6ea8be588ca42de5fa9cfd56e12fa5702efebb1e5e5919c648e11aed9e738ff9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:32:57.014087Z","signature_b64":"bqiaTM2wPKFVCMX8pAVcDRIJX+oCXTfTWBDBTbLySbc4KsQUl/DE+4MKXR1H8VeZ97QhnRH+AfWj9YXuJwWdBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eeb4fd47dce7f93cdbb0d1bd035039797108cc724d32f20049a7cc6588a23c3a","last_reissued_at":"2026-05-18T03:32:57.013254Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:32:57.013254Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Maximum Number of Colors for Links","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Louis H. Kauffman, Pedro Lopes, Slavik Jablan","submitted_at":"2012-05-07T17:38:25Z","abstract_excerpt":"For each odd prime p, and for each non-split link admitting non-trivial p-colorings, we prove that the maximum number of Fox colors is p. We also prove that we can assemble a non-trivial p-coloring with any number of colors, from the minimum to the maximum number of colors. Furthermore, for any rational link, we prove that there exists a non-trivial coloring of any Schubert Normal Form of it, modulo its determinant, which uses all colors available. If this determinant is an odd prime, then any non-trivial coloring of this Schubert Normal Form, modulo the determinant, uses all available colors."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.1467","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1205.1467","created_at":"2026-05-18T03:32:57.013403+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.1467v3","created_at":"2026-05-18T03:32:57.013403+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.1467","created_at":"2026-05-18T03:32:57.013403+00:00"},{"alias_kind":"pith_short_12","alias_value":"522P2R64474T","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"522P2R64474TZW5Q","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"522P2R64","created_at":"2026-05-18T12:26:53.410803+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/522P2R64474TZW5Q2G6QGUBZPF","json":"https://pith.science/pith/522P2R64474TZW5Q2G6QGUBZPF.json","graph_json":"https://pith.science/api/pith-number/522P2R64474TZW5Q2G6QGUBZPF/graph.json","events_json":"https://pith.science/api/pith-number/522P2R64474TZW5Q2G6QGUBZPF/events.json","paper":"https://pith.science/paper/522P2R64"},"agent_actions":{"view_html":"https://pith.science/pith/522P2R64474TZW5Q2G6QGUBZPF","download_json":"https://pith.science/pith/522P2R64474TZW5Q2G6QGUBZPF.json","view_paper":"https://pith.science/paper/522P2R64","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.1467&json=true","fetch_graph":"https://pith.science/api/pith-number/522P2R64474TZW5Q2G6QGUBZPF/graph.json","fetch_events":"https://pith.science/api/pith-number/522P2R64474TZW5Q2G6QGUBZPF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/522P2R64474TZW5Q2G6QGUBZPF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/522P2R64474TZW5Q2G6QGUBZPF/action/storage_attestation","attest_author":"https://pith.science/pith/522P2R64474TZW5Q2G6QGUBZPF/action/author_attestation","sign_citation":"https://pith.science/pith/522P2R64474TZW5Q2G6QGUBZPF/action/citation_signature","submit_replication":"https://pith.science/pith/522P2R64474TZW5Q2G6QGUBZPF/action/replication_record"}},"created_at":"2026-05-18T03:32:57.013403+00:00","updated_at":"2026-05-18T03:32:57.013403+00:00"}