{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:7C2NJHHXAPDWYEDAQ6R7ZSZMQR","short_pith_number":"pith:7C2NJHHX","canonical_record":{"source":{"id":"1411.1837","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2014-11-07T05:59:45Z","cross_cats_sorted":[],"title_canon_sha256":"0e6d7f00b9dd483c2f14e676d186a5fbc304c8f1ab884690215f85b42b15bed2","abstract_canon_sha256":"210461b3169c7dc2405f4c1d6d602d0ffe25ea4b31624f22a147826e74fff460"},"schema_version":"1.0"},"canonical_sha256":"f8b4d49cf703c76c106087a3fccb2c846377ddb648e80b67e4d205330998b666","source":{"kind":"arxiv","id":"1411.1837","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.1837","created_at":"2026-05-18T02:38:25Z"},{"alias_kind":"arxiv_version","alias_value":"1411.1837v1","created_at":"2026-05-18T02:38:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.1837","created_at":"2026-05-18T02:38:25Z"},{"alias_kind":"pith_short_12","alias_value":"7C2NJHHXAPDW","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"7C2NJHHXAPDWYEDA","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"7C2NJHHX","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:7C2NJHHXAPDWYEDAQ6R7ZSZMQR","target":"record","payload":{"canonical_record":{"source":{"id":"1411.1837","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2014-11-07T05:59:45Z","cross_cats_sorted":[],"title_canon_sha256":"0e6d7f00b9dd483c2f14e676d186a5fbc304c8f1ab884690215f85b42b15bed2","abstract_canon_sha256":"210461b3169c7dc2405f4c1d6d602d0ffe25ea4b31624f22a147826e74fff460"},"schema_version":"1.0"},"canonical_sha256":"f8b4d49cf703c76c106087a3fccb2c846377ddb648e80b67e4d205330998b666","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:25.825328Z","signature_b64":"guRjP79y8UmzFhVz2Jxhw988bSS4vRf/uLuCW0/oCbCmCFwxnDupBZceW+hYis3jRB3mq71oynbDYCUOVNWAAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f8b4d49cf703c76c106087a3fccb2c846377ddb648e80b67e4d205330998b666","last_reissued_at":"2026-05-18T02:38:25.824756Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:25.824756Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.1837","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:38:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9d4WBiF9Y6C1E3MfB5tL/zgQ/jHhK+C1qOkKyjRt6nB/xsmxxB4wgc5Xc5ATwo/1Oj9Go/0ZrxSqGbkyA0sjDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T05:52:56.405471Z"},"content_sha256":"a5d68c701c98f7a90f296e8d119dc8d203a51868c0b80a9f84c982e82a410abd","schema_version":"1.0","event_id":"sha256:a5d68c701c98f7a90f296e8d119dc8d203a51868c0b80a9f84c982e82a410abd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:7C2NJHHXAPDWYEDAQ6R7ZSZMQR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bipartite intrinsically knotted graphs with 22 edges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Hyoungjun Kim, Seungsang Oh, Thomas Mattman","submitted_at":"2014-11-07T05:59:45Z","abstract_excerpt":"A graph is intrinsically knotted if every embedding contains a knotted cycle. It is known that intrinsically knotted graphs have at least 21 edges and that the KS graphs, $K_7$ and the 13 graphs obtained from $K_7$ by $\\nabla Y$ moves, are the only minor minimal intrinsically knotted graphs with 21 edges. This set includes exactly one bipartite graph, the Heawood graph.\n  In this paper we classify the intrinsically knotted bipartite graphs with at most 22 edges. Previously known examples of intrinsically knotted graphs of size 22 were those with KS graph minor and the 168 graphs in the $K_{3,3"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.1837","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:38:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vmls5tX1nkCf9o3yRrUDU8//FXWCuJhrogwq6lh8qRrw8eR9bJ8IcM+ukJs85zLA4iV7VAVwYyoEpL5xN0Q9Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T05:52:56.406116Z"},"content_sha256":"51742767cf6d17195bc4fd5a33e4050793b6d4cb90e9d4f0f9ed9a2658488b6c","schema_version":"1.0","event_id":"sha256:51742767cf6d17195bc4fd5a33e4050793b6d4cb90e9d4f0f9ed9a2658488b6c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7C2NJHHXAPDWYEDAQ6R7ZSZMQR/bundle.json","state_url":"https://pith.science/pith/7C2NJHHXAPDWYEDAQ6R7ZSZMQR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7C2NJHHXAPDWYEDAQ6R7ZSZMQR/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-25T05:52:56Z","links":{"resolver":"https://pith.science/pith/7C2NJHHXAPDWYEDAQ6R7ZSZMQR","bundle":"https://pith.science/pith/7C2NJHHXAPDWYEDAQ6R7ZSZMQR/bundle.json","state":"https://pith.science/pith/7C2NJHHXAPDWYEDAQ6R7ZSZMQR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7C2NJHHXAPDWYEDAQ6R7ZSZMQR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:7C2NJHHXAPDWYEDAQ6R7ZSZMQR","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"210461b3169c7dc2405f4c1d6d602d0ffe25ea4b31624f22a147826e74fff460","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2014-11-07T05:59:45Z","title_canon_sha256":"0e6d7f00b9dd483c2f14e676d186a5fbc304c8f1ab884690215f85b42b15bed2"},"schema_version":"1.0","source":{"id":"1411.1837","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.1837","created_at":"2026-05-18T02:38:25Z"},{"alias_kind":"arxiv_version","alias_value":"1411.1837v1","created_at":"2026-05-18T02:38:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.1837","created_at":"2026-05-18T02:38:25Z"},{"alias_kind":"pith_short_12","alias_value":"7C2NJHHXAPDW","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"7C2NJHHXAPDWYEDA","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"7C2NJHHX","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:51742767cf6d17195bc4fd5a33e4050793b6d4cb90e9d4f0f9ed9a2658488b6c","target":"graph","created_at":"2026-05-18T02:38:25Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"A graph is intrinsically knotted if every embedding contains a knotted cycle. It is known that intrinsically knotted graphs have at least 21 edges and that the KS graphs, $K_7$ and the 13 graphs obtained from $K_7$ by $\\nabla Y$ moves, are the only minor minimal intrinsically knotted graphs with 21 edges. This set includes exactly one bipartite graph, the Heawood graph.\n  In this paper we classify the intrinsically knotted bipartite graphs with at most 22 edges. Previously known examples of intrinsically knotted graphs of size 22 were those with KS graph minor and the 168 graphs in the $K_{3,3","authors_text":"Hyoungjun Kim, Seungsang Oh, Thomas Mattman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2014-11-07T05:59:45Z","title":"Bipartite intrinsically knotted graphs with 22 edges"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.1837","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a5d68c701c98f7a90f296e8d119dc8d203a51868c0b80a9f84c982e82a410abd","target":"record","created_at":"2026-05-18T02:38:25Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"210461b3169c7dc2405f4c1d6d602d0ffe25ea4b31624f22a147826e74fff460","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2014-11-07T05:59:45Z","title_canon_sha256":"0e6d7f00b9dd483c2f14e676d186a5fbc304c8f1ab884690215f85b42b15bed2"},"schema_version":"1.0","source":{"id":"1411.1837","kind":"arxiv","version":1}},"canonical_sha256":"f8b4d49cf703c76c106087a3fccb2c846377ddb648e80b67e4d205330998b666","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f8b4d49cf703c76c106087a3fccb2c846377ddb648e80b67e4d205330998b666","first_computed_at":"2026-05-18T02:38:25.824756Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:38:25.824756Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"guRjP79y8UmzFhVz2Jxhw988bSS4vRf/uLuCW0/oCbCmCFwxnDupBZceW+hYis3jRB3mq71oynbDYCUOVNWAAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:38:25.825328Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.1837","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a5d68c701c98f7a90f296e8d119dc8d203a51868c0b80a9f84c982e82a410abd","sha256:51742767cf6d17195bc4fd5a33e4050793b6d4cb90e9d4f0f9ed9a2658488b6c"],"state_sha256":"05cfc962987e49b8588911a5071325670626c3a736bf5c2ff60b998de59e8d18"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GKqRo5TdOAi2kf5icQN4k0gwjx62AN24u5KdBoX5eo/B068Nzeai/oiyjjyXYCia+dwvz39KRJfuj62BvQc9CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T05:52:56.408963Z","bundle_sha256":"ad479a94d157690341cb08e877b17f9bf284d55a36e51891ec29c919b29a62a2"}}