{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:T3GFZWSIC4R5OFREMDCIOVEWPL","short_pith_number":"pith:T3GFZWSI","schema_version":"1.0","canonical_sha256":"9ecc5cda481723d7162460c48754967afe5080fc277e707c26f6f325e05793f8","source":{"kind":"arxiv","id":"2312.07105","version":2},"attestation_state":"computed","paper":{"title":"A coarse geometric approach to graph layout problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.MG","authors_text":"David Hume, Ryan Lam, Samuel J. Kelly, Wanying Huang","submitted_at":"2023-12-12T09:35:09Z","abstract_excerpt":"We define a range of new coarse geometric invariants based on various graph-theoretic measures of complexity for finite graphs, including: treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these invariants can be used to define functions which satisfy a strong monotonicity property, namely they are monotonically non-decreasing with respect to a large-scale geometric generalisation of graph inclusion, and as such have potential applications in coarse geometry and geometric group theory. On the graph-theoretic side, we prove asymptotically optimal bounds on "},"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":"2312.07105","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.MG","submitted_at":"2023-12-12T09:35:09Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"06815455f3e0c4376bbfd8da5bdc476771185bd29f6aa3fea5a1eb3c7d1f5460","abstract_canon_sha256":"eb92fd887c96ae4e000c1e73921bb3bbe896949c24299610337cbc722e22c74f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:49:02.504165Z","signature_b64":"4vcD+fMn3OamgfqJxZvrXRBe2oId9Tyfunls0WrL9WwnE7hRh4EblApSTq4hD6wFhGp+AFyShXWXFTPUPU2rBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ecc5cda481723d7162460c48754967afe5080fc277e707c26f6f325e05793f8","last_reissued_at":"2026-07-05T11:49:02.503792Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:49:02.503792Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A coarse geometric approach to graph layout problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.MG","authors_text":"David Hume, Ryan Lam, Samuel J. Kelly, Wanying Huang","submitted_at":"2023-12-12T09:35:09Z","abstract_excerpt":"We define a range of new coarse geometric invariants based on various graph-theoretic measures of complexity for finite graphs, including: treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these invariants can be used to define functions which satisfy a strong monotonicity property, namely they are monotonically non-decreasing with respect to a large-scale geometric generalisation of graph inclusion, and as such have potential applications in coarse geometry and geometric group theory. On the graph-theoretic side, we prove asymptotically optimal bounds on "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.07105","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/2312.07105/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":"2312.07105","created_at":"2026-07-05T11:49:02.503849+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.07105v2","created_at":"2026-07-05T11:49:02.503849+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.07105","created_at":"2026-07-05T11:49:02.503849+00:00"},{"alias_kind":"pith_short_12","alias_value":"T3GFZWSIC4R5","created_at":"2026-07-05T11:49:02.503849+00:00"},{"alias_kind":"pith_short_16","alias_value":"T3GFZWSIC4R5OFRE","created_at":"2026-07-05T11:49:02.503849+00:00"},{"alias_kind":"pith_short_8","alias_value":"T3GFZWSI","created_at":"2026-07-05T11:49:02.503849+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.13294","citing_title":"Topological expanders, coarse geometry and thick embeddings of complexes","ref_index":21,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/T3GFZWSIC4R5OFREMDCIOVEWPL","json":"https://pith.science/pith/T3GFZWSIC4R5OFREMDCIOVEWPL.json","graph_json":"https://pith.science/api/pith-number/T3GFZWSIC4R5OFREMDCIOVEWPL/graph.json","events_json":"https://pith.science/api/pith-number/T3GFZWSIC4R5OFREMDCIOVEWPL/events.json","paper":"https://pith.science/paper/T3GFZWSI"},"agent_actions":{"view_html":"https://pith.science/pith/T3GFZWSIC4R5OFREMDCIOVEWPL","download_json":"https://pith.science/pith/T3GFZWSIC4R5OFREMDCIOVEWPL.json","view_paper":"https://pith.science/paper/T3GFZWSI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.07105&json=true","fetch_graph":"https://pith.science/api/pith-number/T3GFZWSIC4R5OFREMDCIOVEWPL/graph.json","fetch_events":"https://pith.science/api/pith-number/T3GFZWSIC4R5OFREMDCIOVEWPL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T3GFZWSIC4R5OFREMDCIOVEWPL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T3GFZWSIC4R5OFREMDCIOVEWPL/action/storage_attestation","attest_author":"https://pith.science/pith/T3GFZWSIC4R5OFREMDCIOVEWPL/action/author_attestation","sign_citation":"https://pith.science/pith/T3GFZWSIC4R5OFREMDCIOVEWPL/action/citation_signature","submit_replication":"https://pith.science/pith/T3GFZWSIC4R5OFREMDCIOVEWPL/action/replication_record"}},"created_at":"2026-07-05T11:49:02.503849+00:00","updated_at":"2026-07-05T11:49:02.503849+00:00"}