{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:CLHECKG3ZXZUKLX4HL2RFQZTJ4","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"e8f2a2822c93a1c18d00f6d653dad0f9e8befe14249870d349e590437b1ad2a4","cross_cats_sorted":["math.GN"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2019-01-28T16:27:09Z","title_canon_sha256":"21fd4138ef16c409d95a250a6897fc74ebd4efb348291024c35f7eb6169943fe"},"schema_version":"1.0","source":{"id":"1901.09778","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.09778","created_at":"2026-05-17T23:55:23Z"},{"alias_kind":"arxiv_version","alias_value":"1901.09778v1","created_at":"2026-05-17T23:55:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.09778","created_at":"2026-05-17T23:55:23Z"},{"alias_kind":"pith_short_12","alias_value":"CLHECKG3ZXZU","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"CLHECKG3ZXZUKLX4","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"CLHECKG3","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:32fd5da87f6b736352fa35fba982c5811f447a8c87831c7c1e0223b718b185b5","target":"graph","created_at":"2026-05-17T23:55:23Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"It is well known that the braid index of a link equals the minimum number of Seifert circles among all link diagrams representing it. For a link with a reduced alternating diagram $D$, $s(D)$, the number of Seifert circles in $D$, equals the braid index $\\textbf{b}(D)$ of $D$ if $D$ contains no {\\em lone crossings} (a crossing in $D$ is called a {\\em lone crossing} if it is the only crossing between two Seifert circles in $D$). If $D$ contains lone crossings, then $\\textbf{b}(D)$ is strictly less than $s(D)$. However in general it is not known how $s(D)$ is related to $\\textbf{b}(D)$. In this ","authors_text":"Claus Ernst, Gabor Hetyei, Pengyu Liu, Yuanan Diao","cross_cats":["math.GN"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2019-01-28T16:27:09Z","title":"A Diagrammatic Approach for Determining the Braid Index of Alternating Links"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.09778","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:099929f174cd8b00a2d6552c7186d22d5fe960f94985bc84bb2b28076eb378f5","target":"record","created_at":"2026-05-17T23:55:23Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"e8f2a2822c93a1c18d00f6d653dad0f9e8befe14249870d349e590437b1ad2a4","cross_cats_sorted":["math.GN"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2019-01-28T16:27:09Z","title_canon_sha256":"21fd4138ef16c409d95a250a6897fc74ebd4efb348291024c35f7eb6169943fe"},"schema_version":"1.0","source":{"id":"1901.09778","kind":"arxiv","version":1}},"canonical_sha256":"12ce4128dbcdf3452efc3af512c3334f151429a71b76534811115093c997becd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"12ce4128dbcdf3452efc3af512c3334f151429a71b76534811115093c997becd","first_computed_at":"2026-05-17T23:55:23.890595Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:23.890595Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"juu920Taf/v8RHE+3zHGxbbrMfL85GR+KsFhwvfvI1W/0ex/FWTZSHrbA3ftu/eXV8fW4YBOwLFrF1+e0KRwDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:23.890984Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.09778","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:099929f174cd8b00a2d6552c7186d22d5fe960f94985bc84bb2b28076eb378f5","sha256:32fd5da87f6b736352fa35fba982c5811f447a8c87831c7c1e0223b718b185b5"],"state_sha256":"2f441535850c4d1b72ddebe5f277f23136b8b7e53ef4f9eb54d6ff675d66920b"}