{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:2TKZ6XPBOIAJ63UIMYZNFU63NB","short_pith_number":"pith:2TKZ6XPB","canonical_record":{"source":{"id":"1202.4631","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-02-21T13:26:38Z","cross_cats_sorted":[],"title_canon_sha256":"3eec479b4394e4e3aa8723885913e0dab2e4bbcdf7dfe5f1f81f1fe163ec9d07","abstract_canon_sha256":"8d7a46f4ccf546dc4f90586a429ef62f018fe97bf74479a2ed297b20bca1b934"},"schema_version":"1.0"},"canonical_sha256":"d4d59f5de172009f6e886632d2d3db6860ecf44a6641eecb2c0c6d3bad90d003","source":{"kind":"arxiv","id":"1202.4631","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.4631","created_at":"2026-05-18T04:01:50Z"},{"alias_kind":"arxiv_version","alias_value":"1202.4631v1","created_at":"2026-05-18T04:01:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.4631","created_at":"2026-05-18T04:01:50Z"},{"alias_kind":"pith_short_12","alias_value":"2TKZ6XPBOIAJ","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"2TKZ6XPBOIAJ63UI","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"2TKZ6XPB","created_at":"2026-05-18T12:26:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:2TKZ6XPBOIAJ63UIMYZNFU63NB","target":"record","payload":{"canonical_record":{"source":{"id":"1202.4631","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-02-21T13:26:38Z","cross_cats_sorted":[],"title_canon_sha256":"3eec479b4394e4e3aa8723885913e0dab2e4bbcdf7dfe5f1f81f1fe163ec9d07","abstract_canon_sha256":"8d7a46f4ccf546dc4f90586a429ef62f018fe97bf74479a2ed297b20bca1b934"},"schema_version":"1.0"},"canonical_sha256":"d4d59f5de172009f6e886632d2d3db6860ecf44a6641eecb2c0c6d3bad90d003","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:01:50.215304Z","signature_b64":"XHn9PFPdxYHul9Ir1SIGA1JE2HMo5wF83iT/gMgVIA/4BILZmH05h54ZnxaWFvfy26ieiXrouxw33G+1wFFSCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4d59f5de172009f6e886632d2d3db6860ecf44a6641eecb2c0c6d3bad90d003","last_reissued_at":"2026-05-18T04:01:50.214811Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:01:50.214811Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.4631","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-18T04:01:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ijWLEngsIMdp0gyK6vRC9+WYYxMvPwJAJynlI5M3fVKy1aaDJ9L1m1IYDpQ1xPhspN3UM+lR4/ErJ3WAfCubDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T04:59:45.053526Z"},"content_sha256":"b2647c8a436457ea9cbd7e482865b046dfeafd728af51b1dc8f77b6f83a51c4c","schema_version":"1.0","event_id":"sha256:b2647c8a436457ea9cbd7e482865b046dfeafd728af51b1dc8f77b6f83a51c4c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:2TKZ6XPBOIAJ63UIMYZNFU63NB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"All graphs with at most seven vertices are Pairwise Compatibility Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Blerina Sinaimeri, Dario Frascaria, Tiziana Calamoneri","submitted_at":"2012-02-21T13:26:38Z","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,w} (l_u, l_v) \\leq d_{max}$ where $d_{T,w} (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$.\n  In this note, we show that all the graphs with at most seven vertices are PCGs. In particular all these graphs except for the wheel on 7 vertices $W_7$ are PCGs o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.4631","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-18T04:01:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jfyxoMy6Mz6VBAw/Nxqxq2zwlzb0EkvKCaNZwcOctDfrJcPcQcMhoNA7RX85t+YAGdMY4dbF6pvkQWbuZseCCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T04:59:45.054291Z"},"content_sha256":"3f64348fcf4c1e4e87febd898b0a9dde845f6273015e5aa3e6a185f5615eac10","schema_version":"1.0","event_id":"sha256:3f64348fcf4c1e4e87febd898b0a9dde845f6273015e5aa3e6a185f5615eac10"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2TKZ6XPBOIAJ63UIMYZNFU63NB/bundle.json","state_url":"https://pith.science/pith/2TKZ6XPBOIAJ63UIMYZNFU63NB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2TKZ6XPBOIAJ63UIMYZNFU63NB/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-11T04:59:45Z","links":{"resolver":"https://pith.science/pith/2TKZ6XPBOIAJ63UIMYZNFU63NB","bundle":"https://pith.science/pith/2TKZ6XPBOIAJ63UIMYZNFU63NB/bundle.json","state":"https://pith.science/pith/2TKZ6XPBOIAJ63UIMYZNFU63NB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2TKZ6XPBOIAJ63UIMYZNFU63NB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:2TKZ6XPBOIAJ63UIMYZNFU63NB","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":"8d7a46f4ccf546dc4f90586a429ef62f018fe97bf74479a2ed297b20bca1b934","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-02-21T13:26:38Z","title_canon_sha256":"3eec479b4394e4e3aa8723885913e0dab2e4bbcdf7dfe5f1f81f1fe163ec9d07"},"schema_version":"1.0","source":{"id":"1202.4631","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.4631","created_at":"2026-05-18T04:01:50Z"},{"alias_kind":"arxiv_version","alias_value":"1202.4631v1","created_at":"2026-05-18T04:01:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.4631","created_at":"2026-05-18T04:01:50Z"},{"alias_kind":"pith_short_12","alias_value":"2TKZ6XPBOIAJ","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"2TKZ6XPBOIAJ63UI","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"2TKZ6XPB","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:3f64348fcf4c1e4e87febd898b0a9dde845f6273015e5aa3e6a185f5615eac10","target":"graph","created_at":"2026-05-18T04:01:50Z","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$ 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,w} (l_u, l_v) \\leq d_{max}$ where $d_{T,w} (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$.\n  In this note, we show that all the graphs with at most seven vertices are PCGs. In particular all these graphs except for the wheel on 7 vertices $W_7$ are PCGs o","authors_text":"Blerina Sinaimeri, Dario Frascaria, Tiziana Calamoneri","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-02-21T13:26:38Z","title":"All graphs with at most seven vertices are Pairwise Compatibility Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.4631","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:b2647c8a436457ea9cbd7e482865b046dfeafd728af51b1dc8f77b6f83a51c4c","target":"record","created_at":"2026-05-18T04:01:50Z","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":"8d7a46f4ccf546dc4f90586a429ef62f018fe97bf74479a2ed297b20bca1b934","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-02-21T13:26:38Z","title_canon_sha256":"3eec479b4394e4e3aa8723885913e0dab2e4bbcdf7dfe5f1f81f1fe163ec9d07"},"schema_version":"1.0","source":{"id":"1202.4631","kind":"arxiv","version":1}},"canonical_sha256":"d4d59f5de172009f6e886632d2d3db6860ecf44a6641eecb2c0c6d3bad90d003","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d4d59f5de172009f6e886632d2d3db6860ecf44a6641eecb2c0c6d3bad90d003","first_computed_at":"2026-05-18T04:01:50.214811Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:01:50.214811Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XHn9PFPdxYHul9Ir1SIGA1JE2HMo5wF83iT/gMgVIA/4BILZmH05h54ZnxaWFvfy26ieiXrouxw33G+1wFFSCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:01:50.215304Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.4631","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b2647c8a436457ea9cbd7e482865b046dfeafd728af51b1dc8f77b6f83a51c4c","sha256:3f64348fcf4c1e4e87febd898b0a9dde845f6273015e5aa3e6a185f5615eac10"],"state_sha256":"e632a708c68d0ee3e977499ac4ecebe6341d89679c8edd9b29134f985474730e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sQyrTKfU+1ZoPTaxY426WUvP21yLFi8rgmcaaxH0FX3JeVqa5KQvmWKFh7ryiGFEr1xpQNvUB51y7UnwSSYbAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T04:59:45.057790Z","bundle_sha256":"cb5c36fa647cfd8af73b080ba4b51a2e4a590fee25edfac8b370b9908a929f23"}}