{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:WQYAPIA2BDAUCDNE4SPHNMNQVX","short_pith_number":"pith:WQYAPIA2","schema_version":"1.0","canonical_sha256":"b43007a01a08c1410da4e49e76b1b0adfa7d31ebe40060bc525c7e20c547ecee","source":{"kind":"arxiv","id":"1704.01232","version":3},"attestation_state":"computed","paper":{"title":"The structure of a minimal $n$-chart with two crossings I: Complementary domains of $\\Gamma_1\\cup\\Gamma_{n-1}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Akiko Shima, Teruo Nagase","submitted_at":"2017-04-05T01:05:35Z","abstract_excerpt":"This is the first step of the two steps to enumerate the minimal charts with two crossings. For a label $m$ of a chart $\\Gamma$ we denote by $\\Gamma_m$ the union of all the edges of label $m$ and their vertices. For a minimal chart $\\Gamma$ with exactly two crossings, we can show that the two crossings are contained in $\\Gamma_\\alpha\\cap\\Gamma_\\beta$ for some labels $\\alpha<\\beta$. In this paper, we study the structure of a disk $D$ not containing any crossing but satisfying $\\Gamma\\cap \\partial D\\subset\\Gamma_{\\alpha+1}\\cup \\Gamma_{\\beta-1}$."},"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":"1704.01232","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2017-04-05T01:05:35Z","cross_cats_sorted":[],"title_canon_sha256":"ec1ac9a0d824550771e5b9924d919bdcd401fb55eec3e5d1b26d8f9a01d731e5","abstract_canon_sha256":"6a747a821a00492b7495dd76000dd29237c1f9256279b65a072bffad7dfe521e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:29.013136Z","signature_b64":"sLoutLQnnSNw6fFyi/uG/sjyWlJE/n/SSVMhzRyqIXhvndRq3fJvssqdC9kX3yI/QLo6f/Qeq4hhA05izLG0BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b43007a01a08c1410da4e49e76b1b0adfa7d31ebe40060bc525c7e20c547ecee","last_reissued_at":"2026-05-18T00:14:29.012492Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:29.012492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The structure of a minimal $n$-chart with two crossings I: Complementary domains of $\\Gamma_1\\cup\\Gamma_{n-1}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Akiko Shima, Teruo Nagase","submitted_at":"2017-04-05T01:05:35Z","abstract_excerpt":"This is the first step of the two steps to enumerate the minimal charts with two crossings. For a label $m$ of a chart $\\Gamma$ we denote by $\\Gamma_m$ the union of all the edges of label $m$ and their vertices. For a minimal chart $\\Gamma$ with exactly two crossings, we can show that the two crossings are contained in $\\Gamma_\\alpha\\cap\\Gamma_\\beta$ for some labels $\\alpha<\\beta$. In this paper, we study the structure of a disk $D$ not containing any crossing but satisfying $\\Gamma\\cap \\partial D\\subset\\Gamma_{\\alpha+1}\\cup \\Gamma_{\\beta-1}$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.01232","kind":"arxiv","version":3},"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":"1704.01232","created_at":"2026-05-18T00:14:29.012578+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.01232v3","created_at":"2026-05-18T00:14:29.012578+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.01232","created_at":"2026-05-18T00:14:29.012578+00:00"},{"alias_kind":"pith_short_12","alias_value":"WQYAPIA2BDAU","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"WQYAPIA2BDAUCDNE","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"WQYAPIA2","created_at":"2026-05-18T12:31:53.515858+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.04114","citing_title":"The linear minimal 4-chart with three crossings","ref_index":10,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WQYAPIA2BDAUCDNE4SPHNMNQVX","json":"https://pith.science/pith/WQYAPIA2BDAUCDNE4SPHNMNQVX.json","graph_json":"https://pith.science/api/pith-number/WQYAPIA2BDAUCDNE4SPHNMNQVX/graph.json","events_json":"https://pith.science/api/pith-number/WQYAPIA2BDAUCDNE4SPHNMNQVX/events.json","paper":"https://pith.science/paper/WQYAPIA2"},"agent_actions":{"view_html":"https://pith.science/pith/WQYAPIA2BDAUCDNE4SPHNMNQVX","download_json":"https://pith.science/pith/WQYAPIA2BDAUCDNE4SPHNMNQVX.json","view_paper":"https://pith.science/paper/WQYAPIA2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.01232&json=true","fetch_graph":"https://pith.science/api/pith-number/WQYAPIA2BDAUCDNE4SPHNMNQVX/graph.json","fetch_events":"https://pith.science/api/pith-number/WQYAPIA2BDAUCDNE4SPHNMNQVX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WQYAPIA2BDAUCDNE4SPHNMNQVX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WQYAPIA2BDAUCDNE4SPHNMNQVX/action/storage_attestation","attest_author":"https://pith.science/pith/WQYAPIA2BDAUCDNE4SPHNMNQVX/action/author_attestation","sign_citation":"https://pith.science/pith/WQYAPIA2BDAUCDNE4SPHNMNQVX/action/citation_signature","submit_replication":"https://pith.science/pith/WQYAPIA2BDAUCDNE4SPHNMNQVX/action/replication_record"}},"created_at":"2026-05-18T00:14:29.012578+00:00","updated_at":"2026-05-18T00:14:29.012578+00:00"}