{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:U23TXMVYND4EUP3R7FRE54YFH6","short_pith_number":"pith:U23TXMVY","canonical_record":{"source":{"id":"1311.0526","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2013-11-03T20:55:56Z","cross_cats_sorted":[],"title_canon_sha256":"43d77b87c08dfb52c0180521f6ed8bfcd170237a7286bbd29410ac81452a08e7","abstract_canon_sha256":"7db5070743dd9a561986560d34e1a9be7a24ad2b7ecba75a167ea08fd106548b"},"schema_version":"1.0"},"canonical_sha256":"a6b73bb2b868f84a3f71f9624ef3053fa0db7b138f9e524a4e1ba448ed2e7021","source":{"kind":"arxiv","id":"1311.0526","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.0526","created_at":"2026-05-18T03:08:05Z"},{"alias_kind":"arxiv_version","alias_value":"1311.0526v1","created_at":"2026-05-18T03:08:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.0526","created_at":"2026-05-18T03:08:05Z"},{"alias_kind":"pith_short_12","alias_value":"U23TXMVYND4E","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"U23TXMVYND4EUP3R","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"U23TXMVY","created_at":"2026-05-18T12:28:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:U23TXMVYND4EUP3R7FRE54YFH6","target":"record","payload":{"canonical_record":{"source":{"id":"1311.0526","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2013-11-03T20:55:56Z","cross_cats_sorted":[],"title_canon_sha256":"43d77b87c08dfb52c0180521f6ed8bfcd170237a7286bbd29410ac81452a08e7","abstract_canon_sha256":"7db5070743dd9a561986560d34e1a9be7a24ad2b7ecba75a167ea08fd106548b"},"schema_version":"1.0"},"canonical_sha256":"a6b73bb2b868f84a3f71f9624ef3053fa0db7b138f9e524a4e1ba448ed2e7021","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:08:05.631342Z","signature_b64":"YrN7hSUVxe7hv4vwlqQ0zqjp+VMKFHrcQYV+6yAlEpDoB2m+RhcOuxLwZtvogt4vfK4udrUMQeDvMr1z8fJwBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a6b73bb2b868f84a3f71f9624ef3053fa0db7b138f9e524a4e1ba448ed2e7021","last_reissued_at":"2026-05-18T03:08:05.630841Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:08:05.630841Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.0526","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-18T03:08:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pwDTYBeVtRFZU7SinR+OuDuZ8hAU0dF5+32saLckPFgK880FdLp6qgOpNgYuKwUYKLOfEAvr807wnA39rtYeAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T02:40:25.169470Z"},"content_sha256":"c360679d2ee0049b0931689b1199cca5f1adb2be93fa3aabc0905d420aeabbb5","schema_version":"1.0","event_id":"sha256:c360679d2ee0049b0931689b1199cca5f1adb2be93fa3aabc0905d420aeabbb5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:U23TXMVYND4EUP3R7FRE54YFH6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bounds on \\\"{U}bercrossing and Petal Numbers for Knots","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Ashley Weber, Colin Adams, Daniel Irvine, Daniel Vitek, Jesse Freeman, Orsola Capovilla-Searle, Samantha Petti, Sicong Zhang","submitted_at":"2013-11-03T20:55:56Z","abstract_excerpt":"An $n$-crossing is a point in the projection of a knot where $n$ strands cross so that each strand bisects the crossing. An \\\"ubercrossing projection has a single $n$-crossing and a petal projection has a single $n$-crossing such that there are no loops nested within others. The \\\"ubercrossing number, $\\text{\\\"u}(K)$, is the smallest $n$ for which we can represent a knot $K$ with a single $n$-crossing. The petal number is the number of loops in the minimal petal projection. In this paper, we relate the \\\"{u}bercrossing number and petal number to well-known invariants such as crossing number, b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.0526","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-18T03:08:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iSmwWMhZHFsmrjljfBPwji0J7woobqB2k00lP3Ug9C42Vljs8gV9yFBEQdBB9Vx2NWe5lvPi8oOcRbPhIzi/AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T02:40:25.169940Z"},"content_sha256":"466755635a6231284da41846f4a5fd562e4f05b3d53ca002ec52fdd2e4d9ac45","schema_version":"1.0","event_id":"sha256:466755635a6231284da41846f4a5fd562e4f05b3d53ca002ec52fdd2e4d9ac45"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U23TXMVYND4EUP3R7FRE54YFH6/bundle.json","state_url":"https://pith.science/pith/U23TXMVYND4EUP3R7FRE54YFH6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U23TXMVYND4EUP3R7FRE54YFH6/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-23T02:40:25Z","links":{"resolver":"https://pith.science/pith/U23TXMVYND4EUP3R7FRE54YFH6","bundle":"https://pith.science/pith/U23TXMVYND4EUP3R7FRE54YFH6/bundle.json","state":"https://pith.science/pith/U23TXMVYND4EUP3R7FRE54YFH6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U23TXMVYND4EUP3R7FRE54YFH6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:U23TXMVYND4EUP3R7FRE54YFH6","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":"7db5070743dd9a561986560d34e1a9be7a24ad2b7ecba75a167ea08fd106548b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2013-11-03T20:55:56Z","title_canon_sha256":"43d77b87c08dfb52c0180521f6ed8bfcd170237a7286bbd29410ac81452a08e7"},"schema_version":"1.0","source":{"id":"1311.0526","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.0526","created_at":"2026-05-18T03:08:05Z"},{"alias_kind":"arxiv_version","alias_value":"1311.0526v1","created_at":"2026-05-18T03:08:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.0526","created_at":"2026-05-18T03:08:05Z"},{"alias_kind":"pith_short_12","alias_value":"U23TXMVYND4E","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"U23TXMVYND4EUP3R","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"U23TXMVY","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:466755635a6231284da41846f4a5fd562e4f05b3d53ca002ec52fdd2e4d9ac45","target":"graph","created_at":"2026-05-18T03:08:05Z","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":"An $n$-crossing is a point in the projection of a knot where $n$ strands cross so that each strand bisects the crossing. An \\\"ubercrossing projection has a single $n$-crossing and a petal projection has a single $n$-crossing such that there are no loops nested within others. The \\\"ubercrossing number, $\\text{\\\"u}(K)$, is the smallest $n$ for which we can represent a knot $K$ with a single $n$-crossing. The petal number is the number of loops in the minimal petal projection. In this paper, we relate the \\\"{u}bercrossing number and petal number to well-known invariants such as crossing number, b","authors_text":"Ashley Weber, Colin Adams, Daniel Irvine, Daniel Vitek, Jesse Freeman, Orsola Capovilla-Searle, Samantha Petti, Sicong Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2013-11-03T20:55:56Z","title":"Bounds on \\\"{U}bercrossing and Petal Numbers for Knots"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.0526","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:c360679d2ee0049b0931689b1199cca5f1adb2be93fa3aabc0905d420aeabbb5","target":"record","created_at":"2026-05-18T03:08:05Z","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":"7db5070743dd9a561986560d34e1a9be7a24ad2b7ecba75a167ea08fd106548b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2013-11-03T20:55:56Z","title_canon_sha256":"43d77b87c08dfb52c0180521f6ed8bfcd170237a7286bbd29410ac81452a08e7"},"schema_version":"1.0","source":{"id":"1311.0526","kind":"arxiv","version":1}},"canonical_sha256":"a6b73bb2b868f84a3f71f9624ef3053fa0db7b138f9e524a4e1ba448ed2e7021","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a6b73bb2b868f84a3f71f9624ef3053fa0db7b138f9e524a4e1ba448ed2e7021","first_computed_at":"2026-05-18T03:08:05.630841Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:08:05.630841Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YrN7hSUVxe7hv4vwlqQ0zqjp+VMKFHrcQYV+6yAlEpDoB2m+RhcOuxLwZtvogt4vfK4udrUMQeDvMr1z8fJwBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:08:05.631342Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.0526","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c360679d2ee0049b0931689b1199cca5f1adb2be93fa3aabc0905d420aeabbb5","sha256:466755635a6231284da41846f4a5fd562e4f05b3d53ca002ec52fdd2e4d9ac45"],"state_sha256":"29c862a4436db8410c2dbcd7eba8ec69e975cfcf9b43cc10c2dc7d3fb4f145b7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6e5Dimuwlow3WgO6K0Vbmg3iwx4ooIYFGisVhriZMrlwZn2Em8FBX5JA50dL+vDISM2eGbAO/1IMHwTJ1gdfAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T02:40:25.172485Z","bundle_sha256":"03ac04e7092c5fb3afe2f724119a558977d41cee9973d8aeff4e6a3715748b63"}}