{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:3CNYVARJKAOA4DKPVL43OALJLW","short_pith_number":"pith:3CNYVARJ","schema_version":"1.0","canonical_sha256":"d89b8a8229501c0e0d4faaf9b701695d975e7c616b66007df5e0fd1a83051a75","source":{"kind":"arxiv","id":"1109.1030","version":2},"attestation_state":"computed","paper":{"title":"An Algorithm for Detecting Intrinsically Knotted Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.GT","authors_text":"Jonathan Miller, Ramin Naimi","submitted_at":"2011-09-05T23:25:22Z","abstract_excerpt":"We describe an algorithm that recognizes some (perhaps all) intrinsically knotted (IK) graphs, and can help find knotless embeddings for graphs that are not IK. The algorithm, implemented as a Mathematica program, has already been used by Goldberg, Mattman, and Naimi [6] to greatly expand the list of known minor minimal IK graphs, and to find knotless embeddings for some graphs that had previously resisted attempts to classify them as IK or non-IK."},"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":"1109.1030","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2011-09-05T23:25:22Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"82a7da4fd11dcb231192153021e2c9cffb15b68cc0fae3fc9fc96b5870f3a813","abstract_canon_sha256":"ab685634d128fb727ea9d4c52b1a8a7bfdc6df9d49f1735161486fd3eda23419"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:58.590037Z","signature_b64":"Vd3MLnAqnibEkF7QK6kJTDPiS1DbXF98RychaVmP7g/JluHOSpoZB52rLR3VbsIeUz72JcG0Ywtvfg+I6YYbDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d89b8a8229501c0e0d4faaf9b701695d975e7c616b66007df5e0fd1a83051a75","last_reissued_at":"2026-05-18T03:10:58.589293Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:58.589293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Algorithm for Detecting Intrinsically Knotted Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.GT","authors_text":"Jonathan Miller, Ramin Naimi","submitted_at":"2011-09-05T23:25:22Z","abstract_excerpt":"We describe an algorithm that recognizes some (perhaps all) intrinsically knotted (IK) graphs, and can help find knotless embeddings for graphs that are not IK. The algorithm, implemented as a Mathematica program, has already been used by Goldberg, Mattman, and Naimi [6] to greatly expand the list of known minor minimal IK graphs, and to find knotless embeddings for some graphs that had previously resisted attempts to classify them as IK or non-IK."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.1030","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":"1109.1030","created_at":"2026-05-18T03:10:58.589437+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.1030v2","created_at":"2026-05-18T03:10:58.589437+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.1030","created_at":"2026-05-18T03:10:58.589437+00:00"},{"alias_kind":"pith_short_12","alias_value":"3CNYVARJKAOA","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_16","alias_value":"3CNYVARJKAOA4DKP","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_8","alias_value":"3CNYVARJ","created_at":"2026-05-18T12:26:18.847500+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/3CNYVARJKAOA4DKPVL43OALJLW","json":"https://pith.science/pith/3CNYVARJKAOA4DKPVL43OALJLW.json","graph_json":"https://pith.science/api/pith-number/3CNYVARJKAOA4DKPVL43OALJLW/graph.json","events_json":"https://pith.science/api/pith-number/3CNYVARJKAOA4DKPVL43OALJLW/events.json","paper":"https://pith.science/paper/3CNYVARJ"},"agent_actions":{"view_html":"https://pith.science/pith/3CNYVARJKAOA4DKPVL43OALJLW","download_json":"https://pith.science/pith/3CNYVARJKAOA4DKPVL43OALJLW.json","view_paper":"https://pith.science/paper/3CNYVARJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.1030&json=true","fetch_graph":"https://pith.science/api/pith-number/3CNYVARJKAOA4DKPVL43OALJLW/graph.json","fetch_events":"https://pith.science/api/pith-number/3CNYVARJKAOA4DKPVL43OALJLW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3CNYVARJKAOA4DKPVL43OALJLW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3CNYVARJKAOA4DKPVL43OALJLW/action/storage_attestation","attest_author":"https://pith.science/pith/3CNYVARJKAOA4DKPVL43OALJLW/action/author_attestation","sign_citation":"https://pith.science/pith/3CNYVARJKAOA4DKPVL43OALJLW/action/citation_signature","submit_replication":"https://pith.science/pith/3CNYVARJKAOA4DKPVL43OALJLW/action/replication_record"}},"created_at":"2026-05-18T03:10:58.589437+00:00","updated_at":"2026-05-18T03:10:58.589437+00:00"}