{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:K4ENTILCVYFZFZVAGTYM2AJRDY","short_pith_number":"pith:K4ENTILC","schema_version":"1.0","canonical_sha256":"5708d9a162ae0b92e6a034f0cd01311e2177fff3eec0d29493cd1f0b7f524ea7","source":{"kind":"arxiv","id":"1103.2251","version":1},"attestation_state":"computed","paper":{"title":"Asymptotic expansions for enumerating connected labelled graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Keith Briggs","submitted_at":"2011-03-11T12:04:17Z","abstract_excerpt":"I compute several terms of the asymptotic expansion of the number of connected labelled graphs with n nodes and m edges, for small k=m-n."},"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":"1103.2251","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-03-11T12:04:17Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"16bf23d2b6e58b888fdd2cd553f5f21c0fd81cf711c8f6f35ee67fe2ba5c3986","abstract_canon_sha256":"7c67b1dc4adc854aa855a32f1be23e808dea4549d25d3a5937a691644ff1f0ff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:26:55.919400Z","signature_b64":"GxAPtCFE/IMVZp+HUjiITGzvKZEi1hiTbjdVXqyueukcAQXGeveDHLMt2r5O0HDpmbIzD8dgzbPsrEWhkHxQDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5708d9a162ae0b92e6a034f0cd01311e2177fff3eec0d29493cd1f0b7f524ea7","last_reissued_at":"2026-05-18T04:26:55.918977Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:26:55.918977Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asymptotic expansions for enumerating connected labelled graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Keith Briggs","submitted_at":"2011-03-11T12:04:17Z","abstract_excerpt":"I compute several terms of the asymptotic expansion of the number of connected labelled graphs with n nodes and m edges, for small k=m-n."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.2251","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1103.2251","created_at":"2026-05-18T04:26:55.919041+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.2251v1","created_at":"2026-05-18T04:26:55.919041+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.2251","created_at":"2026-05-18T04:26:55.919041+00:00"},{"alias_kind":"pith_short_12","alias_value":"K4ENTILCVYFZ","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_16","alias_value":"K4ENTILCVYFZFZVA","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_8","alias_value":"K4ENTILC","created_at":"2026-05-18T12:26:32.869790+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/K4ENTILCVYFZFZVAGTYM2AJRDY","json":"https://pith.science/pith/K4ENTILCVYFZFZVAGTYM2AJRDY.json","graph_json":"https://pith.science/api/pith-number/K4ENTILCVYFZFZVAGTYM2AJRDY/graph.json","events_json":"https://pith.science/api/pith-number/K4ENTILCVYFZFZVAGTYM2AJRDY/events.json","paper":"https://pith.science/paper/K4ENTILC"},"agent_actions":{"view_html":"https://pith.science/pith/K4ENTILCVYFZFZVAGTYM2AJRDY","download_json":"https://pith.science/pith/K4ENTILCVYFZFZVAGTYM2AJRDY.json","view_paper":"https://pith.science/paper/K4ENTILC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.2251&json=true","fetch_graph":"https://pith.science/api/pith-number/K4ENTILCVYFZFZVAGTYM2AJRDY/graph.json","fetch_events":"https://pith.science/api/pith-number/K4ENTILCVYFZFZVAGTYM2AJRDY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K4ENTILCVYFZFZVAGTYM2AJRDY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K4ENTILCVYFZFZVAGTYM2AJRDY/action/storage_attestation","attest_author":"https://pith.science/pith/K4ENTILCVYFZFZVAGTYM2AJRDY/action/author_attestation","sign_citation":"https://pith.science/pith/K4ENTILCVYFZFZVAGTYM2AJRDY/action/citation_signature","submit_replication":"https://pith.science/pith/K4ENTILCVYFZFZVAGTYM2AJRDY/action/replication_record"}},"created_at":"2026-05-18T04:26:55.919041+00:00","updated_at":"2026-05-18T04:26:55.919041+00:00"}