{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:VITZAVMFMK7732ZWKCMUJUZAV3","short_pith_number":"pith:VITZAVMF","schema_version":"1.0","canonical_sha256":"aa2790558562bffdeb36509944d320aeda52b2dbc8f7ab6d70dc2a76029e9ab7","source":{"kind":"arxiv","id":"2507.20937","version":3},"attestation_state":"computed","paper":{"title":"General Strong Bound on the Uncrossed Number via a Tight Bound for the Maximum Uncrossed Subgraph Number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.DM"],"primary_cat":"math.CO","authors_text":"Gaspard Charvy, Tom\\'a\\v{s} Masa\\v{r}\\'ik","submitted_at":"2025-07-28T15:50:38Z","abstract_excerpt":"We investigate a very recent concept for visualizing various aspects of a graph in the plane using a collection of drawings introduced by Hlin\\v{e}n\\'y and Masa\\v{r}\\'ik [GD 2023]. Formally, given a graph $G$, we aim to find an uncrossed collection containing drawings of $G$ in the plane such that each edge of $G$ is not crossed in at least one drawing in the collection. The uncrossed number of $G$ ($unc(G)$) is the smallest integer $k$ such that an uncrossed collection for $G$ of size $k$ exists. The uncrossed number is lower-bounded by the well-known thickness, which is an edge-decomposition"},"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":"2507.20937","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-07-28T15:50:38Z","cross_cats_sorted":["cs.CG","cs.DM"],"title_canon_sha256":"62b0a3d0dc5990f7a3a7366e442c7bdd2cbddef7248ee95b97706f2d8060028a","abstract_canon_sha256":"8de2763212552f1623cd6cc04095997e2d38feb086277e9e13d511fd4a0e4696"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:04.847220Z","signature_b64":"7/XZFKlnKjQlZ76CoyQbpP/wiHixgzcDCI15w3Zq4zIbpJwecW4NdW8C1i/xr9quESqEGikwJons73cqD/D3CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa2790558562bffdeb36509944d320aeda52b2dbc8f7ab6d70dc2a76029e9ab7","last_reissued_at":"2026-05-17T23:39:04.846455Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:04.846455Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"General Strong Bound on the Uncrossed Number via a Tight Bound for the Maximum Uncrossed Subgraph Number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.DM"],"primary_cat":"math.CO","authors_text":"Gaspard Charvy, Tom\\'a\\v{s} Masa\\v{r}\\'ik","submitted_at":"2025-07-28T15:50:38Z","abstract_excerpt":"We investigate a very recent concept for visualizing various aspects of a graph in the plane using a collection of drawings introduced by Hlin\\v{e}n\\'y and Masa\\v{r}\\'ik [GD 2023]. Formally, given a graph $G$, we aim to find an uncrossed collection containing drawings of $G$ in the plane such that each edge of $G$ is not crossed in at least one drawing in the collection. The uncrossed number of $G$ ($unc(G)$) is the smallest integer $k$ such that an uncrossed collection for $G$ of size $k$ exists. The uncrossed number is lower-bounded by the well-known thickness, which is an edge-decomposition"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.20937","kind":"arxiv","version":3},"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":"2507.20937","created_at":"2026-05-17T23:39:04.846583+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.20937v3","created_at":"2026-05-17T23:39:04.846583+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.20937","created_at":"2026-05-17T23:39:04.846583+00:00"},{"alias_kind":"pith_short_12","alias_value":"VITZAVMFMK77","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"VITZAVMFMK7732ZW","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"VITZAVMF","created_at":"2026-05-18T12:33:37.589309+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/VITZAVMFMK7732ZWKCMUJUZAV3","json":"https://pith.science/pith/VITZAVMFMK7732ZWKCMUJUZAV3.json","graph_json":"https://pith.science/api/pith-number/VITZAVMFMK7732ZWKCMUJUZAV3/graph.json","events_json":"https://pith.science/api/pith-number/VITZAVMFMK7732ZWKCMUJUZAV3/events.json","paper":"https://pith.science/paper/VITZAVMF"},"agent_actions":{"view_html":"https://pith.science/pith/VITZAVMFMK7732ZWKCMUJUZAV3","download_json":"https://pith.science/pith/VITZAVMFMK7732ZWKCMUJUZAV3.json","view_paper":"https://pith.science/paper/VITZAVMF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.20937&json=true","fetch_graph":"https://pith.science/api/pith-number/VITZAVMFMK7732ZWKCMUJUZAV3/graph.json","fetch_events":"https://pith.science/api/pith-number/VITZAVMFMK7732ZWKCMUJUZAV3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VITZAVMFMK7732ZWKCMUJUZAV3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VITZAVMFMK7732ZWKCMUJUZAV3/action/storage_attestation","attest_author":"https://pith.science/pith/VITZAVMFMK7732ZWKCMUJUZAV3/action/author_attestation","sign_citation":"https://pith.science/pith/VITZAVMFMK7732ZWKCMUJUZAV3/action/citation_signature","submit_replication":"https://pith.science/pith/VITZAVMFMK7732ZWKCMUJUZAV3/action/replication_record"}},"created_at":"2026-05-17T23:39:04.846583+00:00","updated_at":"2026-05-17T23:39:04.846583+00:00"}