{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:UR7KHESE7V25MLJI2BUDTUP3AM","short_pith_number":"pith:UR7KHESE","schema_version":"1.0","canonical_sha256":"a47ea39244fd75d62d28d06839d1fb033b682da746d799df03865d126fe7e4d1","source":{"kind":"arxiv","id":"1907.10359","version":1},"attestation_state":"computed","paper":{"title":"Checkerboard graph links and simply laced Dynkin diagrams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Lucas Fernandez Vilanova","submitted_at":"2019-07-21T09:00:14Z","abstract_excerpt":"We define an equivalence relation on graphs with signed edges, such that the associated adjacency matrices of two equivalent graphs are congruent over $\\mathbb{Z}$. We show that signed graphs whose eigenvalues are larger than $-2$ are equivalent to one of the simply laced Dynkin diagrams: $A_{n}$, $D_{n}$, $E_{6}$, $E_{7}$ and $E_{8}$. Checkerboard graph links are a class of fibred strongly quasipositive links which include positive braid links. We use the previous result to prove that a checkerboard graph link with maximal signature is isotopic to one of the links realized by the simply laced"},"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":"1907.10359","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2019-07-21T09:00:14Z","cross_cats_sorted":[],"title_canon_sha256":"5673737abecd6aaa5c7f85c66106278cd720411f9d1e052ecbbd5064de1aed8f","abstract_canon_sha256":"811c6fc370d8acb92c760455475dac50800c0051bc7459c6b5956b33412182e2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:38.185281Z","signature_b64":"OIcGyIFNmpCaD1AuXz1R1G6S4cG9X8hF0fK5ByKzgd2e0+lQmtTL0A+esMfmKjH1SEpBusTsmfSQeBoBaw0TCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a47ea39244fd75d62d28d06839d1fb033b682da746d799df03865d126fe7e4d1","last_reissued_at":"2026-05-17T23:39:38.184721Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:38.184721Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Checkerboard graph links and simply laced Dynkin diagrams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Lucas Fernandez Vilanova","submitted_at":"2019-07-21T09:00:14Z","abstract_excerpt":"We define an equivalence relation on graphs with signed edges, such that the associated adjacency matrices of two equivalent graphs are congruent over $\\mathbb{Z}$. We show that signed graphs whose eigenvalues are larger than $-2$ are equivalent to one of the simply laced Dynkin diagrams: $A_{n}$, $D_{n}$, $E_{6}$, $E_{7}$ and $E_{8}$. Checkerboard graph links are a class of fibred strongly quasipositive links which include positive braid links. We use the previous result to prove that a checkerboard graph link with maximal signature is isotopic to one of the links realized by the simply laced"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.10359","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":"1907.10359","created_at":"2026-05-17T23:39:38.184808+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.10359v1","created_at":"2026-05-17T23:39:38.184808+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.10359","created_at":"2026-05-17T23:39:38.184808+00:00"},{"alias_kind":"pith_short_12","alias_value":"UR7KHESE7V25","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"UR7KHESE7V25MLJI","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"UR7KHESE","created_at":"2026-05-18T12:33:30.264802+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/UR7KHESE7V25MLJI2BUDTUP3AM","json":"https://pith.science/pith/UR7KHESE7V25MLJI2BUDTUP3AM.json","graph_json":"https://pith.science/api/pith-number/UR7KHESE7V25MLJI2BUDTUP3AM/graph.json","events_json":"https://pith.science/api/pith-number/UR7KHESE7V25MLJI2BUDTUP3AM/events.json","paper":"https://pith.science/paper/UR7KHESE"},"agent_actions":{"view_html":"https://pith.science/pith/UR7KHESE7V25MLJI2BUDTUP3AM","download_json":"https://pith.science/pith/UR7KHESE7V25MLJI2BUDTUP3AM.json","view_paper":"https://pith.science/paper/UR7KHESE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.10359&json=true","fetch_graph":"https://pith.science/api/pith-number/UR7KHESE7V25MLJI2BUDTUP3AM/graph.json","fetch_events":"https://pith.science/api/pith-number/UR7KHESE7V25MLJI2BUDTUP3AM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UR7KHESE7V25MLJI2BUDTUP3AM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UR7KHESE7V25MLJI2BUDTUP3AM/action/storage_attestation","attest_author":"https://pith.science/pith/UR7KHESE7V25MLJI2BUDTUP3AM/action/author_attestation","sign_citation":"https://pith.science/pith/UR7KHESE7V25MLJI2BUDTUP3AM/action/citation_signature","submit_replication":"https://pith.science/pith/UR7KHESE7V25MLJI2BUDTUP3AM/action/replication_record"}},"created_at":"2026-05-17T23:39:38.184808+00:00","updated_at":"2026-05-17T23:39:38.184808+00:00"}