{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:HK57ZXA25UZSQSCPBLJ5PYBM3N","short_pith_number":"pith:HK57ZXA2","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"},"canonical_sha256":"3abbfcdc1aed3328484f0ad3d7e02cdb79d01622d9ab5d4289e83c1308ef48a7","source":{"kind":"arxiv","id":"1308.3999","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.3999","created_at":"2026-05-18T03:15:35Z"},{"alias_kind":"arxiv_version","alias_value":"1308.3999v1","created_at":"2026-05-18T03:15:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.3999","created_at":"2026-05-18T03:15:35Z"},{"alias_kind":"pith_short_12","alias_value":"HK57ZXA25UZS","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HK57ZXA25UZSQSCP","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HK57ZXA2","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:HK57ZXA25UZSQSCPBLJ5PYBM3N","target":"record","payload":{"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"},"canonical_sha256":"3abbfcdc1aed3328484f0ad3d7e02cdb79d01622d9ab5d4289e83c1308ef48a7","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"},"source_kind":"arxiv","source_id":"1308.3999","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:15:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rRLhNXWgmcp3R22mFvdHrP6x/VPwde43hhto7XWb+59+AKEVRFQaPI+kdZ8xmLy+DlGbr1Po90FaoyDtnP7cAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T08:10:37.960195Z"},"content_sha256":"135842f54f0feb90788d4682b9cb13cfa2ae841f8d99c26384a8d71518cf5191","schema_version":"1.0","event_id":"sha256:135842f54f0feb90788d4682b9cb13cfa2ae841f8d99c26384a8d71518cf5191"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:HK57ZXA25UZSQSCPBLJ5PYBM3N","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:15:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JFZT3F9a75kubEL3rp0gSXs53Zcku3sff9OvBWIydcUh1VOXi1iErYHEWeUFNEesrghlc2KzFjY7tbQwBgG7Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T08:10:37.960545Z"},"content_sha256":"9131b26a292c4b77104e899587ad27300e0d5e606244f105fb87e176e28e512b","schema_version":"1.0","event_id":"sha256:9131b26a292c4b77104e899587ad27300e0d5e606244f105fb87e176e28e512b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HK57ZXA25UZSQSCPBLJ5PYBM3N/bundle.json","state_url":"https://pith.science/pith/HK57ZXA25UZSQSCPBLJ5PYBM3N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HK57ZXA25UZSQSCPBLJ5PYBM3N/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-02T08:10:37Z","links":{"resolver":"https://pith.science/pith/HK57ZXA25UZSQSCPBLJ5PYBM3N","bundle":"https://pith.science/pith/HK57ZXA25UZSQSCPBLJ5PYBM3N/bundle.json","state":"https://pith.science/pith/HK57ZXA25UZSQSCPBLJ5PYBM3N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HK57ZXA25UZSQSCPBLJ5PYBM3N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:HK57ZXA25UZSQSCPBLJ5PYBM3N","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"3149f749c79fa341eb2db108d88e27f6f5f9c35df6be8545dd85b02e5b385c50","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-19T12:28:56Z","title_canon_sha256":"7147b5c907d65016e5bcfb79263ad2a8d319d3a595bc09bab19000be3048f5fd"},"schema_version":"1.0","source":{"id":"1308.3999","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.3999","created_at":"2026-05-18T03:15:35Z"},{"alias_kind":"arxiv_version","alias_value":"1308.3999v1","created_at":"2026-05-18T03:15:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.3999","created_at":"2026-05-18T03:15:35Z"},{"alias_kind":"pith_short_12","alias_value":"HK57ZXA25UZS","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HK57ZXA25UZSQSCP","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HK57ZXA2","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:9131b26a292c4b77104e899587ad27300e0d5e606244f105fb87e176e28e512b","target":"graph","created_at":"2026-05-18T03:15:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Andrew Goodall, Delia Garijo, Jaroslav Nesetril","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-19T12:28:56Z","title":"Polynomial graph invariants from homomorphism numbers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.3999","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:135842f54f0feb90788d4682b9cb13cfa2ae841f8d99c26384a8d71518cf5191","target":"record","created_at":"2026-05-18T03:15:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"3149f749c79fa341eb2db108d88e27f6f5f9c35df6be8545dd85b02e5b385c50","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-19T12:28:56Z","title_canon_sha256":"7147b5c907d65016e5bcfb79263ad2a8d319d3a595bc09bab19000be3048f5fd"},"schema_version":"1.0","source":{"id":"1308.3999","kind":"arxiv","version":1}},"canonical_sha256":"3abbfcdc1aed3328484f0ad3d7e02cdb79d01622d9ab5d4289e83c1308ef48a7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3abbfcdc1aed3328484f0ad3d7e02cdb79d01622d9ab5d4289e83c1308ef48a7","first_computed_at":"2026-05-18T03:15:35.112886Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:15:35.112886Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tdbsHPtVGf4pxy5T0edB2tSHI7kg7i9KK1LZ5iXSb1GynQGnvbWrQ25R5CfqdPsSz9azDSSV5B9mHBFITZe0Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:15:35.113557Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.3999","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:135842f54f0feb90788d4682b9cb13cfa2ae841f8d99c26384a8d71518cf5191","sha256:9131b26a292c4b77104e899587ad27300e0d5e606244f105fb87e176e28e512b"],"state_sha256":"74b1127f9b97de991baba908d7c4d664e2c14f11014c0a1e096b4b41205e0b35"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sde6Ct44HO47DE3ks/FhnrDGhC4bnt3ycmnJ2b1dOTAryXaI3l9ue++41UdYjMpDrOxzhYvPjgwg96nmDu1CBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T08:10:37.962452Z","bundle_sha256":"6aec7f834a6a344a29ff913e7b506ac15fdc22ce79c6ba57449f9d4f501cbfc1"}}