{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:5JI3G3KKO3BRIS3IQGPF65G4BB","short_pith_number":"pith:5JI3G3KK","canonical_record":{"source":{"id":"1604.07273","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-25T14:22:58Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"2a85c15c6b59eb7148ccd409d1f1c977d146e58ff6c3609f0b3b2dd008452b09","abstract_canon_sha256":"1835f7d737f545ea00d7a3daec6b12f27f1cc6363a77f05a51758136dcef5804"},"schema_version":"1.0"},"canonical_sha256":"ea51b36d4a76c3144b68819e5f74dc084e9e89d16089174a700ea1e39ab0c275","source":{"kind":"arxiv","id":"1604.07273","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.07273","created_at":"2026-05-18T01:16:22Z"},{"alias_kind":"arxiv_version","alias_value":"1604.07273v1","created_at":"2026-05-18T01:16:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.07273","created_at":"2026-05-18T01:16:22Z"},{"alias_kind":"pith_short_12","alias_value":"5JI3G3KKO3BR","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5JI3G3KKO3BRIS3I","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5JI3G3KK","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:5JI3G3KKO3BRIS3IQGPF65G4BB","target":"record","payload":{"canonical_record":{"source":{"id":"1604.07273","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-25T14:22:58Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"2a85c15c6b59eb7148ccd409d1f1c977d146e58ff6c3609f0b3b2dd008452b09","abstract_canon_sha256":"1835f7d737f545ea00d7a3daec6b12f27f1cc6363a77f05a51758136dcef5804"},"schema_version":"1.0"},"canonical_sha256":"ea51b36d4a76c3144b68819e5f74dc084e9e89d16089174a700ea1e39ab0c275","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:22.556675Z","signature_b64":"dlcA9iIV51Ae+xOFLjAC0YT0Wbq2BXBUSi32XcekCMtoZHnmDtPt4hezjQ5OemNcAnYrdF7k9qYoYTfrTkUTCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea51b36d4a76c3144b68819e5f74dc084e9e89d16089174a700ea1e39ab0c275","last_reissued_at":"2026-05-18T01:16:22.556155Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:22.556155Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.07273","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:16:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Db/sqOJTnOyLASwfUgUdGxnU5cp5Ot7QkmMjVpQ48D8yv6zajtVeiKqrzYqxvfoaAL0fgJpkfibO/sStnLiICw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T02:21:48.745345Z"},"content_sha256":"86833fc012f3deeaf659c0c30181be01c529943af74443d05cbb34eb07226cbd","schema_version":"1.0","event_id":"sha256:86833fc012f3deeaf659c0c30181be01c529943af74443d05cbb34eb07226cbd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:5JI3G3KKO3BRIS3IQGPF65G4BB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The number of labeled graphs of bounded treewidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"math.CO","authors_text":"Ignasi Sau, Julien Baste, Marc Noy","submitted_at":"2016-04-25T14:22:58Z","abstract_excerpt":"We focus on counting the number of labeled graphs on $n$ vertices and treewidth at most $k$ (or equivalently, the number of labeled partial $k$-trees), which we denote by $T_{n,k}$. So far, only the particular cases $T_{n,1}$ and $T_{n,2}$ had been studied. We show that $$ \\left(c \\cdot \\frac{k\\cdot 2^k \\cdot n}{\\log k} \\right)^n \\cdot 2^{-\\frac{k(k+3)}{2}} \\cdot k^{-2k-2}\\ \\leq\\ T_{n,k}\\ \\leq\\ \\left(k \\cdot 2^k \\cdot n\\right)^n \\cdot 2^{-\\frac{k(k+1)}{2}} \\cdot k^{-k}, $$ for $k > 1$ and some explicit absolute constant $c > 0$. The upper bound is an immediate consequence of the well-known num"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.07273","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:16:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fArk/REJ4h9Gm0d05ypi3YvFr4Bnf9aS8jfmXNSgVM3r+cXKOsLDccLnM512y3fvdKuTvDvPCny6e1hBIYZJAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T02:21:48.746043Z"},"content_sha256":"0f431e120773db1f49a138f14b88f7e9b8da419dfe43057449aa1b003668090f","schema_version":"1.0","event_id":"sha256:0f431e120773db1f49a138f14b88f7e9b8da419dfe43057449aa1b003668090f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5JI3G3KKO3BRIS3IQGPF65G4BB/bundle.json","state_url":"https://pith.science/pith/5JI3G3KKO3BRIS3IQGPF65G4BB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5JI3G3KKO3BRIS3IQGPF65G4BB/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-12T02:21:48Z","links":{"resolver":"https://pith.science/pith/5JI3G3KKO3BRIS3IQGPF65G4BB","bundle":"https://pith.science/pith/5JI3G3KKO3BRIS3IQGPF65G4BB/bundle.json","state":"https://pith.science/pith/5JI3G3KKO3BRIS3IQGPF65G4BB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5JI3G3KKO3BRIS3IQGPF65G4BB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:5JI3G3KKO3BRIS3IQGPF65G4BB","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":"1835f7d737f545ea00d7a3daec6b12f27f1cc6363a77f05a51758136dcef5804","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-25T14:22:58Z","title_canon_sha256":"2a85c15c6b59eb7148ccd409d1f1c977d146e58ff6c3609f0b3b2dd008452b09"},"schema_version":"1.0","source":{"id":"1604.07273","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.07273","created_at":"2026-05-18T01:16:22Z"},{"alias_kind":"arxiv_version","alias_value":"1604.07273v1","created_at":"2026-05-18T01:16:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.07273","created_at":"2026-05-18T01:16:22Z"},{"alias_kind":"pith_short_12","alias_value":"5JI3G3KKO3BR","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5JI3G3KKO3BRIS3I","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5JI3G3KK","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:0f431e120773db1f49a138f14b88f7e9b8da419dfe43057449aa1b003668090f","target":"graph","created_at":"2026-05-18T01:16:22Z","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":"We focus on counting the number of labeled graphs on $n$ vertices and treewidth at most $k$ (or equivalently, the number of labeled partial $k$-trees), which we denote by $T_{n,k}$. So far, only the particular cases $T_{n,1}$ and $T_{n,2}$ had been studied. We show that $$ \\left(c \\cdot \\frac{k\\cdot 2^k \\cdot n}{\\log k} \\right)^n \\cdot 2^{-\\frac{k(k+3)}{2}} \\cdot k^{-2k-2}\\ \\leq\\ T_{n,k}\\ \\leq\\ \\left(k \\cdot 2^k \\cdot n\\right)^n \\cdot 2^{-\\frac{k(k+1)}{2}} \\cdot k^{-k}, $$ for $k > 1$ and some explicit absolute constant $c > 0$. The upper bound is an immediate consequence of the well-known num","authors_text":"Ignasi Sau, Julien Baste, Marc Noy","cross_cats":["cs.DM","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-25T14:22:58Z","title":"The number of labeled graphs of bounded treewidth"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.07273","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:86833fc012f3deeaf659c0c30181be01c529943af74443d05cbb34eb07226cbd","target":"record","created_at":"2026-05-18T01:16:22Z","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":"1835f7d737f545ea00d7a3daec6b12f27f1cc6363a77f05a51758136dcef5804","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-25T14:22:58Z","title_canon_sha256":"2a85c15c6b59eb7148ccd409d1f1c977d146e58ff6c3609f0b3b2dd008452b09"},"schema_version":"1.0","source":{"id":"1604.07273","kind":"arxiv","version":1}},"canonical_sha256":"ea51b36d4a76c3144b68819e5f74dc084e9e89d16089174a700ea1e39ab0c275","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ea51b36d4a76c3144b68819e5f74dc084e9e89d16089174a700ea1e39ab0c275","first_computed_at":"2026-05-18T01:16:22.556155Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:22.556155Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dlcA9iIV51Ae+xOFLjAC0YT0Wbq2BXBUSi32XcekCMtoZHnmDtPt4hezjQ5OemNcAnYrdF7k9qYoYTfrTkUTCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:22.556675Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.07273","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:86833fc012f3deeaf659c0c30181be01c529943af74443d05cbb34eb07226cbd","sha256:0f431e120773db1f49a138f14b88f7e9b8da419dfe43057449aa1b003668090f"],"state_sha256":"2ded3e61bdfa0aa923efcb113ff5c19f86eb484180fbb9c0d0b88ef34c56fa1d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fZefjlKaVGMdHIdxeROeUUzJ2zAgxm7YsqSgTxYofx52M8iQDIxKsRLtavh5nkpz1dG0fV5EVARQZRJhudd2BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T02:21:48.750307Z","bundle_sha256":"9c013ebfbfdcd47b7930ab321f0aa90e92faf7fda4afad9c9e6f9bf4eca3e8b1"}}