{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:7JFEF3ZIMVEPAT4HBM3OJY3QAB","short_pith_number":"pith:7JFEF3ZI","canonical_record":{"source":{"id":"1509.03855","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-13T15:04:21Z","cross_cats_sorted":["math.AT"],"title_canon_sha256":"99b48c736a18475f3c9fe30d40f33b03a440523dd9a7d9536b1849bdfb656f1f","abstract_canon_sha256":"38242b1c336d89150f4b9d63e24f3dc9c324c5a048c8253fadc2d6bea950f3f3"},"schema_version":"1.0"},"canonical_sha256":"fa4a42ef286548f04f870b36e4e3700040607e4ba0148f1852e61f176651a339","source":{"kind":"arxiv","id":"1509.03855","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.03855","created_at":"2026-05-18T00:39:13Z"},{"alias_kind":"arxiv_version","alias_value":"1509.03855v3","created_at":"2026-05-18T00:39:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.03855","created_at":"2026-05-18T00:39:13Z"},{"alias_kind":"pith_short_12","alias_value":"7JFEF3ZIMVEP","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7JFEF3ZIMVEPAT4H","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7JFEF3ZI","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:7JFEF3ZIMVEPAT4HBM3OJY3QAB","target":"record","payload":{"canonical_record":{"source":{"id":"1509.03855","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-13T15:04:21Z","cross_cats_sorted":["math.AT"],"title_canon_sha256":"99b48c736a18475f3c9fe30d40f33b03a440523dd9a7d9536b1849bdfb656f1f","abstract_canon_sha256":"38242b1c336d89150f4b9d63e24f3dc9c324c5a048c8253fadc2d6bea950f3f3"},"schema_version":"1.0"},"canonical_sha256":"fa4a42ef286548f04f870b36e4e3700040607e4ba0148f1852e61f176651a339","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:13.841223Z","signature_b64":"Gi2VYDfNMdQn3dmaJPZDfWCV56pJjoxQiZAY2sAUUHjg8YO7QjVSlqeIAGpNUTg5kdvSMdm3ENu83o8BuWA4Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa4a42ef286548f04f870b36e4e3700040607e4ba0148f1852e61f176651a339","last_reissued_at":"2026-05-18T00:39:13.840681Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:13.840681Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.03855","source_version":3,"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-18T00:39:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TRcaPZh51j8SSZKlm22hyKrmL+l5U+rQ2ATN2cPh2QwdtSJAHEb7sa/3DxDq3Qnl/MYNsX2ebeuM+a2LgmfFDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T05:16:01.717539Z"},"content_sha256":"c4874e7ef0a14883075bfbc2f1eba01e7e63f46f09cb2be11be15377084135a4","schema_version":"1.0","event_id":"sha256:c4874e7ef0a14883075bfbc2f1eba01e7e63f46f09cb2be11be15377084135a4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:7JFEF3ZIMVEPAT4HBM3OJY3QAB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Homotopy types of Hom complexes of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AT"],"primary_cat":"math.CO","authors_text":"Takahiro Matsushita","submitted_at":"2015-09-13T15:04:21Z","abstract_excerpt":"The Hom complex ${\\rm Hom}(T,G)$ of graphs is a CW-complex associated to a pair of graphs $T$ and $G$, considered in the graph coloring problem. It is known that certain homotopy invariants of ${\\rm Hom}(T,G)$ give lower bounds for the chromatic number of $G$.\n  For a fixed finite graph $T$, we show that there is no homotopy invariant of ${\\rm Hom}(T,G)$ which gives an upper bound for the chromatic number of $G$. More precisely, for a non-bipartite graph $G$, we construct a graph $H$ such that ${\\rm Hom}(T,G)$ and ${\\rm Hom}(T,H)$ are homotopy equivalent but $\\chi(H)$ is much larger than $\\chi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.03855","kind":"arxiv","version":3},"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-18T00:39:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aw2wlxJ2m4WjII1pQXwAXbgAtGmBmGSqrWdheytSm/FCScBwvpQVZvcBIp8gywOTG7u01TpZ6caDi4AuKbV6Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T05:16:01.718244Z"},"content_sha256":"eaacea16306434b31856749e0a56aeaf97f8c03dfb70bd6534dcdfcd267fe4ad","schema_version":"1.0","event_id":"sha256:eaacea16306434b31856749e0a56aeaf97f8c03dfb70bd6534dcdfcd267fe4ad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7JFEF3ZIMVEPAT4HBM3OJY3QAB/bundle.json","state_url":"https://pith.science/pith/7JFEF3ZIMVEPAT4HBM3OJY3QAB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7JFEF3ZIMVEPAT4HBM3OJY3QAB/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-08T05:16:01Z","links":{"resolver":"https://pith.science/pith/7JFEF3ZIMVEPAT4HBM3OJY3QAB","bundle":"https://pith.science/pith/7JFEF3ZIMVEPAT4HBM3OJY3QAB/bundle.json","state":"https://pith.science/pith/7JFEF3ZIMVEPAT4HBM3OJY3QAB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7JFEF3ZIMVEPAT4HBM3OJY3QAB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:7JFEF3ZIMVEPAT4HBM3OJY3QAB","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":"38242b1c336d89150f4b9d63e24f3dc9c324c5a048c8253fadc2d6bea950f3f3","cross_cats_sorted":["math.AT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-13T15:04:21Z","title_canon_sha256":"99b48c736a18475f3c9fe30d40f33b03a440523dd9a7d9536b1849bdfb656f1f"},"schema_version":"1.0","source":{"id":"1509.03855","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.03855","created_at":"2026-05-18T00:39:13Z"},{"alias_kind":"arxiv_version","alias_value":"1509.03855v3","created_at":"2026-05-18T00:39:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.03855","created_at":"2026-05-18T00:39:13Z"},{"alias_kind":"pith_short_12","alias_value":"7JFEF3ZIMVEP","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7JFEF3ZIMVEPAT4H","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7JFEF3ZI","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:eaacea16306434b31856749e0a56aeaf97f8c03dfb70bd6534dcdfcd267fe4ad","target":"graph","created_at":"2026-05-18T00:39:13Z","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":"The Hom complex ${\\rm Hom}(T,G)$ of graphs is a CW-complex associated to a pair of graphs $T$ and $G$, considered in the graph coloring problem. It is known that certain homotopy invariants of ${\\rm Hom}(T,G)$ give lower bounds for the chromatic number of $G$.\n  For a fixed finite graph $T$, we show that there is no homotopy invariant of ${\\rm Hom}(T,G)$ which gives an upper bound for the chromatic number of $G$. More precisely, for a non-bipartite graph $G$, we construct a graph $H$ such that ${\\rm Hom}(T,G)$ and ${\\rm Hom}(T,H)$ are homotopy equivalent but $\\chi(H)$ is much larger than $\\chi","authors_text":"Takahiro Matsushita","cross_cats":["math.AT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-13T15:04:21Z","title":"Homotopy types of Hom complexes of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.03855","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:c4874e7ef0a14883075bfbc2f1eba01e7e63f46f09cb2be11be15377084135a4","target":"record","created_at":"2026-05-18T00:39:13Z","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":"38242b1c336d89150f4b9d63e24f3dc9c324c5a048c8253fadc2d6bea950f3f3","cross_cats_sorted":["math.AT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-13T15:04:21Z","title_canon_sha256":"99b48c736a18475f3c9fe30d40f33b03a440523dd9a7d9536b1849bdfb656f1f"},"schema_version":"1.0","source":{"id":"1509.03855","kind":"arxiv","version":3}},"canonical_sha256":"fa4a42ef286548f04f870b36e4e3700040607e4ba0148f1852e61f176651a339","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fa4a42ef286548f04f870b36e4e3700040607e4ba0148f1852e61f176651a339","first_computed_at":"2026-05-18T00:39:13.840681Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:13.840681Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Gi2VYDfNMdQn3dmaJPZDfWCV56pJjoxQiZAY2sAUUHjg8YO7QjVSlqeIAGpNUTg5kdvSMdm3ENu83o8BuWA4Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:13.841223Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.03855","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c4874e7ef0a14883075bfbc2f1eba01e7e63f46f09cb2be11be15377084135a4","sha256:eaacea16306434b31856749e0a56aeaf97f8c03dfb70bd6534dcdfcd267fe4ad"],"state_sha256":"027ac1484cf9741d80490816ee7512cc16a5acd0ca5b20bd09f3453b31006ebf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rcBo7MD/Cy1/Ni0NrRP95Q1HGp0POGDzQtlhMtVI5yMJRiNI6104zwp2bqmuSobT6kDDfblNeCJExFESD8vNDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T05:16:01.721986Z","bundle_sha256":"3a2b8b3cddee546e8890d87eb1a538d2cd75ee668997175ea69f5cf6b25a4af8"}}