{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:PEHHCVJ5DKYPGUTEMIIBXE2U52","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":"a23ea536e20845a436cb484e742e95935bb33c07832bef8cd31ea916c7ed321e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-25T16:31:17Z","title_canon_sha256":"031745bff9f7715c6de5f94319ea3462aa3218d1fc6678b89cc5157b89926bc7"},"schema_version":"1.0","source":{"id":"2411.16547","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.16547","created_at":"2026-07-05T11:31:41Z"},{"alias_kind":"arxiv_version","alias_value":"2411.16547v3","created_at":"2026-07-05T11:31:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.16547","created_at":"2026-07-05T11:31:41Z"},{"alias_kind":"pith_short_12","alias_value":"PEHHCVJ5DKYP","created_at":"2026-07-05T11:31:41Z"},{"alias_kind":"pith_short_16","alias_value":"PEHHCVJ5DKYPGUTE","created_at":"2026-07-05T11:31:41Z"},{"alias_kind":"pith_short_8","alias_value":"PEHHCVJ5","created_at":"2026-07-05T11:31:41Z"}],"graph_snapshots":[{"event_id":"sha256:e0ec9cd44157292bc9efcf6defb16fddc28fd7c34b13d9ee5841e65d76dace42","target":"graph","created_at":"2026-07-05T11:31:41Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2411.16547/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present the notion of hom-complexity, $\\text{C}(G;H)$, for two graphs $G$ and $H$, along with basic results for this numerical invariant. This invariant $\\text{C}(G;H)$ is a number that measures the \\aspas{complexity} of the question: when is there a homomorphism $G\\to H$? More precisely, $\\text{C}(G;H)$ is the least positive integer $k$ such that there are $k$ different subgraphs $G_j$ of $G$ such that $G=G_1\\cup\\cdots\\cup G_k$, and for each $G_j$, there is a homomorphism $G_j\\to H$. Likewise, we introduce the notion of injective hom-complexity, $\\text{IC}(G;H)$. The (injective) hom-comple","authors_text":"Cesar A. Ipanaque Zapata, Josu\\'e A. Aguirre Enciso, Wilman Francisco Cuba Ramos","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-25T16:31:17Z","title":"(Injective) hom-complexity between graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.16547","kind":"arxiv","version":3},"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:e6b5f098e82c396a76b52c7573cd92495829865a963751c206a20d80b6b25b93","target":"record","created_at":"2026-07-05T11:31:41Z","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":"a23ea536e20845a436cb484e742e95935bb33c07832bef8cd31ea916c7ed321e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-25T16:31:17Z","title_canon_sha256":"031745bff9f7715c6de5f94319ea3462aa3218d1fc6678b89cc5157b89926bc7"},"schema_version":"1.0","source":{"id":"2411.16547","kind":"arxiv","version":3}},"canonical_sha256":"790e71553d1ab0f3526462101b9354ee8924d8256e85caa5afb0d2813e120e11","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"790e71553d1ab0f3526462101b9354ee8924d8256e85caa5afb0d2813e120e11","first_computed_at":"2026-07-05T11:31:41.531732Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:31:41.531732Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Mt0RYgFp8ht8/cBZDqKOjg7Qn1RnelXYNNjrOPXBsJgW2QNhD3ULYUd+v/m/fHyFXLTqtMUJf21XTbK6D2WOCA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:31:41.532176Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.16547","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e6b5f098e82c396a76b52c7573cd92495829865a963751c206a20d80b6b25b93","sha256:e0ec9cd44157292bc9efcf6defb16fddc28fd7c34b13d9ee5841e65d76dace42"],"state_sha256":"0da4f84e5ce39b29358399bf9822f539081388f845f2980589aca6bee15f6885"}