{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:BMR6JHDW4UIMJ2V2VCB55R4OSP","short_pith_number":"pith:BMR6JHDW","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"},"canonical_sha256":"0b23e49c76e510c4eabaa883dec78e93f468081e7774eeab93e794e64d83f0a6","source":{"kind":"arxiv","id":"1803.03468","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.03468","created_at":"2026-05-18T00:06:25Z"},{"alias_kind":"arxiv_version","alias_value":"1803.03468v4","created_at":"2026-05-18T00:06:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.03468","created_at":"2026-05-18T00:06:25Z"},{"alias_kind":"pith_short_12","alias_value":"BMR6JHDW4UIM","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BMR6JHDW4UIMJ2V2","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BMR6JHDW","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:BMR6JHDW4UIMJ2V2VCB55R4OSP","target":"record","payload":{"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"},"canonical_sha256":"0b23e49c76e510c4eabaa883dec78e93f468081e7774eeab93e794e64d83f0a6","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"},"source_kind":"arxiv","source_id":"1803.03468","source_version":4,"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-05-18T00:06:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IqL89PxK8KnbqwsoQk+xjZ+2r+4l8R7txuUoeVoJP9NeOxd4CKsm1RSQage3E92z6YFINKFL2E3610aFzlyeDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T01:31:02.359483Z"},"content_sha256":"1a6372609b7c05a718afaa7c79b5eec2989b2877b23f05acbab8197f254b4761","schema_version":"1.0","event_id":"sha256:1a6372609b7c05a718afaa7c79b5eec2989b2877b23f05acbab8197f254b4761"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:BMR6JHDW4UIMJ2V2VCB55R4OSP","target":"graph","payload":{"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"},"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-05-18T00:06:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YXISTMT/6PiPpnxRZE1AwhyT1MoEQLPI2HAjazcvtVK2qWZf/y+s//5SCCrGtFD/GNVR+bG2kRjYJQDpa2DhDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T01:31:02.359826Z"},"content_sha256":"2fe3be5c16fc7f33ce1d931398827749511a742176287dc975069dac8134439c","schema_version":"1.0","event_id":"sha256:2fe3be5c16fc7f33ce1d931398827749511a742176287dc975069dac8134439c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BMR6JHDW4UIMJ2V2VCB55R4OSP/bundle.json","state_url":"https://pith.science/pith/BMR6JHDW4UIMJ2V2VCB55R4OSP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BMR6JHDW4UIMJ2V2VCB55R4OSP/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-05-28T01:31:02Z","links":{"resolver":"https://pith.science/pith/BMR6JHDW4UIMJ2V2VCB55R4OSP","bundle":"https://pith.science/pith/BMR6JHDW4UIMJ2V2VCB55R4OSP/bundle.json","state":"https://pith.science/pith/BMR6JHDW4UIMJ2V2VCB55R4OSP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BMR6JHDW4UIMJ2V2VCB55R4OSP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:BMR6JHDW4UIMJ2V2VCB55R4OSP","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":"38fbeba35a27637eb0582bd02a5f67e7cb71dadbc6ec6df84d67bacecf553e36","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-03-09T11:19:48Z","title_canon_sha256":"659c80d4dc77df5127921db06e531a6f1b39d1817d9924a9efa56c5a9b1be524"},"schema_version":"1.0","source":{"id":"1803.03468","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.03468","created_at":"2026-05-18T00:06:25Z"},{"alias_kind":"arxiv_version","alias_value":"1803.03468v4","created_at":"2026-05-18T00:06:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.03468","created_at":"2026-05-18T00:06:25Z"},{"alias_kind":"pith_short_12","alias_value":"BMR6JHDW4UIM","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BMR6JHDW4UIMJ2V2","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BMR6JHDW","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:2fe3be5c16fc7f33ce1d931398827749511a742176287dc975069dac8134439c","target":"graph","created_at":"2026-05-18T00:06:25Z","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"},"paper":{"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","authors_text":"Andrea Munaro, Bernard Ries, Esther Galby, Zakir Deniz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-03-09T11:19:48Z","title":"On contact graphs of paths on a grid"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.03468","kind":"arxiv","version":4},"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:1a6372609b7c05a718afaa7c79b5eec2989b2877b23f05acbab8197f254b4761","target":"record","created_at":"2026-05-18T00:06:25Z","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":"38fbeba35a27637eb0582bd02a5f67e7cb71dadbc6ec6df84d67bacecf553e36","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-03-09T11:19:48Z","title_canon_sha256":"659c80d4dc77df5127921db06e531a6f1b39d1817d9924a9efa56c5a9b1be524"},"schema_version":"1.0","source":{"id":"1803.03468","kind":"arxiv","version":4}},"canonical_sha256":"0b23e49c76e510c4eabaa883dec78e93f468081e7774eeab93e794e64d83f0a6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0b23e49c76e510c4eabaa883dec78e93f468081e7774eeab93e794e64d83f0a6","first_computed_at":"2026-05-18T00:06:25.109737Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:25.109737Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"v7qUGJt5rqdczFvF0ri2BzQqtZxAFv142Cc8zLPjEhXpkWqwptwiQSbgJJ60Q5S07LhbqJt66c9lXcvqKoAvAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:25.110425Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.03468","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1a6372609b7c05a718afaa7c79b5eec2989b2877b23f05acbab8197f254b4761","sha256:2fe3be5c16fc7f33ce1d931398827749511a742176287dc975069dac8134439c"],"state_sha256":"a0f597cd2fb5a973bb55b8ea38f4e0fab8ee38019907b9c822d15cde3a8726fd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MtnImwhab7omC4XE4+GhfbdIqQ+0UUlePaQqmBKhV7Ext2Z39WHjtYkq/XUz8WZPIv50DvoBtH8bg1xPYNO+Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T01:31:02.361820Z","bundle_sha256":"a97afa41f540c38364df3f8e479e747826ddfe70e36909c93a72957228380edc"}}