{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:KGBHWIX4NDEE6SKHI26SSGQMKK","short_pith_number":"pith:KGBHWIX4","schema_version":"1.0","canonical_sha256":"51827b22fc68c84f494746bd291a0c52aa2c0cdf73d211dc09f1ff7d3390f35c","source":{"kind":"arxiv","id":"1612.06328","version":2},"attestation_state":"computed","paper":{"title":"Constructing a polynomial whose nodal set is any prescribed knot or link","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"math.GT","authors_text":"Benjamin Bode, Mark R. Dennis","submitted_at":"2016-12-19T20:03:02Z","abstract_excerpt":"We describe an algorithm that for every given braid $B$ explicitly constructs a function $f:\\mathbb{C}^{2}\\rightarrow\\mathbb{C}$ such that $f$ is a polynomial in $u$, $v$ and $\\overline{v}$ and the zero level set of $f$ on the unit three-sphere is the closure of $B$. The nature of this construction allows us to prove certain properties of the constructed polynomials. In particular, we provide bounds on the degree of $f$ in terms of braid data."},"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":"1612.06328","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2016-12-19T20:03:02Z","cross_cats_sorted":["math-ph","math.MP"],"title_canon_sha256":"c6332e6e5a8d10590495e53a17aa7d54cb348a3a502738a98d8127224938a034","abstract_canon_sha256":"18528d14c9a351606a369da33cf046372cb2ce3a33bdb025a4fb6d49aa136ec0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:15.182242Z","signature_b64":"UonQsmv3nZBA/DDP2Y/SHSBwgVjxtbVDsaDpanKaYOF35otJVuZNtM3gE7nX+HatD8M1sSDMbjiyAnBEs6q0BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51827b22fc68c84f494746bd291a0c52aa2c0cdf73d211dc09f1ff7d3390f35c","last_reissued_at":"2026-05-18T00:54:15.181872Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:15.181872Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constructing a polynomial whose nodal set is any prescribed knot or link","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"math.GT","authors_text":"Benjamin Bode, Mark R. Dennis","submitted_at":"2016-12-19T20:03:02Z","abstract_excerpt":"We describe an algorithm that for every given braid $B$ explicitly constructs a function $f:\\mathbb{C}^{2}\\rightarrow\\mathbb{C}$ such that $f$ is a polynomial in $u$, $v$ and $\\overline{v}$ and the zero level set of $f$ on the unit three-sphere is the closure of $B$. The nature of this construction allows us to prove certain properties of the constructed polynomials. In particular, we provide bounds on the degree of $f$ in terms of braid data."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.06328","kind":"arxiv","version":2},"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":"1612.06328","created_at":"2026-05-18T00:54:15.181928+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.06328v2","created_at":"2026-05-18T00:54:15.181928+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.06328","created_at":"2026-05-18T00:54:15.181928+00:00"},{"alias_kind":"pith_short_12","alias_value":"KGBHWIX4NDEE","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"KGBHWIX4NDEE6SKH","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"KGBHWIX4","created_at":"2026-05-18T12:30:25.849896+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/KGBHWIX4NDEE6SKHI26SSGQMKK","json":"https://pith.science/pith/KGBHWIX4NDEE6SKHI26SSGQMKK.json","graph_json":"https://pith.science/api/pith-number/KGBHWIX4NDEE6SKHI26SSGQMKK/graph.json","events_json":"https://pith.science/api/pith-number/KGBHWIX4NDEE6SKHI26SSGQMKK/events.json","paper":"https://pith.science/paper/KGBHWIX4"},"agent_actions":{"view_html":"https://pith.science/pith/KGBHWIX4NDEE6SKHI26SSGQMKK","download_json":"https://pith.science/pith/KGBHWIX4NDEE6SKHI26SSGQMKK.json","view_paper":"https://pith.science/paper/KGBHWIX4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.06328&json=true","fetch_graph":"https://pith.science/api/pith-number/KGBHWIX4NDEE6SKHI26SSGQMKK/graph.json","fetch_events":"https://pith.science/api/pith-number/KGBHWIX4NDEE6SKHI26SSGQMKK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KGBHWIX4NDEE6SKHI26SSGQMKK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KGBHWIX4NDEE6SKHI26SSGQMKK/action/storage_attestation","attest_author":"https://pith.science/pith/KGBHWIX4NDEE6SKHI26SSGQMKK/action/author_attestation","sign_citation":"https://pith.science/pith/KGBHWIX4NDEE6SKHI26SSGQMKK/action/citation_signature","submit_replication":"https://pith.science/pith/KGBHWIX4NDEE6SKHI26SSGQMKK/action/replication_record"}},"created_at":"2026-05-18T00:54:15.181928+00:00","updated_at":"2026-05-18T00:54:15.181928+00:00"}