{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:A7SRCSXWFLELX3QIPOGJDGHILC","short_pith_number":"pith:A7SRCSXW","schema_version":"1.0","canonical_sha256":"07e5114af62ac8bbee087b8c9198e8588c4dbf96dd0eef1ac7e4c2344555ba06","source":{"kind":"arxiv","id":"1406.2378","version":1},"attestation_state":"computed","paper":{"title":"The Delunification Process and Minimal Diagrams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Louis Kauffman, Pedro Lopes, Slavik Jablan","submitted_at":"2014-06-09T22:48:46Z","abstract_excerpt":"A link diagram is said to be lune-free if, when viewed as a 4-regular plane graph it does not have multiple edges between any pair of nodes. We prove that any colored link diagram is equivalent to a colored lune-free diagram with the same number of colors. Thus any colored link diagram with a minimum number of colors (known as a minimal diagram) is equivalent to a colored lune-free diagram with that same number of colors. We call the passage from a link diagram to an equivalent lune-free diagram its delunification process.\n  We then introduce a notion of grey sets in order to obtain higher low"},"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":"1406.2378","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2014-06-09T22:48:46Z","cross_cats_sorted":[],"title_canon_sha256":"5a35a4cab75762495c57c1cd61223a07fc40f1b61328be47e4e3bb6d9fdb485b","abstract_canon_sha256":"e4205a4f83d314ddd4b219d3f2cb3b6586364bb47fcc1dd8d2bc01a5c95ab874"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:01.811981Z","signature_b64":"L+9ZNTLtrNkqsr9GLBgg0sYy04TLDZKKsK0r+fLL5hm0pMp2JHg9gN9VaPpYwQzMXuDB8n/ZLNFld/Mrl87qAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07e5114af62ac8bbee087b8c9198e8588c4dbf96dd0eef1ac7e4c2344555ba06","last_reissued_at":"2026-05-18T02:50:01.811472Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:01.811472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Delunification Process and Minimal Diagrams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Louis Kauffman, Pedro Lopes, Slavik Jablan","submitted_at":"2014-06-09T22:48:46Z","abstract_excerpt":"A link diagram is said to be lune-free if, when viewed as a 4-regular plane graph it does not have multiple edges between any pair of nodes. We prove that any colored link diagram is equivalent to a colored lune-free diagram with the same number of colors. Thus any colored link diagram with a minimum number of colors (known as a minimal diagram) is equivalent to a colored lune-free diagram with that same number of colors. We call the passage from a link diagram to an equivalent lune-free diagram its delunification process.\n  We then introduce a notion of grey sets in order to obtain higher low"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.2378","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":"1406.2378","created_at":"2026-05-18T02:50:01.811540+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.2378v1","created_at":"2026-05-18T02:50:01.811540+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.2378","created_at":"2026-05-18T02:50:01.811540+00:00"},{"alias_kind":"pith_short_12","alias_value":"A7SRCSXWFLEL","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"A7SRCSXWFLELX3QI","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"A7SRCSXW","created_at":"2026-05-18T12:28:19.803747+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/A7SRCSXWFLELX3QIPOGJDGHILC","json":"https://pith.science/pith/A7SRCSXWFLELX3QIPOGJDGHILC.json","graph_json":"https://pith.science/api/pith-number/A7SRCSXWFLELX3QIPOGJDGHILC/graph.json","events_json":"https://pith.science/api/pith-number/A7SRCSXWFLELX3QIPOGJDGHILC/events.json","paper":"https://pith.science/paper/A7SRCSXW"},"agent_actions":{"view_html":"https://pith.science/pith/A7SRCSXWFLELX3QIPOGJDGHILC","download_json":"https://pith.science/pith/A7SRCSXWFLELX3QIPOGJDGHILC.json","view_paper":"https://pith.science/paper/A7SRCSXW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.2378&json=true","fetch_graph":"https://pith.science/api/pith-number/A7SRCSXWFLELX3QIPOGJDGHILC/graph.json","fetch_events":"https://pith.science/api/pith-number/A7SRCSXWFLELX3QIPOGJDGHILC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A7SRCSXWFLELX3QIPOGJDGHILC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A7SRCSXWFLELX3QIPOGJDGHILC/action/storage_attestation","attest_author":"https://pith.science/pith/A7SRCSXWFLELX3QIPOGJDGHILC/action/author_attestation","sign_citation":"https://pith.science/pith/A7SRCSXWFLELX3QIPOGJDGHILC/action/citation_signature","submit_replication":"https://pith.science/pith/A7SRCSXWFLELX3QIPOGJDGHILC/action/replication_record"}},"created_at":"2026-05-18T02:50:01.811540+00:00","updated_at":"2026-05-18T02:50:01.811540+00:00"}