{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:YLTKEQS2XCLSDA7A6NYXCDPL4I","short_pith_number":"pith:YLTKEQS2","schema_version":"1.0","canonical_sha256":"c2e6a2425ab8972183e0f371710debe217bf73d56bd41216535690040f96175d","source":{"kind":"arxiv","id":"1105.2171","version":2},"attestation_state":"computed","paper":{"title":"On relaxing the constraints in pairwise compatibility graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Blerina Sinaimeri, Rossella Petreschi, Tiziana Calamoneri","submitted_at":"2011-05-11T12:21:23Z","abstract_excerpt":"A graph $G$ is called a pairwise compatibility graph (PCG) if there exists an edge weighted tree $T$ and two non-negative real numbers $d_{min}$ and $d_{max}$ such that each leaf $l_u$ of $T$ corresponds to a vertex $u \\in V$ and there is an edge $(u,v) \\in E$ if and only if $d_{min} \\leq d_T (l_u, l_v) \\leq d_{max}$ where $d_T (l_u, l_v)$ is the sum of the weights of the edges on the unique path from $l_u$ to $l_v$ in $T$. In this paper we analyze the class of PCG in relation with two particular subclasses resulting from the the cases where $\\dmin=0$ (LPG) and $\\dmax=+\\infty$ (mLPG). In parti"},"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":"1105.2171","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-05-11T12:21:23Z","cross_cats_sorted":[],"title_canon_sha256":"ea482e56f2160a2e2000d5dee29674a0315610db0051fadc73b84b4651eddbb3","abstract_canon_sha256":"63e254ba163f4335c937d9f1fbe237f82c69bddc7a8c376e236b303b276172de"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:19:40.931690Z","signature_b64":"RF3J/Po7vrqp7suMC6rsTzlwhI0eVsjcGSmt6kGX16/pYcq1JbN1/pFlUZdTVDZaqgd7PEyZ0yRYOjcrEMgKBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2e6a2425ab8972183e0f371710debe217bf73d56bd41216535690040f96175d","last_reissued_at":"2026-05-18T04:19:40.931012Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:19:40.931012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On relaxing the constraints in pairwise compatibility graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Blerina Sinaimeri, Rossella Petreschi, Tiziana Calamoneri","submitted_at":"2011-05-11T12:21:23Z","abstract_excerpt":"A graph $G$ is called a pairwise compatibility graph (PCG) if there exists an edge weighted tree $T$ and two non-negative real numbers $d_{min}$ and $d_{max}$ such that each leaf $l_u$ of $T$ corresponds to a vertex $u \\in V$ and there is an edge $(u,v) \\in E$ if and only if $d_{min} \\leq d_T (l_u, l_v) \\leq d_{max}$ where $d_T (l_u, l_v)$ is the sum of the weights of the edges on the unique path from $l_u$ to $l_v$ in $T$. In this paper we analyze the class of PCG in relation with two particular subclasses resulting from the the cases where $\\dmin=0$ (LPG) and $\\dmax=+\\infty$ (mLPG). In parti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.2171","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":""},"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":"1105.2171","created_at":"2026-05-18T04:19:40.931119+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.2171v2","created_at":"2026-05-18T04:19:40.931119+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.2171","created_at":"2026-05-18T04:19:40.931119+00:00"},{"alias_kind":"pith_short_12","alias_value":"YLTKEQS2XCLS","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_16","alias_value":"YLTKEQS2XCLSDA7A","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_8","alias_value":"YLTKEQS2","created_at":"2026-05-18T12:26:47.523578+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/YLTKEQS2XCLSDA7A6NYXCDPL4I","json":"https://pith.science/pith/YLTKEQS2XCLSDA7A6NYXCDPL4I.json","graph_json":"https://pith.science/api/pith-number/YLTKEQS2XCLSDA7A6NYXCDPL4I/graph.json","events_json":"https://pith.science/api/pith-number/YLTKEQS2XCLSDA7A6NYXCDPL4I/events.json","paper":"https://pith.science/paper/YLTKEQS2"},"agent_actions":{"view_html":"https://pith.science/pith/YLTKEQS2XCLSDA7A6NYXCDPL4I","download_json":"https://pith.science/pith/YLTKEQS2XCLSDA7A6NYXCDPL4I.json","view_paper":"https://pith.science/paper/YLTKEQS2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.2171&json=true","fetch_graph":"https://pith.science/api/pith-number/YLTKEQS2XCLSDA7A6NYXCDPL4I/graph.json","fetch_events":"https://pith.science/api/pith-number/YLTKEQS2XCLSDA7A6NYXCDPL4I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YLTKEQS2XCLSDA7A6NYXCDPL4I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YLTKEQS2XCLSDA7A6NYXCDPL4I/action/storage_attestation","attest_author":"https://pith.science/pith/YLTKEQS2XCLSDA7A6NYXCDPL4I/action/author_attestation","sign_citation":"https://pith.science/pith/YLTKEQS2XCLSDA7A6NYXCDPL4I/action/citation_signature","submit_replication":"https://pith.science/pith/YLTKEQS2XCLSDA7A6NYXCDPL4I/action/replication_record"}},"created_at":"2026-05-18T04:19:40.931119+00:00","updated_at":"2026-05-18T04:19:40.931119+00:00"}