{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:L5MIDBD5RXPLAIDXQTE75SG2AC","short_pith_number":"pith:L5MIDBD5","schema_version":"1.0","canonical_sha256":"5f5881847d8ddeb0207784c9fec8da00a25274634c67b43023fb7ccdece155b9","source":{"kind":"arxiv","id":"1705.06520","version":1},"attestation_state":"computed","paper":{"title":"The number of strings on essential tangle decompositions of a knot can be unbounded","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Jo\\~ao Miguel Nogueira","submitted_at":"2017-05-18T11:03:41Z","abstract_excerpt":"We construct an infinite collection of knots with the property that any knot in this family has $n$-string essential tangle decompositions for arbitrarily high $n$."},"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":"1705.06520","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2017-05-18T11:03:41Z","cross_cats_sorted":[],"title_canon_sha256":"09ac69bad1ef8d6d511d8bbed053d857c5d5f7024f3dbbf74d13e164c3c270c2","abstract_canon_sha256":"a3f71b5167a9cd66637e38b38a00edee5819b97963088f57b368dcade9e5b35c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:14.507362Z","signature_b64":"MdcxjrAZNTEnyhLK6KFMjiFq1tgMZwJFtvUYRXalDV0TndX9GEEzy6lxYpqecAYl9NTRpamJpyRJX/RkwwdwDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f5881847d8ddeb0207784c9fec8da00a25274634c67b43023fb7ccdece155b9","last_reissued_at":"2026-05-18T00:44:14.506658Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:14.506658Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The number of strings on essential tangle decompositions of a knot can be unbounded","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Jo\\~ao Miguel Nogueira","submitted_at":"2017-05-18T11:03:41Z","abstract_excerpt":"We construct an infinite collection of knots with the property that any knot in this family has $n$-string essential tangle decompositions for arbitrarily high $n$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.06520","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":"1705.06520","created_at":"2026-05-18T00:44:14.506782+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.06520v1","created_at":"2026-05-18T00:44:14.506782+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.06520","created_at":"2026-05-18T00:44:14.506782+00:00"},{"alias_kind":"pith_short_12","alias_value":"L5MIDBD5RXPL","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"L5MIDBD5RXPLAIDX","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"L5MIDBD5","created_at":"2026-05-18T12:31:28.150371+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/L5MIDBD5RXPLAIDXQTE75SG2AC","json":"https://pith.science/pith/L5MIDBD5RXPLAIDXQTE75SG2AC.json","graph_json":"https://pith.science/api/pith-number/L5MIDBD5RXPLAIDXQTE75SG2AC/graph.json","events_json":"https://pith.science/api/pith-number/L5MIDBD5RXPLAIDXQTE75SG2AC/events.json","paper":"https://pith.science/paper/L5MIDBD5"},"agent_actions":{"view_html":"https://pith.science/pith/L5MIDBD5RXPLAIDXQTE75SG2AC","download_json":"https://pith.science/pith/L5MIDBD5RXPLAIDXQTE75SG2AC.json","view_paper":"https://pith.science/paper/L5MIDBD5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.06520&json=true","fetch_graph":"https://pith.science/api/pith-number/L5MIDBD5RXPLAIDXQTE75SG2AC/graph.json","fetch_events":"https://pith.science/api/pith-number/L5MIDBD5RXPLAIDXQTE75SG2AC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L5MIDBD5RXPLAIDXQTE75SG2AC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L5MIDBD5RXPLAIDXQTE75SG2AC/action/storage_attestation","attest_author":"https://pith.science/pith/L5MIDBD5RXPLAIDXQTE75SG2AC/action/author_attestation","sign_citation":"https://pith.science/pith/L5MIDBD5RXPLAIDXQTE75SG2AC/action/citation_signature","submit_replication":"https://pith.science/pith/L5MIDBD5RXPLAIDXQTE75SG2AC/action/replication_record"}},"created_at":"2026-05-18T00:44:14.506782+00:00","updated_at":"2026-05-18T00:44:14.506782+00:00"}