{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:5ZGE5W7ISWESZDSV276543SOD4","short_pith_number":"pith:5ZGE5W7I","canonical_record":{"source":{"id":"1512.05749","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2015-12-17T20:18:21Z","cross_cats_sorted":[],"title_canon_sha256":"2e2475074525ca098a22bb62690f2846fd959b30a71685441210926c52673894","abstract_canon_sha256":"4acaeeef7b6af5dbc185081e3dfe81063cf8513e8a4b9ca0fcf7aebc7101ae3e"},"schema_version":"1.0"},"canonical_sha256":"ee4c4edbe895892c8e55d7fdde6e4e1f10a836a6a7f96449599c78db57658fe1","source":{"kind":"arxiv","id":"1512.05749","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.05749","created_at":"2026-05-18T01:02:45Z"},{"alias_kind":"arxiv_version","alias_value":"1512.05749v1","created_at":"2026-05-18T01:02:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.05749","created_at":"2026-05-18T01:02:45Z"},{"alias_kind":"pith_short_12","alias_value":"5ZGE5W7ISWES","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"5ZGE5W7ISWESZDSV","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"5ZGE5W7I","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:5ZGE5W7ISWESZDSV276543SOD4","target":"record","payload":{"canonical_record":{"source":{"id":"1512.05749","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2015-12-17T20:18:21Z","cross_cats_sorted":[],"title_canon_sha256":"2e2475074525ca098a22bb62690f2846fd959b30a71685441210926c52673894","abstract_canon_sha256":"4acaeeef7b6af5dbc185081e3dfe81063cf8513e8a4b9ca0fcf7aebc7101ae3e"},"schema_version":"1.0"},"canonical_sha256":"ee4c4edbe895892c8e55d7fdde6e4e1f10a836a6a7f96449599c78db57658fe1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:45.296055Z","signature_b64":"aw4FK7YLxHlba8ungiG38MmKW7zjBvNade34QsP04pc7htETelmfZjsDopsTLmnGDlOYH6HxXr8fqXbWN52RCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee4c4edbe895892c8e55d7fdde6e4e1f10a836a6a7f96449599c78db57658fe1","last_reissued_at":"2026-05-18T01:02:45.295367Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:45.295367Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.05749","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-18T01:02:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xd+7RLGk+SKuxieuUutUf5qsGR9e3t/9S3XjosEtYH6/Ib2gjgf0sYUM/3i/OxA23N2d1KmSu6Ia8ZpN1aanAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T04:51:33.247071Z"},"content_sha256":"7d5c0e6fbbddd10fe870f8fbb3e7b0dd8e14ede5312ca6f1755d261472ff9a58","schema_version":"1.0","event_id":"sha256:7d5c0e6fbbddd10fe870f8fbb3e7b0dd8e14ede5312ca6f1755d261472ff9a58"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:5ZGE5W7ISWESZDSV276543SOD4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Knot Probabilities in Random Diagrams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Harrison Chapman, Jason Cantarella, Matt Mastin","submitted_at":"2015-12-17T20:18:21Z","abstract_excerpt":"We consider a natural model of random knotting- choose a knot diagram at random from the finite set of diagrams with n crossings. We tabulate diagrams with 10 and fewer crossings and classify the diagrams by knot type, allowing us to compute exact probabilities for knots in this model. As expected, most diagrams with 10 and fewer crossings are unknots (about 78% of the roughly 1.6 billion 10 crossing diagrams). For these crossing numbers, the unknot fraction is mostly explained by the prevalence of tree-like diagrams which are unknots for any assignment of over/under information at crossings. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.05749","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-18T01:02:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tA+lB1lEspSX7kMKlSQRwQZbESMZWl5mtjQdZ6LLBQ+af8TXomU/dybDpaDXtCKeJ4ByUST9dkLonpzLtEi0BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T04:51:33.247458Z"},"content_sha256":"a188fb2a52ce4426aaaba963ab9263c3a7a4a0508f0a3c5b1db761c160a049f8","schema_version":"1.0","event_id":"sha256:a188fb2a52ce4426aaaba963ab9263c3a7a4a0508f0a3c5b1db761c160a049f8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5ZGE5W7ISWESZDSV276543SOD4/bundle.json","state_url":"https://pith.science/pith/5ZGE5W7ISWESZDSV276543SOD4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5ZGE5W7ISWESZDSV276543SOD4/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-06-22T04:51:33Z","links":{"resolver":"https://pith.science/pith/5ZGE5W7ISWESZDSV276543SOD4","bundle":"https://pith.science/pith/5ZGE5W7ISWESZDSV276543SOD4/bundle.json","state":"https://pith.science/pith/5ZGE5W7ISWESZDSV276543SOD4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5ZGE5W7ISWESZDSV276543SOD4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:5ZGE5W7ISWESZDSV276543SOD4","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":"4acaeeef7b6af5dbc185081e3dfe81063cf8513e8a4b9ca0fcf7aebc7101ae3e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2015-12-17T20:18:21Z","title_canon_sha256":"2e2475074525ca098a22bb62690f2846fd959b30a71685441210926c52673894"},"schema_version":"1.0","source":{"id":"1512.05749","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.05749","created_at":"2026-05-18T01:02:45Z"},{"alias_kind":"arxiv_version","alias_value":"1512.05749v1","created_at":"2026-05-18T01:02:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.05749","created_at":"2026-05-18T01:02:45Z"},{"alias_kind":"pith_short_12","alias_value":"5ZGE5W7ISWES","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"5ZGE5W7ISWESZDSV","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"5ZGE5W7I","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:a188fb2a52ce4426aaaba963ab9263c3a7a4a0508f0a3c5b1db761c160a049f8","target":"graph","created_at":"2026-05-18T01:02:45Z","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":"We consider a natural model of random knotting- choose a knot diagram at random from the finite set of diagrams with n crossings. We tabulate diagrams with 10 and fewer crossings and classify the diagrams by knot type, allowing us to compute exact probabilities for knots in this model. As expected, most diagrams with 10 and fewer crossings are unknots (about 78% of the roughly 1.6 billion 10 crossing diagrams). For these crossing numbers, the unknot fraction is mostly explained by the prevalence of tree-like diagrams which are unknots for any assignment of over/under information at crossings. ","authors_text":"Harrison Chapman, Jason Cantarella, Matt Mastin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2015-12-17T20:18:21Z","title":"Knot Probabilities in Random Diagrams"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.05749","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:7d5c0e6fbbddd10fe870f8fbb3e7b0dd8e14ede5312ca6f1755d261472ff9a58","target":"record","created_at":"2026-05-18T01:02:45Z","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":"4acaeeef7b6af5dbc185081e3dfe81063cf8513e8a4b9ca0fcf7aebc7101ae3e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2015-12-17T20:18:21Z","title_canon_sha256":"2e2475074525ca098a22bb62690f2846fd959b30a71685441210926c52673894"},"schema_version":"1.0","source":{"id":"1512.05749","kind":"arxiv","version":1}},"canonical_sha256":"ee4c4edbe895892c8e55d7fdde6e4e1f10a836a6a7f96449599c78db57658fe1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ee4c4edbe895892c8e55d7fdde6e4e1f10a836a6a7f96449599c78db57658fe1","first_computed_at":"2026-05-18T01:02:45.295367Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:02:45.295367Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aw4FK7YLxHlba8ungiG38MmKW7zjBvNade34QsP04pc7htETelmfZjsDopsTLmnGDlOYH6HxXr8fqXbWN52RCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:02:45.296055Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.05749","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7d5c0e6fbbddd10fe870f8fbb3e7b0dd8e14ede5312ca6f1755d261472ff9a58","sha256:a188fb2a52ce4426aaaba963ab9263c3a7a4a0508f0a3c5b1db761c160a049f8"],"state_sha256":"afe83ebf640d061ced0fe17bdb51626e6683c14ae7384dc47b7e5295e163491c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gowGkbTWYTcNX7Ea9b8aR9Mes9YwxQl7I+nbKxSRPKbSvxApatnv22ig9JxTRxNMOzfnQ4AHLp9HvX3ex8p+Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T04:51:33.249399Z","bundle_sha256":"e11cfb5cf5bcd14083dc8260fb407ac7f326909832a12c34d027acc9be13aaf3"}}