{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:JCPFX5EGGWNIK3KTQBPQMZGMQZ","short_pith_number":"pith:JCPFX5EG","canonical_record":{"source":{"id":"1502.00965","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-03T19:14:13Z","cross_cats_sorted":[],"title_canon_sha256":"8fba0e02444c924625f9035d021eb9aa9ee07464a5c3ca8ee70f48c6569d30be","abstract_canon_sha256":"a838b5dc37adc44f161e8b61d0b6d1f556cd198a40a061f2744c397f7294cee4"},"schema_version":"1.0"},"canonical_sha256":"489e5bf486359a856d53805f0664cc864b2d8fac3534a89dd4c062c65733c01c","source":{"kind":"arxiv","id":"1502.00965","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.00965","created_at":"2026-05-18T01:22:01Z"},{"alias_kind":"arxiv_version","alias_value":"1502.00965v5","created_at":"2026-05-18T01:22:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.00965","created_at":"2026-05-18T01:22:01Z"},{"alias_kind":"pith_short_12","alias_value":"JCPFX5EGGWNI","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JCPFX5EGGWNIK3KT","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JCPFX5EG","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:JCPFX5EGGWNIK3KTQBPQMZGMQZ","target":"record","payload":{"canonical_record":{"source":{"id":"1502.00965","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-03T19:14:13Z","cross_cats_sorted":[],"title_canon_sha256":"8fba0e02444c924625f9035d021eb9aa9ee07464a5c3ca8ee70f48c6569d30be","abstract_canon_sha256":"a838b5dc37adc44f161e8b61d0b6d1f556cd198a40a061f2744c397f7294cee4"},"schema_version":"1.0"},"canonical_sha256":"489e5bf486359a856d53805f0664cc864b2d8fac3534a89dd4c062c65733c01c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:01.842826Z","signature_b64":"sykL5Uk7J+xlllEr3HqY/bE+XP1P5YFqS+JSpxQ9KrT+ckfNalA+Whg/3vLf10OFgfp5SfRRMYUrrddj5BQ+BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"489e5bf486359a856d53805f0664cc864b2d8fac3534a89dd4c062c65733c01c","last_reissued_at":"2026-05-18T01:22:01.842309Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:01.842309Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.00965","source_version":5,"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-18T01:22:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k1G4NkO0uZ/4agCk+MaQGzUuQKKtaK1kt/mGrNHYhIuATmiHm0zcggZajtrQz0Ca+4QEDQvLTk1h0MGlXcNvBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:28:41.224497Z"},"content_sha256":"ca99c37bc33c93dce8bfeb36fb68e1e5b665ce3bc2ebbff46cbeefa8cef05ee7","schema_version":"1.0","event_id":"sha256:ca99c37bc33c93dce8bfeb36fb68e1e5b665ce3bc2ebbff46cbeefa8cef05ee7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:JCPFX5EGGWNIK3KTQBPQMZGMQZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hardness of Computing Clique Number and Chromatic Number For Cayley Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Brendan Rooney, Chris Godsil","submitted_at":"2015-02-03T19:14:13Z","abstract_excerpt":"Computing the clique number and chromatic number of a general graph are well-known NP-Hard problems. Codenotti et al. (Bruno Codenotti, Ivan Gerace, and Sebastiano Vigna. Hardness results and spectral techniques for combinatorial problems on circulant graphs. \\emph{Linear Algebra Appl.}, 285(1-3): 123--142, 1998) showed that computing clique number and chromatic number are still NP-Hard problems for the class of circulant graphs. We show that computing clique number is NP-Hard for the class of Cayley graphs for the groups $G^n$, where $G$ is any fixed finite group (e.g., cubelike graphs). We a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.00965","kind":"arxiv","version":5},"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-18T01:22:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BtVEjUej2SUTbuQmD5Z4Idu6oZw3xD20SOTjmJY4yPY5FE4ye9QkYYrWfdsVxYM8IrqPDBtXg4lq8Kc0MHH9DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:28:41.225194Z"},"content_sha256":"05cdffea58e78cb92d54554b42bb0543539e3ebe83c0fc13b904ad2d4c457671","schema_version":"1.0","event_id":"sha256:05cdffea58e78cb92d54554b42bb0543539e3ebe83c0fc13b904ad2d4c457671"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JCPFX5EGGWNIK3KTQBPQMZGMQZ/bundle.json","state_url":"https://pith.science/pith/JCPFX5EGGWNIK3KTQBPQMZGMQZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JCPFX5EGGWNIK3KTQBPQMZGMQZ/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-05-26T07:28:41Z","links":{"resolver":"https://pith.science/pith/JCPFX5EGGWNIK3KTQBPQMZGMQZ","bundle":"https://pith.science/pith/JCPFX5EGGWNIK3KTQBPQMZGMQZ/bundle.json","state":"https://pith.science/pith/JCPFX5EGGWNIK3KTQBPQMZGMQZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JCPFX5EGGWNIK3KTQBPQMZGMQZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:JCPFX5EGGWNIK3KTQBPQMZGMQZ","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":"a838b5dc37adc44f161e8b61d0b6d1f556cd198a40a061f2744c397f7294cee4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-03T19:14:13Z","title_canon_sha256":"8fba0e02444c924625f9035d021eb9aa9ee07464a5c3ca8ee70f48c6569d30be"},"schema_version":"1.0","source":{"id":"1502.00965","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.00965","created_at":"2026-05-18T01:22:01Z"},{"alias_kind":"arxiv_version","alias_value":"1502.00965v5","created_at":"2026-05-18T01:22:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.00965","created_at":"2026-05-18T01:22:01Z"},{"alias_kind":"pith_short_12","alias_value":"JCPFX5EGGWNI","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JCPFX5EGGWNIK3KT","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JCPFX5EG","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:05cdffea58e78cb92d54554b42bb0543539e3ebe83c0fc13b904ad2d4c457671","target":"graph","created_at":"2026-05-18T01:22:01Z","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":"Computing the clique number and chromatic number of a general graph are well-known NP-Hard problems. Codenotti et al. (Bruno Codenotti, Ivan Gerace, and Sebastiano Vigna. Hardness results and spectral techniques for combinatorial problems on circulant graphs. \\emph{Linear Algebra Appl.}, 285(1-3): 123--142, 1998) showed that computing clique number and chromatic number are still NP-Hard problems for the class of circulant graphs. We show that computing clique number is NP-Hard for the class of Cayley graphs for the groups $G^n$, where $G$ is any fixed finite group (e.g., cubelike graphs). We a","authors_text":"Brendan Rooney, Chris Godsil","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-03T19:14:13Z","title":"Hardness of Computing Clique Number and Chromatic Number For Cayley Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.00965","kind":"arxiv","version":5},"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:ca99c37bc33c93dce8bfeb36fb68e1e5b665ce3bc2ebbff46cbeefa8cef05ee7","target":"record","created_at":"2026-05-18T01:22:01Z","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":"a838b5dc37adc44f161e8b61d0b6d1f556cd198a40a061f2744c397f7294cee4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-03T19:14:13Z","title_canon_sha256":"8fba0e02444c924625f9035d021eb9aa9ee07464a5c3ca8ee70f48c6569d30be"},"schema_version":"1.0","source":{"id":"1502.00965","kind":"arxiv","version":5}},"canonical_sha256":"489e5bf486359a856d53805f0664cc864b2d8fac3534a89dd4c062c65733c01c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"489e5bf486359a856d53805f0664cc864b2d8fac3534a89dd4c062c65733c01c","first_computed_at":"2026-05-18T01:22:01.842309Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:22:01.842309Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sykL5Uk7J+xlllEr3HqY/bE+XP1P5YFqS+JSpxQ9KrT+ckfNalA+Whg/3vLf10OFgfp5SfRRMYUrrddj5BQ+BA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:22:01.842826Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.00965","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ca99c37bc33c93dce8bfeb36fb68e1e5b665ce3bc2ebbff46cbeefa8cef05ee7","sha256:05cdffea58e78cb92d54554b42bb0543539e3ebe83c0fc13b904ad2d4c457671"],"state_sha256":"02053de0501e0b7852ae14036c0a734098ded3119dbd96b2c52a27234de448e7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7oMgax6Z12j8L+kyHblPhArE+u1NI+3ps1Vm8AF02fKgvsKqSsV/rtGeO5AQj+fgc4qTsfRI2flMPzhyxIM3CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T07:28:41.228734Z","bundle_sha256":"2ab238f6a4bec41f13b4ac38ececd36e3a9c7bdea3a02b87590e6a8427149ea1"}}