{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:F3ZWP7GDCO4WZGZU5Q6NULFX3G","short_pith_number":"pith:F3ZWP7GD","canonical_record":{"source":{"id":"1703.08018","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-03-23T11:43:26Z","cross_cats_sorted":[],"title_canon_sha256":"9e58eccf1b7d98508328528572e405c4664d689598fb412c80a5e4787b87ae53","abstract_canon_sha256":"f25ba69c7add19fbe51d1c8f19269bf8fcad3ba7007db6a347e2b5feb9a96317"},"schema_version":"1.0"},"canonical_sha256":"2ef367fcc313b96c9b34ec3cda2cb7d9abf4b17c59f689ef0306bf7ffcc5ec01","source":{"kind":"arxiv","id":"1703.08018","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.08018","created_at":"2026-05-18T00:41:07Z"},{"alias_kind":"arxiv_version","alias_value":"1703.08018v3","created_at":"2026-05-18T00:41:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.08018","created_at":"2026-05-18T00:41:07Z"},{"alias_kind":"pith_short_12","alias_value":"F3ZWP7GDCO4W","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"F3ZWP7GDCO4WZGZU","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"F3ZWP7GD","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:F3ZWP7GDCO4WZGZU5Q6NULFX3G","target":"record","payload":{"canonical_record":{"source":{"id":"1703.08018","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-03-23T11:43:26Z","cross_cats_sorted":[],"title_canon_sha256":"9e58eccf1b7d98508328528572e405c4664d689598fb412c80a5e4787b87ae53","abstract_canon_sha256":"f25ba69c7add19fbe51d1c8f19269bf8fcad3ba7007db6a347e2b5feb9a96317"},"schema_version":"1.0"},"canonical_sha256":"2ef367fcc313b96c9b34ec3cda2cb7d9abf4b17c59f689ef0306bf7ffcc5ec01","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:07.207021Z","signature_b64":"cQif7y3vayVkIEePhAy104yA+CzC+XFWk6F+L3lBJlTAQPrTIz1SkkiqInKTx6joBQWAfFAWS9GRL4nlSDzFBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ef367fcc313b96c9b34ec3cda2cb7d9abf4b17c59f689ef0306bf7ffcc5ec01","last_reissued_at":"2026-05-18T00:41:07.206336Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:07.206336Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.08018","source_version":3,"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-18T00:41:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"76ApwObmvgJPMDk6TQF72Awph9zQ6XCPn6fYT14/I1Mhgz32S33BwVxeFzBsiO7j2srXb5GaOaGLQuwn9LUOCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:15:08.335811Z"},"content_sha256":"0e5e2db3da2996394239da5760f75c36f98a8dd1dbc8adfc4bdb7bcf618407a2","schema_version":"1.0","event_id":"sha256:0e5e2db3da2996394239da5760f75c36f98a8dd1dbc8adfc4bdb7bcf618407a2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:F3ZWP7GDCO4WZGZU5Q6NULFX3G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On strongly chordal graphs that are not leaf powers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Manuel Lafond","submitted_at":"2017-03-23T11:43:26Z","abstract_excerpt":"A common task in phylogenetics is to find an evolutionary tree representing proximity relationships between species. This motivates the notion of leaf powers: a graph G = (V, E) is a leaf power if there exist a tree T on leafset V and a threshold k such that uv is an edge if and only if the distance between u and v in T is at most k. Characterizing leaf powers is a challenging open problem, along with determining the complexity of their recognition. This is in part due to the fact that few graphs are known to not be leaf powers, as such graphs are difficult to construct. Recently, Nevries and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.08018","kind":"arxiv","version":3},"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-18T00:41:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5hb7EQOWmOINgK7FBKa0zWwu3P6x/uWQjrCoN+7czNPttal5M5PTR9QDOczUV965/leTATNNqhMDHjMlSYr1DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:15:08.336628Z"},"content_sha256":"a4df73bcad09ba1009783933e9724c904a2dc41def8c0cbf1854bcce1986fb66","schema_version":"1.0","event_id":"sha256:a4df73bcad09ba1009783933e9724c904a2dc41def8c0cbf1854bcce1986fb66"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F3ZWP7GDCO4WZGZU5Q6NULFX3G/bundle.json","state_url":"https://pith.science/pith/F3ZWP7GDCO4WZGZU5Q6NULFX3G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F3ZWP7GDCO4WZGZU5Q6NULFX3G/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-05-27T02:15:08Z","links":{"resolver":"https://pith.science/pith/F3ZWP7GDCO4WZGZU5Q6NULFX3G","bundle":"https://pith.science/pith/F3ZWP7GDCO4WZGZU5Q6NULFX3G/bundle.json","state":"https://pith.science/pith/F3ZWP7GDCO4WZGZU5Q6NULFX3G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F3ZWP7GDCO4WZGZU5Q6NULFX3G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:F3ZWP7GDCO4WZGZU5Q6NULFX3G","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":"f25ba69c7add19fbe51d1c8f19269bf8fcad3ba7007db6a347e2b5feb9a96317","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-03-23T11:43:26Z","title_canon_sha256":"9e58eccf1b7d98508328528572e405c4664d689598fb412c80a5e4787b87ae53"},"schema_version":"1.0","source":{"id":"1703.08018","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.08018","created_at":"2026-05-18T00:41:07Z"},{"alias_kind":"arxiv_version","alias_value":"1703.08018v3","created_at":"2026-05-18T00:41:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.08018","created_at":"2026-05-18T00:41:07Z"},{"alias_kind":"pith_short_12","alias_value":"F3ZWP7GDCO4W","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"F3ZWP7GDCO4WZGZU","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"F3ZWP7GD","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:a4df73bcad09ba1009783933e9724c904a2dc41def8c0cbf1854bcce1986fb66","target":"graph","created_at":"2026-05-18T00:41:07Z","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 common task in phylogenetics is to find an evolutionary tree representing proximity relationships between species. This motivates the notion of leaf powers: a graph G = (V, E) is a leaf power if there exist a tree T on leafset V and a threshold k such that uv is an edge if and only if the distance between u and v in T is at most k. Characterizing leaf powers is a challenging open problem, along with determining the complexity of their recognition. This is in part due to the fact that few graphs are known to not be leaf powers, as such graphs are difficult to construct. Recently, Nevries and ","authors_text":"Manuel Lafond","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-03-23T11:43:26Z","title":"On strongly chordal graphs that are not leaf powers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.08018","kind":"arxiv","version":3},"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:0e5e2db3da2996394239da5760f75c36f98a8dd1dbc8adfc4bdb7bcf618407a2","target":"record","created_at":"2026-05-18T00:41:07Z","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":"f25ba69c7add19fbe51d1c8f19269bf8fcad3ba7007db6a347e2b5feb9a96317","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-03-23T11:43:26Z","title_canon_sha256":"9e58eccf1b7d98508328528572e405c4664d689598fb412c80a5e4787b87ae53"},"schema_version":"1.0","source":{"id":"1703.08018","kind":"arxiv","version":3}},"canonical_sha256":"2ef367fcc313b96c9b34ec3cda2cb7d9abf4b17c59f689ef0306bf7ffcc5ec01","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2ef367fcc313b96c9b34ec3cda2cb7d9abf4b17c59f689ef0306bf7ffcc5ec01","first_computed_at":"2026-05-18T00:41:07.206336Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:07.206336Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cQif7y3vayVkIEePhAy104yA+CzC+XFWk6F+L3lBJlTAQPrTIz1SkkiqInKTx6joBQWAfFAWS9GRL4nlSDzFBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:07.207021Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.08018","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0e5e2db3da2996394239da5760f75c36f98a8dd1dbc8adfc4bdb7bcf618407a2","sha256:a4df73bcad09ba1009783933e9724c904a2dc41def8c0cbf1854bcce1986fb66"],"state_sha256":"fea3588c941ffd602f8867b167dd56922e1d14d0c1522ab68eb0b7f97d77d64e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gPrLlG5lOJ8uGokzUaRZmYN7/vAji549gzaYszoUaa0N6FGFkmMPXfMJEHLMfr2eJKhij2pNtYv0Ro5jQ65kDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T02:15:08.339794Z","bundle_sha256":"a60b3ce5ce4eed2d55051a357e9b8c1c6a332e38d5de78517198bdd5867ceb4a"}}