{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:3VT3KL5KXPMLC3MTEWZOUHCBGE","short_pith_number":"pith:3VT3KL5K","schema_version":"1.0","canonical_sha256":"dd67b52faabbd8b16d9325b2ea1c4131354301fdc4422ac9702708f3fb9473c4","source":{"kind":"arxiv","id":"1710.05237","version":2},"attestation_state":"computed","paper":{"title":"Unknotting numbers for prime $\\theta$-curves up to seven crossings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Danielle O'Donnol (with Appendix by Kenneth L. Baker), Dorothy Buck","submitted_at":"2017-10-14T20:54:17Z","abstract_excerpt":"Determining unknotting numbers is a large and widely studied problem. We consider the more general question of the unknotting number of a spatial graph. We show the unknotting number of spatial graphs is subadditive. Let $g$ be an embedding of a planar graph $G$, then we show $u(g) \\geq \\max\\{u(s) |$ $s$ is a non-overlapping set of constituents of $g\\}$.\n  Focusing on $\\theta$-curves, we determine the exact unknotting numbers of the $\\theta$-curves in the Litherland-Moriuchi Table. Additionally, we demonstrate unknotting crossing changes for all of the curves. In doing this we introduce new me"},"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":"1710.05237","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2017-10-14T20:54:17Z","cross_cats_sorted":[],"title_canon_sha256":"25ba5c72bdbce7f627f2008b5550ffe4e808b4e2b9e7bb64ce9c82e05eed8205","abstract_canon_sha256":"64a79b3b8b24e17ac912c867b84623a407e443e66652dbe7a0584b680f506902"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:01.670536Z","signature_b64":"iRBe3WWDpzhKayvoEwJ3FxICVNRGdsyf0zo9tKncYhyzG6tMvV/GDR8C8HxtyIEWjYxpkGpv9fxmvT+QM/lLDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd67b52faabbd8b16d9325b2ea1c4131354301fdc4422ac9702708f3fb9473c4","last_reissued_at":"2026-05-18T00:17:01.669906Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:01.669906Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unknotting numbers for prime $\\theta$-curves up to seven crossings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Danielle O'Donnol (with Appendix by Kenneth L. Baker), Dorothy Buck","submitted_at":"2017-10-14T20:54:17Z","abstract_excerpt":"Determining unknotting numbers is a large and widely studied problem. We consider the more general question of the unknotting number of a spatial graph. We show the unknotting number of spatial graphs is subadditive. Let $g$ be an embedding of a planar graph $G$, then we show $u(g) \\geq \\max\\{u(s) |$ $s$ is a non-overlapping set of constituents of $g\\}$.\n  Focusing on $\\theta$-curves, we determine the exact unknotting numbers of the $\\theta$-curves in the Litherland-Moriuchi Table. Additionally, we demonstrate unknotting crossing changes for all of the curves. In doing this we introduce new me"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.05237","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":"1710.05237","created_at":"2026-05-18T00:17:01.669991+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.05237v2","created_at":"2026-05-18T00:17:01.669991+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.05237","created_at":"2026-05-18T00:17:01.669991+00:00"},{"alias_kind":"pith_short_12","alias_value":"3VT3KL5KXPML","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"3VT3KL5KXPMLC3MT","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"3VT3KL5K","created_at":"2026-05-18T12:30:58.224056+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/3VT3KL5KXPMLC3MTEWZOUHCBGE","json":"https://pith.science/pith/3VT3KL5KXPMLC3MTEWZOUHCBGE.json","graph_json":"https://pith.science/api/pith-number/3VT3KL5KXPMLC3MTEWZOUHCBGE/graph.json","events_json":"https://pith.science/api/pith-number/3VT3KL5KXPMLC3MTEWZOUHCBGE/events.json","paper":"https://pith.science/paper/3VT3KL5K"},"agent_actions":{"view_html":"https://pith.science/pith/3VT3KL5KXPMLC3MTEWZOUHCBGE","download_json":"https://pith.science/pith/3VT3KL5KXPMLC3MTEWZOUHCBGE.json","view_paper":"https://pith.science/paper/3VT3KL5K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.05237&json=true","fetch_graph":"https://pith.science/api/pith-number/3VT3KL5KXPMLC3MTEWZOUHCBGE/graph.json","fetch_events":"https://pith.science/api/pith-number/3VT3KL5KXPMLC3MTEWZOUHCBGE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3VT3KL5KXPMLC3MTEWZOUHCBGE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3VT3KL5KXPMLC3MTEWZOUHCBGE/action/storage_attestation","attest_author":"https://pith.science/pith/3VT3KL5KXPMLC3MTEWZOUHCBGE/action/author_attestation","sign_citation":"https://pith.science/pith/3VT3KL5KXPMLC3MTEWZOUHCBGE/action/citation_signature","submit_replication":"https://pith.science/pith/3VT3KL5KXPMLC3MTEWZOUHCBGE/action/replication_record"}},"created_at":"2026-05-18T00:17:01.669991+00:00","updated_at":"2026-05-18T00:17:01.669991+00:00"}