{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:F4TSTPIQCN7NNQ5GBQ72FFGQTF","short_pith_number":"pith:F4TSTPIQ","canonical_record":{"source":{"id":"1801.08243","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-24T23:39:35Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"36be09ac4e820c42ef681fc70bd0bda37608f1ef98408589d79ac8b7ac2b325c","abstract_canon_sha256":"22dfaff6df9f34b5f00fc688ce3242fa1c2a4833b63a099e854390a5d69892e2"},"schema_version":"1.0"},"canonical_sha256":"2f2729bd10137ed6c3a60c3fa294d0996dd3324737e02ff134a20d98a921feef","source":{"kind":"arxiv","id":"1801.08243","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.08243","created_at":"2026-05-18T00:25:06Z"},{"alias_kind":"arxiv_version","alias_value":"1801.08243v1","created_at":"2026-05-18T00:25:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.08243","created_at":"2026-05-18T00:25:06Z"},{"alias_kind":"pith_short_12","alias_value":"F4TSTPIQCN7N","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"F4TSTPIQCN7NNQ5G","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"F4TSTPIQ","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:F4TSTPIQCN7NNQ5GBQ72FFGQTF","target":"record","payload":{"canonical_record":{"source":{"id":"1801.08243","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-24T23:39:35Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"36be09ac4e820c42ef681fc70bd0bda37608f1ef98408589d79ac8b7ac2b325c","abstract_canon_sha256":"22dfaff6df9f34b5f00fc688ce3242fa1c2a4833b63a099e854390a5d69892e2"},"schema_version":"1.0"},"canonical_sha256":"2f2729bd10137ed6c3a60c3fa294d0996dd3324737e02ff134a20d98a921feef","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:06.759240Z","signature_b64":"fXX5Uur19lBQQjAyeTXJLzDav74OwAJL/okCEwHNU3R+s3tEd7OnrJJ5NEXyqLDyyvAp+Lyes4/z6OVLnw2AAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f2729bd10137ed6c3a60c3fa294d0996dd3324737e02ff134a20d98a921feef","last_reissued_at":"2026-05-18T00:25:06.758740Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:06.758740Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.08243","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-18T00:25:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rfNUOFbvMw49AfvKqhR7ffnEuPq62GE+lCb7ysma8pLn0Di/7w0MLns4vrjPv3LDvhbxFLAYKfJ4zVovovXhCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:03:56.755807Z"},"content_sha256":"a7d788b47dc2d316ec3f77efe7d15de63b5c453c9c7cb322b5319920bfee91c9","schema_version":"1.0","event_id":"sha256:a7d788b47dc2d316ec3f77efe7d15de63b5c453c9c7cb322b5319920bfee91c9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:F4TSTPIQCN7NNQ5GBQ72FFGQTF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Vector Coloring the Categorical Product of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.CO","authors_text":"Antonios Varvitsiotis, Brendan Rooney, Chris Godsil, David E. Roberson, Robert \\v{S}\\'amal","submitted_at":"2018-01-24T23:39:35Z","abstract_excerpt":"A vector $t$-coloring of a graph is an assignment of real vectors $p_1, \\ldots, p_n$ to its vertices such that $p_i^Tp_i = t-1$ for all $i=1, \\ldots, n$ and $p_i^Tp_j \\le -1$ whenever $i$ and $j$ are adjacent. The vector chromatic number of $G$ is the smallest real number $t \\ge 1$ for which a vector $t$-coloring of $G$ exists. For a graph $H$ and a vector $t$-coloring $p_1,\\ldots,p_n$ of a graph $G$, the assignment $(i,\\ell) \\mapsto p_i$ is a vector $t$-coloring of the categorical product $G \\times H$. It follows that the vector chromatic number of $G \\times H$ is at most the minimum of the v"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.08243","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-18T00:25:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Lm4+bsfuXI1vRT/Uq2XVkguixNNgOuNj2p23Pc/KYsHMUoHvokLOhqLuxEr8yxJa/74EPjkdRsEgGCXyAqsAAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:03:56.756146Z"},"content_sha256":"f2f0aa6287bf65314fdbfdf12b0e1c8c2a113a5791306f3ff2d92ee6252d1ca1","schema_version":"1.0","event_id":"sha256:f2f0aa6287bf65314fdbfdf12b0e1c8c2a113a5791306f3ff2d92ee6252d1ca1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F4TSTPIQCN7NNQ5GBQ72FFGQTF/bundle.json","state_url":"https://pith.science/pith/F4TSTPIQCN7NNQ5GBQ72FFGQTF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F4TSTPIQCN7NNQ5GBQ72FFGQTF/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-01T10:03:56Z","links":{"resolver":"https://pith.science/pith/F4TSTPIQCN7NNQ5GBQ72FFGQTF","bundle":"https://pith.science/pith/F4TSTPIQCN7NNQ5GBQ72FFGQTF/bundle.json","state":"https://pith.science/pith/F4TSTPIQCN7NNQ5GBQ72FFGQTF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F4TSTPIQCN7NNQ5GBQ72FFGQTF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:F4TSTPIQCN7NNQ5GBQ72FFGQTF","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":"22dfaff6df9f34b5f00fc688ce3242fa1c2a4833b63a099e854390a5d69892e2","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-24T23:39:35Z","title_canon_sha256":"36be09ac4e820c42ef681fc70bd0bda37608f1ef98408589d79ac8b7ac2b325c"},"schema_version":"1.0","source":{"id":"1801.08243","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.08243","created_at":"2026-05-18T00:25:06Z"},{"alias_kind":"arxiv_version","alias_value":"1801.08243v1","created_at":"2026-05-18T00:25:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.08243","created_at":"2026-05-18T00:25:06Z"},{"alias_kind":"pith_short_12","alias_value":"F4TSTPIQCN7N","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"F4TSTPIQCN7NNQ5G","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"F4TSTPIQ","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:f2f0aa6287bf65314fdbfdf12b0e1c8c2a113a5791306f3ff2d92ee6252d1ca1","target":"graph","created_at":"2026-05-18T00:25:06Z","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":"A vector $t$-coloring of a graph is an assignment of real vectors $p_1, \\ldots, p_n$ to its vertices such that $p_i^Tp_i = t-1$ for all $i=1, \\ldots, n$ and $p_i^Tp_j \\le -1$ whenever $i$ and $j$ are adjacent. The vector chromatic number of $G$ is the smallest real number $t \\ge 1$ for which a vector $t$-coloring of $G$ exists. For a graph $H$ and a vector $t$-coloring $p_1,\\ldots,p_n$ of a graph $G$, the assignment $(i,\\ell) \\mapsto p_i$ is a vector $t$-coloring of the categorical product $G \\times H$. It follows that the vector chromatic number of $G \\times H$ is at most the minimum of the v","authors_text":"Antonios Varvitsiotis, Brendan Rooney, Chris Godsil, David E. Roberson, Robert \\v{S}\\'amal","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-24T23:39:35Z","title":"Vector Coloring the Categorical Product of Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.08243","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:a7d788b47dc2d316ec3f77efe7d15de63b5c453c9c7cb322b5319920bfee91c9","target":"record","created_at":"2026-05-18T00:25:06Z","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":"22dfaff6df9f34b5f00fc688ce3242fa1c2a4833b63a099e854390a5d69892e2","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-24T23:39:35Z","title_canon_sha256":"36be09ac4e820c42ef681fc70bd0bda37608f1ef98408589d79ac8b7ac2b325c"},"schema_version":"1.0","source":{"id":"1801.08243","kind":"arxiv","version":1}},"canonical_sha256":"2f2729bd10137ed6c3a60c3fa294d0996dd3324737e02ff134a20d98a921feef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2f2729bd10137ed6c3a60c3fa294d0996dd3324737e02ff134a20d98a921feef","first_computed_at":"2026-05-18T00:25:06.758740Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:06.758740Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fXX5Uur19lBQQjAyeTXJLzDav74OwAJL/okCEwHNU3R+s3tEd7OnrJJ5NEXyqLDyyvAp+Lyes4/z6OVLnw2AAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:06.759240Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.08243","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a7d788b47dc2d316ec3f77efe7d15de63b5c453c9c7cb322b5319920bfee91c9","sha256:f2f0aa6287bf65314fdbfdf12b0e1c8c2a113a5791306f3ff2d92ee6252d1ca1"],"state_sha256":"d6f352cb7916027ae1c2865f24f1b7c547bb1fb4792ee8e8f1c036d770d1eb33"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oPAOh2WnurJ5A4yrIIEQgAafgxmX191/89rdSL3dE8yW8xKL9yn9g2Hs1cDyc2RSgaGrPIwpSiPq86vCFrxICA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T10:03:56.758272Z","bundle_sha256":"4a59c86d5d79b641dfeb0cd980d5d663e901c6c8e31f9d101626c7f94c804780"}}