{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:BMR6JHDW4UIMJ2V2VCB55R4OSP","short_pith_number":"pith:BMR6JHDW","schema_version":"1.0","canonical_sha256":"0b23e49c76e510c4eabaa883dec78e93f468081e7774eeab93e794e64d83f0a6","source":{"kind":"arxiv","id":"1803.03468","version":4},"attestation_state":"computed","paper":{"title":"On contact graphs of paths on a grid","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Andrea Munaro, Bernard Ries, Esther Galby, Zakir Deniz","submitted_at":"2018-03-09T11:19:48Z","abstract_excerpt":"In this paper we consider Contact graphs of Paths on a Grid (CPG graphs), i.e. graphs for which there exists a family of interiorly disjoint paths on a grid in one-to-one correspondence with their vertex set such that two vertices are adjacent if and only if the corresponding paths touch at a grid-point. Our class generalizes the well studied class of VCPG graphs (see [1]). We examine CPG graphs from a structural point of view which leads to constant upper bounds on the clique number and the chromatic number. Moreover, we investigate the recognition and 3-colorability problems for $B_0$-CPG, a"},"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":"1803.03468","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-03-09T11:19:48Z","cross_cats_sorted":[],"title_canon_sha256":"659c80d4dc77df5127921db06e531a6f1b39d1817d9924a9efa56c5a9b1be524","abstract_canon_sha256":"38fbeba35a27637eb0582bd02a5f67e7cb71dadbc6ec6df84d67bacecf553e36"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:25.110425Z","signature_b64":"v7qUGJt5rqdczFvF0ri2BzQqtZxAFv142Cc8zLPjEhXpkWqwptwiQSbgJJ60Q5S07LhbqJt66c9lXcvqKoAvAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b23e49c76e510c4eabaa883dec78e93f468081e7774eeab93e794e64d83f0a6","last_reissued_at":"2026-05-18T00:06:25.109737Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:25.109737Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On contact graphs of paths on a grid","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Andrea Munaro, Bernard Ries, Esther Galby, Zakir Deniz","submitted_at":"2018-03-09T11:19:48Z","abstract_excerpt":"In this paper we consider Contact graphs of Paths on a Grid (CPG graphs), i.e. graphs for which there exists a family of interiorly disjoint paths on a grid in one-to-one correspondence with their vertex set such that two vertices are adjacent if and only if the corresponding paths touch at a grid-point. Our class generalizes the well studied class of VCPG graphs (see [1]). We examine CPG graphs from a structural point of view which leads to constant upper bounds on the clique number and the chromatic number. Moreover, we investigate the recognition and 3-colorability problems for $B_0$-CPG, a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.03468","kind":"arxiv","version":4},"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":"1803.03468","created_at":"2026-05-18T00:06:25.109832+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.03468v4","created_at":"2026-05-18T00:06:25.109832+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.03468","created_at":"2026-05-18T00:06:25.109832+00:00"},{"alias_kind":"pith_short_12","alias_value":"BMR6JHDW4UIM","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"BMR6JHDW4UIMJ2V2","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"BMR6JHDW","created_at":"2026-05-18T12:32:16.446611+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/BMR6JHDW4UIMJ2V2VCB55R4OSP","json":"https://pith.science/pith/BMR6JHDW4UIMJ2V2VCB55R4OSP.json","graph_json":"https://pith.science/api/pith-number/BMR6JHDW4UIMJ2V2VCB55R4OSP/graph.json","events_json":"https://pith.science/api/pith-number/BMR6JHDW4UIMJ2V2VCB55R4OSP/events.json","paper":"https://pith.science/paper/BMR6JHDW"},"agent_actions":{"view_html":"https://pith.science/pith/BMR6JHDW4UIMJ2V2VCB55R4OSP","download_json":"https://pith.science/pith/BMR6JHDW4UIMJ2V2VCB55R4OSP.json","view_paper":"https://pith.science/paper/BMR6JHDW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.03468&json=true","fetch_graph":"https://pith.science/api/pith-number/BMR6JHDW4UIMJ2V2VCB55R4OSP/graph.json","fetch_events":"https://pith.science/api/pith-number/BMR6JHDW4UIMJ2V2VCB55R4OSP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BMR6JHDW4UIMJ2V2VCB55R4OSP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BMR6JHDW4UIMJ2V2VCB55R4OSP/action/storage_attestation","attest_author":"https://pith.science/pith/BMR6JHDW4UIMJ2V2VCB55R4OSP/action/author_attestation","sign_citation":"https://pith.science/pith/BMR6JHDW4UIMJ2V2VCB55R4OSP/action/citation_signature","submit_replication":"https://pith.science/pith/BMR6JHDW4UIMJ2V2VCB55R4OSP/action/replication_record"}},"created_at":"2026-05-18T00:06:25.109832+00:00","updated_at":"2026-05-18T00:06:25.109832+00:00"}