{"as_of":"2026-08-08T02:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8241a23090aa4939b1782920932563955a5bf9034e10abf18291722a34a65324","coverage":[{"denominator":69,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":69,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T05:43:14.696244Z","state":"measured"},{"denominator":69,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":69,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2506.07373/citation-record","integrity":"/paper/2506.07373/integrity","json":"/paper/2506.07373/citation-record.json","paper":"/paper/2506.07373"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:43:16.074579Z","title":"Optimization of smart sensor for balance between code bug ratio and energy consumption,","venue":null,"work_id":"4c75189e-d9a8-4a9a-aa96-94db14c01fdf","year":2023},"citing_paper":{"arxiv_id":"2506.07373","last_updated":"2025-06-09T02:45:08Z","snapshot_observed_at":"2026-08-07T05:33:10.324588Z","submitted_at":"2025-06-09T02:45:08Z","title":"HyColor: An Efficient Heuristic Algorithm for Graph Coloring","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T05:43:14.383165Z"},"links":{"citing_paper":"/paper/2506.07373"},"observation_digest":"sha256:bc5205a0aa4af43e3a257d3bed615c6be2548cc89b79c3cdbc48e44a2e64b869","observation_id":"3fccdd1b-3401-4259-b469-5708d33630c2","resolution":{"observed_at":"2026-08-07T05:43:16.079545Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:43:16.058887Z","title":"Local model- based pareto front estimation for multiobjective optimization,","venue":null,"work_id":"9468b1dd-ae17-4c17-83cb-c981921991a0","year":2023},"citing_paper":{"arxiv_id":"2506.07373","last_updated":"2025-06-09T02:45:08Z","snapshot_observed_at":"2026-08-07T05:33:10.324588Z","submitted_at":"2025-06-09T02:45:08Z","title":"HyColor: An Efficient Heuristic Algorithm for Graph Coloring","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T05:43:14.388842Z"},"links":{"citing_paper":"/paper/2506.07373"},"observation_digest":"sha256:bc665839b920553913cebd0394f21796ed3c3f089ea0a981a6a2d7f04beb7e2a","observation_id":"49be5511-b808-4de9-bfe3-6eab5d90b18a","resolution":{"observed_at":"2026-08-07T05:43:16.064127Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:43:14.393726Z","title":"Matrix representation and behavioral analysis in a graph model for conflict resolution with incomplete fuzzy preferences,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.07373","last_updated":"2025-06-09T02:45:08Z","snapshot_observed_at":"2026-08-07T05:33:10.324588Z","submitted_at":"2025-06-09T02:45:08Z","title":"HyColor: An Efficient Heuristic Algorithm for Graph Coloring","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T05:43:14.393726Z"},"links":{"citing_paper":"/paper/2506.07373"},"observation_digest":"sha256:0e1e36abb0bc892c58eedc774103d5d42984acca96624e18f7b59a54263b3e42","observation_id":"1b521d96-180e-4f1e-aabf-d8839b17f012","resolution":{"observed_at":"2026-08-07T05:43:14.393726Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:43:16.042163Z","title":"New methods to color the vertices of a graph. communica- tion,","venue":null,"work_id":"d8dc478d-e6dc-46b8-93cd-53b67bb07f60","year":1979},"citing_paper":{"arxiv_id":"2506.07373","last_updated":"2025-06-09T02:45:08Z","snapshot_observed_at":"2026-08-07T05:33:10.324588Z","submitted_at":"2025-06-09T02:45:08Z","title":"HyColor: An Efficient Heuristic Algorithm for Graph Coloring","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T05:43:14.398766Z"},"links":{"citing_paper":"/paper/2506.07373"},"observation_digest":"sha256:a2af7b28179a43511714ae573f4b86de7e76e6bdfc575066ed54dfaa29d171b6","observation_id":"ef273542-3459-4ae4-8b05-e0fc5800630a","resolution":{"observed_at":"2026-08-07T05:43:16.048010Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:43:16.026441Z","title":"Ore, The Four-color problem","venue":null,"work_id":"e088addc-14f8-4f1d-bdb4-1eca919e7358","year":1969},"citing_paper":{"arxiv_id":"2506.07373","last_updated":"2025-06-09T02:45:08Z","snapshot_observed_at":"2026-08-07T05:33:10.324588Z","submitted_at":"2025-06-09T02:45:08Z","title":"HyColor: An Efficient Heuristic Algorithm for Graph Coloring","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T05:43:14.403548Z"},"links":{"citing_paper":"/paper/2506.07373"},"observation_digest":"sha256:39770973344ce24487191b7d377814a9f6c2aac176a04b5f1498c186180f5a1c","observation_id":"4e379da3-fca3-45ff-b742-50e6bf771c13","resolution":{"observed_at":"2026-08-07T05:43:16.031208Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:43:16.009615Z","title":"Haj ´os’ graph-coloring conjecture: variations and counterexam- ples,","venue":null,"work_id":"c6e8ee8c-3b96-4f02-84bc-6e2a1f44bdbf","year":1979},"citing_paper":{"arxiv_id":"2506.07373","last_updated":"2025-06-09T02:45:08Z","snapshot_observed_at":"2026-08-07T05:33:10.324588Z","submitted_at":"2025-06-09T02:45:08Z","title":"HyColor: An Efficient Heuristic Algorithm for Graph Coloring","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T05:43:14.408107Z"},"links":{"citing_paper":"/paper/2506.07373"},"observation_digest":"sha256:84aa17141dc3c62b43b2210ded93f1701d0785ff87a822e55758c927bab0d6cc","observation_id":"b942f749-22e3-4fdd-b1da-51f247d520b8","resolution":{"observed_at":"2026-08-07T05:43:16.014692Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:43:15.990664Z","title":"A new short proof of kneser’s conjecture,","venue":null,"work_id":"1d56e41e-c4fc-4cb3-a37b-a1d9397305f1","year":2002},"citing_paper":{"arxiv_id":"2506.07373","last_updated":"2025-06-09T02:45:08Z","snapshot_observed_at":"2026-08-07T05:33:10.324588Z","submitted_at":"2025-06-09T02:45:08Z","title":"HyColor: An Efficient Heuristic Algorithm for Graph Coloring","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T05:43:14.412991Z"},"links":{"citing_paper":"/paper/2506.07373"},"observation_digest":"sha256:0283fcb20a6eb322cbe51c03aad5f3129a6b490761766d3fa16633f3e4e9b05c","observation_id":"ac8cf138-5b34-4303-851b-b9373192ba7c","resolution":{"observed_at":"2026-08-07T05:43:15.995565Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:43:15.975166Z","title":"Optimality clue for graph coloring prob- lem,","venue":null,"work_id":"6037518f-0842-4234-8d48-6e2faa4478ec","year":2019},"citing_paper":{"arxiv_id":"2506.07373","last_updated":"2025-06-09T02:45:08Z","snapshot_observed_at":"2026-08-07T05:33:10.324588Z","submitted_at":"2025-06-09T02:45:08Z","title":"HyColor: An Efficient Heuristic Algorithm for Graph Coloring","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T05:43:14.418066Z"},"links":{"citing_paper":"/paper/2506.07373"},"observation_digest":"sha256:64213a35c81c6a3f27cfe450ee3443ab0420a234f03c42bdb7235cd6743a66cd","observation_id":"22abeba1-cd74-4f52-94f7-405dee86a8a9","resolution":{"observed_at":"2026-08-07T05:43:15.979567Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:43:15.960619Z","title":"Graph coloring via neural networks for haplotype assembly and viral quasispecies reconstruction,","venue":null,"work_id":"6ff1c916-42dd-42eb-919f-681d059e1a00","year":2022},"citing_paper":{"arxiv_id":"2506.07373","last_updated":"2025-06-09T02:45:08Z","snapshot_observed_at":"2026-08-07T05:33:10.324588Z","submitted_at":"2025-06-09T02:45:08Z","title":"HyColor: An Efficient Heuristic Algorithm for Graph Coloring","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T05:43:14.422634Z"},"links":{"citing_paper":"/paper/2506.07373"},"observation_digest":"sha256:f864693ce1a13a19c09dcfce1d87676b3bc526903147d9ae49d4551ca5a5b64e","observation_id":"a6dd1d7a-8885-43ff-a8ad-1bd5146d1aa7","resolution":{"observed_at":"2026-08-07T05:43:15.965072Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:43:15.945438Z","title":"A hierarchical event de- tection method based on spectral theory of multidimensional matrix for power system,","venue":null,"work_id":"ed20efe2-6760-4bd7-b029-7ed647d5a373","year":2021},"citing_paper":{"arxiv_id":"2506.07373","last_updated":"2025-06-09T02:45:08Z","snapshot_observed_at":"2026-08-07T05:33:10.324588Z","submitted_at":"2025-06-09T02:45:08Z","title":"HyColor: An Efficient Heuristic Algorithm for Graph Coloring","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T05:43:14.427063Z"},"links":{"citing_paper":"/paper/2506.07373"},"observation_digest":"sha256:5bd23b0e934fc8f1ab3e895d162f7856858dd6b381bf329ded5ae84a817da267","observation_id":"ff7a9229-3077-4967-9bfb-13636c6bf477","resolution":{"observed_at":"2026-08-07T05:43:15.950859Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:43:15.930105Z","title":"A review of application of graph theory for network,","venue":null,"work_id":"1b8afe77-5fcf-4e60-8e9f-8e7c066ba748","year":2012},"citing_paper":{"arxiv_id":"2506.07373","last_updated":"2025-06-09T02:45:08Z","snapshot_observed_at":"2026-08-07T05:33:10.324588Z","submitted_at":"2025-06-09T02:45:08Z","title":"HyColor: An Efficient Heuristic Algorithm for Graph Coloring","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T05:43:14.431789Z"},"links":{"citing_paper":"/paper/2506.07373"},"observation_digest":"sha256:44bbcca91d931eea4da6924778a9e7c27d2fd08b9f8fe7ce8db11bd17eff5618","observation_id":"9d0d8df4-4f52-4e00-8b8d-abc5b9ea9dc0","resolution":{"observed_at":"2026-08-07T05:43:15.934746Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:43:15.912963Z","title":"Scalable design of error-correcting output codes using discrete optimization with graph coloring,","venue":null,"work_id":"d7ad7105-d1d5-4717-9de3-256eda24812d","year":2022},"citing_paper":{"arxiv_id":"2506.07373","last_updated":"2025-06-09T02:45:08Z","snapshot_observed_at":"2026-08-07T05:33:10.324588Z","submitted_at":"2025-06-09T02:45:08Z","title":"HyColor: An Efficient Heuristic Algorithm for Graph Coloring","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T05:43:14.436596Z"},"links":{"citing_paper":"/paper/2506.07373"},"observation_digest":"sha256:283489db6f3f374e3fbdf89a81449f1d1d318b858af1009f1192f481c02f2dd5","observation_id":"7011c040-b2a2-486d-b108-191b88ec518e","resolution":{"observed_at":"2026-08-07T05:43:15.918332Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:43:15.894908Z","title":"An effective solution space clipping-based algorithm for large-scale permutation flow shop scheduling problem,","venue":null,"work_id":"5d1fff5d-7c1c-48f9-b493-c169efc96aa0","year":2023},"citing_paper":{"arxiv_id":"2506.07373","last_updated":"2025-06-09T02:45:08Z","snapshot_observed_at":"2026-08-07T05:33:10.324588Z","submitted_at":"2025-06-09T02:45:08Z","title":"HyColor: An Efficient Heuristic Algorithm for Graph Coloring","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T05:43:14.441287Z"},"links":{"citing_paper":"/paper/2506.07373"},"observation_digest":"sha256:320beb2a6c13625942d6f74635048cff614bd3195bfdad4f27ce7c54ad345de1","observation_id":"a58863d3-06c4-4636-8c6d-91d125357a9c","resolution":{"observed_at":"2026-08-07T05:43:15.899823Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:43:15.878706Z","title":"Partition independent set and reduction-based approach for partition coloring problem,","venue":null,"work_id":"cfb03363-ae33-4487-b979-072b4ee7cd65","year":2022},"citing_paper":{"arxiv_id":"2506.07373","last_updated":"2025-06-09T02:45:08Z","snapshot_observed_at":"2026-08-07T05:33:10.324588Z","submitted_at":"2025-06-09T02:45:08Z","title":"HyColor: An Efficient Heuristic Algorithm for Graph Coloring","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T05:43:14.445599Z"},"links":{"citing_paper":"/paper/2506.07373"},"observation_digest":"sha256:317765ee2ddf2eec6b7230951072d78b9f22f7c5976103dd8207295975be075c","observation_id":"fffb7125-4061-4be1-98ff-df231455529a","resolution":{"observed_at":"2026-08-07T05:43:15.883377Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:43:15.862381Z","title":null,"venue":null,"work_id":"913a9954-db5b-4775-863f-1eae95c03f25","year":1979},"citing_paper":{"arxiv_id":"2506.07373","last_updated":"2025-06-09T02:45:08Z","snapshot_observed_at":"2026-08-07T05:33:10.324588Z","submitted_at":"2025-06-09T02:45:08Z","title":"HyColor: An Efficient Heuristic Algorithm for Graph Coloring","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T05:43:14.449816Z"},"links":{"citing_paper":"/paper/2506.07373"},"observation_digest":"sha256:3f3ae8146b0a88d1d91798cdf5cef9d0420623d5217d13f7a08634d588ef991f","observation_id":"76bbb592-8f9c-4c0c-886d-3bd86e99c6f5","resolution":{"observed_at":"2026-08-07T05:43:15.867693Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:43:15.845657Z","title":"Priority-based heuristics for the multi-skill resource constrained project scheduling problem,","venue":null,"work_id":"9b976fee-ea1c-48c8-a677-fb3eec4fa909","year":2016},"citing_paper":{"arxiv_id":"2506.07373","last_updated":"2025-06-09T02:45:08Z","snapshot_observed_at":"2026-08-07T05:33:10.324588Z","submitted_at":"2025-06-09T02:45:08Z","title":"HyColor: An Efficient Heuristic Algorithm for Graph Coloring","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T05:43:14.454258Z"},"links":{"citing_paper":"/paper/2506.07373"},"observation_digest":"sha256:bd5a78c0ca51b85d200156201d40831524882fb17ecc340e6d029d9c930e31d5","observation_id":"867f9acc-60a6-477c-8713-f851651561b0","resolution":{"observed_at":"2026-08-07T05:43:15.850474Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:43:15.829893Z","title":"Linear degree extractors and the inapproximability of max clique and chromatic number,","venue":null,"work_id":"cb4daf47-98e3-4e78-be73-c26fc5a31698","year":2007},"citing_paper":{"arxiv_id":"2506.07373","last_updated":"2025-06-09T02:45:08Z","snapshot_observed_at":"2026-08-07T05:33:10.324588Z","submitted_at":"2025-06-09T02:45:08Z","title":"HyColor: An Efficient Heuristic Algorithm for Graph Coloring","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T05:43:14.458714Z"},"links":{"citing_paper":"/paper/2506.07373"},"observation_digest":"sha256:d39f2952c435a186caee294e95ee997c50576b13ac0540e98d85f12be6fc595c","observation_id":"d3b2cdd7-ced1-43fd-aeb0-9f395dbacac1","resolution":{"observed_at":"2026-08-07T05:43:15.834624Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:43:15.814207Z","title":"3-coloring in time o(1.3289n),","venue":null,"work_id":"a0149064-f907-47c7-858f-81aebef59be6","year":2005},"citing_paper":{"arxiv_id":"2506.07373","last_updated":"2025-06-09T02:45:08Z","snapshot_observed_at":"2026-08-07T05:33:10.324588Z","submitted_at":"2025-06-09T02:45:08Z","title":"HyColor: An Efficient Heuristic Algorithm for Graph Coloring","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T05:43:14.462903Z"},"links":{"citing_paper":"/paper/2506.07373"},"observation_digest":"sha256:23b814dd908f0d3bf7b59e6022e301444bb5fc737850684804553849d312ba21","observation_id":"c6d216e1-af1f-4d0f-aa98-44300238018f","resolution":{"observed_at":"2026-08-07T05:43:15.819076Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:43:15.797777Z","title":"Improved exact algorithms for counting 3-and 4-colorings,","venue":null,"work_id":"88bd66c0-c3cd-4ed6-8eec-03cc2ddd4873","year":2007},"citing_paper":{"arxiv_id":"2506.07373","last_updated":"2025-06-09T02:45:08Z","snapshot_observed_at":"2026-08-07T05:33:10.324588Z","submitted_at":"2025-06-09T02:45:08Z","title":"HyColor: An Efficient Heuristic Algorithm for Graph Coloring","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T05:43:14.466996Z"},"links":{"citing_paper":"/paper/2506.07373"},"observation_digest":"sha256:7e9b566ecc449f94621399ae1a5b0a12530c9c577f71c42f867b1c3c307290a5","observation_id":"d8ba10e9-5e13-47b4-b6e5-807355d0cb6c","resolution":{"observed_at":"2026-08-07T05:43:15.802678Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:43:15.780472Z","title":"Exact algorithms for counting 3-colorings of graphs,","venue":null,"work_id":"0fe71881-c97f-4640-b160-b17990d4f305","year":2022},"citing_paper":{"arxiv_id":"2506.07373","last_updated":"2025-06-09T02:45:08Z","snapshot_observed_at":"2026-08-07T05:33:10.324588Z","submitted_at":"2025-06-09T02:45:08Z","title":"HyColor: An Efficient Heuristic Algorithm for Graph Coloring","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T05:43:14.471494Z"},"links":{"citing_paper":"/paper/2506.07373"},"observation_digest":"sha256:db68a10545b8d258b64e60c94e47835074c366e54801e404d965364e5edf07e6","observation_id":"c496b207-9c90-42fb-b80d-634e15b5bfdf","resolution":{"observed_at":"2026-08-07T05:43:15.785529Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:43:14.476007Z","title":"The structure and function of complex networks,","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2506.07373","last_updated":"2025-06-09T02:45:08Z","snapshot_observed_at":"2026-08-07T05:33:10.324588Z","submitted_at":"2025-06-09T02:45:08Z","title":"HyColor: An Efficient Heuristic Algorithm for Graph Coloring","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T05:43:14.476007Z"},"links":{"citing_paper":"/paper/2506.07373"},"observation_digest":"sha256:c5272cd204cc0549593cdc04add6ad1e07e9caa79a1d8de388b4b8f9e3166f2a","observation_id":"c42ad7bb-985e-4a83-b59d-18187fed3d18","resolution":{"observed_at":"2026-08-07T05:43:14.476007Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:43:15.751481Z","title":"New techniques for approximating optimal substructure problems in power-law graphs,","venue":null,"work_id":"cc31753a-41ba-457f-a83c-a95ad6c9310c","year":2012},"citing_paper":{"arxiv_id":"2506.07373","last_updated":"2025-06-09T02:45:08Z","snapshot_observed_at":"2026-08-07T05:33:10.324588Z","submitted_at":"2025-06-09T02:45:08Z","title":"HyColor: An Efficient Heuristic Algorithm for Graph Coloring","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T05:43:14.480304Z"},"links":{"citing_paper":"/paper/2506.07373"},"observation_digest":"sha256:d416a08dfcb8c219389fdc2d7cf30073927a1b1e808970257b903fafa8e504e4","observation_id":"c1cc8246-87ec-4253-b200-bb6717f588d9","resolution":{"observed_at":"2026-08-07T05:43:15.756505Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:43:15.735916Z","title":"Informed reactive tabu search for graph coloring,","venue":null,"work_id":"c9a54811-a050-4f2d-aa09-ee4f44931a06","year":2013},"citing_paper":{"arxiv_id":"2506.07373","last_updated":"2025-06-09T02:45:08Z","snapshot_observed_at":"2026-08-07T05:33:10.324588Z","submitted_at":"2025-06-09T02:45:08Z","title":"HyColor: An Efficient Heuristic Algorithm for Graph Coloring","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T05:43:14.484960Z"},"links":{"citing_paper":"/paper/2506.07373"},"observation_digest":"sha256:57ab19a6cc23851ed76b12ceaebfcf340bce2e7fb89b7e648d9e310b9cd98af7","observation_id":"4dc785bc-4572-4e2d-b983-2059cb8bde4e","resolution":{"observed_at":"2026-08-07T05:43:15.740672Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:43:15.720259Z","title":"An improved dsatur-based branch-and-bound algorithm for the vertex coloring problem,","venue":null,"work_id":"2fa81a15-2709-4827-a9c7-00f97697eb82","year":2017},"citing_paper":{"arxiv_id":"2506.07373","last_updated":"2025-06-09T02:45:08Z","snapshot_observed_at":"2026-08-07T05:33:10.324588Z","submitted_at":"2025-06-09T02:45:08Z","title":"HyColor: An Efficient Heuristic Algorithm for Graph Coloring","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T05:43:14.489263Z"},"links":{"citing_paper":"/paper/2506.07373"},"observation_digest":"sha256:cc0a0f719c43a8e1a2964c24814c535ac6a7102eafcacfa67251925e793ffe83","observation_id":"5d1bad29-8534-48b4-a537-063289f76170","resolution":{"observed_at":"2026-08-07T05:43:15.725048Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:43:15.704540Z","title":"An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs,","venue":null,"work_id":"998844a9-185d-4b97-a350-fa47d9134212","year":2021},"citing_paper":{"arxiv_id":"2506.07373","last_updated":"2025-06-09T02:45:08Z","snapshot_observed_at":"2026-08-07T05:33:10.324588Z","submitted_at":"2025-06-09T02:45:08Z","title":"HyColor: An Efficient Heuristic Algorithm for Graph Coloring","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T05:43:14.493843Z"},"links":{"citing_paper":"/paper/2506.07373"},"observation_digest":"sha256:e756b4bb8c570e15bc3cd87075cc855d07228d80706da820f1c82d523cbfeb19","observation_id":"4d6590a6-1b28-4a49-9c2e-5d007d3fdb46","resolution":{"observed_at":"2026-08-07T05:43:15.709561Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:43:15.688720Z","title":"A cuckoo quantum evolutionary algorithm for the graph coloring problem,","venue":null,"work_id":"93d51184-ce1c-4730-b6b2-48fd9d235d74","year":2021},"citing_paper":{"arxiv_id":"2506.07373","last_updated":"2025-06-09T02:45:08Z","snapshot_observed_at":"2026-08-07T05:33:10.324588Z","submitted_at":"2025-06-09T02:45:08Z","title":"HyColor: An Efficient Heuristic Algorithm for Graph Coloring","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T05:43:14.498155Z"},"links":{"citing_paper":"/paper/2506.07373"},"observation_digest":"sha256:d4bdc48b24239862d2776e718cc765d3708ae5bf79e350e682b44a4ad156fea2","observation_id":"ca53e61c-0304-4c7e-b351-a4a039a79cc0","resolution":{"observed_at":"2026-08-07T05:43:15.693929Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:43:15.672541Z","title":"New evolutionary operators in coloring dimacs challenge benchmark graphs,","venue":null,"work_id":"fdb60db6-6375-4d3b-b818-fc250a2fc97b","year":2022},"citing_paper":{"arxiv_id":"2506.07373","last_updated":"2025-06-09T02:45:08Z","snapshot_observed_at":"2026-08-07T05:33:10.324588Z","submitted_at":"2025-06-09T02:45:08Z","title":"HyColor: An Efficient Heuristic Algorithm for Graph Coloring","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T05:43:14.502661Z"},"links":{"citing_paper":"/paper/2506.07373"},"observation_digest":"sha256:d9aee942cdde5b95784e1ed0fec8429f00c3420a7b0547306d03d460ac9fa33e","observation_id":"68d46240-d57a-41ca-8aae-47e79824c263","resolution":{"observed_at":"2026-08-07T05:43:15.677764Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:43:15.656356Z","title":"Memetic teaching–learning-based opti- mization algorithms for large graph coloring problems,","venue":null,"work_id":"6d6da3d0-0fb9-494b-88a2-8df335637578","year":2021},"citing_paper":{"arxiv_id":"2506.07373","last_updated":"2025-06-09T02:45:08Z","snapshot_observed_at":"2026-08-07T05:33:10.324588Z","submitted_at":"2025-06-09T02:45:08Z","title":"HyColor: An Efficient Heuristic Algorithm for Graph Coloring","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T05:43:14.506907Z"},"links":{"citing_paper":"/paper/2506.07373"},"observation_digest":"sha256:fc2b5ff2c097d64c4e1a73a3185cdd5cb752d69dacd426ea106f692912b2920c","observation_id":"dc9dc2da-45b6-4032-887a-6a75f6fa2bfa","resolution":{"observed_at":"2026-08-07T05:43:15.661558Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:43:15.639614Z","title":"Sat-boosted tabu search for coloring massive graphs,","venue":null,"work_id":"86819db6-2197-4410-9830-502cd7f1eb36","year":2023},"citing_paper":{"arxiv_id":"2506.07373","last_updated":"2025-06-09T02:45:08Z","snapshot_observed_at":"2026-08-07T05:33:10.324588Z","submitted_at":"2025-06-09T02:45:08Z","title":"HyColor: An Efficient Heuristic Algorithm for Graph Coloring","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T05:43:14.511575Z"},"links":{"citing_paper":"/paper/2506.07373"},"observation_digest":"sha256:60e48f9a96a9b6843b7547d0feae4992062fc5558a93291efbac77c512211ada","observation_id":"0a8a427f-991e-41e9-8b1b-efff3abba805","resolution":{"observed_at":"2026-08-07T05:43:15.645088Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:43:15.621889Z","title":"A hybrid approach for exact coloring of massive graphs,","venue":null,"work_id":"f57be9b5-af8f-476a-aa51-8070dd291b45","year":2019},"citing_paper":{"arxiv_id":"2506.07373","last_updated":"2025-06-09T02:45:08Z","snapshot_observed_at":"2026-08-07T05:33:10.324588Z","submitted_at":"2025-06-09T02:45:08Z","title":"HyColor: An Efficient Heuristic Algorithm for Graph Coloring","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T05:43:14.516055Z"},"links":{"citing_paper":"/paper/2506.07373"},"observation_digest":"sha256:4a7d4bcdfb924126da9d2aad778a4abaa56cee0af0635894838a9206b3ed188b","observation_id":"4edefb89-7536-4a74-a401-b1840229ce38","resolution":{"observed_at":"2026-08-07T05:43:15.627652Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:43:15.594829Z","title":"Coloring large complex networks,","venue":null,"work_id":"22e90557-07da-4bd7-8ae0-d02b5cce5151","year":2014},"citing_paper":{"arxiv_id":"2506.07373","last_updated":"2025-06-09T02:45:08Z","snapshot_observed_at":"2026-08-07T05:33:10.324588Z","submitted_at":"2025-06-09T02:45:08Z","title":"HyColor: An Efficient Heuristic Algorithm for Graph Coloring","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T05:43:14.520323Z"},"links":{"citing_paper":"/paper/2506.07373"},"observation_digest":"sha256:69e2b9ec3c13892e3bfcf65339bd2fffc480fd0479bc6806d5f97198bec82487","observation_id":"b8a6509f-f81f-4e2c-a9f2-d5feee7fcfbf","resolution":{"observed_at":"2026-08-07T05:43:15.600982Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:43:15.575649Z","title":"Solving the maximum clique and vertex coloring problems on very large sparse networks,","venue":null,"work_id":"a6a2ccd0-361e-491b-8565-fde43d801157","year":2015},"citing_paper":{"arxiv_id":"2506.07373","last_updated":"2025-06-09T02:45:08Z","snapshot_observed_at":"2026-08-07T05:33:10.324588Z","submitted_at":"2025-06-09T02:45:08Z","title":"HyColor: An Efficient Heuristic Algorithm for Graph Coloring","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T05:43:14.525119Z"},"links":{"citing_paper":"/paper/2506.07373"},"observation_digest":"sha256:cb262a23ff912db32a42de600ae451c8fe203f60414c21c58e4c45880a116096","observation_id":"bf517c59-84b5-4e10-9ff1-134be3ea580d","resolution":{"observed_at":"2026-08-07T05:43:15.580085Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:43:15.559678Z","title":"A reduction based method for coloring very large graphs,","venue":null,"work_id":"75271c6b-c589-422f-b44d-f61211018b25","year":2017},"citing_paper":{"arxiv_id":"2506.07373","last_updated":"2025-06-09T02:45:08Z","snapshot_observed_at":"2026-08-07T05:33:10.324588Z","submitted_at":"2025-06-09T02:45:08Z","title":"HyColor: An Efficient Heuristic Algorithm for Graph Coloring","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T05:43:14.529709Z"},"links":{"citing_paper":"/paper/2506.07373"},"observation_digest":"sha256:a8869cfbcb02764ebfa641e828a994a73d54b6b5138da247982f0dbdca323460","observation_id":"a48a61e5-b07c-4b18-ab00-7448256d457a","resolution":{"observed_at":"2026-08-07T05:43:15.564596Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:43:15.544340Z","title":"Using tabu search techniques for graph coloring,","venue":null,"work_id":"e5d5bb51-8b27-4c6b-9fee-212c39b2aa34","year":1987},"citing_paper":{"arxiv_id":"2506.07373","last_updated":"2025-06-09T02:45:08Z","snapshot_observed_at":"2026-08-07T05:33:10.324588Z","submitted_at":"2025-06-09T02:45:08Z","title":"HyColor: An Efficient Heuristic Algorithm for Graph Coloring","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T05:43:14.534243Z"},"links":{"citing_paper":"/paper/2506.07373"},"observation_digest":"sha256:a9a969e6da23e9537edb9783c36df8f8630f2a50306c52302c47398f78886992","observation_id":"ab3e3474-88cc-4b55-b069-39ce0935f7fd","resolution":{"observed_at":"2026-08-07T05:43:15.549287Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:43:15.527513Z","title":"A variable neighborhood search for graph coloring,","venue":null,"work_id":"ed76aba6-f8c4-4b23-92bd-1501888e0eb6","year":2003},"citing_paper":{"arxiv_id":"2506.07373","last_updated":"2025-06-09T02:45:08Z","snapshot_observed_at":"2026-08-07T05:33:10.324588Z","submitted_at":"2025-06-09T02:45:08Z","title":"HyColor: An Efficient Heuristic Algorithm for Graph Coloring","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T05:43:14.539034Z"},"links":{"citing_paper":"/paper/2506.07373"},"observation_digest":"sha256:81e72f177b21e45d25c218072ea2869f1fe0e43692f83846d665e1e5d695c539","observation_id":"3ada71a7-5ee7-4449-85eb-2816464fdbc7","resolution":{"observed_at":"2026-08-07T05:43:15.533333Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:43:15.503857Z","title":"A graph coloring heuristic using par- tial solutions and a reactive tabu scheme,","venue":null,"work_id":"1de77354-b6e6-4573-af9b-a2445584faf1","year":2008},"citing_paper":{"arxiv_id":"2506.07373","last_updated":"2025-06-09T02:45:08Z","snapshot_observed_at":"2026-08-07T05:33:10.324588Z","submitted_at":"2025-06-09T02:45:08Z","title":"HyColor: An Efficient Heuristic Algorithm for Graph Coloring","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T05:43:14.543358Z"},"links":{"citing_paper":"/paper/2506.07373"},"observation_digest":"sha256:0c7292d438a5cd61174f5c1cccaa099f9f6ff2003add19be74d9f7930acd6842","observation_id":"0fba795a-61c6-4962-b428-b8114c9de9ae","resolution":{"observed_at":"2026-08-07T05:43:15.511495Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:43:15.479466Z","title":"Coloring large graphs based on independent set extraction,","venue":null,"work_id":"1c5bb125-bf03-4315-8999-04cc4073e4d5","year":2012},"citing_paper":{"arxiv_id":"2506.07373","last_updated":"2025-06-09T02:45:08Z","snapshot_observed_at":"2026-08-07T05:33:10.324588Z","submitted_at":"2025-06-09T02:45:08Z","title":"HyColor: An Efficient Heuristic Algorithm for Graph Coloring","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T05:43:14.548125Z"},"links":{"citing_paper":"/paper/2506.07373"},"observation_digest":"sha256:c2f148c7240f294b3ad9b97a0032dead49190f0dd2601e52521743e9ad77f93c","observation_id":"7a7d7655-a98e-4718-8d39-d884d4b16c0a","resolution":{"observed_at":"2026-08-07T05:43:15.484909Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:43:15.461637Z","title":"A memetic algorithm for graph coloring,","venue":null,"work_id":"3d3172d9-b426-4e66-9db6-62297a3e3895","year":2010},"citing_paper":{"arxiv_id":"2506.07373","last_updated":"2025-06-09T02:45:08Z","snapshot_observed_at":"2026-08-07T05:33:10.324588Z","submitted_at":"2025-06-09T02:45:08Z","title":"HyColor: An Efficient Heuristic Algorithm for Graph Coloring","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T05:43:14.552762Z"},"links":{"citing_paper":"/paper/2506.07373"},"observation_digest":"sha256:1795240df5e9a6b9bff6888dd35d755614645af7aad1b7d12bd99e601e2eee70","observation_id":"a285b77a-d71e-4396-9c6b-7541593adbc8","resolution":{"observed_at":"2026-08-07T05:43:15.467132Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:43:15.440176Z","title":"Solution to graph coloring using genetic and tabu search procedures,","venue":null,"work_id":"fbb36178-2be0-49f4-ab6f-fc4e466097e0","year":2018},"citing_paper":{"arxiv_id":"2506.07373","last_updated":"2025-06-09T02:45:08Z","snapshot_observed_at":"2026-08-07T05:33:10.324588Z","submitted_at":"2025-06-09T02:45:08Z","title":"HyColor: An Efficient Heuristic Algorithm for Graph Coloring","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T05:43:14.557256Z"},"links":{"citing_paper":"/paper/2506.07373"},"observation_digest":"sha256:ff03252754fba8b8342cb0bd7ab2edadb87050a22230a54348e804319a95c4ea","observation_id":"9abe5488-2396-44b8-826b-41ff7ceb2595","resolution":{"observed_at":"2026-08-07T05:43:15.446506Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:43:15.418263Z","title":"Variations on memetic algorithms for graph coloring problems,","venue":null,"work_id":"57ca89bb-87c0-4c59-8309-66c6eb3e0e04","year":2018},"citing_paper":{"arxiv_id":"2506.07373","last_updated":"2025-06-09T02:45:08Z","snapshot_observed_at":"2026-08-07T05:33:10.324588Z","submitted_at":"2025-06-09T02:45:08Z","title":"HyColor: An Efficient Heuristic Algorithm for Graph Coloring","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T05:43:14.561666Z"},"links":{"citing_paper":"/paper/2506.07373"},"observation_digest":"sha256:5ef2d24e851262127c6bf9bc5915136819dfcfff079055977258ffbd5dd6dd86","observation_id":"1b71a452-cff6-4a35-b3db-90a1b00a3dcf","resolution":{"observed_at":"2026-08-07T05:43:15.423685Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:43:15.399093Z","title":"A deep learning guided memetic framework for graph coloring problems,","venue":null,"work_id":"2c338554-7dae-47ec-a55a-82a71f0b424b","year":2022},"citing_paper":{"arxiv_id":"2506.07373","last_updated":"2025-06-09T02:45:08Z","snapshot_observed_at":"2026-08-07T05:33:10.324588Z","submitted_at":"2025-06-09T02:45:08Z","title":"HyColor: An Efficient Heuristic Algorithm for Graph Coloring","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T05:43:14.566718Z"},"links":{"citing_paper":"/paper/2506.07373"},"observation_digest":"sha256:3066d3496c846f7e493b95eee323cf732254e567413b15e210bfe98107199917","observation_id":"b6a23a65-eea5-4f83-812b-5c6b98dee627","resolution":{"observed_at":"2026-08-07T05:43:15.405536Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:43:15.379740Z","title":"A sat approach to branchwidth,","venue":null,"work_id":"77371cdb-b62d-4062-8cc6-ed9ec751075d","year":2019},"citing_paper":{"arxiv_id":"2506.07373","last_updated":"2025-06-09T02:45:08Z","snapshot_observed_at":"2026-08-07T05:33:10.324588Z","submitted_at":"2025-06-09T02:45:08Z","title":"HyColor: An Efficient Heuristic Algorithm for Graph Coloring","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T05:43:14.571249Z"},"links":{"citing_paper":"/paper/2506.07373"},"observation_digest":"sha256:a5d5d0862d2aaecef3d6984c8e11965da218aaec402bd4110273fd83d0acaf05","observation_id":"01efebde-6847-403f-a08d-f1b2e08a0130","resolution":{"observed_at":"2026-08-07T05:43:15.384657Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:43:15.362933Z","title":"Circuit minimization with qbf-based exact synthesis,","venue":null,"work_id":"a3541ff7-f487-4f40-ae12-9e5a252accbc","year":2023},"citing_paper":{"arxiv_id":"2506.07373","last_updated":"2025-06-09T02:45:08Z","snapshot_observed_at":"2026-08-07T05:33:10.324588Z","submitted_at":"2025-06-09T02:45:08Z","title":"HyColor: An Efficient Heuristic Algorithm for Graph Coloring","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T05:43:14.576129Z"},"links":{"citing_paper":"/paper/2506.07373"},"observation_digest":"sha256:1530ec59e455281f78b65f6bffd370df214b2fc6490da072ab7589bf2d176438","observation_id":"299e210e-46b2-452e-8a20-f393e0e03c47","resolution":{"observed_at":"2026-08-07T05:43:15.368808Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:43:15.345704Z","title":"Predicting learnt clauses quality in modern sat solvers,","venue":null,"work_id":"55482e78-d4f8-44e4-a5e6-77e58449ec35","year":2009},"citing_paper":{"arxiv_id":"2506.07373","last_updated":"2025-06-09T02:45:08Z","snapshot_observed_at":"2026-08-07T05:33:10.324588Z","submitted_at":"2025-06-09T02:45:08Z","title":"HyColor: An Efficient Heuristic Algorithm for Graph Coloring","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T05:43:14.580616Z"},"links":{"citing_paper":"/paper/2506.07373"},"observation_digest":"sha256:806e299915e6d925998f708cf8f24e6cba80b597e4e823510663fbae8519ed27","observation_id":"c88681d7-fb24-41dd-a5dd-aadfecaf50d0","resolution":{"observed_at":"2026-08-07T05:43:15.351183Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:43:15.325400Z","title":"Cadical, kissat, paracooba, plingeling and treengeling entering the sat competition 2020,","venue":null,"work_id":"a3937792-09a2-45b8-a178-1d806dea281a","year":2020},"citing_paper":{"arxiv_id":"2506.07373","last_updated":"2025-06-09T02:45:08Z","snapshot_observed_at":"2026-08-07T05:33:10.324588Z","submitted_at":"2025-06-09T02:45:08Z","title":"HyColor: An Efficient Heuristic Algorithm for Graph Coloring","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T05:43:14.585776Z"},"links":{"citing_paper":"/paper/2506.07373"},"observation_digest":"sha256:cc6520fd504b74a70678bbd5396cbf503d2d4d781b30fe57cd6be30c22e0a55d","observation_id":"9e61f07c-473a-403d-b6d2-aa871a28ee66","resolution":{"observed_at":"2026-08-07T05:43:15.332096Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:43:15.294754Z","title":"An iterative greedy algo- rithm with q-learning mechanism for the multiobjective distributed no- idle permutation flowshop scheduling,","venue":null,"work_id":"93d9d166-e781-4b5e-8b5b-1ab9b1fd16fc","year":2024},"citing_paper":{"arxiv_id":"2506.07373","last_updated":"2025-06-09T02:45:08Z","snapshot_observed_at":"2026-08-07T05:33:10.324588Z","submitted_at":"2025-06-09T02:45:08Z","title":"HyColor: An Efficient Heuristic Algorithm for Graph Coloring","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T05:43:14.590544Z"},"links":{"citing_paper":"/paper/2506.07373"},"observation_digest":"sha256:89b9ac76af08e17a0d320e072b6f307a0b68b9be604aa74637c542a42f90dad2","observation_id":"79be0de0-eac3-4316-ac9e-ab01fe39e46b","resolution":{"observed_at":"2026-08-07T05:43:15.308857Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:43:15.270272Z","title":"An iterated greedy heuristic for mixed no-wait flowshop problems,","venue":null,"work_id":"f2d3745c-2a8e-4d82-bb18-f88c18b87fcf","year":2018},"citing_paper":{"arxiv_id":"2506.07373","last_updated":"2025-06-09T02:45:08Z","snapshot_observed_at":"2026-08-07T05:33:10.324588Z","submitted_at":"2025-06-09T02:45:08Z","title":"HyColor: An Efficient Heuristic Algorithm for Graph Coloring","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-07T05:43:14.595422Z"},"links":{"citing_paper":"/paper/2506.07373"},"observation_digest":"sha256:af15b087def38b680b4a9d6bed5a7968490770dd8f08d7583736980ab1bfdba0","observation_id":"2b72d23c-8238-4b16-b73a-12503dba4e09","resolution":{"observed_at":"2026-08-07T05:43:15.275545Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:43:15.251929Z","title":"A knowledge-based two-population optimization algorithm for distributed energy-efficient parallel machines scheduling,","venue":null,"work_id":"1d32a579-c51b-40b8-9cdc-df64b9ac7602","year":2020},"citing_paper":{"arxiv_id":"2506.07373","last_updated":"2025-06-09T02:45:08Z","snapshot_observed_at":"2026-08-07T05:33:10.324588Z","submitted_at":"2025-06-09T02:45:08Z","title":"HyColor: An Efficient Heuristic Algorithm for Graph Coloring","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-07T05:43:14.600248Z"},"links":{"citing_paper":"/paper/2506.07373"},"observation_digest":"sha256:92556f71656b91f010e971134ff459ebf8c7da26f6c3e981890a71975cf4e29c","observation_id":"fcfa3eec-913d-496e-80c6-af4b4d65415e","resolution":{"observed_at":"2026-08-07T05:43:15.257326Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:43:15.233334Z","title":"A hyperheuristic with q-learning for the multiobjective energy-efficient distributed blocking flow shop scheduling problem,","venue":null,"work_id":"be443c5b-01d7-4362-8af8-f148dbf5bc9c","year":2022},"citing_paper":{"arxiv_id":"2506.07373","last_updated":"2025-06-09T02:45:08Z","snapshot_observed_at":"2026-08-07T05:33:10.324588Z","submitted_at":"2025-06-09T02:45:08Z","title":"HyColor: An Efficient Heuristic Algorithm for Graph Coloring","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-07T05:43:14.604613Z"},"links":{"citing_paper":"/paper/2506.07373"},"observation_digest":"sha256:40898d3be1a9d5f26b741ed4cde57a4fdaebdea19dfe1333a21b343b4b0f6b26","observation_id":"3257dc4b-db18-4fec-bb26-11c849b865c4","resolution":{"observed_at":"2026-08-07T05:43:15.238843Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:43:15.209671Z","title":"A dual-mode local search algorithm for solving the minimum dominating set problem,","venue":null,"work_id":"45c38acf-bad3-4c6b-8437-46656089ecbd","year":2024},"citing_paper":{"arxiv_id":"2506.07373","last_updated":"2025-06-09T02:45:08Z","snapshot_observed_at":"2026-08-07T05:33:10.324588Z","submitted_at":"2025-06-09T02:45:08Z","title":"HyColor: An Efficient Heuristic Algorithm for Graph Coloring","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-07T05:43:14.609505Z"},"links":{"citing_paper":"/paper/2506.07373"},"observation_digest":"sha256:069b9ad6bbb1ff55315348ad7c7a6854b2ed6b1bc2e0bd25e92d74f72688481c","observation_id":"6f61b15b-43ec-45fa-b7d0-eada12d7c003","resolution":{"observed_at":"2026-08-07T05:43:15.217268Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:43:15.188604Z","title":"A heuristic initialized stochastic memetic algorithm for mdpvrp with interdependent depot operations,","venue":null,"work_id":"1afc545e-48b6-4d00-8c3a-48e06f924e19","year":2017},"citing_paper":{"arxiv_id":"2506.07373","last_updated":"2025-06-09T02:45:08Z","snapshot_observed_at":"2026-08-07T05:33:10.324588Z","submitted_at":"2025-06-09T02:45:08Z","title":"HyColor: An Efficient Heuristic Algorithm for Graph Coloring","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-07T05:43:14.613896Z"},"links":{"citing_paper":"/paper/2506.07373"},"observation_digest":"sha256:7f0db104ae73667cb42934effb1b2d4be1ae00af97757590294c7dac1ac3cf4f","observation_id":"56f2a844-ece3-4934-8f13-d7858a64da99","resolution":{"observed_at":"2026-08-07T05:43:15.194875Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:43:15.168996Z","title":"A systematic study on meta-heuristic approaches for solving the graph coloring problem,","venue":null,"work_id":"ab7eadd2-e6cc-4c6f-ad25-5efcf1bf8225","year":2020},"citing_paper":{"arxiv_id":"2506.07373","last_updated":"2025-06-09T02:45:08Z","snapshot_observed_at":"2026-08-07T05:33:10.324588Z","submitted_at":"2025-06-09T02:45:08Z","title":"HyColor: An Efficient Heuristic Algorithm for Graph Coloring","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-07T05:43:14.618706Z"},"links":{"citing_paper":"/paper/2506.07373"},"observation_digest":"sha256:686e3197178ff76f247c926d60c24ba9dc9ea0423a8a1b489cf8e9fdbd6accf8","observation_id":"0f33c9fd-7ca8-4972-b245-b56471a9404c","resolution":{"observed_at":"2026-08-07T05:43:15.175686Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:43:15.145752Z","title":"A chaotic binary salp swarm algorithm for solving the graph coloring problem,","venue":null,"work_id":"34383f97-b7f9-4cf1-9dfe-c0aba92f0064","year":2018},"citing_paper":{"arxiv_id":"2506.07373","last_updated":"2025-06-09T02:45:08Z","snapshot_observed_at":"2026-08-07T05:33:10.324588Z","submitted_at":"2025-06-09T02:45:08Z","title":"HyColor: An Efficient Heuristic Algorithm for Graph Coloring","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-07T05:43:14.623482Z"},"links":{"citing_paper":"/paper/2506.07373"},"observation_digest":"sha256:13fd200c212b974dcb9cef8c17216f1a4974a7efcd4d7e4555f6649f741c9a10","observation_id":"698a053a-fd1d-4f2f-8d93-8b2163dff990","resolution":{"observed_at":"2026-08-07T05:43:15.154081Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:43:15.121599Z","title":"The improved colourant algorithm: a hybrid algorithm for solving the graph colouring problem,","venue":null,"work_id":"eac48f40-e980-4e37-932e-5117073480c9","year":2020},"citing_paper":{"arxiv_id":"2506.07373","last_updated":"2025-06-09T02:45:08Z","snapshot_observed_at":"2026-08-07T05:33:10.324588Z","submitted_at":"2025-06-09T02:45:08Z","title":"HyColor: An Efficient Heuristic Algorithm for Graph Coloring","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-07T05:43:14.628205Z"},"links":{"citing_paper":"/paper/2506.07373"},"observation_digest":"sha256:163a930d61234f0b29f7cbbe388237d9fe0d46c602b7549afe64823cd8f166e8","observation_id":"27bc9842-ff9d-40f5-b6fd-68f7bcef0f83","resolution":{"observed_at":"2026-08-07T05:43:15.127996Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:43:15.102444Z","title":"A hybrid modified pso approach to var- based facility location problems with variable capacity in fuzzy random uncertainty,","venue":null,"work_id":"eceecacf-9b7b-4dd1-91c4-7f8715d68e56","year":2012},"citing_paper":{"arxiv_id":"2506.07373","last_updated":"2025-06-09T02:45:08Z","snapshot_observed_at":"2026-08-07T05:33:10.324588Z","submitted_at":"2025-06-09T02:45:08Z","title":"HyColor: An Efficient Heuristic Algorithm for Graph Coloring","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-07T05:43:14.632898Z"},"links":{"citing_paper":"/paper/2506.07373"},"observation_digest":"sha256:5d6e5baadf934442c3e3e988603e10074b8895d5527eca52a6e2c800d3b8c815","observation_id":"8b0354eb-5e24-4c65-982f-a491afa86f08","resolution":{"observed_at":"2026-08-07T05:43:15.108421Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:43:15.080338Z","title":"Solving graph coloring problem using divide and conquer-based turbulent particle swarm optimization,","venue":null,"work_id":"7efc4381-32e0-4268-912a-239a91e04d2f","year":2021},"citing_paper":{"arxiv_id":"2506.07373","last_updated":"2025-06-09T02:45:08Z","snapshot_observed_at":"2026-08-07T05:33:10.324588Z","submitted_at":"2025-06-09T02:45:08Z","title":"HyColor: An Efficient Heuristic Algorithm for Graph Coloring","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-07T05:43:14.637420Z"},"links":{"citing_paper":"/paper/2506.07373"},"observation_digest":"sha256:a8d6ad6eb5bb8a16756061042d2fa37cf54a17c46a19db33e5c2a72b257a1733","observation_id":"ba916bc1-54af-4e47-acfd-bdac1c987c38","resolution":{"observed_at":"2026-08-07T05:43:15.086250Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:43:15.061776Z","title":"Fast solving maximum weight clique problem in massive graphs","venue":null,"work_id":"26dce0ab-78c6-420b-8875-9aa4da507bb0","year":2016},"citing_paper":{"arxiv_id":"2506.07373","last_updated":"2025-06-09T02:45:08Z","snapshot_observed_at":"2026-08-07T05:33:10.324588Z","submitted_at":"2025-06-09T02:45:08Z","title":"HyColor: An Efficient Heuristic Algorithm for Graph Coloring","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-07T05:43:14.642592Z"},"links":{"citing_paper":"/paper/2506.07373"},"observation_digest":"sha256:b35d2c67145d1e6e996939da61fe6c574a5c4d9607bc14e10a123ddfc3e7ec65","observation_id":"333b5373-d7d0-4daf-82e5-2c0a03d958f2","resolution":{"observed_at":"2026-08-07T05:43:15.067266Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:43:15.040181Z","title":"Network structure and minimum degree,","venue":null,"work_id":"6745519b-c3c7-4a5c-93f2-00cd8900e135","year":1983},"citing_paper":{"arxiv_id":"2506.07373","last_updated":"2025-06-09T02:45:08Z","snapshot_observed_at":"2026-08-07T05:33:10.324588Z","submitted_at":"2025-06-09T02:45:08Z","title":"HyColor: An Efficient Heuristic Algorithm for Graph Coloring","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-07T05:43:14.647214Z"},"links":{"citing_paper":"/paper/2506.07373"},"observation_digest":"sha256:1db7639a08d926961e97ca90ee4a3c571ba07b4ca3aba086041da53e181f0ab5","observation_id":"c52f706b-82e2-40e3-998c-fbffb29bfc91","resolution":{"observed_at":"2026-08-07T05:43:15.046332Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:43:15.015606Z","title":"Ranking spreaders by decomposing complex networks,","venue":null,"work_id":"618e91b7-cc80-4441-bbed-0b2ccf90c8ef","year":2013},"citing_paper":{"arxiv_id":"2506.07373","last_updated":"2025-06-09T02:45:08Z","snapshot_observed_at":"2026-08-07T05:33:10.324588Z","submitted_at":"2025-06-09T02:45:08Z","title":"HyColor: An Efficient Heuristic Algorithm for Graph Coloring","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-07T05:43:14.651728Z"},"links":{"citing_paper":"/paper/2506.07373"},"observation_digest":"sha256:e6d8169a6f7f5f1bb7d68887fd412069512053bcf302a37a02a1ce0fc2db1de7","observation_id":"3c4c9dc5-1424-4ebe-8f49-d7d6ba5df6f1","resolution":{"observed_at":"2026-08-07T05:43:15.022630Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:43:14.656095Z","title":"An o (m) algorithm for cores decompo- sition of networks. corr,","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2506.07373","last_updated":"2025-06-09T02:45:08Z","snapshot_observed_at":"2026-08-07T05:33:10.324588Z","submitted_at":"2025-06-09T02:45:08Z","title":"HyColor: An Efficient Heuristic Algorithm for Graph Coloring","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-07T05:43:14.656095Z"},"links":{"citing_paper":"/paper/2506.07373"},"observation_digest":"sha256:649495bf46190043af115453461dd604c9f1d00419beba1ca9d0d9b1022c849a","observation_id":"2f0cec8e-5af6-4bc3-9a0c-6d153dcfdb82","resolution":{"observed_at":"2026-08-07T05:43:14.656095Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:43:14.994886Z","title":"A systematic survey on influential spreaders identification in complex networks with a focus on k-shell based techniques,","venue":null,"work_id":"b1018203-3bee-4985-9571-5fdee1707029","year":2020},"citing_paper":{"arxiv_id":"2506.07373","last_updated":"2025-06-09T02:45:08Z","snapshot_observed_at":"2026-08-07T05:33:10.324588Z","submitted_at":"2025-06-09T02:45:08Z","title":"HyColor: An Efficient Heuristic Algorithm for Graph Coloring","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-07T05:43:14.660734Z"},"links":{"citing_paper":"/paper/2506.07373"},"observation_digest":"sha256:9d5176026c785acfc646af608b47c0bec6ea7d0b31f2b75b405c94224dab4476","observation_id":"5c5da12e-1b80-40f6-8436-5d545b1dc755","resolution":{"observed_at":"2026-08-07T05:43:14.999994Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:43:14.977427Z","title":"Lewis, Guide to graph colouring","venue":null,"work_id":"4d09e159-4b93-4d7b-a03a-13e3de65bf1e","year":2021},"citing_paper":{"arxiv_id":"2506.07373","last_updated":"2025-06-09T02:45:08Z","snapshot_observed_at":"2026-08-07T05:33:10.324588Z","submitted_at":"2025-06-09T02:45:08Z","title":"HyColor: An Efficient Heuristic Algorithm for Graph Coloring","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-07T05:43:14.665238Z"},"links":{"citing_paper":"/paper/2506.07373"},"observation_digest":"sha256:c79a9c46e9dd2cc4dd17f1617940ef25b0a5b3b3880f0fa94b6c6a8d103ccec7","observation_id":"95f1be87-4262-4907-b5b0-97ade578605b","resolution":{"observed_at":"2026-08-07T05:43:14.982401Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:43:14.961422Z","title":"Cliques, coloring, and satisfiability: Second dimacs implementation challenge, workshop, october 11- 13, 1993,","venue":null,"work_id":"9a2ad124-55ae-4072-afaf-f9f4dd96566a","year":1993},"citing_paper":{"arxiv_id":"2506.07373","last_updated":"2025-06-09T02:45:08Z","snapshot_observed_at":"2026-08-07T05:33:10.324588Z","submitted_at":"2025-06-09T02:45:08Z","title":"HyColor: An Efficient Heuristic Algorithm for Graph Coloring","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-07T05:43:14.669554Z"},"links":{"citing_paper":"/paper/2506.07373"},"observation_digest":"sha256:c6092008bae19f7d27201fb88c9cd68d7462a1b7aa4b27f7c31e4a5cd835c57b","observation_id":"f816a34b-e988-46b5-8e24-e6bfa000b16d","resolution":{"observed_at":"2026-08-07T05:43:14.966021Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:43:14.945792Z","title":"Benchmarking for graph clustering and partitioning,","venue":null,"work_id":"c0fa4437-612a-4db6-b081-ae1607067b7b","year":2014},"citing_paper":{"arxiv_id":"2506.07373","last_updated":"2025-06-09T02:45:08Z","snapshot_observed_at":"2026-08-07T05:33:10.324588Z","submitted_at":"2025-06-09T02:45:08Z","title":"HyColor: An Efficient Heuristic Algorithm for Graph Coloring","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-07T05:43:14.673710Z"},"links":{"citing_paper":"/paper/2506.07373"},"observation_digest":"sha256:bcd13fb9047db36e45a2405d15efb603409b9003137dfe669f3729df496ccb3f","observation_id":"e8046930-3843-4759-b444-db84c5d3ad5d","resolution":{"observed_at":"2026-08-07T05:43:14.950532Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:43:14.677873Z","title":"SNAP Datasets: Stanford large network dataset collection,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2506.07373","last_updated":"2025-06-09T02:45:08Z","snapshot_observed_at":"2026-08-07T05:33:10.324588Z","submitted_at":"2025-06-09T02:45:08Z","title":"HyColor: An Efficient Heuristic Algorithm for Graph Coloring","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-07T05:43:14.677873Z"},"links":{"citing_paper":"/paper/2506.07373"},"observation_digest":"sha256:876d0a31342081abafe9d939e83bb902865678c532cd8759f63effa5f11fabfc","observation_id":"5c0da8e9-7820-41aa-8bde-edd9a056d0ad","resolution":{"observed_at":"2026-08-07T05:43:14.677873Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:43:14.918607Z","title":"The network data repository with interactive graph analytics and visualization,","venue":null,"work_id":"0880edc3-ee53-4fa3-912f-6abde4eefb0e","year":2015},"citing_paper":{"arxiv_id":"2506.07373","last_updated":"2025-06-09T02:45:08Z","snapshot_observed_at":"2026-08-07T05:33:10.324588Z","submitted_at":"2025-06-09T02:45:08Z","title":"HyColor: An Efficient Heuristic Algorithm for Graph Coloring","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-07T05:43:14.682182Z"},"links":{"citing_paper":"/paper/2506.07373"},"observation_digest":"sha256:dc27bbd8394e1398fa147e0d8bb311b05a526dcb98d07eb4d53af59e0e33f35e","observation_id":"44185f42-d8a2-44de-be1d-04bf3bfb1c2d","resolution":{"observed_at":"2026-08-07T05:43:14.923521Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:43:14.902105Z","title":"Local search with efficient automatic configuration for minimum vertex cover","venue":null,"work_id":"829043c5-4f34-4af4-8d74-ad804c465a82","year":2019},"citing_paper":{"arxiv_id":"2506.07373","last_updated":"2025-06-09T02:45:08Z","snapshot_observed_at":"2026-08-07T05:33:10.324588Z","submitted_at":"2025-06-09T02:45:08Z","title":"HyColor: An Efficient Heuristic Algorithm for Graph Coloring","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-07T05:43:14.686706Z"},"links":{"citing_paper":"/paper/2506.07373"},"observation_digest":"sha256:1de278b1d9478da028a4e9cd5030a91a18d530caee6b49bcc917f0c2ba3056fa","observation_id":"b9108826-39a8-4689-926d-65b4c220d2f3","resolution":{"observed_at":"2026-08-07T05:43:14.907203Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:43:14.691440Z","title":"The use of ranks to avoid the assumption of normality implicit in the analysis of variance,","venue":null,"work_id":null,"year":1937},"citing_paper":{"arxiv_id":"2506.07373","last_updated":"2025-06-09T02:45:08Z","snapshot_observed_at":"2026-08-07T05:33:10.324588Z","submitted_at":"2025-06-09T02:45:08Z","title":"HyColor: An Efficient Heuristic Algorithm for Graph Coloring","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-07T05:43:14.691440Z"},"links":{"citing_paper":"/paper/2506.07373"},"observation_digest":"sha256:be47a7c9a1511c92da5d83bc58938b37ab97d967f551637454dfe85cc83b35ce","observation_id":"8bd8deda-999c-46b2-99e5-325095b1c698","resolution":{"observed_at":"2026-08-07T05:43:14.691440Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:43:14.869884Z","title":"Statistical comparisons of classifiers over multiple data sets,","venue":null,"work_id":"0fcc6369-9a81-4915-8fea-99d3e55388f1","year":2006},"citing_paper":{"arxiv_id":"2506.07373","last_updated":"2025-06-09T02:45:08Z","snapshot_observed_at":"2026-08-07T05:33:10.324588Z","submitted_at":"2025-06-09T02:45:08Z","title":"HyColor: An Efficient Heuristic Algorithm for Graph Coloring","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-07T05:43:14.696244Z"},"links":{"citing_paper":"/paper/2506.07373"},"observation_digest":"sha256:e7682ec57848926c1e352f0b5bf2350293c6907c43bdbea78ac9cc78cb8bdabb","observation_id":"a77ae324-2a78-47d6-ab61-77f878f41668","resolution":{"observed_at":"2026-08-07T05:43:14.879351Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.07373","last_updated":"2025-06-09T02:45:08Z","latest_version":1,"primary_category":"cs.DM","snapshot_observed_at":"2026-08-07T05:33:10.324588Z","submitted_at":"2025-06-09T02:45:08Z","title":"HyColor: An Efficient Heuristic Algorithm for Graph Coloring"},"reference_resolution":{"displayed":69,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":6,"verified_exact":0,"verified_fuzzy":63},"total_outbound_references":69},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 69 of 69 outbound references and 0 inbound Pith citation observations for arXiv:2506.07373."}