{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:DKQJTGSRP3VZWWGLJPOLV2DCQD","short_pith_number":"pith:DKQJTGSR","schema_version":"1.0","canonical_sha256":"1aa0999a517eeb9b58cb4bdcbae86280d32d63acd6b01fcd0edf71e3af4f2a17","source":{"kind":"arxiv","id":"1708.04773","version":2},"attestation_state":"computed","paper":{"title":"Thickness and Antithickness of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.CO","authors_text":"David R. Wood, Vida Dujmovi\\'c","submitted_at":"2017-08-16T05:36:52Z","abstract_excerpt":"This paper studies questions about duality between crossings and non-crossings in graph drawings via the notions of thickness and antithickness. The \"thickness\" of a graph $G$ is the minimum integer $k$ such that in some drawing of $G$, the edges can be partitioned into $k$ noncrossing subgraphs. The \"antithickness\" of a graph $G$ is the minimum integer $k$ such that in some drawing of $G$, the edges can be partitioned into $k$ thrackles, where a \"thrackle\" is a set of edges, each pair of which intersect exactly once. (Here edges with a common endvertex $v$ are considered to intersect at $v$.)"},"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":"1708.04773","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-16T05:36:52Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"0f73fc12edfda3d6a8738d9cace6ab2eca2fbdad659a4ec1d8f69bcc28e6426c","abstract_canon_sha256":"a2a9bb558c73ff39aa805c99f229c25b8bd979bc053231088a931659d835225e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:49.865631Z","signature_b64":"ecBt193/2GQzE8Cgc8j2K9dY6dF2hL+tj6+8tfQe+Y0EsEYrPDuSBxPBMf2B7iS9oPCcidx86zrEcn1afMIHBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1aa0999a517eeb9b58cb4bdcbae86280d32d63acd6b01fcd0edf71e3af4f2a17","last_reissued_at":"2026-05-17T23:40:49.864758Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:49.864758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Thickness and Antithickness of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.CO","authors_text":"David R. Wood, Vida Dujmovi\\'c","submitted_at":"2017-08-16T05:36:52Z","abstract_excerpt":"This paper studies questions about duality between crossings and non-crossings in graph drawings via the notions of thickness and antithickness. The \"thickness\" of a graph $G$ is the minimum integer $k$ such that in some drawing of $G$, the edges can be partitioned into $k$ noncrossing subgraphs. The \"antithickness\" of a graph $G$ is the minimum integer $k$ such that in some drawing of $G$, the edges can be partitioned into $k$ thrackles, where a \"thrackle\" is a set of edges, each pair of which intersect exactly once. (Here edges with a common endvertex $v$ are considered to intersect at $v$.)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.04773","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":"1708.04773","created_at":"2026-05-17T23:40:49.864908+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.04773v2","created_at":"2026-05-17T23:40:49.864908+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.04773","created_at":"2026-05-17T23:40:49.864908+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/DKQJTGSRP3VZWWGLJPOLV2DCQD","json":"https://pith.science/pith/DKQJTGSRP3VZWWGLJPOLV2DCQD.json","graph_json":"https://pith.science/api/pith-number/DKQJTGSRP3VZWWGLJPOLV2DCQD/graph.json","events_json":"https://pith.science/api/pith-number/DKQJTGSRP3VZWWGLJPOLV2DCQD/events.json","paper":"https://pith.science/paper/DKQJTGSR"},"agent_actions":{"view_html":"https://pith.science/pith/DKQJTGSRP3VZWWGLJPOLV2DCQD","download_json":"https://pith.science/pith/DKQJTGSRP3VZWWGLJPOLV2DCQD.json","view_paper":"https://pith.science/paper/DKQJTGSR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.04773&json=true","fetch_graph":"https://pith.science/api/pith-number/DKQJTGSRP3VZWWGLJPOLV2DCQD/graph.json","fetch_events":"https://pith.science/api/pith-number/DKQJTGSRP3VZWWGLJPOLV2DCQD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DKQJTGSRP3VZWWGLJPOLV2DCQD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DKQJTGSRP3VZWWGLJPOLV2DCQD/action/storage_attestation","attest_author":"https://pith.science/pith/DKQJTGSRP3VZWWGLJPOLV2DCQD/action/author_attestation","sign_citation":"https://pith.science/pith/DKQJTGSRP3VZWWGLJPOLV2DCQD/action/citation_signature","submit_replication":"https://pith.science/pith/DKQJTGSRP3VZWWGLJPOLV2DCQD/action/replication_record"}},"created_at":"2026-05-17T23:40:49.864908+00:00","updated_at":"2026-05-17T23:40:49.864908+00:00"}