{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:4A4BPIG6PPARBHXZOQHZ6WIXPX","short_pith_number":"pith:4A4BPIG6","schema_version":"1.0","canonical_sha256":"e03817a0de7bc1109ef9740f9f59177de135a0a1e36dbf910191e45c2e589222","source":{"kind":"arxiv","id":"1505.07268","version":2},"attestation_state":"computed","paper":{"title":"The minimum crossing number of essential tangles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Ant\\'onio Salgueiro, Jo\\~ao Miguel Nogueira","submitted_at":"2015-05-27T11:33:48Z","abstract_excerpt":"In this paper we compute the sharp lower bounds for the crossing number of $n$-string $k$-loop essential tangles. For essential tangles with only string components, we characterise the ones with the minimum crossing number for a given number of components, both when the tangle has knotted strings or only unknotted strings."},"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":"1505.07268","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2015-05-27T11:33:48Z","cross_cats_sorted":[],"title_canon_sha256":"e52617b31300ac10c7cd45f9b1b0278c5a473a607327f8e449c21c575ec490c1","abstract_canon_sha256":"41e819163fbcaca7b0d19aa65d6f3ba6e322bc85ae6e3eb5070a8817116cdad5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:33.631369Z","signature_b64":"yLWg74IKj5wEbAj8fOPc5uiHO8vb7tZxjLFbyiXTGlSM5fVt0eM0jovfqDgj8nF0VUgKcZhy7Mxe7KvczNFOAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e03817a0de7bc1109ef9740f9f59177de135a0a1e36dbf910191e45c2e589222","last_reissued_at":"2026-05-18T00:36:33.630940Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:33.630940Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The minimum crossing number of essential tangles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Ant\\'onio Salgueiro, Jo\\~ao Miguel Nogueira","submitted_at":"2015-05-27T11:33:48Z","abstract_excerpt":"In this paper we compute the sharp lower bounds for the crossing number of $n$-string $k$-loop essential tangles. For essential tangles with only string components, we characterise the ones with the minimum crossing number for a given number of components, both when the tangle has knotted strings or only unknotted strings."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.07268","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":"1505.07268","created_at":"2026-05-18T00:36:33.631001+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.07268v2","created_at":"2026-05-18T00:36:33.631001+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.07268","created_at":"2026-05-18T00:36:33.631001+00:00"},{"alias_kind":"pith_short_12","alias_value":"4A4BPIG6PPAR","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"4A4BPIG6PPARBHXZ","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"4A4BPIG6","created_at":"2026-05-18T12:29:05.191682+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/4A4BPIG6PPARBHXZOQHZ6WIXPX","json":"https://pith.science/pith/4A4BPIG6PPARBHXZOQHZ6WIXPX.json","graph_json":"https://pith.science/api/pith-number/4A4BPIG6PPARBHXZOQHZ6WIXPX/graph.json","events_json":"https://pith.science/api/pith-number/4A4BPIG6PPARBHXZOQHZ6WIXPX/events.json","paper":"https://pith.science/paper/4A4BPIG6"},"agent_actions":{"view_html":"https://pith.science/pith/4A4BPIG6PPARBHXZOQHZ6WIXPX","download_json":"https://pith.science/pith/4A4BPIG6PPARBHXZOQHZ6WIXPX.json","view_paper":"https://pith.science/paper/4A4BPIG6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.07268&json=true","fetch_graph":"https://pith.science/api/pith-number/4A4BPIG6PPARBHXZOQHZ6WIXPX/graph.json","fetch_events":"https://pith.science/api/pith-number/4A4BPIG6PPARBHXZOQHZ6WIXPX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4A4BPIG6PPARBHXZOQHZ6WIXPX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4A4BPIG6PPARBHXZOQHZ6WIXPX/action/storage_attestation","attest_author":"https://pith.science/pith/4A4BPIG6PPARBHXZOQHZ6WIXPX/action/author_attestation","sign_citation":"https://pith.science/pith/4A4BPIG6PPARBHXZOQHZ6WIXPX/action/citation_signature","submit_replication":"https://pith.science/pith/4A4BPIG6PPARBHXZOQHZ6WIXPX/action/replication_record"}},"created_at":"2026-05-18T00:36:33.631001+00:00","updated_at":"2026-05-18T00:36:33.631001+00:00"}