{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:IPYNRBWDK3UKVHSCZBBLPD2JJU","short_pith_number":"pith:IPYNRBWD","schema_version":"1.0","canonical_sha256":"43f0d886c356e8aa9e42c842b78f494d37db9cc59f8f14d917b4c75194b8d4fe","source":{"kind":"arxiv","id":"1709.06209","version":1},"attestation_state":"computed","paper":{"title":"Chromatic polynomials of random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.CO","math.MP"],"primary_cat":"cond-mat.stat-mech","authors_text":"Christoph Ehrlich, Denny Fliegner, Frank Van Bussel, Marc Timme, Sebastian Stolzenberg","submitted_at":"2017-09-19T00:31:39Z","abstract_excerpt":"Chromatic polynomials and related graph invariants are central objects in both graph theory and statistical physics. Computational difficulties, however, have so far restricted studies of such polynomials to graphs that were either very small, very sparse or highly structured. Recent algorithmic advances (Timme et al 2009 New J. Phys. 11 023001) now make it possible to compute chromatic polynomials for moderately sized graphs of arbitrary structure and number of edges. Here we present chromatic polynomials of ensembles of random graphs with up to 30 vertices, over the entire range of edge dens"},"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":"1709.06209","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2017-09-19T00:31:39Z","cross_cats_sorted":["math-ph","math.CO","math.MP"],"title_canon_sha256":"c119d9e9bcc025517f2758996f1d46025e5314176ab90a49c07f14bb2dc9599c","abstract_canon_sha256":"0cfcb6b69c7329090602d6bc07daa755dc1cb888f84e36632b8eddc99f885e91"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:53.999991Z","signature_b64":"YPpqg3AY4V4WUzKcYrROwi0Yjbq/TvppO/U23h2coS5MoBK5tU7qJd2ZYxvTvq7OCf1xWibz8+1ze6YHTLfPAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43f0d886c356e8aa9e42c842b78f494d37db9cc59f8f14d917b4c75194b8d4fe","last_reissued_at":"2026-05-18T00:34:53.999335Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:53.999335Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Chromatic polynomials of random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.CO","math.MP"],"primary_cat":"cond-mat.stat-mech","authors_text":"Christoph Ehrlich, Denny Fliegner, Frank Van Bussel, Marc Timme, Sebastian Stolzenberg","submitted_at":"2017-09-19T00:31:39Z","abstract_excerpt":"Chromatic polynomials and related graph invariants are central objects in both graph theory and statistical physics. Computational difficulties, however, have so far restricted studies of such polynomials to graphs that were either very small, very sparse or highly structured. Recent algorithmic advances (Timme et al 2009 New J. Phys. 11 023001) now make it possible to compute chromatic polynomials for moderately sized graphs of arbitrary structure and number of edges. Here we present chromatic polynomials of ensembles of random graphs with up to 30 vertices, over the entire range of edge dens"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.06209","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":"1709.06209","created_at":"2026-05-18T00:34:53.999448+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.06209v1","created_at":"2026-05-18T00:34:53.999448+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.06209","created_at":"2026-05-18T00:34:53.999448+00:00"},{"alias_kind":"pith_short_12","alias_value":"IPYNRBWDK3UK","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"IPYNRBWDK3UKVHSC","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"IPYNRBWD","created_at":"2026-05-18T12:31:21.493067+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/IPYNRBWDK3UKVHSCZBBLPD2JJU","json":"https://pith.science/pith/IPYNRBWDK3UKVHSCZBBLPD2JJU.json","graph_json":"https://pith.science/api/pith-number/IPYNRBWDK3UKVHSCZBBLPD2JJU/graph.json","events_json":"https://pith.science/api/pith-number/IPYNRBWDK3UKVHSCZBBLPD2JJU/events.json","paper":"https://pith.science/paper/IPYNRBWD"},"agent_actions":{"view_html":"https://pith.science/pith/IPYNRBWDK3UKVHSCZBBLPD2JJU","download_json":"https://pith.science/pith/IPYNRBWDK3UKVHSCZBBLPD2JJU.json","view_paper":"https://pith.science/paper/IPYNRBWD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.06209&json=true","fetch_graph":"https://pith.science/api/pith-number/IPYNRBWDK3UKVHSCZBBLPD2JJU/graph.json","fetch_events":"https://pith.science/api/pith-number/IPYNRBWDK3UKVHSCZBBLPD2JJU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IPYNRBWDK3UKVHSCZBBLPD2JJU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IPYNRBWDK3UKVHSCZBBLPD2JJU/action/storage_attestation","attest_author":"https://pith.science/pith/IPYNRBWDK3UKVHSCZBBLPD2JJU/action/author_attestation","sign_citation":"https://pith.science/pith/IPYNRBWDK3UKVHSCZBBLPD2JJU/action/citation_signature","submit_replication":"https://pith.science/pith/IPYNRBWDK3UKVHSCZBBLPD2JJU/action/replication_record"}},"created_at":"2026-05-18T00:34:53.999448+00:00","updated_at":"2026-05-18T00:34:53.999448+00:00"}