{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:7RJCGVWR4KPZM7SPKQDJFL3NZB","short_pith_number":"pith:7RJCGVWR","schema_version":"1.0","canonical_sha256":"fc522356d1e29f967e4f540692af6dc85b4836836933f2b3ce3c7aa999b740f0","source":{"kind":"arxiv","id":"1405.7683","version":3},"attestation_state":"computed","paper":{"title":"Crossing Number Bound in Knot Mosaics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Andrew Kobin, Hugh Howards","submitted_at":"2014-05-29T19:53:26Z","abstract_excerpt":"Knot mosaics are used to model physical quantum states. The mosaic number of a knot is the smallest integer $m$ such that the knot can be represented as a knot $m$-mosaic. In this paper we establish an upper bound for the crossing number of a knot in terms of the mosaic number. Given an $m$-mosaic and any knot $K$ that is represented on the mosaic, its crossing number $c$ is bounded above by $(m - 2)^{2} - 2$ if $m$ is odd, and $(m - 2)^{2} - (m - 3)$ if $m$ is even."},"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":"1405.7683","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2014-05-29T19:53:26Z","cross_cats_sorted":[],"title_canon_sha256":"fe098ef052f0a9138f9962c8c3487721d678f52bf1c672f49c116202b526aab6","abstract_canon_sha256":"d7e8199f423ea6bd87eda57e9ff53d96d3edbbed6d31573962c9eb3b7e7286ad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:57.653293Z","signature_b64":"o8LBTq+gVRG5TRNFdQKRbhP92VXHeaUN/fddCQlu2htujKAZHvI8z+7E1M7dYlXtG2tPPBlnBIUwQfamxhHCDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc522356d1e29f967e4f540692af6dc85b4836836933f2b3ce3c7aa999b740f0","last_reissued_at":"2026-05-18T00:14:57.652586Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:57.652586Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Crossing Number Bound in Knot Mosaics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Andrew Kobin, Hugh Howards","submitted_at":"2014-05-29T19:53:26Z","abstract_excerpt":"Knot mosaics are used to model physical quantum states. The mosaic number of a knot is the smallest integer $m$ such that the knot can be represented as a knot $m$-mosaic. In this paper we establish an upper bound for the crossing number of a knot in terms of the mosaic number. Given an $m$-mosaic and any knot $K$ that is represented on the mosaic, its crossing number $c$ is bounded above by $(m - 2)^{2} - 2$ if $m$ is odd, and $(m - 2)^{2} - (m - 3)$ if $m$ is even."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.7683","kind":"arxiv","version":3},"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":"1405.7683","created_at":"2026-05-18T00:14:57.652718+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.7683v3","created_at":"2026-05-18T00:14:57.652718+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.7683","created_at":"2026-05-18T00:14:57.652718+00:00"},{"alias_kind":"pith_short_12","alias_value":"7RJCGVWR4KPZ","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"7RJCGVWR4KPZM7SP","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"7RJCGVWR","created_at":"2026-05-18T12:28:19.803747+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/7RJCGVWR4KPZM7SPKQDJFL3NZB","json":"https://pith.science/pith/7RJCGVWR4KPZM7SPKQDJFL3NZB.json","graph_json":"https://pith.science/api/pith-number/7RJCGVWR4KPZM7SPKQDJFL3NZB/graph.json","events_json":"https://pith.science/api/pith-number/7RJCGVWR4KPZM7SPKQDJFL3NZB/events.json","paper":"https://pith.science/paper/7RJCGVWR"},"agent_actions":{"view_html":"https://pith.science/pith/7RJCGVWR4KPZM7SPKQDJFL3NZB","download_json":"https://pith.science/pith/7RJCGVWR4KPZM7SPKQDJFL3NZB.json","view_paper":"https://pith.science/paper/7RJCGVWR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.7683&json=true","fetch_graph":"https://pith.science/api/pith-number/7RJCGVWR4KPZM7SPKQDJFL3NZB/graph.json","fetch_events":"https://pith.science/api/pith-number/7RJCGVWR4KPZM7SPKQDJFL3NZB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7RJCGVWR4KPZM7SPKQDJFL3NZB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7RJCGVWR4KPZM7SPKQDJFL3NZB/action/storage_attestation","attest_author":"https://pith.science/pith/7RJCGVWR4KPZM7SPKQDJFL3NZB/action/author_attestation","sign_citation":"https://pith.science/pith/7RJCGVWR4KPZM7SPKQDJFL3NZB/action/citation_signature","submit_replication":"https://pith.science/pith/7RJCGVWR4KPZM7SPKQDJFL3NZB/action/replication_record"}},"created_at":"2026-05-18T00:14:57.652718+00:00","updated_at":"2026-05-18T00:14:57.652718+00:00"}