{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2005:JCPTMYYX4BWKQLZQWICOUKJWLB","short_pith_number":"pith:JCPTMYYX","schema_version":"1.0","canonical_sha256":"489f366317e06ca82f30b204ea2936587584e702a72899162ba0fd1ee6a3d409","source":{"kind":"arxiv","id":"math/0503270","version":2},"attestation_state":"computed","paper":{"title":"Unlinking Number and Unlinking Gap","license":"","headline":"","cross_cats":["math.GT"],"primary_cat":"math.GN","authors_text":"Radmila Sazdanovi\\'c, Slavik Jablan","submitted_at":"2005-03-14T18:44:23Z","abstract_excerpt":"Computing unlinking number is usually very difficult and complex problem, therefore we define BJ-unlinking number and recall Bernhard-Jablan conjecture stating that the classical unknotting/unlinking number is equal to the BJ-unlinking number. We compute BJ-unlinking number for various families of knots and links for which the unlinking number is unknown. Furthermore, we define BJ-unlinking gap and construct examples of links with arbitrarily large BJ-unlinking gap. Experimental results for BJ-unlinking gap of rational links up to 16 crossings, and all alternating links up to 12 crossings are "},"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/0503270","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"math.GN","submitted_at":"2005-03-14T18:44:23Z","cross_cats_sorted":["math.GT"],"title_canon_sha256":"c5ad1a4ac9c1ea979394346ee9e947d080497523ce1275f41a045056ad003e06","abstract_canon_sha256":"5359d5155da398a5f9cbc3a6c103d8d7d584c1579ab442d28fe6641d823143eb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:08:53.811215Z","signature_b64":"igFKn1tpbICTijc9TUl2CdxXspV1rQo71TouYR1i66ZxrW/fGOZkI3w6X5Xjyk32TZFox5xncGR/meeqCpcVBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"489f366317e06ca82f30b204ea2936587584e702a72899162ba0fd1ee6a3d409","last_reissued_at":"2026-05-18T04:08:53.810736Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:08:53.810736Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unlinking Number and Unlinking Gap","license":"","headline":"","cross_cats":["math.GT"],"primary_cat":"math.GN","authors_text":"Radmila Sazdanovi\\'c, Slavik Jablan","submitted_at":"2005-03-14T18:44:23Z","abstract_excerpt":"Computing unlinking number is usually very difficult and complex problem, therefore we define BJ-unlinking number and recall Bernhard-Jablan conjecture stating that the classical unknotting/unlinking number is equal to the BJ-unlinking number. We compute BJ-unlinking number for various families of knots and links for which the unlinking number is unknown. Furthermore, we define BJ-unlinking gap and construct examples of links with arbitrarily large BJ-unlinking gap. Experimental results for BJ-unlinking gap of rational links up to 16 crossings, and all alternating links up to 12 crossings are "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0503270","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":"math/0503270","created_at":"2026-05-18T04:08:53.810812+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0503270v2","created_at":"2026-05-18T04:08:53.810812+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0503270","created_at":"2026-05-18T04:08:53.810812+00:00"},{"alias_kind":"pith_short_12","alias_value":"JCPTMYYX4BWK","created_at":"2026-05-18T12:25:53.335082+00:00"},{"alias_kind":"pith_short_16","alias_value":"JCPTMYYX4BWKQLZQ","created_at":"2026-05-18T12:25:53.335082+00:00"},{"alias_kind":"pith_short_8","alias_value":"JCPTMYYX","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/JCPTMYYX4BWKQLZQWICOUKJWLB","json":"https://pith.science/pith/JCPTMYYX4BWKQLZQWICOUKJWLB.json","graph_json":"https://pith.science/api/pith-number/JCPTMYYX4BWKQLZQWICOUKJWLB/graph.json","events_json":"https://pith.science/api/pith-number/JCPTMYYX4BWKQLZQWICOUKJWLB/events.json","paper":"https://pith.science/paper/JCPTMYYX"},"agent_actions":{"view_html":"https://pith.science/pith/JCPTMYYX4BWKQLZQWICOUKJWLB","download_json":"https://pith.science/pith/JCPTMYYX4BWKQLZQWICOUKJWLB.json","view_paper":"https://pith.science/paper/JCPTMYYX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0503270&json=true","fetch_graph":"https://pith.science/api/pith-number/JCPTMYYX4BWKQLZQWICOUKJWLB/graph.json","fetch_events":"https://pith.science/api/pith-number/JCPTMYYX4BWKQLZQWICOUKJWLB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JCPTMYYX4BWKQLZQWICOUKJWLB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JCPTMYYX4BWKQLZQWICOUKJWLB/action/storage_attestation","attest_author":"https://pith.science/pith/JCPTMYYX4BWKQLZQWICOUKJWLB/action/author_attestation","sign_citation":"https://pith.science/pith/JCPTMYYX4BWKQLZQWICOUKJWLB/action/citation_signature","submit_replication":"https://pith.science/pith/JCPTMYYX4BWKQLZQWICOUKJWLB/action/replication_record"}},"created_at":"2026-05-18T04:08:53.810812+00:00","updated_at":"2026-05-18T04:08:53.810812+00:00"}