{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:5KT7FMVK6LHLOZZ7YWQCQHVB6X","short_pith_number":"pith:5KT7FMVK","schema_version":"1.0","canonical_sha256":"eaa7f2b2aaf2ceb7673fc5a0281ea1f5ddc05d8a3b01605e3451bb70315bb26e","source":{"kind":"arxiv","id":"2606.02390","version":1},"attestation_state":"computed","paper":{"title":"Symmetric ribbon numbers of low-complexity knots","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Alexander Zupan, Anok Timothy, Bishop Placke, Eric Corrado, Nick Starns, Sajid Raihan Akash, Sam Sanketh","submitted_at":"2026-06-01T15:37:31Z","abstract_excerpt":"Every knot $K \\subset S^3$ that admits a symmetric union presentation bounds an immersed ribbon disk in $S^3$, while the converse is an open problem due to Christoph Lamm. The symmetric ribbon number $r_s(K)$ of $K$ is the minimum number of ribbon singularities in any symmetric ribbon disk bounded by $K$. In this paper, we undertake a systematic investigation of symmetric ribbon numbers of knots with at most 12 crossings. Along the way, we exhibit novel lower bounds for $r_s(K)$ arising from knot determinants, Alexander polynomials, Jones polynomials, and Kauffman polynomials."},"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":"2606.02390","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2026-06-01T15:37:31Z","cross_cats_sorted":[],"title_canon_sha256":"9e001a8d5b045bcd1ef17c23a6375bfcfcc7bcc59d5b51046d9a312f7fc8456f","abstract_canon_sha256":"3b74b31dcd93b1cbdde19e496307b27c05cc5cd0c7ed60dce5d990e03d376e2a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T03:04:57.907800Z","signature_b64":"PVpsj4jfjiUu5ciJSAZaM5ApNHC7FVIOGECO3pFpJxYg0MKnyTVPynxP25JQLuECiWy0xQR5OswsASjTiIUhAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eaa7f2b2aaf2ceb7673fc5a0281ea1f5ddc05d8a3b01605e3451bb70315bb26e","last_reissued_at":"2026-06-02T03:04:57.907387Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T03:04:57.907387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Symmetric ribbon numbers of low-complexity knots","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Alexander Zupan, Anok Timothy, Bishop Placke, Eric Corrado, Nick Starns, Sajid Raihan Akash, Sam Sanketh","submitted_at":"2026-06-01T15:37:31Z","abstract_excerpt":"Every knot $K \\subset S^3$ that admits a symmetric union presentation bounds an immersed ribbon disk in $S^3$, while the converse is an open problem due to Christoph Lamm. The symmetric ribbon number $r_s(K)$ of $K$ is the minimum number of ribbon singularities in any symmetric ribbon disk bounded by $K$. In this paper, we undertake a systematic investigation of symmetric ribbon numbers of knots with at most 12 crossings. Along the way, we exhibit novel lower bounds for $r_s(K)$ arising from knot determinants, Alexander polynomials, Jones polynomials, and Kauffman polynomials."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.02390","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.02390/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2606.02390","created_at":"2026-06-02T03:04:57.907449+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.02390v1","created_at":"2026-06-02T03:04:57.907449+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.02390","created_at":"2026-06-02T03:04:57.907449+00:00"},{"alias_kind":"pith_short_12","alias_value":"5KT7FMVK6LHL","created_at":"2026-06-02T03:04:57.907449+00:00"},{"alias_kind":"pith_short_16","alias_value":"5KT7FMVK6LHLOZZ7","created_at":"2026-06-02T03:04:57.907449+00:00"},{"alias_kind":"pith_short_8","alias_value":"5KT7FMVK","created_at":"2026-06-02T03:04:57.907449+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/5KT7FMVK6LHLOZZ7YWQCQHVB6X","json":"https://pith.science/pith/5KT7FMVK6LHLOZZ7YWQCQHVB6X.json","graph_json":"https://pith.science/api/pith-number/5KT7FMVK6LHLOZZ7YWQCQHVB6X/graph.json","events_json":"https://pith.science/api/pith-number/5KT7FMVK6LHLOZZ7YWQCQHVB6X/events.json","paper":"https://pith.science/paper/5KT7FMVK"},"agent_actions":{"view_html":"https://pith.science/pith/5KT7FMVK6LHLOZZ7YWQCQHVB6X","download_json":"https://pith.science/pith/5KT7FMVK6LHLOZZ7YWQCQHVB6X.json","view_paper":"https://pith.science/paper/5KT7FMVK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.02390&json=true","fetch_graph":"https://pith.science/api/pith-number/5KT7FMVK6LHLOZZ7YWQCQHVB6X/graph.json","fetch_events":"https://pith.science/api/pith-number/5KT7FMVK6LHLOZZ7YWQCQHVB6X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5KT7FMVK6LHLOZZ7YWQCQHVB6X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5KT7FMVK6LHLOZZ7YWQCQHVB6X/action/storage_attestation","attest_author":"https://pith.science/pith/5KT7FMVK6LHLOZZ7YWQCQHVB6X/action/author_attestation","sign_citation":"https://pith.science/pith/5KT7FMVK6LHLOZZ7YWQCQHVB6X/action/citation_signature","submit_replication":"https://pith.science/pith/5KT7FMVK6LHLOZZ7YWQCQHVB6X/action/replication_record"}},"created_at":"2026-06-02T03:04:57.907449+00:00","updated_at":"2026-06-02T03:04:57.907449+00:00"}