{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:JGTXXKTVVG7RDEB2Q5YOXJEGWI","short_pith_number":"pith:JGTXXKTV","schema_version":"1.0","canonical_sha256":"49a77baa75a9bf11903a8770eba486b23a1a7bc4efd7b273cac8c65018394adf","source":{"kind":"arxiv","id":"1411.6367","version":1},"attestation_state":"computed","paper":{"title":"Untangling trigonal diagrams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Daniel Pecker (UPMC, Erwan Brugall\\'e (CMLS-EcolePolytechnique), IMJ, IMJ), Inria Paris-Rocquencourt), Pierre-Vincent Koseleff (UPMC","submitted_at":"2014-11-24T07:27:27Z","abstract_excerpt":"Let $K$ be a link of Conway's normal form $C(m)$, $m \\geq 0$, or $C(m,n)$ with $mn\\textgreater{}0$, and let $D$ be a trigonal diagram of $K.$ We show that it is possible to transform $D$ into an alternating trigonal diagram, so that all intermediate diagrams remain trigonal, and the number of crossings never increases."},"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":"1411.6367","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2014-11-24T07:27:27Z","cross_cats_sorted":[],"title_canon_sha256":"245ce3cde31b5dccce9e7a6c08aab7a81e9e2ee7aeae3d24da351363c2492f65","abstract_canon_sha256":"ce71b33aefaab6d4aae204ae87644e731a6474b8cf2832c0e7d06a993f5c7ce9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:33:00.206204Z","signature_b64":"LwLgwOExVin9JUaYdaR6LmmmFBGTQEJJI14/zQCQKIDcTVCFqvuDrVsoRd5m8nR0hoSJOminScwLQcN2hnjtDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"49a77baa75a9bf11903a8770eba486b23a1a7bc4efd7b273cac8c65018394adf","last_reissued_at":"2026-05-18T02:33:00.205855Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:33:00.205855Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Untangling trigonal diagrams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Daniel Pecker (UPMC, Erwan Brugall\\'e (CMLS-EcolePolytechnique), IMJ, IMJ), Inria Paris-Rocquencourt), Pierre-Vincent Koseleff (UPMC","submitted_at":"2014-11-24T07:27:27Z","abstract_excerpt":"Let $K$ be a link of Conway's normal form $C(m)$, $m \\geq 0$, or $C(m,n)$ with $mn\\textgreater{}0$, and let $D$ be a trigonal diagram of $K.$ We show that it is possible to transform $D$ into an alternating trigonal diagram, so that all intermediate diagrams remain trigonal, and the number of crossings never increases."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.6367","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":"1411.6367","created_at":"2026-05-18T02:33:00.205913+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.6367v1","created_at":"2026-05-18T02:33:00.205913+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.6367","created_at":"2026-05-18T02:33:00.205913+00:00"},{"alias_kind":"pith_short_12","alias_value":"JGTXXKTVVG7R","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"JGTXXKTVVG7RDEB2","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"JGTXXKTV","created_at":"2026-05-18T12:28:33.132498+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/JGTXXKTVVG7RDEB2Q5YOXJEGWI","json":"https://pith.science/pith/JGTXXKTVVG7RDEB2Q5YOXJEGWI.json","graph_json":"https://pith.science/api/pith-number/JGTXXKTVVG7RDEB2Q5YOXJEGWI/graph.json","events_json":"https://pith.science/api/pith-number/JGTXXKTVVG7RDEB2Q5YOXJEGWI/events.json","paper":"https://pith.science/paper/JGTXXKTV"},"agent_actions":{"view_html":"https://pith.science/pith/JGTXXKTVVG7RDEB2Q5YOXJEGWI","download_json":"https://pith.science/pith/JGTXXKTVVG7RDEB2Q5YOXJEGWI.json","view_paper":"https://pith.science/paper/JGTXXKTV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.6367&json=true","fetch_graph":"https://pith.science/api/pith-number/JGTXXKTVVG7RDEB2Q5YOXJEGWI/graph.json","fetch_events":"https://pith.science/api/pith-number/JGTXXKTVVG7RDEB2Q5YOXJEGWI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JGTXXKTVVG7RDEB2Q5YOXJEGWI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JGTXXKTVVG7RDEB2Q5YOXJEGWI/action/storage_attestation","attest_author":"https://pith.science/pith/JGTXXKTVVG7RDEB2Q5YOXJEGWI/action/author_attestation","sign_citation":"https://pith.science/pith/JGTXXKTVVG7RDEB2Q5YOXJEGWI/action/citation_signature","submit_replication":"https://pith.science/pith/JGTXXKTVVG7RDEB2Q5YOXJEGWI/action/replication_record"}},"created_at":"2026-05-18T02:33:00.205913+00:00","updated_at":"2026-05-18T02:33:00.205913+00:00"}