{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:HK57ZXA25UZSQSCPBLJ5PYBM3N","short_pith_number":"pith:HK57ZXA2","schema_version":"1.0","canonical_sha256":"3abbfcdc1aed3328484f0ad3d7e02cdb79d01622d9ab5d4289e83c1308ef48a7","source":{"kind":"arxiv","id":"1308.3999","version":1},"attestation_state":"computed","paper":{"title":"Polynomial graph invariants from homomorphism numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrew Goodall, Delia Garijo, Jaroslav Nesetril","submitted_at":"2013-08-19T12:28:56Z","abstract_excerpt":"We give a method of generating strongly polynomial sequences of graphs, i.e., sequences $(H_{\\mathbf{k}})$ indexed by a multivariate parameter $\\mathbf{k}=(k_1,\\ldots, k_h)$ such that, for each fixed graph $G$, there is a multivariate polynomial $p(G;x_1,\\ldots, x_h)$ such that the number of homomorphisms from $G$ to $H_{\\mathbf{k}}$ is given by the evaluation $p(G;k_1,\\ldots, k_h)$. A classical example is the sequence $(K_k)$ of complete graphs, for which ${\\rm hom}(G,K_k)=P(G;k)$ is the evaluation of the chromatic polynomial at $k$. Our construction produces a large family of graph polynomia"},"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":"1308.3999","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-19T12:28:56Z","cross_cats_sorted":[],"title_canon_sha256":"7147b5c907d65016e5bcfb79263ad2a8d319d3a595bc09bab19000be3048f5fd","abstract_canon_sha256":"3149f749c79fa341eb2db108d88e27f6f5f9c35df6be8545dd85b02e5b385c50"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:35.113557Z","signature_b64":"tdbsHPtVGf4pxy5T0edB2tSHI7kg7i9KK1LZ5iXSb1GynQGnvbWrQ25R5CfqdPsSz9azDSSV5B9mHBFITZe0Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3abbfcdc1aed3328484f0ad3d7e02cdb79d01622d9ab5d4289e83c1308ef48a7","last_reissued_at":"2026-05-18T03:15:35.112886Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:35.112886Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Polynomial graph invariants from homomorphism numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrew Goodall, Delia Garijo, Jaroslav Nesetril","submitted_at":"2013-08-19T12:28:56Z","abstract_excerpt":"We give a method of generating strongly polynomial sequences of graphs, i.e., sequences $(H_{\\mathbf{k}})$ indexed by a multivariate parameter $\\mathbf{k}=(k_1,\\ldots, k_h)$ such that, for each fixed graph $G$, there is a multivariate polynomial $p(G;x_1,\\ldots, x_h)$ such that the number of homomorphisms from $G$ to $H_{\\mathbf{k}}$ is given by the evaluation $p(G;k_1,\\ldots, k_h)$. A classical example is the sequence $(K_k)$ of complete graphs, for which ${\\rm hom}(G,K_k)=P(G;k)$ is the evaluation of the chromatic polynomial at $k$. Our construction produces a large family of graph polynomia"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.3999","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":"1308.3999","created_at":"2026-05-18T03:15:35.113020+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.3999v1","created_at":"2026-05-18T03:15:35.113020+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.3999","created_at":"2026-05-18T03:15:35.113020+00:00"},{"alias_kind":"pith_short_12","alias_value":"HK57ZXA25UZS","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"HK57ZXA25UZSQSCP","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"HK57ZXA2","created_at":"2026-05-18T12:27:46.883200+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/HK57ZXA25UZSQSCPBLJ5PYBM3N","json":"https://pith.science/pith/HK57ZXA25UZSQSCPBLJ5PYBM3N.json","graph_json":"https://pith.science/api/pith-number/HK57ZXA25UZSQSCPBLJ5PYBM3N/graph.json","events_json":"https://pith.science/api/pith-number/HK57ZXA25UZSQSCPBLJ5PYBM3N/events.json","paper":"https://pith.science/paper/HK57ZXA2"},"agent_actions":{"view_html":"https://pith.science/pith/HK57ZXA25UZSQSCPBLJ5PYBM3N","download_json":"https://pith.science/pith/HK57ZXA25UZSQSCPBLJ5PYBM3N.json","view_paper":"https://pith.science/paper/HK57ZXA2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.3999&json=true","fetch_graph":"https://pith.science/api/pith-number/HK57ZXA25UZSQSCPBLJ5PYBM3N/graph.json","fetch_events":"https://pith.science/api/pith-number/HK57ZXA25UZSQSCPBLJ5PYBM3N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HK57ZXA25UZSQSCPBLJ5PYBM3N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HK57ZXA25UZSQSCPBLJ5PYBM3N/action/storage_attestation","attest_author":"https://pith.science/pith/HK57ZXA25UZSQSCPBLJ5PYBM3N/action/author_attestation","sign_citation":"https://pith.science/pith/HK57ZXA25UZSQSCPBLJ5PYBM3N/action/citation_signature","submit_replication":"https://pith.science/pith/HK57ZXA25UZSQSCPBLJ5PYBM3N/action/replication_record"}},"created_at":"2026-05-18T03:15:35.113020+00:00","updated_at":"2026-05-18T03:15:35.113020+00:00"}