{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:M5VFYQE63MN4YHM3GKV2JLJTFB","short_pith_number":"pith:M5VFYQE6","schema_version":"1.0","canonical_sha256":"676a5c409edb1bcc1d9b32aba4ad332843a30a8742e9bd04186c271f1dd3de5e","source":{"kind":"arxiv","id":"1706.09311","version":1},"attestation_state":"computed","paper":{"title":"Towards a version of Markov's theorem for ribbon torus-links in $\\mathbb{R}^4$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Celeste Damiani","submitted_at":"2017-06-28T14:24:21Z","abstract_excerpt":"In classical knot theory, Markov's theorem gives a way of describing all braids with isotopic closures as links in $\\mathbb{R}^3$. We present a version of Markov's theorem for extended loop braids with closure in $B^3 \\times S^1$, as a first step towards a Markov's theorem for extended loop braids and ribbon torus-links in $\\mathbb{R}^4$."},"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":"1706.09311","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2017-06-28T14:24:21Z","cross_cats_sorted":[],"title_canon_sha256":"61950ba32d79a0fbc423506b37f822ed2b79d55ea5eb2b122674e428b91368ce","abstract_canon_sha256":"c587bc299d602eb2797296ef8c795af9c53f637227773d67fefa9e8a3f8203e7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:19.058072Z","signature_b64":"xfCn2Ay3cwFqStrZCkfo2Mbq3HRWQAwiRgEWUg3RwFGVFZVKtSQQJIZHNb1UD9D+cZAZyz4n7Xb1e4sYH7UYBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"676a5c409edb1bcc1d9b32aba4ad332843a30a8742e9bd04186c271f1dd3de5e","last_reissued_at":"2026-05-18T00:41:19.057280Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:19.057280Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards a version of Markov's theorem for ribbon torus-links in $\\mathbb{R}^4$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Celeste Damiani","submitted_at":"2017-06-28T14:24:21Z","abstract_excerpt":"In classical knot theory, Markov's theorem gives a way of describing all braids with isotopic closures as links in $\\mathbb{R}^3$. We present a version of Markov's theorem for extended loop braids with closure in $B^3 \\times S^1$, as a first step towards a Markov's theorem for extended loop braids and ribbon torus-links in $\\mathbb{R}^4$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.09311","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":"1706.09311","created_at":"2026-05-18T00:41:19.057432+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.09311v1","created_at":"2026-05-18T00:41:19.057432+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.09311","created_at":"2026-05-18T00:41:19.057432+00:00"},{"alias_kind":"pith_short_12","alias_value":"M5VFYQE63MN4","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"M5VFYQE63MN4YHM3","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"M5VFYQE6","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/M5VFYQE63MN4YHM3GKV2JLJTFB","json":"https://pith.science/pith/M5VFYQE63MN4YHM3GKV2JLJTFB.json","graph_json":"https://pith.science/api/pith-number/M5VFYQE63MN4YHM3GKV2JLJTFB/graph.json","events_json":"https://pith.science/api/pith-number/M5VFYQE63MN4YHM3GKV2JLJTFB/events.json","paper":"https://pith.science/paper/M5VFYQE6"},"agent_actions":{"view_html":"https://pith.science/pith/M5VFYQE63MN4YHM3GKV2JLJTFB","download_json":"https://pith.science/pith/M5VFYQE63MN4YHM3GKV2JLJTFB.json","view_paper":"https://pith.science/paper/M5VFYQE6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.09311&json=true","fetch_graph":"https://pith.science/api/pith-number/M5VFYQE63MN4YHM3GKV2JLJTFB/graph.json","fetch_events":"https://pith.science/api/pith-number/M5VFYQE63MN4YHM3GKV2JLJTFB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M5VFYQE63MN4YHM3GKV2JLJTFB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M5VFYQE63MN4YHM3GKV2JLJTFB/action/storage_attestation","attest_author":"https://pith.science/pith/M5VFYQE63MN4YHM3GKV2JLJTFB/action/author_attestation","sign_citation":"https://pith.science/pith/M5VFYQE63MN4YHM3GKV2JLJTFB/action/citation_signature","submit_replication":"https://pith.science/pith/M5VFYQE63MN4YHM3GKV2JLJTFB/action/replication_record"}},"created_at":"2026-05-18T00:41:19.057432+00:00","updated_at":"2026-05-18T00:41:19.057432+00:00"}