{"as_of":"2026-08-08T04:44:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7b85e10521198f3d55072dac24a4486f5cdfc85a4b47bc7a3748db3ac4103c0d","coverage":[{"denominator":43,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":43,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T13:47:35.736530Z","state":"measured"},{"denominator":43,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":43,"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/2505.20972/citation-record","integrity":"/paper/2505.20972/integrity","json":"/paper/2505.20972/citation-record.json","paper":"/paper/2505.20972"},"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-07T13:47:43.305922Z","title":"Gnn&gbdt-guided fast optimizing framework for large-scale integer programming","venue":null,"work_id":"6aa45153-10b6-41c8-969f-4f05760719ba","year":2023},"citing_paper":{"arxiv_id":"2505.20972","last_updated":"2025-05-27T10:04:54Z","snapshot_observed_at":"2026-08-07T13:40:28.394564Z","submitted_at":"2025-05-27T10:04:54Z","title":"Deep k-grouping: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs and Hypergraphs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T13:47:31.743304Z"},"links":{"citing_paper":"/paper/2505.20972"},"observation_digest":"sha256:059e37991e243bed4391289b579f927d0db576964e0124a5d052af95464ef93d","observation_id":"2064ba12-8659-49c2-8569-44a6d3edb75f","resolution":{"observed_at":"2026-08-07T13:47:43.384505Z","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-07T13:47:43.176712Z","title":"Neural network-based dimensionality reduction for large-scale binary optimization with millions of variables","venue":null,"work_id":"0416e35f-a6c9-4cb8-a98f-977aaba6b8dd","year":2024},"citing_paper":{"arxiv_id":"2505.20972","last_updated":"2025-05-27T10:04:54Z","snapshot_observed_at":"2026-08-07T13:40:28.394564Z","submitted_at":"2025-05-27T10:04:54Z","title":"Deep k-grouping: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs and Hypergraphs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T13:47:31.833503Z"},"links":{"citing_paper":"/paper/2505.20972"},"observation_digest":"sha256:b9daf269b003917c0ba95153c5b6065df0edaf73984ad084250bc0bdbef06852","observation_id":"40a7855c-508c-40f3-88bb-0edbd83da2ff","resolution":{"observed_at":"2026-08-07T13:47:43.232438Z","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-07T13:47:43.071000Z","title":"On the power of small-size graph neural networks for linear programming","venue":null,"work_id":"bd2862d6-b51b-468d-bb5b-6f648d03745a","year":2024},"citing_paper":{"arxiv_id":"2505.20972","last_updated":"2025-05-27T10:04:54Z","snapshot_observed_at":"2026-08-07T13:40:28.394564Z","submitted_at":"2025-05-27T10:04:54Z","title":"Deep k-grouping: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs and Hypergraphs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T13:47:31.905794Z"},"links":{"citing_paper":"/paper/2505.20972"},"observation_digest":"sha256:5494c5d2e1a3c5d1482448eb830a20f23d2337d3abadeb71f3aeda6d52fb4965","observation_id":"2b8ab720-4824-44d9-b4b4-a74f788d55fb","resolution":{"observed_at":"2026-08-07T13:47:43.125706Z","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-07T13:47:42.915641Z","title":"Combinatorial optimization and reasoning with graph neural networks","venue":null,"work_id":"34039303-b796-4db2-b27c-5e553353d6b8","year":2023},"citing_paper":{"arxiv_id":"2505.20972","last_updated":"2025-05-27T10:04:54Z","snapshot_observed_at":"2026-08-07T13:40:28.394564Z","submitted_at":"2025-05-27T10:04:54Z","title":"Deep k-grouping: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs and Hypergraphs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T13:47:31.984227Z"},"links":{"citing_paper":"/paper/2505.20972"},"observation_digest":"sha256:a813b7446bd252bf1c344814a5dfb2e9b4f094ba56fbd87331ee700b60ccb67e","observation_id":"f9f341f9-45c7-47ea-aa22-b23a04687f0e","resolution":{"observed_at":"2026-08-07T13:47:42.992324Z","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-07T13:47:32.079625Z","title":"Combinatorial optimization with physics-inspired graph neural networks","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.20972","last_updated":"2025-05-27T10:04:54Z","snapshot_observed_at":"2026-08-07T13:40:28.394564Z","submitted_at":"2025-05-27T10:04:54Z","title":"Deep k-grouping: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs and Hypergraphs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T13:47:32.079625Z"},"links":{"citing_paper":"/paper/2505.20972"},"observation_digest":"sha256:d0d5637370b3e145566ae771b25c31b7fb0ad8b9961ba0e2529307adab009de9","observation_id":"31eb14b6-3ed1-482c-a981-d3ccfcc62f6f","resolution":{"observed_at":"2026-08-07T13:47:32.079625Z","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-07T13:47:42.776673Z","title":"A deep learning framework for graph partitioning","venue":null,"work_id":"a5bededd-8955-4e3b-a815-f47e671c09d8","year":2019},"citing_paper":{"arxiv_id":"2505.20972","last_updated":"2025-05-27T10:04:54Z","snapshot_observed_at":"2026-08-07T13:40:28.394564Z","submitted_at":"2025-05-27T10:04:54Z","title":"Deep k-grouping: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs and Hypergraphs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T13:47:32.150095Z"},"links":{"citing_paper":"/paper/2505.20972"},"observation_digest":"sha256:670260fe8ab25d4df639a29e8994655bbf2d2e8006242bfcf19ff1938e568c1b","observation_id":"55293212-ac6e-46a9-a4b6-15328ff88848","resolution":{"observed_at":"2026-08-07T13:47:42.831315Z","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-07T13:47:42.664660Z","title":"Graph clustering with graph neural networks","venue":null,"work_id":"a6662f20-4e13-47b8-bd11-adcb308073ab","year":2023},"citing_paper":{"arxiv_id":"2505.20972","last_updated":"2025-05-27T10:04:54Z","snapshot_observed_at":"2026-08-07T13:40:28.394564Z","submitted_at":"2025-05-27T10:04:54Z","title":"Deep k-grouping: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs and Hypergraphs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T13:47:32.220873Z"},"links":{"citing_paper":"/paper/2505.20972"},"observation_digest":"sha256:de1e4c3ac055ebf3b2130e3e6bf93436c5c8aec91170709002496b5eac8af9cb","observation_id":"b490f122-a1e4-4b7a-b73a-7a8d19529db9","resolution":{"observed_at":"2026-08-07T13:47:42.727498Z","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-07T13:47:42.519705Z","title":"Controlling continuous relaxation for combinatorial optimization.Advances in Neural Information Processing Systems (NeurIPS), 37:47189–47216, 2024","venue":null,"work_id":"e99dc22e-88fc-4c91-9a81-fa11d877ece4","year":2024},"citing_paper":{"arxiv_id":"2505.20972","last_updated":"2025-05-27T10:04:54Z","snapshot_observed_at":"2026-08-07T13:40:28.394564Z","submitted_at":"2025-05-27T10:04:54Z","title":"Deep k-grouping: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs and Hypergraphs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T13:47:32.309213Z"},"links":{"citing_paper":"/paper/2505.20972"},"observation_digest":"sha256:e83e9a1b24626ca2dd3f58c3dbbeba99c385f06c83e8b94e4eb00d9863af208b","observation_id":"d01a82ec-dfcb-4ccb-b7ba-f40bbe9b8e6b","resolution":{"observed_at":"2026-08-07T13:47:42.608491Z","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-07T13:47:42.348368Z","title":"Learning to solve quadratic unconstrained binary optimization in a classification way","venue":null,"work_id":"9bf859b7-2b07-4336-8ff8-6571d63cf443","year":2024},"citing_paper":{"arxiv_id":"2505.20972","last_updated":"2025-05-27T10:04:54Z","snapshot_observed_at":"2026-08-07T13:40:28.394564Z","submitted_at":"2025-05-27T10:04:54Z","title":"Deep k-grouping: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs and Hypergraphs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T13:47:32.381969Z"},"links":{"citing_paper":"/paper/2505.20972"},"observation_digest":"sha256:43877c7f4849db8d4155209139815897850418965e2993d64085ee37ea1587e7","observation_id":"04dbd8f0-8996-46bb-abe1-142b1cf88d47","resolution":{"observed_at":"2026-08-07T13:47:42.446648Z","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-07T13:47:42.193459Z","title":"Neural graph matching network: Learning lawler’s quadratic assignment problem with extension to hypergraph and multiple-graph matching","venue":null,"work_id":"3bca3b20-831f-4095-9545-ccebf5c87429","year":2021},"citing_paper":{"arxiv_id":"2505.20972","last_updated":"2025-05-27T10:04:54Z","snapshot_observed_at":"2026-08-07T13:40:28.394564Z","submitted_at":"2025-05-27T10:04:54Z","title":"Deep k-grouping: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs and Hypergraphs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T13:47:32.492204Z"},"links":{"citing_paper":"/paper/2505.20972"},"observation_digest":"sha256:ed67ccb561df0324c3fc5eb2b62cbb7a38de6fdecaf736e0fdb5881cb44e4629","observation_id":"82afb103-78db-40dd-b8e5-f2c2a26edd82","resolution":{"observed_at":"2026-08-07T13:47:42.267917Z","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-07T13:47:42.014891Z","title":"Quantum bridge analytics i: a tutorial on formulating and using qubo models","venue":null,"work_id":"6f14a26f-52a6-47de-9761-a82595b9b443","year":2022},"citing_paper":{"arxiv_id":"2505.20972","last_updated":"2025-05-27T10:04:54Z","snapshot_observed_at":"2026-08-07T13:40:28.394564Z","submitted_at":"2025-05-27T10:04:54Z","title":"Deep k-grouping: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs and Hypergraphs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T13:47:32.573667Z"},"links":{"citing_paper":"/paper/2505.20972"},"observation_digest":"sha256:8c94dd68f44357a65f231b88138db9fa736c1ef9ccfaa2db87e70244ab251f8b","observation_id":"28d7c10d-e4c3-4824-b2c7-6c24c97eb7c0","resolution":{"observed_at":"2026-08-07T13:47:42.096091Z","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-07T13:47:41.876169Z","title":"Colorrl: reinforced coloring for end-to-end instance segmentation","venue":null,"work_id":"4e7aa23e-dcaa-419f-af83-cc0d6c355ef4","year":2021},"citing_paper":{"arxiv_id":"2505.20972","last_updated":"2025-05-27T10:04:54Z","snapshot_observed_at":"2026-08-07T13:40:28.394564Z","submitted_at":"2025-05-27T10:04:54Z","title":"Deep k-grouping: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs and Hypergraphs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T13:47:32.676561Z"},"links":{"citing_paper":"/paper/2505.20972"},"observation_digest":"sha256:0e167031206cae7d314f73b48c28ef7a3771e7301802511f7d721119b35045dc","observation_id":"22bf076b-445e-48de-85fc-b220d552f064","resolution":{"observed_at":"2026-08-07T13:47:41.926754Z","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-07T13:47:41.740475Z","title":"A graph coloring approach for image segmentation","venue":null,"work_id":"26da2563-e61c-4040-8d7b-8e2628535969","year":2007},"citing_paper":{"arxiv_id":"2505.20972","last_updated":"2025-05-27T10:04:54Z","snapshot_observed_at":"2026-08-07T13:40:28.394564Z","submitted_at":"2025-05-27T10:04:54Z","title":"Deep k-grouping: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs and Hypergraphs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T13:47:32.766494Z"},"links":{"citing_paper":"/paper/2505.20972"},"observation_digest":"sha256:b20a5314ffe8851854e25bd326535f48784153621a54cc58b6511acc6b1138c0","observation_id":"f0ddae25-3f86-4555-9c5f-43beaf8e2713","resolution":{"observed_at":"2026-08-07T13:47:41.795239Z","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-07T13:47:41.609360Z","title":"Toward quantum gate-model heuristics for real-world planning problems","venue":null,"work_id":"76acaadc-3c65-4386-a8bb-4850cdb2ae7d","year":2020},"citing_paper":{"arxiv_id":"2505.20972","last_updated":"2025-05-27T10:04:54Z","snapshot_observed_at":"2026-08-07T13:40:28.394564Z","submitted_at":"2025-05-27T10:04:54Z","title":"Deep k-grouping: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs and Hypergraphs","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T13:47:32.891712Z"},"links":{"citing_paper":"/paper/2505.20972"},"observation_digest":"sha256:6c3e841284d7de9349d9101936956c9d580fe3b75e9c822a3ab6b04da7fef92a","observation_id":"765a5f90-6b37-4297-818f-8b39e64501e7","resolution":{"observed_at":"2026-08-07T13:47:41.689706Z","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-07T13:47:41.435220Z","title":"Towards sustainable industry 4.0: A green real-time iiot multitask scheduling architecture for distributed 3d printing services","venue":null,"work_id":"41615caf-428e-474b-b488-6d43fdaf31d5","year":2021},"citing_paper":{"arxiv_id":"2505.20972","last_updated":"2025-05-27T10:04:54Z","snapshot_observed_at":"2026-08-07T13:40:28.394564Z","submitted_at":"2025-05-27T10:04:54Z","title":"Deep k-grouping: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs and Hypergraphs","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T13:47:33.008424Z"},"links":{"citing_paper":"/paper/2505.20972"},"observation_digest":"sha256:d7da036134c5780a2edb60d250606a5c32d1663c027d0c7a032ff8352f159e34","observation_id":"c50b70f3-f717-4d84-92da-1f72eab88187","resolution":{"observed_at":"2026-08-07T13:47:41.537078Z","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-07T13:47:41.210256Z","title":"A study on course timetable scheduling using graph coloring approach","venue":null,"work_id":"16cc99bd-c7a8-4017-929f-19e7be5dd378","year":2017},"citing_paper":{"arxiv_id":"2505.20972","last_updated":"2025-05-27T10:04:54Z","snapshot_observed_at":"2026-08-07T13:40:28.394564Z","submitted_at":"2025-05-27T10:04:54Z","title":"Deep k-grouping: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs and Hypergraphs","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T13:47:33.074003Z"},"links":{"citing_paper":"/paper/2505.20972"},"observation_digest":"sha256:a0b5b51cddaceb52993a9ce25e86bbe1da6d7f8d2e2a390c65c21746a4db3dfa","observation_id":"74bfc5df-d157-4ddb-b7b2-3f8fb11dadb3","resolution":{"observed_at":"2026-08-07T13:47:41.314573Z","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-07T13:47:41.045854Z","title":"Coloring-based channel allocation for multiple coexisting wireless body area networks: A game-theoretic approach","venue":null,"work_id":"27e9d96e-f987-4986-9eb3-db5f840be76e","year":2020},"citing_paper":{"arxiv_id":"2505.20972","last_updated":"2025-05-27T10:04:54Z","snapshot_observed_at":"2026-08-07T13:40:28.394564Z","submitted_at":"2025-05-27T10:04:54Z","title":"Deep k-grouping: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs and Hypergraphs","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T13:47:33.151328Z"},"links":{"citing_paper":"/paper/2505.20972"},"observation_digest":"sha256:683313f99896e769706c4ed633460f7079c2f3745b8f282a0401a1b34d0136c3","observation_id":"9d1786fc-bd8f-4164-a38d-148d91e572f4","resolution":{"observed_at":"2026-08-07T13:47:41.128055Z","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-07T13:47:40.868689Z","title":"Hypergraph- based interference avoidance resource management in customer-centric communication for intelligent cyber- physical transportation systems","venue":null,"work_id":"f063e70c-d764-4170-8b36-454f9119f877","year":2023},"citing_paper":{"arxiv_id":"2505.20972","last_updated":"2025-05-27T10:04:54Z","snapshot_observed_at":"2026-08-07T13:40:28.394564Z","submitted_at":"2025-05-27T10:04:54Z","title":"Deep k-grouping: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs and Hypergraphs","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T13:47:33.248065Z"},"links":{"citing_paper":"/paper/2505.20972"},"observation_digest":"sha256:2be96c94318ca631b9c7a431822a8fd312574181e858f33e4d87b1e0835b3062","observation_id":"73816152-9024-4fc1-98c8-07fb2604ae0f","resolution":{"observed_at":"2026-08-07T13:47:40.967717Z","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-07T13:47:40.679211Z","title":"Uav-assisted emergency communica- tions in social iot: A dynamic hypergraph coloring approach","venue":null,"work_id":"2ee8df14-42b1-470d-b141-c183b7be7454","year":2020},"citing_paper":{"arxiv_id":"2505.20972","last_updated":"2025-05-27T10:04:54Z","snapshot_observed_at":"2026-08-07T13:40:28.394564Z","submitted_at":"2025-05-27T10:04:54Z","title":"Deep k-grouping: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs and Hypergraphs","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T13:47:33.337684Z"},"links":{"citing_paper":"/paper/2505.20972"},"observation_digest":"sha256:6093778ff462cae78ae90fa46a6c46212b990db72e9f3b7c045283920cc49c4c","observation_id":"16af1392-df0d-4fb0-999e-75099044d74e","resolution":{"observed_at":"2026-08-07T13:47:40.786104Z","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-07T13:47:40.242421Z","title":"A grover search-based algorithm for the list coloring problem","venue":null,"work_id":"5e14ce77-a453-4e1c-94ec-022f7adb8ddf","year":2022},"citing_paper":{"arxiv_id":"2505.20972","last_updated":"2025-05-27T10:04:54Z","snapshot_observed_at":"2026-08-07T13:40:28.394564Z","submitted_at":"2025-05-27T10:04:54Z","title":"Deep k-grouping: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs and Hypergraphs","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T13:47:33.415550Z"},"links":{"citing_paper":"/paper/2505.20972"},"observation_digest":"sha256:145c06a2cfcfb0a6898a7ff1b19675e813444127076db0e6f0e06b03d6dc95e2","observation_id":"c37abc7a-3777-4dc0-be05-473d07608a9b","resolution":{"observed_at":"2026-08-07T13:47:40.586240Z","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-07T13:47:39.596131Z","title":"Multilevel hypergraph partitioning: Applica- tion in vlsi domain","venue":null,"work_id":"31cbdd5e-03f6-4b73-ba3a-3d80ef52ef9b","year":1997},"citing_paper":{"arxiv_id":"2505.20972","last_updated":"2025-05-27T10:04:54Z","snapshot_observed_at":"2026-08-07T13:40:28.394564Z","submitted_at":"2025-05-27T10:04:54Z","title":"Deep k-grouping: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs and Hypergraphs","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T13:47:33.541191Z"},"links":{"citing_paper":"/paper/2505.20972"},"observation_digest":"sha256:b2f92cb9f6878c99dd00c89623ac588e2267186fd61c3c9aaea4d25bb3285ee6","observation_id":"f62d2466-5ade-4dc5-b5ab-0275384e5549","resolution":{"observed_at":"2026-08-07T13:47:39.863956Z","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-07T13:47:39.373713Z","title":"Mapart: an efficient multi-fpga system-aware hypergraph partitioning framework","venue":null,"work_id":"2caacb13-483a-436b-becd-fc4e78ea717c","year":2024},"citing_paper":{"arxiv_id":"2505.20972","last_updated":"2025-05-27T10:04:54Z","snapshot_observed_at":"2026-08-07T13:40:28.394564Z","submitted_at":"2025-05-27T10:04:54Z","title":"Deep k-grouping: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs and Hypergraphs","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T13:47:33.626923Z"},"links":{"citing_paper":"/paper/2505.20972"},"observation_digest":"sha256:45cb233200721b0509751571072faf402346a61b1df373a5f1f3dca8ce77b8c9","observation_id":"bca8a654-317d-4204-a2fc-f0ad7c0dec7b","resolution":{"observed_at":"2026-08-07T13:47:39.469689Z","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-07T13:47:39.179345Z","title":"Stochastic shadow detection using a hypergraph partitioning approach","venue":null,"work_id":"f16e2714-7820-4c1c-bdea-bbacf5951775","year":2017},"citing_paper":{"arxiv_id":"2505.20972","last_updated":"2025-05-27T10:04:54Z","snapshot_observed_at":"2026-08-07T13:40:28.394564Z","submitted_at":"2025-05-27T10:04:54Z","title":"Deep k-grouping: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs and Hypergraphs","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T13:47:33.709659Z"},"links":{"citing_paper":"/paper/2505.20972"},"observation_digest":"sha256:6a2ddfec522dc5d8d18e3e357ebcb542a2420c914bc612caa7920b3fb0e1ce9c","observation_id":"53d250d7-bec2-4605-a7cf-9c66c2faedab","resolution":{"observed_at":"2026-08-07T13:47:39.307781Z","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-07T13:47:38.964940Z","title":"A novel adaptive hypergraph neural network for enhancing medical image segmentation","venue":null,"work_id":"ae29d406-d17b-45f5-96ec-13d576c551a0","year":2024},"citing_paper":{"arxiv_id":"2505.20972","last_updated":"2025-05-27T10:04:54Z","snapshot_observed_at":"2026-08-07T13:40:28.394564Z","submitted_at":"2025-05-27T10:04:54Z","title":"Deep k-grouping: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs and Hypergraphs","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T13:47:33.803380Z"},"links":{"citing_paper":"/paper/2505.20972"},"observation_digest":"sha256:e1b490724961fb5ef2a91b0a1a5815d6eb16e2faab281fc006c02e641823908d","observation_id":"76a042ee-781c-4f34-b552-ed77b0721801","resolution":{"observed_at":"2026-08-07T13:47:39.059194Z","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-07T13:47:38.793043Z","title":"Social hash partitioner: a scalable distributed hypergraph partitioner","venue":null,"work_id":"32a1fdc6-b0a8-47c3-986a-265763e471b8","year":2017},"citing_paper":{"arxiv_id":"2505.20972","last_updated":"2025-05-27T10:04:54Z","snapshot_observed_at":"2026-08-07T13:40:28.394564Z","submitted_at":"2025-05-27T10:04:54Z","title":"Deep k-grouping: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs and Hypergraphs","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T13:47:33.920299Z"},"links":{"citing_paper":"/paper/2505.20972"},"observation_digest":"sha256:88e6f97120107d478804e08946847bcbc6ab1c097b7f8c0cf27704706fa18367","observation_id":"09751a78-6a9e-4202-9dcc-fdafb4d0984e","resolution":{"observed_at":"2026-08-07T13:47:38.883954Z","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-07T13:47:38.665645Z","title":"Hepart: A balanced hypergraph partitioning algorithm for big data applications","venue":null,"work_id":"0709009f-ca4d-4148-989f-6b56552f7fd4","year":2018},"citing_paper":{"arxiv_id":"2505.20972","last_updated":"2025-05-27T10:04:54Z","snapshot_observed_at":"2026-08-07T13:40:28.394564Z","submitted_at":"2025-05-27T10:04:54Z","title":"Deep k-grouping: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs and Hypergraphs","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T13:47:34.071454Z"},"links":{"citing_paper":"/paper/2505.20972"},"observation_digest":"sha256:4a74512653d9be0b57099f0847fca180eb0ed761be8a6d3a6dfef388cd2368de","observation_id":"2a338549-2917-4179-8392-fc0b28cd895b","resolution":{"observed_at":"2026-08-07T13:47:38.734338Z","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-07T13:47:38.470773Z","title":"Automated distribution of quantum circuits via hypergraph partitioning","venue":null,"work_id":"7e129d15-52c9-485c-abb0-ea309854695b","year":2019},"citing_paper":{"arxiv_id":"2505.20972","last_updated":"2025-05-27T10:04:54Z","snapshot_observed_at":"2026-08-07T13:40:28.394564Z","submitted_at":"2025-05-27T10:04:54Z","title":"Deep k-grouping: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs and Hypergraphs","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T13:47:34.193871Z"},"links":{"citing_paper":"/paper/2505.20972"},"observation_digest":"sha256:82840cb0d3bea7de35aa6f8438a96b2d13eab9c2dc739441cd29cb8be71a7b2b","observation_id":"902b2082-a820-49f3-af06-d84c3c884ef1","resolution":{"observed_at":"2026-08-07T13:47:38.567680Z","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-07T13:47:38.309797Z","title":"Hyper-optimized tensor network contraction","venue":null,"work_id":"5e7a26d1-71ca-4769-bf9d-aafe0c8ac128","year":2021},"citing_paper":{"arxiv_id":"2505.20972","last_updated":"2025-05-27T10:04:54Z","snapshot_observed_at":"2026-08-07T13:40:28.394564Z","submitted_at":"2025-05-27T10:04:54Z","title":"Deep k-grouping: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs and Hypergraphs","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T13:47:34.281610Z"},"links":{"citing_paper":"/paper/2505.20972"},"observation_digest":"sha256:bba4820f799fe0e268723bbd6bdfab269e45178120a5fc11dbfabbc91d00148f","observation_id":"bf93a945-451d-4fdd-b9bc-498da78473cd","resolution":{"observed_at":"2026-08-07T13:47:38.368308Z","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":{"arxiv_id":"1701.06548","last_updated":"2017-01-23T18:35:28Z","snapshot_observed_at":"2026-08-05T00:39:48.314299Z","submitted_at":"2017-01-23T18:35:28Z","title":"Regularizing Neural Networks by Penalizing Confident Output Distributions","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1701.06548","snapshot_observed_at":"2026-08-07T13:47:34.343432Z","title":"Regularizing neural networks by penalizing confident output distributions","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.20972","last_updated":"2025-05-27T10:04:54Z","snapshot_observed_at":"2026-08-07T13:40:28.394564Z","submitted_at":"2025-05-27T10:04:54Z","title":"Deep k-grouping: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs and Hypergraphs","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T13:47:34.343432Z"},"links":{"cited_paper":"/paper/1701.06548","citing_paper":"/paper/2505.20972"},"observation_digest":"sha256:63ac93b4869372a9cc58758e2861abf99f5fa4b539bcc2f1970b94bec18f6820","observation_id":"e292c983-1f9f-4ccf-bab6-0089b1f7d100","resolution":{"observed_at":"2026-08-07T13:47:34.343432Z","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-07T13:47:38.178561Z","title":"PySCIPOpt: Mathematical programming in python with the SCIP optimization suite","venue":null,"work_id":"5563d324-3a68-4e5f-8222-39e0bf8c73cf","year":2016},"citing_paper":{"arxiv_id":"2505.20972","last_updated":"2025-05-27T10:04:54Z","snapshot_observed_at":"2026-08-07T13:40:28.394564Z","submitted_at":"2025-05-27T10:04:54Z","title":"Deep k-grouping: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs and Hypergraphs","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T13:47:34.436876Z"},"links":{"citing_paper":"/paper/2505.20972"},"observation_digest":"sha256:6a142bb4a8fad054dc00d3c420bff1f50d2da4270923d74bce3ed4c2a9313f64","observation_id":"08ae57f7-6909-4874-aaf9-dbf8ea29ab08","resolution":{"observed_at":"2026-08-07T13:47:38.214156Z","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-07T13:47:38.054891Z","title":"Tabu search","venue":null,"work_id":"6d188d0e-ef29-4ee6-9f61-a9674c08a232","year":1998},"citing_paper":{"arxiv_id":"2505.20972","last_updated":"2025-05-27T10:04:54Z","snapshot_observed_at":"2026-08-07T13:40:28.394564Z","submitted_at":"2025-05-27T10:04:54Z","title":"Deep k-grouping: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs and Hypergraphs","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T13:47:34.553113Z"},"links":{"citing_paper":"/paper/2505.20972"},"observation_digest":"sha256:4d3db0e522e93424d907a6b64225487ab756e7f35032cf8bf99b1b3390b86f2d","observation_id":"7e867263-5659-4886-942b-d7fe573ef397","resolution":{"observed_at":"2026-08-07T13:47:38.118482Z","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-07T13:47:37.865100Z","title":"Scalable high-quality hypergraph partitioning","venue":null,"work_id":"cb65f22a-e693-483b-8cab-a82c21411927","year":2024},"citing_paper":{"arxiv_id":"2505.20972","last_updated":"2025-05-27T10:04:54Z","snapshot_observed_at":"2026-08-07T13:40:28.394564Z","submitted_at":"2025-05-27T10:04:54Z","title":"Deep k-grouping: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs and Hypergraphs","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T13:47:34.633247Z"},"links":{"citing_paper":"/paper/2505.20972"},"observation_digest":"sha256:e9ab45377ed8db1f906772567c9dbd578f476125c53da2b3eae27a4c408eabce","observation_id":"d3decd93-ed46-4793-909d-57f2a6604694","resolution":{"observed_at":"2026-08-07T13:47:37.946517Z","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-07T13:47:34.696635Z","title":"Hgnn+: General hypergraph neural networks.IEEE Transactions on Pattern Analysis and Machine Intelligence, 45(3):3181–3199, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.20972","last_updated":"2025-05-27T10:04:54Z","snapshot_observed_at":"2026-08-07T13:40:28.394564Z","submitted_at":"2025-05-27T10:04:54Z","title":"Deep k-grouping: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs and Hypergraphs","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T13:47:34.696635Z"},"links":{"citing_paper":"/paper/2505.20972"},"observation_digest":"sha256:6aa2770e2340f550297cb599d4dc8828950d8c4ca27dce23418de3e5fe277ed3","observation_id":"9d2f1fed-2756-4ec0-a758-d9822e3fe6df","resolution":{"observed_at":"2026-08-07T13:47:34.696635Z","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-07T13:47:37.698922Z","title":"Hypergraph neural networks","venue":null,"work_id":"eb0b08af-4f6c-4842-9875-6f6bfc5f96b4","year":2019},"citing_paper":{"arxiv_id":"2505.20972","last_updated":"2025-05-27T10:04:54Z","snapshot_observed_at":"2026-08-07T13:40:28.394564Z","submitted_at":"2025-05-27T10:04:54Z","title":"Deep k-grouping: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs and Hypergraphs","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T13:47:34.787990Z"},"links":{"citing_paper":"/paper/2505.20972"},"observation_digest":"sha256:4218db9e9172900cab11f3d04d3e4af6441c0a975ca02a1ad80b70533be9ecb7","observation_id":"729a90ee-8573-4a2a-9a96-06587ce7ade1","resolution":{"observed_at":"2026-08-07T13:47:37.765960Z","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-07T13:47:37.457752Z","title":"Inductive representation learning on large graphs","venue":null,"work_id":"dad87e9f-94e6-49ec-9a44-1f6dc502c058","year":2017},"citing_paper":{"arxiv_id":"2505.20972","last_updated":"2025-05-27T10:04:54Z","snapshot_observed_at":"2026-08-07T13:40:28.394564Z","submitted_at":"2025-05-27T10:04:54Z","title":"Deep k-grouping: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs and Hypergraphs","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T13:47:34.896425Z"},"links":{"citing_paper":"/paper/2505.20972"},"observation_digest":"sha256:1a394f4a2dc3b7049014ecdd439557e0e43b36209f104de9f4e31d93284517d8","observation_id":"d65e9dca-bdbe-41b1-a43e-b65ef32c4a71","resolution":{"observed_at":"2026-08-07T13:47:37.553238Z","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-07T13:47:37.234838Z","title":"Graph attention networks","venue":null,"work_id":"5f09b0bb-bcea-46a3-8260-78b8ac617a47","year":2018},"citing_paper":{"arxiv_id":"2505.20972","last_updated":"2025-05-27T10:04:54Z","snapshot_observed_at":"2026-08-07T13:40:28.394564Z","submitted_at":"2025-05-27T10:04:54Z","title":"Deep k-grouping: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs and Hypergraphs","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T13:47:35.007770Z"},"links":{"citing_paper":"/paper/2505.20972"},"observation_digest":"sha256:12cc53e88e08fc80e8071a8d31d0d351756613fdc02fd105e8cdfba52c61f8b6","observation_id":"3ba97d22-d932-4aff-8ae7-61c85e21c834","resolution":{"observed_at":"2026-08-07T13:47:37.365938Z","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-07T13:47:37.010977Z","title":"Contrastive learning network for unsupervised graph matching","venue":null,"work_id":"d168617b-af40-48e0-82b0-6542d8728c37","year":2024},"citing_paper":{"arxiv_id":"2505.20972","last_updated":"2025-05-27T10:04:54Z","snapshot_observed_at":"2026-08-07T13:40:28.394564Z","submitted_at":"2025-05-27T10:04:54Z","title":"Deep k-grouping: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs and Hypergraphs","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T13:47:35.137190Z"},"links":{"citing_paper":"/paper/2505.20972"},"observation_digest":"sha256:d4de3a0d8525b23d982ef0272db5f54a28e15826218532aaddced1252ebe9e42","observation_id":"421d2bc6-2f16-4751-925f-e85dd42c5005","resolution":{"observed_at":"2026-08-07T13:47:37.093593Z","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-07T13:47:36.835868Z","title":"Improving graph matching with positional reconstruction encoder-decoder network","venue":null,"work_id":"e1c81c5a-ab3e-44b0-9c32-e37edc651259","year":2023},"citing_paper":{"arxiv_id":"2505.20972","last_updated":"2025-05-27T10:04:54Z","snapshot_observed_at":"2026-08-07T13:40:28.394564Z","submitted_at":"2025-05-27T10:04:54Z","title":"Deep k-grouping: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs and Hypergraphs","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T13:47:35.210815Z"},"links":{"citing_paper":"/paper/2505.20972"},"observation_digest":"sha256:2275ff1cd9acf45534c6e5eb9cc51f5b1d7d82e27e3e52327b0350cdaaeb6e60","observation_id":"5c6baf28-8011-4a52-ad29-05f9edc94644","resolution":{"observed_at":"2026-08-07T13:47:36.938242Z","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-07T13:47:36.598105Z","title":"Discrete cycle-consistency based unsupervised deep graph matching","venue":null,"work_id":"9eb9d5bf-3bdc-4ec4-a29d-9baf98bca9d8","year":2024},"citing_paper":{"arxiv_id":"2505.20972","last_updated":"2025-05-27T10:04:54Z","snapshot_observed_at":"2026-08-07T13:40:28.394564Z","submitted_at":"2025-05-27T10:04:54Z","title":"Deep k-grouping: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs and Hypergraphs","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T13:47:35.285020Z"},"links":{"citing_paper":"/paper/2505.20972"},"observation_digest":"sha256:9bd9385fcdb437dcf78741df2c8074dec0915e24c3bf6daa5410b8689b89251b","observation_id":"d86773f3-cc46-448a-b11e-a9012d40be6e","resolution":{"observed_at":"2026-08-07T13:47:36.669497Z","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-07T13:47:36.417174Z","title":"Specpart: A supervised spectral framework for hypergraph partitioning solution improvement","venue":null,"work_id":"719f4e04-41a4-4ab9-8593-793dbfa6c368","year":2022},"citing_paper":{"arxiv_id":"2505.20972","last_updated":"2025-05-27T10:04:54Z","snapshot_observed_at":"2026-08-07T13:40:28.394564Z","submitted_at":"2025-05-27T10:04:54Z","title":"Deep k-grouping: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs and Hypergraphs","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T13:47:35.413361Z"},"links":{"citing_paper":"/paper/2505.20972"},"observation_digest":"sha256:c62b83e29d761bdf8ed37c2442cd6c383e4da96bc777edbe3e1480b99f16732c","observation_id":"4b0a3c10-e3fe-450d-94e7-20ebe429644c","resolution":{"observed_at":"2026-08-07T13:47:36.500763Z","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-07T13:47:36.212193Z","title":"K-specpart: Supervised embedding algorithms and cut overlay for improved hypergraph partitioning","venue":null,"work_id":"6090e0ea-ed25-4e16-b34b-42da8d60de57","year":2023},"citing_paper":{"arxiv_id":"2505.20972","last_updated":"2025-05-27T10:04:54Z","snapshot_observed_at":"2026-08-07T13:40:28.394564Z","submitted_at":"2025-05-27T10:04:54Z","title":"Deep k-grouping: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs and Hypergraphs","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T13:47:35.523217Z"},"links":{"citing_paper":"/paper/2505.20972"},"observation_digest":"sha256:978cc2155ce4cd49253017586f86b67a969db4b3ce08757955d46708be6c8b1b","observation_id":"f402bb2d-1db6-4d42-9f3d-d94855357036","resolution":{"observed_at":"2026-08-07T13:47:36.321941Z","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-07T13:47:36.059730Z","title":"Hypergraph partitioning with embeddings","venue":null,"work_id":"02592ad5-7cbd-45dd-98fb-ca9be3bcb926","year":2022},"citing_paper":{"arxiv_id":"2505.20972","last_updated":"2025-05-27T10:04:54Z","snapshot_observed_at":"2026-08-07T13:40:28.394564Z","submitted_at":"2025-05-27T10:04:54Z","title":"Deep k-grouping: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs and Hypergraphs","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T13:47:35.630700Z"},"links":{"citing_paper":"/paper/2505.20972"},"observation_digest":"sha256:d28b4e619f77e3d26523d263cf274f8d3c0341f32341a7550007c553d3f2257e","observation_id":"47375259-df35-4c8f-b7b1-10aad1ba1ad8","resolution":{"observed_at":"2026-08-07T13:47:36.103511Z","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-07T13:47:35.848213Z","title":null,"venue":null,"work_id":"80c1e842-7cf1-4b98-bbb5-1043edb40e00","year":2025},"citing_paper":{"arxiv_id":"2505.20972","last_updated":"2025-05-27T10:04:54Z","snapshot_observed_at":"2026-08-07T13:40:28.394564Z","submitted_at":"2025-05-27T10:04:54Z","title":"Deep k-grouping: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs and Hypergraphs","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T13:47:35.736530Z"},"links":{"citing_paper":"/paper/2505.20972"},"observation_digest":"sha256:b92b1ea0253d78b7d3bdca13763df7709e59f5edfd1a580d7713621c7933080b","observation_id":"c7e7a75b-c328-4154-970b-ce6e5e49ff8d","resolution":{"observed_at":"2026-08-07T13:47:35.950032Z","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"}}],"paper":{"arxiv_id":"2505.20972","last_updated":"2025-05-27T10:04:54Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T13:40:28.394564Z","submitted_at":"2025-05-27T10:04:54Z","title":"Deep k-grouping: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs and Hypergraphs"},"reference_resolution":{"displayed":43,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":0,"verified_fuzzy":39},"total_outbound_references":43},"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 43 of 43 outbound references and 0 inbound Pith citation observations for arXiv:2505.20972."}