{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:CE4VP2BMRFIVW7IPX5LIVXNPRA","short_pith_number":"pith:CE4VP2BM","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"},"canonical_sha256":"113957e82c89515b7d0fbf568addaf882b8014c9900f1f05d70220111c4e7af3","source":{"kind":"arxiv","id":"1504.06454","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.06454","created_at":"2026-05-18T02:17:53Z"},{"alias_kind":"arxiv_version","alias_value":"1504.06454v1","created_at":"2026-05-18T02:17:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.06454","created_at":"2026-05-18T02:17:53Z"},{"alias_kind":"pith_short_12","alias_value":"CE4VP2BMRFIV","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"CE4VP2BMRFIVW7IP","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"CE4VP2BM","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:CE4VP2BMRFIVW7IPX5LIVXNPRA","target":"record","payload":{"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"},"canonical_sha256":"113957e82c89515b7d0fbf568addaf882b8014c9900f1f05d70220111c4e7af3","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"},"source_kind":"arxiv","source_id":"1504.06454","source_version":1,"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-18T02:17:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7hyxAI7Mn86U8zMvIMUhwnK/Ht+pPCu03Z7Mz/4nHDPs1AaUlovZ0mkKra06Ypo6nmWQipXOCB9nJje26HzGBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T10:00:06.653221Z"},"content_sha256":"b85a0e16eb871a52d3a2c14781ed92fd545247fd844dd4b4dc75d30946a910ad","schema_version":"1.0","event_id":"sha256:b85a0e16eb871a52d3a2c14781ed92fd545247fd844dd4b4dc75d30946a910ad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:CE4VP2BMRFIVW7IPX5LIVXNPRA","target":"graph","payload":{"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"},"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-18T02:17:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MyIIKhRGDVSyYQssBxklbWxP7uYC48OYn748RsDQXYtOfEWyNSGdtLUZ7O1HbPvK2JARO7SWOdS1PLOG+9DRAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T10:00:06.653901Z"},"content_sha256":"7525bba24dd7f02996eaf62ffc1bab8d49d1d9d28139c184fa4b058079819b3a","schema_version":"1.0","event_id":"sha256:7525bba24dd7f02996eaf62ffc1bab8d49d1d9d28139c184fa4b058079819b3a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CE4VP2BMRFIVW7IPX5LIVXNPRA/bundle.json","state_url":"https://pith.science/pith/CE4VP2BMRFIVW7IPX5LIVXNPRA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CE4VP2BMRFIVW7IPX5LIVXNPRA/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-06-11T10:00:06Z","links":{"resolver":"https://pith.science/pith/CE4VP2BMRFIVW7IPX5LIVXNPRA","bundle":"https://pith.science/pith/CE4VP2BMRFIVW7IPX5LIVXNPRA/bundle.json","state":"https://pith.science/pith/CE4VP2BMRFIVW7IPX5LIVXNPRA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CE4VP2BMRFIVW7IPX5LIVXNPRA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:CE4VP2BMRFIVW7IPX5LIVXNPRA","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":"a4cb368747402db1dcb8085cb6e5a310e5e2bfebfd5e60609f031222a86d5127","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-04-24T10:04:02Z","title_canon_sha256":"f84f9d1ed487fde1d91e1ae672752580946f9be94793d1e0a7650e2e7d776dc4"},"schema_version":"1.0","source":{"id":"1504.06454","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.06454","created_at":"2026-05-18T02:17:53Z"},{"alias_kind":"arxiv_version","alias_value":"1504.06454v1","created_at":"2026-05-18T02:17:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.06454","created_at":"2026-05-18T02:17:53Z"},{"alias_kind":"pith_short_12","alias_value":"CE4VP2BMRFIV","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"CE4VP2BMRFIVW7IP","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"CE4VP2BM","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:7525bba24dd7f02996eaf62ffc1bab8d49d1d9d28139c184fa4b058079819b3a","target":"graph","created_at":"2026-05-18T02:17:53Z","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":"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","authors_text":"Blerina Sinaimeri, Mattia Gastaldello, Tiziana Calamoneri","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-04-24T10:04:02Z","title":"On Pairwise Compatibility of Some Graph (Super)Classes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.06454","kind":"arxiv","version":1},"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:b85a0e16eb871a52d3a2c14781ed92fd545247fd844dd4b4dc75d30946a910ad","target":"record","created_at":"2026-05-18T02:17:53Z","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":"a4cb368747402db1dcb8085cb6e5a310e5e2bfebfd5e60609f031222a86d5127","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-04-24T10:04:02Z","title_canon_sha256":"f84f9d1ed487fde1d91e1ae672752580946f9be94793d1e0a7650e2e7d776dc4"},"schema_version":"1.0","source":{"id":"1504.06454","kind":"arxiv","version":1}},"canonical_sha256":"113957e82c89515b7d0fbf568addaf882b8014c9900f1f05d70220111c4e7af3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"113957e82c89515b7d0fbf568addaf882b8014c9900f1f05d70220111c4e7af3","first_computed_at":"2026-05-18T02:17:53.561232Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:17:53.561232Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+h0aRG8PKMWq0M9eKnrh9sLNcQ+BnB9Jl2Wqcy0gRoe1D17ZG+qxhvD0fKDJDzWR7m6EQvdPAV7JxIUaXSczDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:17:53.561894Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.06454","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b85a0e16eb871a52d3a2c14781ed92fd545247fd844dd4b4dc75d30946a910ad","sha256:7525bba24dd7f02996eaf62ffc1bab8d49d1d9d28139c184fa4b058079819b3a"],"state_sha256":"b13507b69fdba736a1912d59d5117391dded4fd74860ab4e84417e722bcb06ae"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GTtNdqGH7r0zUDq8UPB5h9KBygG1CEtvTKtj07vJMlcDZMk1IMvr0OKdvLdBzBelkiYDMm8MeVGAQ8pMh5CFCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T10:00:06.657543Z","bundle_sha256":"23bfdf2ebc18dcdb88e480b492a82582d8b315263078eecdbacca0c1fffc1097"}}