{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:522P2R64474TZW5Q2G6QGUBZPF","short_pith_number":"pith:522P2R64","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"},"canonical_sha256":"eeb4fd47dce7f93cdbb0d1bd035039797108cc724d32f20049a7cc6588a23c3a","source":{"kind":"arxiv","id":"1205.1467","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.1467","created_at":"2026-05-18T03:32:57Z"},{"alias_kind":"arxiv_version","alias_value":"1205.1467v3","created_at":"2026-05-18T03:32:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.1467","created_at":"2026-05-18T03:32:57Z"},{"alias_kind":"pith_short_12","alias_value":"522P2R64474T","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"522P2R64474TZW5Q","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"522P2R64","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:522P2R64474TZW5Q2G6QGUBZPF","target":"record","payload":{"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"},"canonical_sha256":"eeb4fd47dce7f93cdbb0d1bd035039797108cc724d32f20049a7cc6588a23c3a","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"},"source_kind":"arxiv","source_id":"1205.1467","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-18T03:32:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jAhhHfwD5zPHrw98GTL5ifwjkv7n4Uvf2KIf+wrE3QYkirfpjlpOY2WGsT8Xt9fDRI9GE79PKu5/M/ypdgyfBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T04:33:42.952605Z"},"content_sha256":"a956e8c50ca6c20ecc9445b3b875904edd5cc04fed289105a4bccc240b2e438c","schema_version":"1.0","event_id":"sha256:a956e8c50ca6c20ecc9445b3b875904edd5cc04fed289105a4bccc240b2e438c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:522P2R64474TZW5Q2G6QGUBZPF","target":"graph","payload":{"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"},"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-18T03:32:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h2VPtz/hBf/b8PNMcIyz85O1790AljsueIlb0QpbAhpV/+DXhcrcmORVX404uy1mgOOiD7TjSPs2M7twn8wNDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T04:33:42.953223Z"},"content_sha256":"1217bcba9d1e9b983017114063c2173d69d1ec5369bfa3cbd421644500bfc405","schema_version":"1.0","event_id":"sha256:1217bcba9d1e9b983017114063c2173d69d1ec5369bfa3cbd421644500bfc405"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/522P2R64474TZW5Q2G6QGUBZPF/bundle.json","state_url":"https://pith.science/pith/522P2R64474TZW5Q2G6QGUBZPF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/522P2R64474TZW5Q2G6QGUBZPF/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-09T04:33:42Z","links":{"resolver":"https://pith.science/pith/522P2R64474TZW5Q2G6QGUBZPF","bundle":"https://pith.science/pith/522P2R64474TZW5Q2G6QGUBZPF/bundle.json","state":"https://pith.science/pith/522P2R64474TZW5Q2G6QGUBZPF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/522P2R64474TZW5Q2G6QGUBZPF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:522P2R64474TZW5Q2G6QGUBZPF","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":"6ea8be588ca42de5fa9cfd56e12fa5702efebb1e5e5919c648e11aed9e738ff9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2012-05-07T17:38:25Z","title_canon_sha256":"e3df0e6c4a0785d49ef5a8ecf731ee89785671fece78bae7a4c7a5b6657f92f2"},"schema_version":"1.0","source":{"id":"1205.1467","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.1467","created_at":"2026-05-18T03:32:57Z"},{"alias_kind":"arxiv_version","alias_value":"1205.1467v3","created_at":"2026-05-18T03:32:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.1467","created_at":"2026-05-18T03:32:57Z"},{"alias_kind":"pith_short_12","alias_value":"522P2R64474T","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"522P2R64474TZW5Q","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"522P2R64","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:1217bcba9d1e9b983017114063c2173d69d1ec5369bfa3cbd421644500bfc405","target":"graph","created_at":"2026-05-18T03:32:57Z","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":"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.","authors_text":"Louis H. Kauffman, Pedro Lopes, Slavik Jablan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2012-05-07T17:38:25Z","title":"On the Maximum Number of Colors for Links"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.1467","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:a956e8c50ca6c20ecc9445b3b875904edd5cc04fed289105a4bccc240b2e438c","target":"record","created_at":"2026-05-18T03:32:57Z","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":"6ea8be588ca42de5fa9cfd56e12fa5702efebb1e5e5919c648e11aed9e738ff9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2012-05-07T17:38:25Z","title_canon_sha256":"e3df0e6c4a0785d49ef5a8ecf731ee89785671fece78bae7a4c7a5b6657f92f2"},"schema_version":"1.0","source":{"id":"1205.1467","kind":"arxiv","version":3}},"canonical_sha256":"eeb4fd47dce7f93cdbb0d1bd035039797108cc724d32f20049a7cc6588a23c3a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eeb4fd47dce7f93cdbb0d1bd035039797108cc724d32f20049a7cc6588a23c3a","first_computed_at":"2026-05-18T03:32:57.013254Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:32:57.013254Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bqiaTM2wPKFVCMX8pAVcDRIJX+oCXTfTWBDBTbLySbc4KsQUl/DE+4MKXR1H8VeZ97QhnRH+AfWj9YXuJwWdBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:32:57.014087Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.1467","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a956e8c50ca6c20ecc9445b3b875904edd5cc04fed289105a4bccc240b2e438c","sha256:1217bcba9d1e9b983017114063c2173d69d1ec5369bfa3cbd421644500bfc405"],"state_sha256":"7515d3a77fdc8bc64c88af6e9d007c39c34e9bed3c2485e6b76c87133d9054e8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Oz90hM+ZR/KYyFqCtN1+sEjPjOpOHAaGxudTvZHzF3Gs7hnwiVMxwFbbHOvWHdq9JXzbNGbenZAc1sKYtP+NDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T04:33:42.956682Z","bundle_sha256":"66f772bc423733bc6db3c43050d832f5fb1703dd342fe9c0ed100236fa070b9c"}}