{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:R7SA3AUZMHZUEBMGWSVPGUSKBS","short_pith_number":"pith:R7SA3AUZ","canonical_record":{"source":{"id":"1503.06595","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-03-23T10:55:02Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"8f697df8127e434d28f1fc035f1f05f98b8d0f64a525aeb88a981994d57277e7","abstract_canon_sha256":"7ba081bb8e3b80a6e7ea3a9d751ca47249c92981f3c7c28d8b632a1fe7087e5b"},"schema_version":"1.0"},"canonical_sha256":"8fe40d829961f3420586b4aaf3524a0c83c408dfb3342a780c52d4c40d9f7184","source":{"kind":"arxiv","id":"1503.06595","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.06595","created_at":"2026-05-18T01:26:57Z"},{"alias_kind":"arxiv_version","alias_value":"1503.06595v2","created_at":"2026-05-18T01:26:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.06595","created_at":"2026-05-18T01:26:57Z"},{"alias_kind":"pith_short_12","alias_value":"R7SA3AUZMHZU","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"R7SA3AUZMHZUEBMG","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"R7SA3AUZ","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:R7SA3AUZMHZUEBMGWSVPGUSKBS","target":"record","payload":{"canonical_record":{"source":{"id":"1503.06595","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-03-23T10:55:02Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"8f697df8127e434d28f1fc035f1f05f98b8d0f64a525aeb88a981994d57277e7","abstract_canon_sha256":"7ba081bb8e3b80a6e7ea3a9d751ca47249c92981f3c7c28d8b632a1fe7087e5b"},"schema_version":"1.0"},"canonical_sha256":"8fe40d829961f3420586b4aaf3524a0c83c408dfb3342a780c52d4c40d9f7184","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:57.855842Z","signature_b64":"OCPb511weKBTCIG4JP9UWirKZyoCNzhNruV6EbQxKqhjC/rBKYV8ENJ53Lh5iAQsJoDFogLBmrN674Pc+/nZAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8fe40d829961f3420586b4aaf3524a0c83c408dfb3342a780c52d4c40d9f7184","last_reissued_at":"2026-05-18T01:26:57.855124Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:57.855124Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.06595","source_version":2,"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:26:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wYlq3RqQl4v32UWozgSLmrv6InMJQV4MC8ekUYKIuIPweqgnoRGApAeHHrZwCRXakue3/VmdAzx4m/G+/fELBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T08:52:18.554874Z"},"content_sha256":"8dd99a790f9ea0cb560a2067b74c36421af7af09597bac36bbf8a8b9dcc47cd4","schema_version":"1.0","event_id":"sha256:8dd99a790f9ea0cb560a2067b74c36421af7af09597bac36bbf8a8b9dcc47cd4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:R7SA3AUZMHZUEBMGWSVPGUSKBS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"New bounds for the max-$k$-cut and chromatic number of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.OC","authors_text":"Edwin R. van Dam, Renata Sotirov","submitted_at":"2015-03-23T10:55:02Z","abstract_excerpt":"We consider several semidefinite programming relaxations for the max-$k$-cut problem, with increasing complexity. The optimal solution of the weakest presented semidefinite programming relaxation has a closed form expression that includes the largest Laplacian eigenvalue of the graph under consideration. This is the first known eigenvalue bound for the max-$k$-cut when $k>2$ that is applicable to any graph. This bound is exploited to derive a new eigenvalue bound on the chromatic number of a graph. For regular graphs, the new bound on the chromatic number is the same as the well-known Hoffman "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.06595","kind":"arxiv","version":2},"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:26:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tcJXt4xmVysYTjY1vpk+Vgrvoq+OiTA8lX8IyAXSlkidNSk/C3yVfWU3OKNIdBu0wk881two0PElb70lto1zDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T08:52:18.555341Z"},"content_sha256":"185173cf0abe3428b8ed122dba2e0ba038069786d11bbf8f275ade8e0801ecd1","schema_version":"1.0","event_id":"sha256:185173cf0abe3428b8ed122dba2e0ba038069786d11bbf8f275ade8e0801ecd1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R7SA3AUZMHZUEBMGWSVPGUSKBS/bundle.json","state_url":"https://pith.science/pith/R7SA3AUZMHZUEBMGWSVPGUSKBS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R7SA3AUZMHZUEBMGWSVPGUSKBS/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-25T08:52:18Z","links":{"resolver":"https://pith.science/pith/R7SA3AUZMHZUEBMGWSVPGUSKBS","bundle":"https://pith.science/pith/R7SA3AUZMHZUEBMGWSVPGUSKBS/bundle.json","state":"https://pith.science/pith/R7SA3AUZMHZUEBMGWSVPGUSKBS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R7SA3AUZMHZUEBMGWSVPGUSKBS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:R7SA3AUZMHZUEBMGWSVPGUSKBS","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":"7ba081bb8e3b80a6e7ea3a9d751ca47249c92981f3c7c28d8b632a1fe7087e5b","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-03-23T10:55:02Z","title_canon_sha256":"8f697df8127e434d28f1fc035f1f05f98b8d0f64a525aeb88a981994d57277e7"},"schema_version":"1.0","source":{"id":"1503.06595","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.06595","created_at":"2026-05-18T01:26:57Z"},{"alias_kind":"arxiv_version","alias_value":"1503.06595v2","created_at":"2026-05-18T01:26:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.06595","created_at":"2026-05-18T01:26:57Z"},{"alias_kind":"pith_short_12","alias_value":"R7SA3AUZMHZU","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"R7SA3AUZMHZUEBMG","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"R7SA3AUZ","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:185173cf0abe3428b8ed122dba2e0ba038069786d11bbf8f275ade8e0801ecd1","target":"graph","created_at":"2026-05-18T01:26:57Z","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":"We consider several semidefinite programming relaxations for the max-$k$-cut problem, with increasing complexity. The optimal solution of the weakest presented semidefinite programming relaxation has a closed form expression that includes the largest Laplacian eigenvalue of the graph under consideration. This is the first known eigenvalue bound for the max-$k$-cut when $k>2$ that is applicable to any graph. This bound is exploited to derive a new eigenvalue bound on the chromatic number of a graph. For regular graphs, the new bound on the chromatic number is the same as the well-known Hoffman ","authors_text":"Edwin R. van Dam, Renata Sotirov","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-03-23T10:55:02Z","title":"New bounds for the max-$k$-cut and chromatic number of a graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.06595","kind":"arxiv","version":2},"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:8dd99a790f9ea0cb560a2067b74c36421af7af09597bac36bbf8a8b9dcc47cd4","target":"record","created_at":"2026-05-18T01:26:57Z","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":"7ba081bb8e3b80a6e7ea3a9d751ca47249c92981f3c7c28d8b632a1fe7087e5b","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-03-23T10:55:02Z","title_canon_sha256":"8f697df8127e434d28f1fc035f1f05f98b8d0f64a525aeb88a981994d57277e7"},"schema_version":"1.0","source":{"id":"1503.06595","kind":"arxiv","version":2}},"canonical_sha256":"8fe40d829961f3420586b4aaf3524a0c83c408dfb3342a780c52d4c40d9f7184","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8fe40d829961f3420586b4aaf3524a0c83c408dfb3342a780c52d4c40d9f7184","first_computed_at":"2026-05-18T01:26:57.855124Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:26:57.855124Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OCPb511weKBTCIG4JP9UWirKZyoCNzhNruV6EbQxKqhjC/rBKYV8ENJ53Lh5iAQsJoDFogLBmrN674Pc+/nZAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:26:57.855842Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.06595","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8dd99a790f9ea0cb560a2067b74c36421af7af09597bac36bbf8a8b9dcc47cd4","sha256:185173cf0abe3428b8ed122dba2e0ba038069786d11bbf8f275ade8e0801ecd1"],"state_sha256":"9329a18f20962e1f5c2136c40bfd1173c8902b5ab8a6a69c7b178dbad7064df0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hlw/Z4Ckg5q5H84u2S5cjqNg3BuZfRldig06rhzpybph3XSy9i9hOsAHGlj0ChcAtaZms/vSa3fNM2D9xncpAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T08:52:18.557714Z","bundle_sha256":"ab9a23bf094851f2c8d1af56a253d2c6527015424d4ec9aa51e5e0d228e627c1"}}