{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:SFGPVFGDGYJPSSDEVYTBZH2HS2","short_pith_number":"pith:SFGPVFGD","schema_version":"1.0","canonical_sha256":"914cfa94c33612f94864ae261c9f4796af40aa5caaf1b8e3f032bd75962fe786","source":{"kind":"arxiv","id":"1501.02421","version":1},"attestation_state":"computed","paper":{"title":"Minimal sufficient sets of colors and minimum number of colors","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Jun Ge, Lianzhu Zhang, Louis H. Kauffman, Pedro Lopes, Xian'an Jin","submitted_at":"2015-01-11T06:26:33Z","abstract_excerpt":"In this paper we first investigate minimal sufficient sets of colors for p=11 and 13. For odd prime p and any p-colorable link L with non-zero determinant, we give alternative proofs of mincol_p L \\geq 5 for p \\geq 11 and mincol_p L \\geq 6 for p \\geq 17. We elaborate on equivalence classes of sets of distinct colors (on a given modulus) and prove that there are two such classes of five colors modulo 11, and only one such class of five colors modulo 13. Finally, we give a positive answer to a question raised by Nakamura, Nakanishi, and Satoh concerning an inequality involving crossing numbers. "},"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":"1501.02421","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.GT","submitted_at":"2015-01-11T06:26:33Z","cross_cats_sorted":[],"title_canon_sha256":"81051602be933bc0d0cc39bd35731a04dc3f233a62dddd0fa045d8355c1f512d","abstract_canon_sha256":"a0de69b7f3e2bf124ab317219a7cd8eefec606767c4275211abab8297737e4a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:38.003166Z","signature_b64":"S1dZAK8WaI1oQ8V5lyzRwCvvogq/4M7Jqdtoigq8QcNGE3UG4BXitt4RkJKzDPAiYsq/EAn4DRC9sj3JQN5rAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"914cfa94c33612f94864ae261c9f4796af40aa5caaf1b8e3f032bd75962fe786","last_reissued_at":"2026-05-18T02:29:38.002805Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:38.002805Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimal sufficient sets of colors and minimum number of colors","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Jun Ge, Lianzhu Zhang, Louis H. Kauffman, Pedro Lopes, Xian'an Jin","submitted_at":"2015-01-11T06:26:33Z","abstract_excerpt":"In this paper we first investigate minimal sufficient sets of colors for p=11 and 13. For odd prime p and any p-colorable link L with non-zero determinant, we give alternative proofs of mincol_p L \\geq 5 for p \\geq 11 and mincol_p L \\geq 6 for p \\geq 17. We elaborate on equivalence classes of sets of distinct colors (on a given modulus) and prove that there are two such classes of five colors modulo 11, and only one such class of five colors modulo 13. Finally, we give a positive answer to a question raised by Nakamura, Nakanishi, and Satoh concerning an inequality involving crossing numbers. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.02421","kind":"arxiv","version":1},"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":"1501.02421","created_at":"2026-05-18T02:29:38.002858+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.02421v1","created_at":"2026-05-18T02:29:38.002858+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.02421","created_at":"2026-05-18T02:29:38.002858+00:00"},{"alias_kind":"pith_short_12","alias_value":"SFGPVFGDGYJP","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"SFGPVFGDGYJPSSDE","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"SFGPVFGD","created_at":"2026-05-18T12:29:39.896362+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/SFGPVFGDGYJPSSDEVYTBZH2HS2","json":"https://pith.science/pith/SFGPVFGDGYJPSSDEVYTBZH2HS2.json","graph_json":"https://pith.science/api/pith-number/SFGPVFGDGYJPSSDEVYTBZH2HS2/graph.json","events_json":"https://pith.science/api/pith-number/SFGPVFGDGYJPSSDEVYTBZH2HS2/events.json","paper":"https://pith.science/paper/SFGPVFGD"},"agent_actions":{"view_html":"https://pith.science/pith/SFGPVFGDGYJPSSDEVYTBZH2HS2","download_json":"https://pith.science/pith/SFGPVFGDGYJPSSDEVYTBZH2HS2.json","view_paper":"https://pith.science/paper/SFGPVFGD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.02421&json=true","fetch_graph":"https://pith.science/api/pith-number/SFGPVFGDGYJPSSDEVYTBZH2HS2/graph.json","fetch_events":"https://pith.science/api/pith-number/SFGPVFGDGYJPSSDEVYTBZH2HS2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SFGPVFGDGYJPSSDEVYTBZH2HS2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SFGPVFGDGYJPSSDEVYTBZH2HS2/action/storage_attestation","attest_author":"https://pith.science/pith/SFGPVFGDGYJPSSDEVYTBZH2HS2/action/author_attestation","sign_citation":"https://pith.science/pith/SFGPVFGDGYJPSSDEVYTBZH2HS2/action/citation_signature","submit_replication":"https://pith.science/pith/SFGPVFGDGYJPSSDEVYTBZH2HS2/action/replication_record"}},"created_at":"2026-05-18T02:29:38.002858+00:00","updated_at":"2026-05-18T02:29:38.002858+00:00"}