{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:NYXLB4QTLH5APPI2OUSODUWPHY","short_pith_number":"pith:NYXLB4QT","schema_version":"1.0","canonical_sha256":"6e2eb0f21359fa07bd1a7524e1d2cf3e1e5c5a286b8f5078e1d3a6bc8c278610","source":{"kind":"arxiv","id":"1707.07436","version":1},"attestation_state":"computed","paper":{"title":"Some classes of graphs that are not PCGs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Angelo Monti, Pierluigi Baiocchi, Rossella Petreschi, Tiziana Calamoneri","submitted_at":"2017-07-24T08:24:48Z","abstract_excerpt":"A graph $G=(V,E)$ is a pairwise compatibility graph (PCG) if there exists an edge-weighted tree $T$ and two non-negative real numbers $d_{min}$ and $d_{max}$, $d_{min} \\leq d_{max}$, such that each node $u \\in V$ is uniquely associated to a leaf of $T$ and there is an edge $(u,v) \\in E$ if and only if $d_{min} \\leq d_{T} (u, v) \\leq d_{max}$, where $d_{T} (u, v)$ is the sum of the weights of the edges on the unique path $P_{T}(u,v)$ from $u$ to $v$ in $T$. Understanding which graph classes lie inside and which ones outside the PCG class is an important issue. In this paper we propose a new pro"},"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":"1707.07436","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-07-24T08:24:48Z","cross_cats_sorted":[],"title_canon_sha256":"a124836ee141fe8ab13991170ae4c653f9a54a46d4f678fc43632750035cd122","abstract_canon_sha256":"d7122b6da7c2865464c2992efce3c31fecc4133b9d2b7e5b9d8b3ad8b3124b0c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:42.202036Z","signature_b64":"Q94R63GDSYVbUZqXiPlcGfUXYxOSv/Ox5VCclcOMa1XU4S7LlnKvhEZKGc+D2qRvks3gvUBqhWw+ONAZVBtwCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e2eb0f21359fa07bd1a7524e1d2cf3e1e5c5a286b8f5078e1d3a6bc8c278610","last_reissued_at":"2026-05-18T00:39:42.201312Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:42.201312Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Some classes of graphs that are not PCGs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Angelo Monti, Pierluigi Baiocchi, Rossella Petreschi, Tiziana Calamoneri","submitted_at":"2017-07-24T08:24:48Z","abstract_excerpt":"A graph $G=(V,E)$ is a pairwise compatibility graph (PCG) if there exists an edge-weighted tree $T$ and two non-negative real numbers $d_{min}$ and $d_{max}$, $d_{min} \\leq d_{max}$, such that each node $u \\in V$ is uniquely associated to a leaf of $T$ and there is an edge $(u,v) \\in E$ if and only if $d_{min} \\leq d_{T} (u, v) \\leq d_{max}$, where $d_{T} (u, v)$ is the sum of the weights of the edges on the unique path $P_{T}(u,v)$ from $u$ to $v$ in $T$. Understanding which graph classes lie inside and which ones outside the PCG class is an important issue. In this paper we propose a new pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.07436","kind":"arxiv","version":1},"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":"1707.07436","created_at":"2026-05-18T00:39:42.201421+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.07436v1","created_at":"2026-05-18T00:39:42.201421+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.07436","created_at":"2026-05-18T00:39:42.201421+00:00"},{"alias_kind":"pith_short_12","alias_value":"NYXLB4QTLH5A","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"NYXLB4QTLH5APPI2","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"NYXLB4QT","created_at":"2026-05-18T12:31:34.259226+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/NYXLB4QTLH5APPI2OUSODUWPHY","json":"https://pith.science/pith/NYXLB4QTLH5APPI2OUSODUWPHY.json","graph_json":"https://pith.science/api/pith-number/NYXLB4QTLH5APPI2OUSODUWPHY/graph.json","events_json":"https://pith.science/api/pith-number/NYXLB4QTLH5APPI2OUSODUWPHY/events.json","paper":"https://pith.science/paper/NYXLB4QT"},"agent_actions":{"view_html":"https://pith.science/pith/NYXLB4QTLH5APPI2OUSODUWPHY","download_json":"https://pith.science/pith/NYXLB4QTLH5APPI2OUSODUWPHY.json","view_paper":"https://pith.science/paper/NYXLB4QT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.07436&json=true","fetch_graph":"https://pith.science/api/pith-number/NYXLB4QTLH5APPI2OUSODUWPHY/graph.json","fetch_events":"https://pith.science/api/pith-number/NYXLB4QTLH5APPI2OUSODUWPHY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NYXLB4QTLH5APPI2OUSODUWPHY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NYXLB4QTLH5APPI2OUSODUWPHY/action/storage_attestation","attest_author":"https://pith.science/pith/NYXLB4QTLH5APPI2OUSODUWPHY/action/author_attestation","sign_citation":"https://pith.science/pith/NYXLB4QTLH5APPI2OUSODUWPHY/action/citation_signature","submit_replication":"https://pith.science/pith/NYXLB4QTLH5APPI2OUSODUWPHY/action/replication_record"}},"created_at":"2026-05-18T00:39:42.201421+00:00","updated_at":"2026-05-18T00:39:42.201421+00:00"}