{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:CTMBGJ4LCAIL5OJDUTU46DJM4F","short_pith_number":"pith:CTMBGJ4L","schema_version":"1.0","canonical_sha256":"14d813278b1010beb923a4e9cf0d2ce14e93c7cacdec1b2e17465f892cf489ff","source":{"kind":"arxiv","id":"1808.04778","version":1},"attestation_state":"computed","paper":{"title":"Hedetniemi's conjecture and strongly multiplicative graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Claude Tardif, Marcin Wrochna","submitted_at":"2018-08-14T16:14:14Z","abstract_excerpt":"A graph K is multiplicative if a homomorphism from any product G x H to K implies a homomorphism from G or from H. Hedetniemi's conjecture states that all cliques are multiplicative. In an attempt to explore the boundaries of current methods, we investigate strongly multiplicative graphs, which we define as K such that for any connected graphs G,H with odd cycles C,C', a homomorphism from $(G \\times C') \\cup (C \\times H) \\subseteq G \\times H$ to K implies a homomorphism from G or H.\n  Strong multiplicativity of K also implies the following property, which may be of independent interest: if G i"},"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.04778","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-14T16:14:14Z","cross_cats_sorted":[],"title_canon_sha256":"edba0dbc436cc11e3d8c1bbc43a7d319baf65d56c9e7561176c6e6023c337e28","abstract_canon_sha256":"9bcd6035e62c5eb6c866edb4b2a0118966c5286d7b4c54f8b5db5c278c9ab36f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:11.772252Z","signature_b64":"BigbAvFtBtmxiuVI8YncQWzLkFsbwpYyqO13ZcTBe8Q2B+j+J8+PTgjsAgFLL2gY4llWdAvfbhOt8Rc91w+uDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"14d813278b1010beb923a4e9cf0d2ce14e93c7cacdec1b2e17465f892cf489ff","last_reissued_at":"2026-05-18T00:08:11.771866Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:11.771866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hedetniemi's conjecture and strongly multiplicative graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Claude Tardif, Marcin Wrochna","submitted_at":"2018-08-14T16:14:14Z","abstract_excerpt":"A graph K is multiplicative if a homomorphism from any product G x H to K implies a homomorphism from G or from H. Hedetniemi's conjecture states that all cliques are multiplicative. In an attempt to explore the boundaries of current methods, we investigate strongly multiplicative graphs, which we define as K such that for any connected graphs G,H with odd cycles C,C', a homomorphism from $(G \\times C') \\cup (C \\times H) \\subseteq G \\times H$ to K implies a homomorphism from G or H.\n  Strong multiplicativity of K also implies the following property, which may be of independent interest: if G i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.04778","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.04778","created_at":"2026-05-18T00:08:11.771928+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.04778v1","created_at":"2026-05-18T00:08:11.771928+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.04778","created_at":"2026-05-18T00:08:11.771928+00:00"},{"alias_kind":"pith_short_12","alias_value":"CTMBGJ4LCAIL","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"CTMBGJ4LCAIL5OJD","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"CTMBGJ4L","created_at":"2026-05-18T12:32:19.392346+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/CTMBGJ4LCAIL5OJDUTU46DJM4F","json":"https://pith.science/pith/CTMBGJ4LCAIL5OJDUTU46DJM4F.json","graph_json":"https://pith.science/api/pith-number/CTMBGJ4LCAIL5OJDUTU46DJM4F/graph.json","events_json":"https://pith.science/api/pith-number/CTMBGJ4LCAIL5OJDUTU46DJM4F/events.json","paper":"https://pith.science/paper/CTMBGJ4L"},"agent_actions":{"view_html":"https://pith.science/pith/CTMBGJ4LCAIL5OJDUTU46DJM4F","download_json":"https://pith.science/pith/CTMBGJ4LCAIL5OJDUTU46DJM4F.json","view_paper":"https://pith.science/paper/CTMBGJ4L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.04778&json=true","fetch_graph":"https://pith.science/api/pith-number/CTMBGJ4LCAIL5OJDUTU46DJM4F/graph.json","fetch_events":"https://pith.science/api/pith-number/CTMBGJ4LCAIL5OJDUTU46DJM4F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CTMBGJ4LCAIL5OJDUTU46DJM4F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CTMBGJ4LCAIL5OJDUTU46DJM4F/action/storage_attestation","attest_author":"https://pith.science/pith/CTMBGJ4LCAIL5OJDUTU46DJM4F/action/author_attestation","sign_citation":"https://pith.science/pith/CTMBGJ4LCAIL5OJDUTU46DJM4F/action/citation_signature","submit_replication":"https://pith.science/pith/CTMBGJ4LCAIL5OJDUTU46DJM4F/action/replication_record"}},"created_at":"2026-05-18T00:08:11.771928+00:00","updated_at":"2026-05-18T00:08:11.771928+00:00"}