{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2005:C7V2N4BIJ4FCHVPULCZOW5FZCL","short_pith_number":"pith:C7V2N4BI","schema_version":"1.0","canonical_sha256":"17eba6f0284f0a23d5f458b2eb74b912d243d571b1666bbd52f956d9c19f0f34","source":{"kind":"arxiv","id":"math/0511152","version":1},"attestation_state":"computed","paper":{"title":"Seifert surfaces in open books, and a new coding algorithm for links","license":"","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Mikami Hirasawa, Rei Furihata, Tsuyoshi Kobayashi","submitted_at":"2005-11-07T01:00:54Z","abstract_excerpt":"We introduce a new standard form of a Seifert surface $F$. In that standard form, $F$ is obtained by successively plumbing flat annuli to a disk $D$, where the gluing regions are all in $D$. We show that any link has a Seifert surface in the standard form, and thereby present a new way of coding a link. We present an algorithm to read the code directly from a braid presentation."},"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":"math/0511152","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.GT","submitted_at":"2005-11-07T01:00:54Z","cross_cats_sorted":[],"title_canon_sha256":"6e75664c4633942df97a65fba2c0f57d56b22a4ad8868d9f122c0655dcedeefa","abstract_canon_sha256":"478aa1ec279537d3d3415a0bd300b34e4406219ed6f671ebe8f763b0fd1cb474"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:57:51.020501Z","signature_b64":"9dYFuWu6jyQFh0OwmpeBKjD0Mh9HKoynrHDF60iysfg9C1eWuolS/YEgCqZfHrkJF242J0AN6GKiR+RU5kLJBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"17eba6f0284f0a23d5f458b2eb74b912d243d571b1666bbd52f956d9c19f0f34","last_reissued_at":"2026-05-18T02:57:51.020014Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:57:51.020014Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Seifert surfaces in open books, and a new coding algorithm for links","license":"","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Mikami Hirasawa, Rei Furihata, Tsuyoshi Kobayashi","submitted_at":"2005-11-07T01:00:54Z","abstract_excerpt":"We introduce a new standard form of a Seifert surface $F$. In that standard form, $F$ is obtained by successively plumbing flat annuli to a disk $D$, where the gluing regions are all in $D$. We show that any link has a Seifert surface in the standard form, and thereby present a new way of coding a link. We present an algorithm to read the code directly from a braid presentation."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0511152","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":"math/0511152","created_at":"2026-05-18T02:57:51.020087+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0511152v1","created_at":"2026-05-18T02:57:51.020087+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0511152","created_at":"2026-05-18T02:57:51.020087+00:00"},{"alias_kind":"pith_short_12","alias_value":"C7V2N4BIJ4FC","created_at":"2026-05-18T12:25:53.335082+00:00"},{"alias_kind":"pith_short_16","alias_value":"C7V2N4BIJ4FCHVPU","created_at":"2026-05-18T12:25:53.335082+00:00"},{"alias_kind":"pith_short_8","alias_value":"C7V2N4BI","created_at":"2026-05-18T12:25:53.335082+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/C7V2N4BIJ4FCHVPULCZOW5FZCL","json":"https://pith.science/pith/C7V2N4BIJ4FCHVPULCZOW5FZCL.json","graph_json":"https://pith.science/api/pith-number/C7V2N4BIJ4FCHVPULCZOW5FZCL/graph.json","events_json":"https://pith.science/api/pith-number/C7V2N4BIJ4FCHVPULCZOW5FZCL/events.json","paper":"https://pith.science/paper/C7V2N4BI"},"agent_actions":{"view_html":"https://pith.science/pith/C7V2N4BIJ4FCHVPULCZOW5FZCL","download_json":"https://pith.science/pith/C7V2N4BIJ4FCHVPULCZOW5FZCL.json","view_paper":"https://pith.science/paper/C7V2N4BI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0511152&json=true","fetch_graph":"https://pith.science/api/pith-number/C7V2N4BIJ4FCHVPULCZOW5FZCL/graph.json","fetch_events":"https://pith.science/api/pith-number/C7V2N4BIJ4FCHVPULCZOW5FZCL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C7V2N4BIJ4FCHVPULCZOW5FZCL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C7V2N4BIJ4FCHVPULCZOW5FZCL/action/storage_attestation","attest_author":"https://pith.science/pith/C7V2N4BIJ4FCHVPULCZOW5FZCL/action/author_attestation","sign_citation":"https://pith.science/pith/C7V2N4BIJ4FCHVPULCZOW5FZCL/action/citation_signature","submit_replication":"https://pith.science/pith/C7V2N4BIJ4FCHVPULCZOW5FZCL/action/replication_record"}},"created_at":"2026-05-18T02:57:51.020087+00:00","updated_at":"2026-05-18T02:57:51.020087+00:00"}