{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:62YRAAX3PLRTMXGMYQQSNGIYMD","short_pith_number":"pith:62YRAAX3","schema_version":"1.0","canonical_sha256":"f6b11002fb7ae3365cccc42126991860fbdf89c39145a19fc144b1797400ee21","source":{"kind":"arxiv","id":"1708.00061","version":2},"attestation_state":"computed","paper":{"title":"A Seifert algorithm for lamination links","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Ulrich Oertel","submitted_at":"2017-07-31T20:34:17Z","abstract_excerpt":"We generalize H. Seifert's algorithm for finding a Seifert surface for a knot or link. The generalization applies to \"framed oriented measured lamination links.\" For knots, a Seifert surface determines a unique framing. In our setting, we analyze the set of framed lamination links which bound Seifert laminations and are carried by an $S^1$-fibered tube neighborhood of an oriented train track embedded in a 3-manifold."},"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":"1708.00061","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2017-07-31T20:34:17Z","cross_cats_sorted":[],"title_canon_sha256":"d695fbc13fff1ae549411ce950a626f6394b995d48c5e039b2ebeabd2ed3d290","abstract_canon_sha256":"8cc0c63e9d8a88853d3493af12feecd6e6fcefa04f56a6d5aced308968fca65a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:15.673232Z","signature_b64":"1HTi4L11BMT+5orNfAztjdorYZrrXDSAETAgLp3bsAln0jUlbW0crBJTYg2svYUKIr2rAPbVZe7J9tbXOqypAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6b11002fb7ae3365cccc42126991860fbdf89c39145a19fc144b1797400ee21","last_reissued_at":"2026-05-17T23:57:15.672478Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:15.672478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Seifert algorithm for lamination links","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Ulrich Oertel","submitted_at":"2017-07-31T20:34:17Z","abstract_excerpt":"We generalize H. Seifert's algorithm for finding a Seifert surface for a knot or link. The generalization applies to \"framed oriented measured lamination links.\" For knots, a Seifert surface determines a unique framing. In our setting, we analyze the set of framed lamination links which bound Seifert laminations and are carried by an $S^1$-fibered tube neighborhood of an oriented train track embedded in a 3-manifold."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.00061","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":"1708.00061","created_at":"2026-05-17T23:57:15.672594+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.00061v2","created_at":"2026-05-17T23:57:15.672594+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.00061","created_at":"2026-05-17T23:57:15.672594+00:00"},{"alias_kind":"pith_short_12","alias_value":"62YRAAX3PLRT","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"62YRAAX3PLRTMXGM","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"62YRAAX3","created_at":"2026-05-18T12:31:03.183658+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/62YRAAX3PLRTMXGMYQQSNGIYMD","json":"https://pith.science/pith/62YRAAX3PLRTMXGMYQQSNGIYMD.json","graph_json":"https://pith.science/api/pith-number/62YRAAX3PLRTMXGMYQQSNGIYMD/graph.json","events_json":"https://pith.science/api/pith-number/62YRAAX3PLRTMXGMYQQSNGIYMD/events.json","paper":"https://pith.science/paper/62YRAAX3"},"agent_actions":{"view_html":"https://pith.science/pith/62YRAAX3PLRTMXGMYQQSNGIYMD","download_json":"https://pith.science/pith/62YRAAX3PLRTMXGMYQQSNGIYMD.json","view_paper":"https://pith.science/paper/62YRAAX3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.00061&json=true","fetch_graph":"https://pith.science/api/pith-number/62YRAAX3PLRTMXGMYQQSNGIYMD/graph.json","fetch_events":"https://pith.science/api/pith-number/62YRAAX3PLRTMXGMYQQSNGIYMD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/62YRAAX3PLRTMXGMYQQSNGIYMD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/62YRAAX3PLRTMXGMYQQSNGIYMD/action/storage_attestation","attest_author":"https://pith.science/pith/62YRAAX3PLRTMXGMYQQSNGIYMD/action/author_attestation","sign_citation":"https://pith.science/pith/62YRAAX3PLRTMXGMYQQSNGIYMD/action/citation_signature","submit_replication":"https://pith.science/pith/62YRAAX3PLRTMXGMYQQSNGIYMD/action/replication_record"}},"created_at":"2026-05-17T23:57:15.672594+00:00","updated_at":"2026-05-17T23:57:15.672594+00:00"}