{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:CE4VP2BMRFIVW7IPX5LIVXNPRA","short_pith_number":"pith:CE4VP2BM","schema_version":"1.0","canonical_sha256":"113957e82c89515b7d0fbf568addaf882b8014c9900f1f05d70220111c4e7af3","source":{"kind":"arxiv","id":"1504.06454","version":1},"attestation_state":"computed","paper":{"title":"On Pairwise Compatibility of Some Graph (Super)Classes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Blerina Sinaimeri, Mattia Gastaldello, Tiziana Calamoneri","submitted_at":"2015-04-24T10:04:02Z","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' and `D' such that each leaf `u' of T is a node of V and the edge `(u,v) belongs to E' iff `d <= d_T(u, v) <= D' where d_T(u, v) is the sum of weights of the edges on the unique path from `u' to `v' in T. The main issue on these graphs consists in characterizing them.\n  In this note we prove the inclusion in the PCG class of threshold tolerance graphs and the non-inclusion of a number of intersection graphs, such as disk and grid intersection graphs, circular arc"},"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":"1504.06454","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-04-24T10:04:02Z","cross_cats_sorted":[],"title_canon_sha256":"f84f9d1ed487fde1d91e1ae672752580946f9be94793d1e0a7650e2e7d776dc4","abstract_canon_sha256":"a4cb368747402db1dcb8085cb6e5a310e5e2bfebfd5e60609f031222a86d5127"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:53.561894Z","signature_b64":"+h0aRG8PKMWq0M9eKnrh9sLNcQ+BnB9Jl2Wqcy0gRoe1D17ZG+qxhvD0fKDJDzWR7m6EQvdPAV7JxIUaXSczDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"113957e82c89515b7d0fbf568addaf882b8014c9900f1f05d70220111c4e7af3","last_reissued_at":"2026-05-18T02:17:53.561232Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:53.561232Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Pairwise Compatibility of Some Graph (Super)Classes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Blerina Sinaimeri, Mattia Gastaldello, Tiziana Calamoneri","submitted_at":"2015-04-24T10:04:02Z","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' and `D' such that each leaf `u' of T is a node of V and the edge `(u,v) belongs to E' iff `d <= d_T(u, v) <= D' where d_T(u, v) is the sum of weights of the edges on the unique path from `u' to `v' in T. The main issue on these graphs consists in characterizing them.\n  In this note we prove the inclusion in the PCG class of threshold tolerance graphs and the non-inclusion of a number of intersection graphs, such as disk and grid intersection graphs, circular arc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.06454","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":"1504.06454","created_at":"2026-05-18T02:17:53.561334+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.06454v1","created_at":"2026-05-18T02:17:53.561334+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.06454","created_at":"2026-05-18T02:17:53.561334+00:00"},{"alias_kind":"pith_short_12","alias_value":"CE4VP2BMRFIV","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"CE4VP2BMRFIVW7IP","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"CE4VP2BM","created_at":"2026-05-18T12:29:14.074870+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/CE4VP2BMRFIVW7IPX5LIVXNPRA","json":"https://pith.science/pith/CE4VP2BMRFIVW7IPX5LIVXNPRA.json","graph_json":"https://pith.science/api/pith-number/CE4VP2BMRFIVW7IPX5LIVXNPRA/graph.json","events_json":"https://pith.science/api/pith-number/CE4VP2BMRFIVW7IPX5LIVXNPRA/events.json","paper":"https://pith.science/paper/CE4VP2BM"},"agent_actions":{"view_html":"https://pith.science/pith/CE4VP2BMRFIVW7IPX5LIVXNPRA","download_json":"https://pith.science/pith/CE4VP2BMRFIVW7IPX5LIVXNPRA.json","view_paper":"https://pith.science/paper/CE4VP2BM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.06454&json=true","fetch_graph":"https://pith.science/api/pith-number/CE4VP2BMRFIVW7IPX5LIVXNPRA/graph.json","fetch_events":"https://pith.science/api/pith-number/CE4VP2BMRFIVW7IPX5LIVXNPRA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CE4VP2BMRFIVW7IPX5LIVXNPRA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CE4VP2BMRFIVW7IPX5LIVXNPRA/action/storage_attestation","attest_author":"https://pith.science/pith/CE4VP2BMRFIVW7IPX5LIVXNPRA/action/author_attestation","sign_citation":"https://pith.science/pith/CE4VP2BMRFIVW7IPX5LIVXNPRA/action/citation_signature","submit_replication":"https://pith.science/pith/CE4VP2BMRFIVW7IPX5LIVXNPRA/action/replication_record"}},"created_at":"2026-05-18T02:17:53.561334+00:00","updated_at":"2026-05-18T02:17:53.561334+00:00"}