{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:2GFUZ2I6QPDA6XOTWIVPLL25ZV","short_pith_number":"pith:2GFUZ2I6","schema_version":"1.0","canonical_sha256":"d18b4ce91e83c60f5dd3b22af5af5dcd62f88057a410f0afca0023168e2e06dd","source":{"kind":"arxiv","id":"1808.03932","version":1},"attestation_state":"computed","paper":{"title":"$PC$-polynomial of graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.RA"],"primary_cat":"math.CO","authors_text":"Vsevolod Gubarev","submitted_at":"2018-08-12T12:35:16Z","abstract_excerpt":"We define $PC$-polynomial of graph which is related to clique, (in)dependence and matching polynomials. The growth rate of partially commutative monoid is equal to the largest root $\\beta(G)$ of $PC$-polynomial of the corresponding graph.\n  The random algebra is defined in such way that its growth rate equals the largest root of $PC$-polynomial of random graph. We prove that for almost all graphs all sufficiently large real roots of $PC$-polynomial lie in neighbourhoods of roots of $PC$-polynomial of random graph. We show how to calculate the series expansions of the latter roots. The average "},"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":"1808.03932","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-12T12:35:16Z","cross_cats_sorted":["math.RA"],"title_canon_sha256":"3e00674a0b79056bdf85a8af5834be78fa2a250ac61c33436b38d3a407376d1b","abstract_canon_sha256":"e6a3ced63beecc4e72cfb9b519066798702d3914bf1162070e53c4b465628407"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:14.207555Z","signature_b64":"u7AGx0SG2vUoT9lOEUmcAnRKNFYLjLKz06TGwi02BRgeFzq1Eu1C2VlfGWqit/LGgX/exgBj+wSX/iT5t3InAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d18b4ce91e83c60f5dd3b22af5af5dcd62f88057a410f0afca0023168e2e06dd","last_reissued_at":"2026-05-18T00:08:14.207184Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:14.207184Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"$PC$-polynomial of graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.RA"],"primary_cat":"math.CO","authors_text":"Vsevolod Gubarev","submitted_at":"2018-08-12T12:35:16Z","abstract_excerpt":"We define $PC$-polynomial of graph which is related to clique, (in)dependence and matching polynomials. The growth rate of partially commutative monoid is equal to the largest root $\\beta(G)$ of $PC$-polynomial of the corresponding graph.\n  The random algebra is defined in such way that its growth rate equals the largest root of $PC$-polynomial of random graph. We prove that for almost all graphs all sufficiently large real roots of $PC$-polynomial lie in neighbourhoods of roots of $PC$-polynomial of random graph. We show how to calculate the series expansions of the latter roots. The average "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.03932","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":"1808.03932","created_at":"2026-05-18T00:08:14.207244+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.03932v1","created_at":"2026-05-18T00:08:14.207244+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.03932","created_at":"2026-05-18T00:08:14.207244+00:00"},{"alias_kind":"pith_short_12","alias_value":"2GFUZ2I6QPDA","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"2GFUZ2I6QPDA6XOT","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"2GFUZ2I6","created_at":"2026-05-18T12:32:02.567920+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/2GFUZ2I6QPDA6XOTWIVPLL25ZV","json":"https://pith.science/pith/2GFUZ2I6QPDA6XOTWIVPLL25ZV.json","graph_json":"https://pith.science/api/pith-number/2GFUZ2I6QPDA6XOTWIVPLL25ZV/graph.json","events_json":"https://pith.science/api/pith-number/2GFUZ2I6QPDA6XOTWIVPLL25ZV/events.json","paper":"https://pith.science/paper/2GFUZ2I6"},"agent_actions":{"view_html":"https://pith.science/pith/2GFUZ2I6QPDA6XOTWIVPLL25ZV","download_json":"https://pith.science/pith/2GFUZ2I6QPDA6XOTWIVPLL25ZV.json","view_paper":"https://pith.science/paper/2GFUZ2I6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.03932&json=true","fetch_graph":"https://pith.science/api/pith-number/2GFUZ2I6QPDA6XOTWIVPLL25ZV/graph.json","fetch_events":"https://pith.science/api/pith-number/2GFUZ2I6QPDA6XOTWIVPLL25ZV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2GFUZ2I6QPDA6XOTWIVPLL25ZV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2GFUZ2I6QPDA6XOTWIVPLL25ZV/action/storage_attestation","attest_author":"https://pith.science/pith/2GFUZ2I6QPDA6XOTWIVPLL25ZV/action/author_attestation","sign_citation":"https://pith.science/pith/2GFUZ2I6QPDA6XOTWIVPLL25ZV/action/citation_signature","submit_replication":"https://pith.science/pith/2GFUZ2I6QPDA6XOTWIVPLL25ZV/action/replication_record"}},"created_at":"2026-05-18T00:08:14.207244+00:00","updated_at":"2026-05-18T00:08:14.207244+00:00"}