{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:U23TXMVYND4EUP3R7FRE54YFH6","short_pith_number":"pith:U23TXMVY","schema_version":"1.0","canonical_sha256":"a6b73bb2b868f84a3f71f9624ef3053fa0db7b138f9e524a4e1ba448ed2e7021","source":{"kind":"arxiv","id":"1311.0526","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1311.0526","created_at":"2026-05-18T03:08:05.630920+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.0526v1","created_at":"2026-05-18T03:08:05.630920+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.0526","created_at":"2026-05-18T03:08:05.630920+00:00"},{"alias_kind":"pith_short_12","alias_value":"U23TXMVYND4E","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_16","alias_value":"U23TXMVYND4EUP3R","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_8","alias_value":"U23TXMVY","created_at":"2026-05-18T12:28:02.375192+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/U23TXMVYND4EUP3R7FRE54YFH6","json":"https://pith.science/pith/U23TXMVYND4EUP3R7FRE54YFH6.json","graph_json":"https://pith.science/api/pith-number/U23TXMVYND4EUP3R7FRE54YFH6/graph.json","events_json":"https://pith.science/api/pith-number/U23TXMVYND4EUP3R7FRE54YFH6/events.json","paper":"https://pith.science/paper/U23TXMVY"},"agent_actions":{"view_html":"https://pith.science/pith/U23TXMVYND4EUP3R7FRE54YFH6","download_json":"https://pith.science/pith/U23TXMVYND4EUP3R7FRE54YFH6.json","view_paper":"https://pith.science/paper/U23TXMVY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.0526&json=true","fetch_graph":"https://pith.science/api/pith-number/U23TXMVYND4EUP3R7FRE54YFH6/graph.json","fetch_events":"https://pith.science/api/pith-number/U23TXMVYND4EUP3R7FRE54YFH6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U23TXMVYND4EUP3R7FRE54YFH6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U23TXMVYND4EUP3R7FRE54YFH6/action/storage_attestation","attest_author":"https://pith.science/pith/U23TXMVYND4EUP3R7FRE54YFH6/action/author_attestation","sign_citation":"https://pith.science/pith/U23TXMVYND4EUP3R7FRE54YFH6/action/citation_signature","submit_replication":"https://pith.science/pith/U23TXMVYND4EUP3R7FRE54YFH6/action/replication_record"}},"created_at":"2026-05-18T03:08:05.630920+00:00","updated_at":"2026-05-18T03:08:05.630920+00:00"}