{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:QIOGI6ZIMUL62CPOYCVEWNRFEA","short_pith_number":"pith:QIOGI6ZI","canonical_record":{"source":{"id":"1608.01464","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-04T08:44:30Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"de188c874b92f898232c57d72810eb5fc3857cfecd25e89170a408573648eeba","abstract_canon_sha256":"b4f8ca0727ade9c9e9fee7042e29672dc58dd86955a86ddbdffb221d50bd9bb0"},"schema_version":"1.0"},"canonical_sha256":"821c647b286517ed09eec0aa4b36252004f89726fc9f5cbcbd9a22bc1b19f2d4","source":{"kind":"arxiv","id":"1608.01464","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.01464","created_at":"2026-05-18T01:09:52Z"},{"alias_kind":"arxiv_version","alias_value":"1608.01464v1","created_at":"2026-05-18T01:09:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.01464","created_at":"2026-05-18T01:09:52Z"},{"alias_kind":"pith_short_12","alias_value":"QIOGI6ZIMUL6","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"QIOGI6ZIMUL62CPO","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"QIOGI6ZI","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:QIOGI6ZIMUL62CPOYCVEWNRFEA","target":"record","payload":{"canonical_record":{"source":{"id":"1608.01464","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-04T08:44:30Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"de188c874b92f898232c57d72810eb5fc3857cfecd25e89170a408573648eeba","abstract_canon_sha256":"b4f8ca0727ade9c9e9fee7042e29672dc58dd86955a86ddbdffb221d50bd9bb0"},"schema_version":"1.0"},"canonical_sha256":"821c647b286517ed09eec0aa4b36252004f89726fc9f5cbcbd9a22bc1b19f2d4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:52.377117Z","signature_b64":"cK28Gd57s0qtHAfavjQzq4V5bp4UBO4MVNuvcRiSG6E1Y0UU7ioCzCXMykCPxRR2A9N5IVTchU35PQ9T1UDxAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"821c647b286517ed09eec0aa4b36252004f89726fc9f5cbcbd9a22bc1b19f2d4","last_reissued_at":"2026-05-18T01:09:52.376454Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:52.376454Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.01464","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-18T01:09:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"htfIm8pAr+WDz4PdYi4ChhyLOW0a5kJeLBDxjyMva9LTf4Lxnmw/wBci85W8ouPx3W+I9PHOFGeNX5ZHpvDMDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T20:07:56.766068Z"},"content_sha256":"cf36d03ca87bf8e64b467aff2f61029576f8d3b1b13705c28e8bc128851604cc","schema_version":"1.0","event_id":"sha256:cf36d03ca87bf8e64b467aff2f61029576f8d3b1b13705c28e8bc128851604cc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:QIOGI6ZIMUL62CPOYCVEWNRFEA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Exact Enumeration of Distance-Hereditary Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"C\\'edric Chauve, \\'Eric Fusy, J\\'er\\'emie Lumbroso","submitted_at":"2016-08-04T08:44:30Z","abstract_excerpt":"Distance-hereditary graphs form an important class of graphs, from the theoretical point of view, due to the fact that they are the totally decomposable graphs for the split-decomposition. The previous best enumerative result for these graphs is from Nakano et al. (J. Comp. Sci. Tech., 2007), who have proven that the number of distance-hereditary graphs on $n$ vertices is bounded by ${2^{\\lceil 3.59n\\rceil}}$.\n  In this paper, using classical tools of enumerative combinatorics, we improve on this result by providing an exact enumeration of distance-hereditary graphs, which allows to show that "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.01464","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-18T01:09:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QyjLR5inpYhCowSrPlpn3rOW91sKjHBmtpkByYhGROZpcGT5m10LkVPTpKxZFETs1zkWWLT+b0XxC9vJdgUvAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T20:07:56.766590Z"},"content_sha256":"8132b8724490e1615ec7e9978aafe1f5577e519be3ed402bc2d65919d3925faa","schema_version":"1.0","event_id":"sha256:8132b8724490e1615ec7e9978aafe1f5577e519be3ed402bc2d65919d3925faa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QIOGI6ZIMUL62CPOYCVEWNRFEA/bundle.json","state_url":"https://pith.science/pith/QIOGI6ZIMUL62CPOYCVEWNRFEA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QIOGI6ZIMUL62CPOYCVEWNRFEA/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-06T20:07:56Z","links":{"resolver":"https://pith.science/pith/QIOGI6ZIMUL62CPOYCVEWNRFEA","bundle":"https://pith.science/pith/QIOGI6ZIMUL62CPOYCVEWNRFEA/bundle.json","state":"https://pith.science/pith/QIOGI6ZIMUL62CPOYCVEWNRFEA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QIOGI6ZIMUL62CPOYCVEWNRFEA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:QIOGI6ZIMUL62CPOYCVEWNRFEA","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":"b4f8ca0727ade9c9e9fee7042e29672dc58dd86955a86ddbdffb221d50bd9bb0","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-04T08:44:30Z","title_canon_sha256":"de188c874b92f898232c57d72810eb5fc3857cfecd25e89170a408573648eeba"},"schema_version":"1.0","source":{"id":"1608.01464","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.01464","created_at":"2026-05-18T01:09:52Z"},{"alias_kind":"arxiv_version","alias_value":"1608.01464v1","created_at":"2026-05-18T01:09:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.01464","created_at":"2026-05-18T01:09:52Z"},{"alias_kind":"pith_short_12","alias_value":"QIOGI6ZIMUL6","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"QIOGI6ZIMUL62CPO","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"QIOGI6ZI","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:8132b8724490e1615ec7e9978aafe1f5577e519be3ed402bc2d65919d3925faa","target":"graph","created_at":"2026-05-18T01:09:52Z","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":"Distance-hereditary graphs form an important class of graphs, from the theoretical point of view, due to the fact that they are the totally decomposable graphs for the split-decomposition. The previous best enumerative result for these graphs is from Nakano et al. (J. Comp. Sci. Tech., 2007), who have proven that the number of distance-hereditary graphs on $n$ vertices is bounded by ${2^{\\lceil 3.59n\\rceil}}$.\n  In this paper, using classical tools of enumerative combinatorics, we improve on this result by providing an exact enumeration of distance-hereditary graphs, which allows to show that ","authors_text":"C\\'edric Chauve, \\'Eric Fusy, J\\'er\\'emie Lumbroso","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-04T08:44:30Z","title":"An Exact Enumeration of Distance-Hereditary Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.01464","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:cf36d03ca87bf8e64b467aff2f61029576f8d3b1b13705c28e8bc128851604cc","target":"record","created_at":"2026-05-18T01:09:52Z","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":"b4f8ca0727ade9c9e9fee7042e29672dc58dd86955a86ddbdffb221d50bd9bb0","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-04T08:44:30Z","title_canon_sha256":"de188c874b92f898232c57d72810eb5fc3857cfecd25e89170a408573648eeba"},"schema_version":"1.0","source":{"id":"1608.01464","kind":"arxiv","version":1}},"canonical_sha256":"821c647b286517ed09eec0aa4b36252004f89726fc9f5cbcbd9a22bc1b19f2d4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"821c647b286517ed09eec0aa4b36252004f89726fc9f5cbcbd9a22bc1b19f2d4","first_computed_at":"2026-05-18T01:09:52.376454Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:52.376454Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cK28Gd57s0qtHAfavjQzq4V5bp4UBO4MVNuvcRiSG6E1Y0UU7ioCzCXMykCPxRR2A9N5IVTchU35PQ9T1UDxAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:52.377117Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.01464","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cf36d03ca87bf8e64b467aff2f61029576f8d3b1b13705c28e8bc128851604cc","sha256:8132b8724490e1615ec7e9978aafe1f5577e519be3ed402bc2d65919d3925faa"],"state_sha256":"eb4025372a1568e969fe72595d5011bf452016653f5196f29ff6a3709e97f8f9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zPO0GhHo9qExxmx2uMbYGR23qvDCj9JFWF2/aFgy0zvS/cp6nR0IfuWF2xHmFUuE5Uueb5rKVd5mYuvs47iEAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T20:07:56.770824Z","bundle_sha256":"a4a53e097f40d4625d2da0e3e6639332947eb8d6fc6343e325837afc3e2551a1"}}