{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:O2ZYV7UM3HVPKHW5WER6IF5QY2","short_pith_number":"pith:O2ZYV7UM","schema_version":"1.0","canonical_sha256":"76b38afe8cd9eaf51eddb123e417b0c68f97977d160d7fef71c68f13b7c7426c","source":{"kind":"arxiv","id":"1605.08597","version":3},"attestation_state":"computed","paper":{"title":"Analytic combinatorics of connected graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Elie de Panafieu","submitted_at":"2016-05-27T11:59:19Z","abstract_excerpt":"We enumerate the connected graphs that contain a number of edges growing linearly with respect to the number of vertices. So far, only the first term of the asymptotics and a bound on the error were known. Using analytic combinatorics, ie generating function manipulations, we derive a formula for the coefficients of the complete asymptotic expansion. The same result is derived for connected multigraphs."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1605.08597","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-27T11:59:19Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"b2c8d1feb90642b8e9538067802fb4e0e90d9d7a4c591023371b52f1f148f04f","abstract_canon_sha256":"974f083233d1129f17098bf92c4968cfdf76dcdacc33377b547c5d5bbc0e4536"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:37.508893Z","signature_b64":"k5cB6YjcLIZOMz43ONUWNFN9uVTnGLc87WVnMr8ykOkFdl5vNiAl+a0GMFAcMjsTRzg2tU/8km37bYIfugX2Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76b38afe8cd9eaf51eddb123e417b0c68f97977d160d7fef71c68f13b7c7426c","last_reissued_at":"2026-05-18T00:03:37.508249Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:37.508249Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Analytic combinatorics of connected graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Elie de Panafieu","submitted_at":"2016-05-27T11:59:19Z","abstract_excerpt":"We enumerate the connected graphs that contain a number of edges growing linearly with respect to the number of vertices. So far, only the first term of the asymptotics and a bound on the error were known. Using analytic combinatorics, ie generating function manipulations, we derive a formula for the coefficients of the complete asymptotic expansion. The same result is derived for connected multigraphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.08597","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1605.08597","created_at":"2026-05-18T00:03:37.508357+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.08597v3","created_at":"2026-05-18T00:03:37.508357+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.08597","created_at":"2026-05-18T00:03:37.508357+00:00"},{"alias_kind":"pith_short_12","alias_value":"O2ZYV7UM3HVP","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"O2ZYV7UM3HVPKHW5","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"O2ZYV7UM","created_at":"2026-05-18T12:30:36.002864+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/O2ZYV7UM3HVPKHW5WER6IF5QY2","json":"https://pith.science/pith/O2ZYV7UM3HVPKHW5WER6IF5QY2.json","graph_json":"https://pith.science/api/pith-number/O2ZYV7UM3HVPKHW5WER6IF5QY2/graph.json","events_json":"https://pith.science/api/pith-number/O2ZYV7UM3HVPKHW5WER6IF5QY2/events.json","paper":"https://pith.science/paper/O2ZYV7UM"},"agent_actions":{"view_html":"https://pith.science/pith/O2ZYV7UM3HVPKHW5WER6IF5QY2","download_json":"https://pith.science/pith/O2ZYV7UM3HVPKHW5WER6IF5QY2.json","view_paper":"https://pith.science/paper/O2ZYV7UM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.08597&json=true","fetch_graph":"https://pith.science/api/pith-number/O2ZYV7UM3HVPKHW5WER6IF5QY2/graph.json","fetch_events":"https://pith.science/api/pith-number/O2ZYV7UM3HVPKHW5WER6IF5QY2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O2ZYV7UM3HVPKHW5WER6IF5QY2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O2ZYV7UM3HVPKHW5WER6IF5QY2/action/storage_attestation","attest_author":"https://pith.science/pith/O2ZYV7UM3HVPKHW5WER6IF5QY2/action/author_attestation","sign_citation":"https://pith.science/pith/O2ZYV7UM3HVPKHW5WER6IF5QY2/action/citation_signature","submit_replication":"https://pith.science/pith/O2ZYV7UM3HVPKHW5WER6IF5QY2/action/replication_record"}},"created_at":"2026-05-18T00:03:37.508357+00:00","updated_at":"2026-05-18T00:03:37.508357+00:00"}