{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:ET2OQ23FCWHIKOTZNYMXRSM2OR","short_pith_number":"pith:ET2OQ23F","canonical_record":{"source":{"id":"2506.07373","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2025-06-09T02:45:08Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"b1dfa64dd2c9b7dff329569c12102a882d8d42c51d76be3cdf0fb1fa636cb6e0","abstract_canon_sha256":"91285793693815f80ed4245475f2117ea24d137e26d800264c073a2d23a06905"},"schema_version":"1.0"},"canonical_sha256":"24f4e86b65158e853a796e1978c99a744d1681c7dd0c92bf5ab8fa63eca12f7b","source":{"kind":"arxiv","id":"2506.07373","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.07373","created_at":"2026-07-05T11:18:25Z"},{"alias_kind":"arxiv_version","alias_value":"2506.07373v1","created_at":"2026-07-05T11:18:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.07373","created_at":"2026-07-05T11:18:25Z"},{"alias_kind":"pith_short_12","alias_value":"ET2OQ23FCWHI","created_at":"2026-07-05T11:18:25Z"},{"alias_kind":"pith_short_16","alias_value":"ET2OQ23FCWHIKOTZ","created_at":"2026-07-05T11:18:25Z"},{"alias_kind":"pith_short_8","alias_value":"ET2OQ23F","created_at":"2026-07-05T11:18:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:ET2OQ23FCWHIKOTZNYMXRSM2OR","target":"record","payload":{"canonical_record":{"source":{"id":"2506.07373","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2025-06-09T02:45:08Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"b1dfa64dd2c9b7dff329569c12102a882d8d42c51d76be3cdf0fb1fa636cb6e0","abstract_canon_sha256":"91285793693815f80ed4245475f2117ea24d137e26d800264c073a2d23a06905"},"schema_version":"1.0"},"canonical_sha256":"24f4e86b65158e853a796e1978c99a744d1681c7dd0c92bf5ab8fa63eca12f7b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:18:25.999610Z","signature_b64":"BvCvUuhD0m2AuBGYenQGZPT47wr/ZZuwJtvkJH+TJHE0NVIDAA0YUjXqNOqAMUxo2bADy+C/JpGaMxjrpkODCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24f4e86b65158e853a796e1978c99a744d1681c7dd0c92bf5ab8fa63eca12f7b","last_reissued_at":"2026-07-05T11:18:25.999132Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:18:25.999132Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.07373","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-07-05T11:18:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yS41rvwwzeFmcDh+SUonOLZTcEhofWXNTu6Go2JmrxesVb65aRk8WjbpIVJ2kQi9rm/M+2h1+gRAwf6/WlNMAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T17:19:58.222473Z"},"content_sha256":"9db5517d296c439c8acdfa271a6b3f8f81e7f5335791af0737f00de95d84cc40","schema_version":"1.0","event_id":"sha256:9db5517d296c439c8acdfa271a6b3f8f81e7f5335791af0737f00de95d84cc40"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:ET2OQ23FCWHIKOTZNYMXRSM2OR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"HyColor: An Efficient Heuristic Algorithm for Graph Coloring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.DM","authors_text":"Chanjuan Liu, Enqiang Zhu, Haopeng Sun, Jin Xu, Witold Pedrycz, Yu Zhang, Ziqi Wei","submitted_at":"2025-06-09T02:45:08Z","abstract_excerpt":"The graph coloring problem (GCP) is a classic combinatorial optimization problem that aims to find the minimum number of colors assigned to vertices of a graph such that no two adjacent vertices receive the same color. GCP has been extensively studied by researchers from various fields, including mathematics, computer science, and biological science. Due to the NP-hard nature, many heuristic algorithms have been proposed to solve GCP. However, existing GCP algorithms focus on either small hard graphs or large-scale sparse graphs (with up to 10^7 vertices). This paper presents an efficient hybr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.07373","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.07373/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T11:18:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tz6O8V+e/3+/8YjKtzfUpYBQShFyUXPv50BvS955BFmIunqn1UiBxA/0ebGyYwlSBDxsfGnr6H+fIPTEfhsHDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T17:19:58.222968Z"},"content_sha256":"c324f62d759242b0a56d1b572b487afd353beac84838efbd69a92c29fca85567","schema_version":"1.0","event_id":"sha256:c324f62d759242b0a56d1b572b487afd353beac84838efbd69a92c29fca85567"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ET2OQ23FCWHIKOTZNYMXRSM2OR/bundle.json","state_url":"https://pith.science/pith/ET2OQ23FCWHIKOTZNYMXRSM2OR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ET2OQ23FCWHIKOTZNYMXRSM2OR/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-08-08T17:19:58Z","links":{"resolver":"https://pith.science/pith/ET2OQ23FCWHIKOTZNYMXRSM2OR","bundle":"https://pith.science/pith/ET2OQ23FCWHIKOTZNYMXRSM2OR/bundle.json","state":"https://pith.science/pith/ET2OQ23FCWHIKOTZNYMXRSM2OR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ET2OQ23FCWHIKOTZNYMXRSM2OR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:ET2OQ23FCWHIKOTZNYMXRSM2OR","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":"91285793693815f80ed4245475f2117ea24d137e26d800264c073a2d23a06905","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2025-06-09T02:45:08Z","title_canon_sha256":"b1dfa64dd2c9b7dff329569c12102a882d8d42c51d76be3cdf0fb1fa636cb6e0"},"schema_version":"1.0","source":{"id":"2506.07373","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.07373","created_at":"2026-07-05T11:18:25Z"},{"alias_kind":"arxiv_version","alias_value":"2506.07373v1","created_at":"2026-07-05T11:18:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.07373","created_at":"2026-07-05T11:18:25Z"},{"alias_kind":"pith_short_12","alias_value":"ET2OQ23FCWHI","created_at":"2026-07-05T11:18:25Z"},{"alias_kind":"pith_short_16","alias_value":"ET2OQ23FCWHIKOTZ","created_at":"2026-07-05T11:18:25Z"},{"alias_kind":"pith_short_8","alias_value":"ET2OQ23F","created_at":"2026-07-05T11:18:25Z"}],"graph_snapshots":[{"event_id":"sha256:c324f62d759242b0a56d1b572b487afd353beac84838efbd69a92c29fca85567","target":"graph","created_at":"2026-07-05T11:18:25Z","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/2506.07373/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The graph coloring problem (GCP) is a classic combinatorial optimization problem that aims to find the minimum number of colors assigned to vertices of a graph such that no two adjacent vertices receive the same color. GCP has been extensively studied by researchers from various fields, including mathematics, computer science, and biological science. Due to the NP-hard nature, many heuristic algorithms have been proposed to solve GCP. However, existing GCP algorithms focus on either small hard graphs or large-scale sparse graphs (with up to 10^7 vertices). This paper presents an efficient hybr","authors_text":"Chanjuan Liu, Enqiang Zhu, Haopeng Sun, Jin Xu, Witold Pedrycz, Yu Zhang, Ziqi Wei","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2025-06-09T02:45:08Z","title":"HyColor: An Efficient Heuristic Algorithm for Graph Coloring"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.07373","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:9db5517d296c439c8acdfa271a6b3f8f81e7f5335791af0737f00de95d84cc40","target":"record","created_at":"2026-07-05T11:18:25Z","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":"91285793693815f80ed4245475f2117ea24d137e26d800264c073a2d23a06905","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2025-06-09T02:45:08Z","title_canon_sha256":"b1dfa64dd2c9b7dff329569c12102a882d8d42c51d76be3cdf0fb1fa636cb6e0"},"schema_version":"1.0","source":{"id":"2506.07373","kind":"arxiv","version":1}},"canonical_sha256":"24f4e86b65158e853a796e1978c99a744d1681c7dd0c92bf5ab8fa63eca12f7b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"24f4e86b65158e853a796e1978c99a744d1681c7dd0c92bf5ab8fa63eca12f7b","first_computed_at":"2026-07-05T11:18:25.999132Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:18:25.999132Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BvCvUuhD0m2AuBGYenQGZPT47wr/ZZuwJtvkJH+TJHE0NVIDAA0YUjXqNOqAMUxo2bADy+C/JpGaMxjrpkODCg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:18:25.999610Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.07373","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9db5517d296c439c8acdfa271a6b3f8f81e7f5335791af0737f00de95d84cc40","sha256:c324f62d759242b0a56d1b572b487afd353beac84838efbd69a92c29fca85567"],"state_sha256":"cd27143ce9f179fb1d8c6f1e596906da63162eb31fb3b0d01c54e7f8fecbbe42"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sTaB97WvqHaVmWcVK6damrkqOFC9T7Kz8OEQzAzJnjpApOuTD91GKh1PnjwmrfAdoi2zcunLnKjUX6h5Vl4fAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T17:19:58.228421Z","bundle_sha256":"ba5883992e2df51d68a88820f9fc8d018545f5c06722f26439936ff6035f1dfa"}}