{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:XURTNZCWEDPDN7ENFW77FXZ5J7","short_pith_number":"pith:XURTNZCW","schema_version":"1.0","canonical_sha256":"bd2336e45620de36fc8d2dbff2df3d4fdf91b5024df07db40900fbdc0191cbef","source":{"kind":"arxiv","id":"1611.00249","version":1},"attestation_state":"computed","paper":{"title":"Computing the Braid Monodromy of Completely Reducible $n$-gonal Curves","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GT"],"primary_cat":"math.AT","authors_text":"Esra Akbas, Mehmet Aktas","submitted_at":"2016-11-01T14:48:34Z","abstract_excerpt":"Braid monodromy is an important tool for computing invariants of curves and surfaces. In this paper, the \\emph{rectangular braid diagram (RBD)} method is proposed to compute the braid monodromy of a completely reducible $n$-gonal curve, i.e. the curves in the form $(y-y_1(x))...(y-y_n(x))=0$ where $n\\in \\mathbb{Z}^{+}$ and $y_i\\in \\mathbb{C}[x]$. Also, an algorithm is presented to compute the Alexander polynomial of these curve complements using Burau representations of braid groups. Examples for each computation are provided."},"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":"1611.00249","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AT","submitted_at":"2016-11-01T14:48:34Z","cross_cats_sorted":["math.GT"],"title_canon_sha256":"86a823f5260386b90afb117f5b7dc6f71b023f40a6ec3e118214bbcb5dd5f89a","abstract_canon_sha256":"b529f7ea9ad71a071aa4b9bf97f68b94d0b5e5985b9707c93e60d0509bb96f13"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:41.182608Z","signature_b64":"Dzk/7oU1ixMDG7va0+qwJ4We6/VuEQMkpJFVIKXJLwDMdAhqQgwqblq7dvUT7d2WhJvDhEcgpUyhreLm+8pPDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd2336e45620de36fc8d2dbff2df3d4fdf91b5024df07db40900fbdc0191cbef","last_reissued_at":"2026-05-18T01:00:41.182055Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:41.182055Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing the Braid Monodromy of Completely Reducible $n$-gonal Curves","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GT"],"primary_cat":"math.AT","authors_text":"Esra Akbas, Mehmet Aktas","submitted_at":"2016-11-01T14:48:34Z","abstract_excerpt":"Braid monodromy is an important tool for computing invariants of curves and surfaces. In this paper, the \\emph{rectangular braid diagram (RBD)} method is proposed to compute the braid monodromy of a completely reducible $n$-gonal curve, i.e. the curves in the form $(y-y_1(x))...(y-y_n(x))=0$ where $n\\in \\mathbb{Z}^{+}$ and $y_i\\in \\mathbb{C}[x]$. Also, an algorithm is presented to compute the Alexander polynomial of these curve complements using Burau representations of braid groups. Examples for each computation are provided."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.00249","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":"1611.00249","created_at":"2026-05-18T01:00:41.182136+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.00249v1","created_at":"2026-05-18T01:00:41.182136+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.00249","created_at":"2026-05-18T01:00:41.182136+00:00"},{"alias_kind":"pith_short_12","alias_value":"XURTNZCWEDPD","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"XURTNZCWEDPDN7EN","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"XURTNZCW","created_at":"2026-05-18T12:30:51.357362+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/XURTNZCWEDPDN7ENFW77FXZ5J7","json":"https://pith.science/pith/XURTNZCWEDPDN7ENFW77FXZ5J7.json","graph_json":"https://pith.science/api/pith-number/XURTNZCWEDPDN7ENFW77FXZ5J7/graph.json","events_json":"https://pith.science/api/pith-number/XURTNZCWEDPDN7ENFW77FXZ5J7/events.json","paper":"https://pith.science/paper/XURTNZCW"},"agent_actions":{"view_html":"https://pith.science/pith/XURTNZCWEDPDN7ENFW77FXZ5J7","download_json":"https://pith.science/pith/XURTNZCWEDPDN7ENFW77FXZ5J7.json","view_paper":"https://pith.science/paper/XURTNZCW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.00249&json=true","fetch_graph":"https://pith.science/api/pith-number/XURTNZCWEDPDN7ENFW77FXZ5J7/graph.json","fetch_events":"https://pith.science/api/pith-number/XURTNZCWEDPDN7ENFW77FXZ5J7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XURTNZCWEDPDN7ENFW77FXZ5J7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XURTNZCWEDPDN7ENFW77FXZ5J7/action/storage_attestation","attest_author":"https://pith.science/pith/XURTNZCWEDPDN7ENFW77FXZ5J7/action/author_attestation","sign_citation":"https://pith.science/pith/XURTNZCWEDPDN7ENFW77FXZ5J7/action/citation_signature","submit_replication":"https://pith.science/pith/XURTNZCWEDPDN7ENFW77FXZ5J7/action/replication_record"}},"created_at":"2026-05-18T01:00:41.182136+00:00","updated_at":"2026-05-18T01:00:41.182136+00:00"}