{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:T3GFZWSIC4R5OFREMDCIOVEWPL","short_pith_number":"pith:T3GFZWSI","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"},"canonical_sha256":"9ecc5cda481723d7162460c48754967afe5080fc277e707c26f6f325e05793f8","source":{"kind":"arxiv","id":"2312.07105","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.07105","created_at":"2026-07-05T11:49:02Z"},{"alias_kind":"arxiv_version","alias_value":"2312.07105v2","created_at":"2026-07-05T11:49:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.07105","created_at":"2026-07-05T11:49:02Z"},{"alias_kind":"pith_short_12","alias_value":"T3GFZWSIC4R5","created_at":"2026-07-05T11:49:02Z"},{"alias_kind":"pith_short_16","alias_value":"T3GFZWSIC4R5OFRE","created_at":"2026-07-05T11:49:02Z"},{"alias_kind":"pith_short_8","alias_value":"T3GFZWSI","created_at":"2026-07-05T11:49:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:T3GFZWSIC4R5OFREMDCIOVEWPL","target":"record","payload":{"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"},"canonical_sha256":"9ecc5cda481723d7162460c48754967afe5080fc277e707c26f6f325e05793f8","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"},"source_kind":"arxiv","source_id":"2312.07105","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:49:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KHkdc2Frh1zFcl4v26sJIU7BKvbQmUiL9001hd7eLEsrrenoTAFuuLoCRVACmUxGCkuSp8v65DWV0ADHpmjxDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T16:21:18.102748Z"},"content_sha256":"32225d15cdf9a8cdaa3ea56d63035bfd11f4fb8324814466eb30febb329754d2","schema_version":"1.0","event_id":"sha256:32225d15cdf9a8cdaa3ea56d63035bfd11f4fb8324814466eb30febb329754d2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:T3GFZWSIC4R5OFREMDCIOVEWPL","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:49:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KEkOnm13ikcRP3NmvZFttoOJxwyjkHGzB5afOf7q0BIxpjFDua+SJaCi+ei1JTfbC9WJAuiQXqe5z+/gvOKpDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T16:21:18.103687Z"},"content_sha256":"adc045c72bb61461b0867a60be53dc7c06124ff0fc9cb55d6b266e7ee8941d22","schema_version":"1.0","event_id":"sha256:adc045c72bb61461b0867a60be53dc7c06124ff0fc9cb55d6b266e7ee8941d22"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T3GFZWSIC4R5OFREMDCIOVEWPL/bundle.json","state_url":"https://pith.science/pith/T3GFZWSIC4R5OFREMDCIOVEWPL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T3GFZWSIC4R5OFREMDCIOVEWPL/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-13T16:21:18Z","links":{"resolver":"https://pith.science/pith/T3GFZWSIC4R5OFREMDCIOVEWPL","bundle":"https://pith.science/pith/T3GFZWSIC4R5OFREMDCIOVEWPL/bundle.json","state":"https://pith.science/pith/T3GFZWSIC4R5OFREMDCIOVEWPL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T3GFZWSIC4R5OFREMDCIOVEWPL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:T3GFZWSIC4R5OFREMDCIOVEWPL","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"eb92fd887c96ae4e000c1e73921bb3bbe896949c24299610337cbc722e22c74f","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.MG","submitted_at":"2023-12-12T09:35:09Z","title_canon_sha256":"06815455f3e0c4376bbfd8da5bdc476771185bd29f6aa3fea5a1eb3c7d1f5460"},"schema_version":"1.0","source":{"id":"2312.07105","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.07105","created_at":"2026-07-05T11:49:02Z"},{"alias_kind":"arxiv_version","alias_value":"2312.07105v2","created_at":"2026-07-05T11:49:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.07105","created_at":"2026-07-05T11:49:02Z"},{"alias_kind":"pith_short_12","alias_value":"T3GFZWSIC4R5","created_at":"2026-07-05T11:49:02Z"},{"alias_kind":"pith_short_16","alias_value":"T3GFZWSIC4R5OFRE","created_at":"2026-07-05T11:49:02Z"},{"alias_kind":"pith_short_8","alias_value":"T3GFZWSI","created_at":"2026-07-05T11:49:02Z"}],"graph_snapshots":[{"event_id":"sha256:adc045c72bb61461b0867a60be53dc7c06124ff0fc9cb55d6b266e7ee8941d22","target":"graph","created_at":"2026-07-05T11:49:02Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2312.07105/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"David Hume, Ryan Lam, Samuel J. Kelly, Wanying Huang","cross_cats":["math.CO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.MG","submitted_at":"2023-12-12T09:35:09Z","title":"A coarse geometric approach to graph layout problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.07105","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:32225d15cdf9a8cdaa3ea56d63035bfd11f4fb8324814466eb30febb329754d2","target":"record","created_at":"2026-07-05T11:49:02Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"eb92fd887c96ae4e000c1e73921bb3bbe896949c24299610337cbc722e22c74f","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.MG","submitted_at":"2023-12-12T09:35:09Z","title_canon_sha256":"06815455f3e0c4376bbfd8da5bdc476771185bd29f6aa3fea5a1eb3c7d1f5460"},"schema_version":"1.0","source":{"id":"2312.07105","kind":"arxiv","version":2}},"canonical_sha256":"9ecc5cda481723d7162460c48754967afe5080fc277e707c26f6f325e05793f8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9ecc5cda481723d7162460c48754967afe5080fc277e707c26f6f325e05793f8","first_computed_at":"2026-07-05T11:49:02.503792Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:49:02.503792Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4vcD+fMn3OamgfqJxZvrXRBe2oId9Tyfunls0WrL9WwnE7hRh4EblApSTq4hD6wFhGp+AFyShXWXFTPUPU2rBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:49:02.504165Z","signed_message":"canonical_sha256_bytes"},"source_id":"2312.07105","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:32225d15cdf9a8cdaa3ea56d63035bfd11f4fb8324814466eb30febb329754d2","sha256:adc045c72bb61461b0867a60be53dc7c06124ff0fc9cb55d6b266e7ee8941d22"],"state_sha256":"bba9e45596f35bc4a6548452ef9b7e33b8b898dad33cde53fdbecd5eb3c6667a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CtzjxO/8JoWvWUn62+TKrQtd0WyKJjOj3lf+++qYYnFNhvaugnecV77eemNpFtDRA6MxmaYgv0AcE+l0cMecBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T16:21:18.111303Z","bundle_sha256":"0c7d625cb3137a74ae23e2fd18ba99b84d66f9ac26d9f31a723316338e852df3"}}