{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:EOZXLPUDIDKZUCLZRG2G4PA4AG","short_pith_number":"pith:EOZXLPUD","schema_version":"1.0","canonical_sha256":"23b375be8340d59a097989b46e3c1c019f0485b0f5104f4e477dcafabbc187a8","source":{"kind":"arxiv","id":"1407.3460","version":2},"attestation_state":"computed","paper":{"title":"A new intrinsically knotted graph with 22 edges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Hwa Jeong Lee, Hyoungjun Kim, Minjung Lee, Seungsang Oh, Thomas Mattman","submitted_at":"2014-07-13T13:13:11Z","abstract_excerpt":"A graph is called intrinsically knotted if every embedding of the graph contains a knotted cycle. Johnson, Kidwell and Michael showed that intrinsically knotted graphs have at least 21 edges. Recently Lee, Kim, Lee and Oh, and, independently, Barsotti and Mattman, showed that $K_7$ and the 13 graphs obtained from $K_7$ by $\\nabla Y$ moves are the only intrinsically knotted graphs with 21 edges.\n  In this paper we present the following results: there are exactly three triangle-free intrinsically knotted graphs with 22 edges having at least two vertices of degree 5. Two are the cousins 94 and 11"},"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":"1407.3460","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2014-07-13T13:13:11Z","cross_cats_sorted":[],"title_canon_sha256":"c1e8d44ecc8075fb4c2dba7d86e6f3019a75cf398cc2a530b5f4d3a1da8b89c9","abstract_canon_sha256":"3243c5daabfd42dcad718af49b0a0f6891382b7c06619455d70594fc0291ec12"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:14.037102Z","signature_b64":"zf0v/aZRA14ZecAMkIcYHMFeZxW1Z3ERCPl5HWdVI1NgRUjSff7kaKMiTffdND1x/pW6HoogpGpZQ3qumCAOCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"23b375be8340d59a097989b46e3c1c019f0485b0f5104f4e477dcafabbc187a8","last_reissued_at":"2026-05-18T00:38:14.036238Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:14.036238Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A new intrinsically knotted graph with 22 edges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Hwa Jeong Lee, Hyoungjun Kim, Minjung Lee, Seungsang Oh, Thomas Mattman","submitted_at":"2014-07-13T13:13:11Z","abstract_excerpt":"A graph is called intrinsically knotted if every embedding of the graph contains a knotted cycle. Johnson, Kidwell and Michael showed that intrinsically knotted graphs have at least 21 edges. Recently Lee, Kim, Lee and Oh, and, independently, Barsotti and Mattman, showed that $K_7$ and the 13 graphs obtained from $K_7$ by $\\nabla Y$ moves are the only intrinsically knotted graphs with 21 edges.\n  In this paper we present the following results: there are exactly three triangle-free intrinsically knotted graphs with 22 edges having at least two vertices of degree 5. Two are the cousins 94 and 11"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.3460","kind":"arxiv","version":2},"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":"1407.3460","created_at":"2026-05-18T00:38:14.036535+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.3460v2","created_at":"2026-05-18T00:38:14.036535+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.3460","created_at":"2026-05-18T00:38:14.036535+00:00"},{"alias_kind":"pith_short_12","alias_value":"EOZXLPUDIDKZ","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"EOZXLPUDIDKZUCLZ","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"EOZXLPUD","created_at":"2026-05-18T12:28:28.263976+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/EOZXLPUDIDKZUCLZRG2G4PA4AG","json":"https://pith.science/pith/EOZXLPUDIDKZUCLZRG2G4PA4AG.json","graph_json":"https://pith.science/api/pith-number/EOZXLPUDIDKZUCLZRG2G4PA4AG/graph.json","events_json":"https://pith.science/api/pith-number/EOZXLPUDIDKZUCLZRG2G4PA4AG/events.json","paper":"https://pith.science/paper/EOZXLPUD"},"agent_actions":{"view_html":"https://pith.science/pith/EOZXLPUDIDKZUCLZRG2G4PA4AG","download_json":"https://pith.science/pith/EOZXLPUDIDKZUCLZRG2G4PA4AG.json","view_paper":"https://pith.science/paper/EOZXLPUD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.3460&json=true","fetch_graph":"https://pith.science/api/pith-number/EOZXLPUDIDKZUCLZRG2G4PA4AG/graph.json","fetch_events":"https://pith.science/api/pith-number/EOZXLPUDIDKZUCLZRG2G4PA4AG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EOZXLPUDIDKZUCLZRG2G4PA4AG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EOZXLPUDIDKZUCLZRG2G4PA4AG/action/storage_attestation","attest_author":"https://pith.science/pith/EOZXLPUDIDKZUCLZRG2G4PA4AG/action/author_attestation","sign_citation":"https://pith.science/pith/EOZXLPUDIDKZUCLZRG2G4PA4AG/action/citation_signature","submit_replication":"https://pith.science/pith/EOZXLPUDIDKZUCLZRG2G4PA4AG/action/replication_record"}},"created_at":"2026-05-18T00:38:14.036535+00:00","updated_at":"2026-05-18T00:38:14.036535+00:00"}