{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:ULRH26B4NEYLZZN73L2FFZKYTD","short_pith_number":"pith:ULRH26B4","schema_version":"1.0","canonical_sha256":"a2e27d783c6930bce5bfdaf452e55898db3e4ea19a9439d76ee9c69c5533b0fb","source":{"kind":"arxiv","id":"2108.01032","version":2},"attestation_state":"computed","paper":{"title":"The tripartite-circle crossing number of graphs with two small partition classes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Charles Camacho, Elizabeth Bailey Matson, Jennifer White, Linda Kleist, Marija Jeli\\'c Milutinovi\\'c, Rachel Kirsch, Silvia Fern\\'andez-Merchant","submitted_at":"2021-08-02T16:43:35Z","abstract_excerpt":"A tripartite-circle drawing of a tripartite graph is a drawing in the plane, where each part of a vertex partition is placed on one of three disjoint circles, and the edges do not cross the circles. The tripartite-circle crossing number of a tripartite graph is the minimum number of edge crossings among all its tripartite-circle drawings. We determine the exact value of the tripartite-circle crossing number of $K_{a,b,n}$, where $a,b\\leq 2$."},"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":"2108.01032","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-08-02T16:43:35Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"56435bb0ef7db677ac9eda208255c5cec8c25f53e362a467b2d9ce038a16135a","abstract_canon_sha256":"a46f57281832ad47e4d09ac1732bea2c3aaec4633c8b44298a8dd64dea76a223"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:38:47.338004Z","signature_b64":"wqV9LBqJWNZbOukd4b4tMMno3apZ6VMUeLBqDOnS60eOZBSR8aHR4wK1YggZ/ahSuFVF/MVOBDynfB1XpCetDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2e27d783c6930bce5bfdaf452e55898db3e4ea19a9439d76ee9c69c5533b0fb","last_reissued_at":"2026-07-05T09:38:47.337333Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:38:47.337333Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The tripartite-circle crossing number of graphs with two small partition classes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Charles Camacho, Elizabeth Bailey Matson, Jennifer White, Linda Kleist, Marija Jeli\\'c Milutinovi\\'c, Rachel Kirsch, Silvia Fern\\'andez-Merchant","submitted_at":"2021-08-02T16:43:35Z","abstract_excerpt":"A tripartite-circle drawing of a tripartite graph is a drawing in the plane, where each part of a vertex partition is placed on one of three disjoint circles, and the edges do not cross the circles. The tripartite-circle crossing number of a tripartite graph is the minimum number of edge crossings among all its tripartite-circle drawings. We determine the exact value of the tripartite-circle crossing number of $K_{a,b,n}$, where $a,b\\leq 2$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.01032","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2108.01032/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2108.01032","created_at":"2026-07-05T09:38:47.337394+00:00"},{"alias_kind":"arxiv_version","alias_value":"2108.01032v2","created_at":"2026-07-05T09:38:47.337394+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.01032","created_at":"2026-07-05T09:38:47.337394+00:00"},{"alias_kind":"pith_short_12","alias_value":"ULRH26B4NEYL","created_at":"2026-07-05T09:38:47.337394+00:00"},{"alias_kind":"pith_short_16","alias_value":"ULRH26B4NEYLZZN7","created_at":"2026-07-05T09:38:47.337394+00:00"},{"alias_kind":"pith_short_8","alias_value":"ULRH26B4","created_at":"2026-07-05T09:38:47.337394+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/ULRH26B4NEYLZZN73L2FFZKYTD","json":"https://pith.science/pith/ULRH26B4NEYLZZN73L2FFZKYTD.json","graph_json":"https://pith.science/api/pith-number/ULRH26B4NEYLZZN73L2FFZKYTD/graph.json","events_json":"https://pith.science/api/pith-number/ULRH26B4NEYLZZN73L2FFZKYTD/events.json","paper":"https://pith.science/paper/ULRH26B4"},"agent_actions":{"view_html":"https://pith.science/pith/ULRH26B4NEYLZZN73L2FFZKYTD","download_json":"https://pith.science/pith/ULRH26B4NEYLZZN73L2FFZKYTD.json","view_paper":"https://pith.science/paper/ULRH26B4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2108.01032&json=true","fetch_graph":"https://pith.science/api/pith-number/ULRH26B4NEYLZZN73L2FFZKYTD/graph.json","fetch_events":"https://pith.science/api/pith-number/ULRH26B4NEYLZZN73L2FFZKYTD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ULRH26B4NEYLZZN73L2FFZKYTD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ULRH26B4NEYLZZN73L2FFZKYTD/action/storage_attestation","attest_author":"https://pith.science/pith/ULRH26B4NEYLZZN73L2FFZKYTD/action/author_attestation","sign_citation":"https://pith.science/pith/ULRH26B4NEYLZZN73L2FFZKYTD/action/citation_signature","submit_replication":"https://pith.science/pith/ULRH26B4NEYLZZN73L2FFZKYTD/action/replication_record"}},"created_at":"2026-07-05T09:38:47.337394+00:00","updated_at":"2026-07-05T09:38:47.337394+00:00"}