{"as_of":"2026-08-18T05:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c7ac5ca7236bb851207b88be83ef47b95b2ed825935182418f42545c4027bf1a","coverage":[{"denominator":79,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":79,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T17:16:31.694824Z","state":"measured"},{"denominator":83,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":83,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T04:13:54.975975Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-24T06:03:58.096011Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"cited_work":{"arxiv_id":"2502.05981","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.05981","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"55c3e50a-2459-4ccd-ac6e-ca25d057aab0","year":2025},"citing_paper":{"arxiv_id":"2311.10433","last_updated":"2026-04-28T18:26:03Z","snapshot_observed_at":"2026-08-14T13:13:30.401784Z","submitted_at":"2023-11-17T10:10:46Z","title":"Task Scheduling Optimization with Direct Constraints from a Tensor Network Perspective","version":4},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-05-24T06:01:35.666365Z"},"links":{"cited_paper":"/paper/2502.05981","citing_paper":"/paper/2311.10433"},"observation_digest":"sha256:00e9bcbbc10e125958f97e34b38a06b7aa249d72bf17eab4545b2ebdaaa9d6f3","observation_id":"14667945-33f8-4997-8d16-42bb8c90b3bc","resolution":{"observed_at":"2026-05-24T06:03:58.099537Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.05981","snapshot_observed_at":"2026-08-16T04:13:54.975975Z","title":"31 FTNILO: Explicit Multivariate Function Inversion, Optimization and Counting, Cryptography Weakness and Riemann Hypothesis Solution equation with Tensor Networks","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.05493","last_updated":"2025-05-03T18:12:44Z","snapshot_observed_at":"2026-08-18T01:47:49.007039Z","submitted_at":"2025-05-03T18:12:44Z","title":"FTNILO: Explicit Multivariate Function Inversion, Optimization and Counting, Cryptography Weakness and Riemann Hypothesis Solution Equation with Tensor Networks","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-16T04:13:54.975975Z"},"links":{"cited_paper":"/paper/2502.05981","citing_paper":"/paper/2505.05493"},"observation_digest":"sha256:88295ed9527068ddaa47b960c96d14b44b1919d621aa12dc1afa283242e043cc","observation_id":"967d55e9-6f83-470f-9d31-d8d519ffc0fe","resolution":{"observed_at":"2026-08-16T04:13:54.975975Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"cited_work":{"arxiv_id":"2502.05981","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.05981","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"55c3e50a-2459-4ccd-ac6e-ca25d057aab0","year":2025},"citing_paper":{"arxiv_id":"2508.00907","last_updated":"2026-04-30T07:53:34Z","snapshot_observed_at":"2026-08-17T09:26:58.977382Z","submitted_at":"2025-07-29T10:38:51Z","title":"Prime Factorization Equation from a Tensor Network Perspective","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-19T03:16:45.449657Z"},"links":{"cited_paper":"/paper/2502.05981","citing_paper":"/paper/2508.00907"},"observation_digest":"sha256:5012ce627a2052a002e64ebc3ea50b07ca28b50fdca33912946c9db89944ef91","observation_id":"7ca4496c-6162-4715-a9a8-e64d28fa841a","resolution":{"observed_at":"2026-05-19T03:17:00.729291Z","resolver_source":"arxiv_id","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.05981","snapshot_observed_at":"2026-08-03T14:24:36.211111Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2512.20613","last_updated":"2026-07-09T11:03:32Z","snapshot_observed_at":"2026-08-15T06:17:20.654360Z","submitted_at":"2025-12-23T18:58:35Z","title":"Variational matrix product states for combinatorial optimization","version":2},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-03T14:24:36.211111Z"},"links":{"cited_paper":"/paper/2502.05981","citing_paper":"/paper/2512.20613"},"observation_digest":"sha256:c1595af4bf7d793b47d22afb10fa9ff30105f019d885c7d1f4385c9e755b2752","observation_id":"bfa45dfe-05cf-4ab6-8c2a-7c9fcf054896","resolution":{"observed_at":"2026-08-03T14:24:36.211111Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2502.05981/citation-record","integrity":"/paper/2502.05981/integrity","json":"/paper/2502.05981/citation-record.json","paper":"/paper/2502.05981"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"8914.26975","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T17:16:33.272597Z","title":"Inverse combinatorial optimization: A survey on problems, methods, and results","venue":null,"work_id":"6aaf34f7-66a4-4fe8-a4f1-3a9989b62e47","year":2004},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.382337Z"},"links":{"citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:f9964d8942e7285260edef4fcb6b3fb6b9269edd3c7e9e19fc7d950feda80332","observation_id":"e38f69d1-5acc-49b7-9096-e12d3e52071d","resolution":{"observed_at":"2026-08-08T17:16:33.282537Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08T17:16:31.386572Z","title":null,"venue":null,"work_id":null,"year":1978},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.386572Z"},"links":{"citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:15a1b793c2d893cef1b2b51d2cd2d904fd3bd1af145240125accd8db4ff8c127","observation_id":"2a8bc2e8-2ebc-4a57-aa3c-b9e5bf131c7a","resolution":{"observed_at":"2026-08-08T17:16:31.386572Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2205.02744","last_updated":"2022-05-05T16:24:29Z","snapshot_observed_at":"2026-08-16T17:02:20.064847Z","submitted_at":"2022-05-05T16:24:29Z","title":"Streaming and Sketching Complexity of CSPs: A survey","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.02744","snapshot_observed_at":"2026-08-08T17:16:31.390823Z","title":"Streaming and sketching complexity of csps: A survey, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.390823Z"},"links":{"cited_paper":"/paper/2205.02744","citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:98b3a148eec884e8c59ca8b8de48505f8110e7c5f3b88fb44028746fab6cbf5e","observation_id":"bd35a273-4800-4543-b60b-44ef290874d1","resolution":{"observed_at":"2026-08-08T17:16:31.390823Z","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-08T17:16:33.497229Z","title":"The n-queens problem, 2021","venue":null,"work_id":"c2fc68b5-ff0a-4f7f-b1fb-db890abcb9d7","year":2021},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.395337Z"},"links":{"citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:988149275b5b3e14798d753e50f166ef4784c2fa7941da74b1db17b2722b3a8e","observation_id":"5bde4c0d-601e-4089-8cc9-8b4818fc6c06","resolution":{"observed_at":"2026-08-08T17:16:33.501220Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.00075","last_updated":"2024-08-24T07:20:29Z","snapshot_observed_at":"2026-08-16T13:24:10.170542Z","submitted_at":"2024-08-24T07:20:29Z","title":"A survey on combinatorial optimization","version":1},"cited_work":{"arxiv_id":"2409.00075","doi":null,"metadata_source":"pith","pith_arxiv_id":"2409.00075","snapshot_observed_at":"2026-08-08T17:16:33.043034Z","title":"A survey on combinatorial optimization","venue":"math.OC","work_id":"96a84e57-f7ea-45cb-b42c-0dde12e7652c","year":2024},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.403111Z"},"links":{"cited_paper":"/paper/2409.00075","citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:e0c97fd58dc0cacb36ef86c8460e08e9a0f50f554ae79a856e769c7f392f4dfe","observation_id":"bc3bee52-4e61-4e2d-9b20-6755b8151808","resolution":{"observed_at":"2026-08-08T17:16:33.047485Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/tssc","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T17:16:33.023525Z","title":"Hart, Nils J","venue":null,"work_id":"307043e3-1d8b-4db9-b7f8-561af772f3fc","year":1968},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.407650Z"},"links":{"citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:e3dcc6f466b013f4ba6e43f4e837bd7307154c9e1f5a283979dca11b66560909","observation_id":"87ba2861-2045-46c8-a9db-cb96031385aa","resolution":{"observed_at":"2026-08-08T17:16:33.027779Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08T17:16:33.485024Z","title":null,"venue":null,"work_id":"a866db5b-f7da-4f45-88aa-75f07145f49a","year":null},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.411433Z"},"links":{"citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:27d0278530ff60cca11350ecc6172d00f2a61fd853fa1be86ee9e68375ac0fbf","observation_id":"4ada4599-712e-4612-8f9a-301817874ae5","resolution":{"observed_at":"2026-08-08T17:16:33.488744Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08T17:16:31.419388Z","title":"The traveling salesman problem: An overview of exact and approximate algorithms","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.419388Z"},"links":{"citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:03d59cfeb89d4e970564aa3e689fce5f265f92ceae9ecabc96736e90243867a4","observation_id":"09e5e9d9-a5b1-49da-9d65-d48554db29b0","resolution":{"observed_at":"2026-08-08T17:16:31.419388Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T17:16:31.425713Z","title":"Springer Berlin Heidelberg, Berlin, Heidelberg, 2008","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.425713Z"},"links":{"citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:271113f706632c613a622f06634dcb3f18ba6da4fbf371e46694ccc0531eaf65","observation_id":"2a29cffb-5492-476d-b47f-6e20d1d60970","resolution":{"observed_at":"2026-08-08T17:16:31.425713Z","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-08T17:16:33.473169Z","title":"A survey on the traveling salesman problem and its variants in a warehousing context","venue":null,"work_id":"b2bbd334-2857-4232-9d2c-42ad43258df4","year":2024},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.429880Z"},"links":{"citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:f471f8615b0aadd8cad5d1433538e10eb16b39e21a7a7243e95a56fe0d4f2610","observation_id":"54b80ea3-6a37-4ed1-9229-da754a8f0e34","resolution":{"observed_at":"2026-08-08T17:16:33.477089Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08T17:16:33.462267Z","title":null,"venue":null,"work_id":"b5409e44-5cfd-446f-a1b2-2cb03744fa7a","year":1992},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.437222Z"},"links":{"citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:5e7a831e00dde2a1110cd174dca6fff6440f5e086f55409e9daa27094fb71b17","observation_id":"e5d89ce6-9b5f-427b-a584-31c0be8a3f09","resolution":{"observed_at":"2026-08-08T17:16:33.466046Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08T17:16:33.450318Z","title":"The flexible job shop schedul- ing problem: A review","venue":null,"work_id":"54b62fb5-d356-4d71-bcf7-758ce46c48f2","year":2024},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.441356Z"},"links":{"citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:c04c79fc7aac871fbcf8c36db0d6465b7e5dc72dcb506e8705952b4571c0f625","observation_id":"58be75c9-4557-4a2f-a704-eb63a27b65de","resolution":{"observed_at":"2026-08-08T17:16:33.454569Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08T17:16:33.438207Z","title":null,"venue":null,"work_id":"c4f4148c-2977-43fb-b48f-54999241d893","year":1976},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.448970Z"},"links":{"citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:fb983a7f68771ea1b5d83a73a03e425121252dc28decef4f8f2100b5f6b68405","observation_id":"db0c4826-dbcc-485e-8bec-8ddcf27a2363","resolution":{"observed_at":"2026-08-08T17:16:33.442277Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08T17:16:31.452920Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.452920Z"},"links":{"citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:55a452e674797ccf76b735a43bca207e9827fdde8b9eb5032f1a23b906eb28ae","observation_id":"70af0587-0395-4229-88d6-a302c6d2a41e","resolution":{"observed_at":"2026-08-08T17:16:31.452920Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T17:16:31.445138Z","title":"URL https://www.sciencedirect.com/science/ article/pii/S037722172300382X","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.445138Z"},"links":{"citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:c96acf1a20f6e67ed5e09e55c3612e647e726fce8503edf2d494fe7675206290","observation_id":"fc4fe981-afb5-4c71-b0b7-2b046b1659c8","resolution":{"observed_at":"2026-08-08T17:16:31.445138Z","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-08T17:16:33.424847Z","title":"Bin-Packing, pages 407–422","venue":null,"work_id":"7fb2f092-633e-435c-8dab-88078c346ba3","year":null},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.461266Z"},"links":{"citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:9aa31822f93fa893e25181179e720ae8d8d47212370fdb49746d0c342fdb0ed2","observation_id":"cdc897ed-9e87-485e-9e5d-0b99d585cc62","resolution":{"observed_at":"2026-08-08T17:16:33.429433Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08T17:16:31.470341Z","title":"A review on genetic algorithm: past, present, and future","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.470341Z"},"links":{"citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:571060059671d461454e00681fddc032eaaa15a21338cc29aed4a0152ac8d9e8","observation_id":"8184388a-9055-44e0-85c2-65b039a2240f","resolution":{"observed_at":"2026-08-08T17:16:31.470341Z","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":"10.17577/ijertv6is030189","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Minimal spanning tree","venue":"International Journal of Engineering Research and","work_id":"8ab7feae-24dc-448e-93be-562768c770ca","year":2017},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.456960Z"},"links":{"citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:56f58c4c9d22cd882d42fc497def96124a08910488b7ccbdbe405a04282ab80d","observation_id":"6bd0632f-407a-461f-a913-1dcd1d18ed3f","resolution":{"observed_at":"2026-08-08T17:16:31.981040Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1038/s41534-024-00856-3","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Krayenhoff, Yoshitaka Inui, Edwin Ng, Tatsuhiro Onodera, Pooya Ronagh, and Yoshihisa Yamamoto","venue":"npj Quantum Information","work_id":"5daa8e64-9420-492a-b5b6-df374a06a699","year":2024},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.477790Z"},"links":{"citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:c03b7fde09b386401d1ce66f5fc621652f7a0b0254520ee1606f37aaf59a6ab9","observation_id":"897832cc-8636-4d06-b44d-8d7e74eb7484","resolution":{"observed_at":"2026-08-08T17:16:31.938129Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.14054","last_updated":"2025-03-05T13:34:11Z","snapshot_observed_at":"2026-08-16T13:58:56.692992Z","submitted_at":"2024-04-22T10:10:29Z","title":"Solving Combinatorial Optimization Problems with a Block Encoding Quantum Optimizer","version":3},"cited_work":{"arxiv_id":"2404.14054","doi":null,"metadata_source":"pith","pith_arxiv_id":"2404.14054","snapshot_observed_at":"2026-08-08T17:16:32.959851Z","title":"Solving Combinatorial Optimization Problems with a Block Encoding Quantum Optimizer","venue":"quant-ph","work_id":"e9c78f90-77fe-482b-ada1-c5ed35a68b78","year":2024},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.481386Z"},"links":{"cited_paper":"/paper/2404.14054","citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:bcde5a4576f45d3b6273215af0512130d6a7368dc1643b7b3e3b77db77dd9ee3","observation_id":"5544a2fc-1892-4427-b981-93a53f376e56","resolution":{"observed_at":"2026-08-08T17:16:32.964800Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08T17:16:31.485140Z","title":"An introduction to variational quantum algorithms for combinatorial optimization problems","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.485140Z"},"links":{"citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:f7b2e176f49c2c220d2257f47935bc7190d72e49ed3eee53f86707ef01f4f4b4","observation_id":"cef79e82-ffea-410d-a0f5-7b241b3763c7","resolution":{"observed_at":"2026-08-08T17:16:31.485140Z","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":"10.1137/0403025","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"On approximate solutions for combinatorial optimization problems.SIAM Journal on Discrete Mathematics, 3(2):294–310, 1990","venue":"SIAM Journal on Discrete Mathematics","work_id":"1ba89b1a-ce7b-479a-9a3f-3b84fe007496","year":1990},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.473869Z"},"links":{"citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:1ac0eb955a805e8cd9f48297d9b704a181f28baac1eb632adf15957c10f61fad","observation_id":"042aac3b-4859-4c5c-9dc5-42a2954ed142","resolution":{"observed_at":"2026-08-08T17:16:31.951541Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08T17:16:31.492577Z","title":"A quantum approximate optimization algorithm, 2014","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.492577Z"},"links":{"citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:cd45960e817dce768e98e8fe4ddf27957786fbf4cd4795327d4fed08d7c6c437","observation_id":"ad4bfde1-46ce-40e6-b893-939c97534bd8","resolution":{"observed_at":"2026-08-08T17:16:31.492577Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T17:16:31.496951Z","title":"A tutorial on formulating and using qubo models, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.496951Z"},"links":{"citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:e4c2d3527ad46ca243680bc828fa0879f94bea490523842ab5b92cd4e5213387","observation_id":"40b57d13-4809-4028-843b-9da27c17b606","resolution":{"observed_at":"2026-08-08T17:16:31.496951Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T17:16:31.501366Z","title":"Limitations of noisy quantum devices in computational and entangling power, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.501366Z"},"links":{"citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:e0be24dd3a16c754139e36e9f79f0b597dc689318c72f30b1c6979779cf65c1a","observation_id":"abf84cc5-a08f-4da0-a7fd-9a1ef55113c7","resolution":{"observed_at":"2026-08-08T17:16:31.501366Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.16986","last_updated":"2025-01-28T14:35:46Z","snapshot_observed_at":"2026-08-16T12:58:35.936340Z","submitted_at":"2025-01-28T14:35:46Z","title":"Generative quantum combinatorial optimization by means of a novel conditional generative quantum eigensolver","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.16986","snapshot_observed_at":"2026-08-08T17:16:31.488806Z","title":"Generative quantum combinatorial optimization by means of a novel conditional generative quantum eigensolver, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.488806Z"},"links":{"cited_paper":"/paper/2501.16986","citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:6c9fe1656c213b3fe6b585e2b41585c70440f2f3a2232bbfef9fad192a6f9361","observation_id":"2e32d71a-78d3-409c-902d-f6f6bee02015","resolution":{"observed_at":"2026-08-08T17:16:31.488806Z","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":"10.22331/q-2023-03-30-964","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":null,"venue":"Quantum","work_id":"84eee123-dad8-4f3b-8082-ae41c251d945","year":2023},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.508822Z"},"links":{"citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:05ba6759e6d5c0bb9c983b773d86b9e6070108666ed932656d6543a52d9e0ef3","observation_id":"df777ea4-d518-4118-b4c3-57dd6eb83f23","resolution":{"observed_at":"2026-08-08T17:16:31.919996Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08T17:16:33.394192Z","title":"Ttopt: a maximum volume quantized tensor train-based optimization and its application to reinforcement learning","venue":null,"work_id":"0d0374ba-7a5e-4c4a-a2d5-9f3e1762a7f2","year":2022},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.512506Z"},"links":{"citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:6fbbcc29f60e3c4840f10d644cc8fc16c95a5839fb13282f1ec7928aec89cd2d","observation_id":"8c2c1d3f-0647-419b-9b4f-7990433a34c1","resolution":{"observed_at":"2026-08-08T17:16:33.398351Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2022.90659","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T17:16:32.849343Z","title":"A quantum-inspired tensor network algorithm for constrained combinatorial optimization problems","venue":null,"work_id":"89ace562-1e6b-48ae-b897-1f8c3eb588df","year":2022},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.515883Z"},"links":{"citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:becf405a44fc9c105d3a91414658a29c8094efb1a47553ff56c2b7408a630a3f","observation_id":"e33c1a30-fb0b-49aa-9da8-015e9b0bce42","resolution":{"observed_at":"2026-08-08T17:16:32.855309Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1708.00006","last_updated":"2017-07-31T18:00:02Z","snapshot_observed_at":"2026-08-14T20:44:08.551444Z","submitted_at":"2017-07-31T18:00:02Z","title":"Tensor Networks in a Nutshell","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1708.00006","snapshot_observed_at":"2026-08-08T17:16:31.504852Z","title":"Tensor networks in a nutshell, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.504852Z"},"links":{"cited_paper":"/paper/1708.00006","citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:79997d3e960c733b53a8213b2313cbde69ee4472308eb6fefd457c2c50407ce4","observation_id":"b7af4e6e-d432-446d-9c42-c45dda809b60","resolution":{"observed_at":"2026-08-08T17:16:31.504852Z","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":"10.1088/2632-2153/ace0f5","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Symmetric tensor networks for generative modeling and constrained combinatorial optimization","venue":"Machine Learning Science and Technology","work_id":"cefee6fe-5534-46bc-a1a0-d10aaca09c3e","year":2023},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.523514Z"},"links":{"citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:4a87e8e5dcd6570b5460e26844c621641e60417218a7b399f4078074d53289fa","observation_id":"f5e42eab-80ec-452f-9f8c-46c2b6eff3b2","resolution":{"observed_at":"2026-08-08T17:16:31.909226Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1038/s41467-024-46959-5","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Kalayci, and Alejandro Perdomo-Ortiz","venue":"Nature Communications","work_id":"06b66f52-8039-4b86-a0d2-538899696190","year":2024},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.527240Z"},"links":{"citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:4c1a9af453c9e2f9ba2b82db8873fb232bfcb8856f7670fbda07ce23a6648e78","observation_id":"8b765226-8566-4f7f-9f89-e0d6d027d87e","resolution":{"observed_at":"2026-08-08T17:16:31.897537Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2012.02430","last_updated":"2022-04-20T22:24:00Z","snapshot_observed_at":"2026-08-16T19:01:02.944427Z","submitted_at":"2020-12-04T06:35:41Z","title":"Tensor Network Quantum Simulator With Step-Dependent Parallelization","version":2},"cited_work":{"arxiv_id":"2012.02430","doi":null,"metadata_source":"pith","pith_arxiv_id":"2012.02430","snapshot_observed_at":"2026-08-08T17:16:32.766286Z","title":"Tensor Network Quantum Simulator With Step-Dependent Parallelization","venue":"quant-ph","work_id":"290da430-e7d8-4311-9d39-f3584bf6dc3c","year":2020},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.530734Z"},"links":{"cited_paper":"/paper/2012.02430","citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:b9de19cd460befb96a02bc16b1caaa899307e6f888a35bd94ddb2a5a9b4d6061","observation_id":"4f917ab0-5b20-48ad-9999-721e81212e6b","resolution":{"observed_at":"2026-08-08T17:16:32.771589Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.01699","last_updated":"2025-07-13T11:30:02Z","snapshot_observed_at":"2026-08-17T17:33:32.464398Z","submitted_at":"2024-09-03T08:36:23Z","title":"Quick design of feasible tensor networks for constrained combinatorial optimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.01699","snapshot_observed_at":"2026-08-08T17:16:31.519531Z","title":"Quick design of feasible tensor networks for constrained combinatorial optimization, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.519531Z"},"links":{"cited_paper":"/paper/2409.01699","citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:0d05cb10f9dd8ef00a3c182f7ca87153184f51831cd28fd1a0b5ae68d8ec8659","observation_id":"f2eef250-224b-4928-ab93-0444eca82736","resolution":{"observed_at":"2026-08-08T17:16:31.519531Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.19987","last_updated":"2024-07-29T13:20:11Z","snapshot_observed_at":"2026-08-16T13:30:14.224547Z","submitted_at":"2024-07-29T13:20:11Z","title":"HOBOTAN: Efficient Higher Order Binary Optimization Solver with Tensor Networks and PyTorch","version":1},"cited_work":{"arxiv_id":"2407.19987","doi":null,"metadata_source":"pith","pith_arxiv_id":"2407.19987","snapshot_observed_at":"2026-08-08T17:16:32.729597Z","title":"HOBOTAN: Efficient Higher Order Binary Optimization Solver with Tensor Networks and PyTorch","venue":"cs.MS","work_id":"5b84d2f9-54a0-4a00-8651-636acf3928ab","year":2024},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.539236Z"},"links":{"cited_paper":"/paper/2407.19987","citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:63702d0eac05678fbfdbbc7fbab0d8b958d5e1593b9ebf754fc9667d25d28611","observation_id":"bef38315-bce5-4d15-912f-a509edf9aeaf","resolution":{"observed_at":"2026-08-08T17:16:32.734221Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.14344","last_updated":"2026-05-15T16:42:52Z","snapshot_observed_at":"2026-08-17T23:11:02.025783Z","submitted_at":"2023-11-24T08:41:02Z","title":"Tensor-Network Formulation of the Traveling Salesman Problem and Variants","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.14344","snapshot_observed_at":"2026-08-08T17:16:31.542957Z","title":"de Leceta","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.542957Z"},"links":{"cited_paper":"/paper/2311.14344","citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:2df8a2ca63daaab0debf80eac87c1c22f3408f97f16a4b9b9fdecd5bd3959b2e","observation_id":"a5f23e14-b9e0-4550-9ae6-de94ab531da7","resolution":{"observed_at":"2026-08-08T17:16:31.542957Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.10433","last_updated":"2026-04-28T18:26:03Z","snapshot_observed_at":"2026-08-14T13:13:30.401784Z","submitted_at":"2023-11-17T10:10:46Z","title":"Task Scheduling Optimization with Direct Constraints from a Tensor Network Perspective","version":4},"cited_work":{"arxiv_id":"2311.10433","doi":null,"metadata_source":"pith","pith_arxiv_id":"2311.10433","snapshot_observed_at":"2026-08-08T17:16:32.703576Z","title":"Task Scheduling Optimization with Direct Constraints from a Tensor Network Perspective","venue":"quant-ph","work_id":"d2d3512d-1263-49a6-bf35-d25263db715c","year":2023},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.546766Z"},"links":{"cited_paper":"/paper/2311.10433","citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:c560a23c48e6a6ed6a2d72f846d55f6c0fae38aef995ac4f6f82cab8d86e9f86","observation_id":"f4bbb422-d82f-46ba-b2c3-83433150c02b","resolution":{"observed_at":"2026-08-08T17:16:32.707732Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.16106","last_updated":"2024-07-23T00:33:34Z","snapshot_observed_at":"2026-08-17T13:05:13.425465Z","submitted_at":"2024-07-23T00:33:34Z","title":"Tensor Network Based HOBO Solver","version":1},"cited_work":{"arxiv_id":"2407.16106","doi":null,"metadata_source":"pith","pith_arxiv_id":"2407.16106","snapshot_observed_at":"2026-08-08T17:16:32.747683Z","title":"Tensor Network Based HOBO Solver","venue":"quant-ph","work_id":"f99e4840-0dd1-439d-bb25-0c3ff98eae19","year":2024},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.534950Z"},"links":{"cited_paper":"/paper/2407.16106","citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:4902c8b67d70308721f43520b147872926db24c48a009a18b2b8088663920d91","observation_id":"feb8c2dc-73d1-45a7-b6ca-d17ce65d721b","resolution":{"observed_at":"2026-08-08T17:16:32.752996Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08T17:16:31.554881Z","title":"Johnson, Eduardo R","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.554881Z"},"links":{"citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:86cd644c7af2dc900c5aac968f05a46a78167631e264910f61013835f32281fb","observation_id":"38d16817-52aa-414c-97b3-167ce4461941","resolution":{"observed_at":"2026-08-08T17:16:31.554881Z","resolver_source":null,"status":"malformed_identifier"},"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-08T17:16:33.380924Z","title":null,"venue":null,"work_id":"f3acfd22-e287-4340-af7e-76ba9d31ce9a","year":1985},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.558644Z"},"links":{"citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:d67ebe41338f55e802132f0eff746f80415828dd4140c657583630e15df4968d","observation_id":"829c90ec-f0de-4553-8eff-dbd7914e314e","resolution":{"observed_at":"2026-08-08T17:16:33.384917Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1088/1402-4896/ad9fb6","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Algebraic language for the efficient representation and optimization of quantum circuits","venue":"Physica Scripta","work_id":"c1b14891-ee60-4c43-8f84-4aba1c5bcc10","year":2025},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.562749Z"},"links":{"citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:8d2fddcffe0e500cf4b4ba1ef7aadb1ca967b8a3fac4625643c79a354e21111e","observation_id":"3bbcecb5-f1a6-44c9-9962-f3dec1d97184","resolution":{"observed_at":"2026-08-08T17:16:31.878702Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2309.10509","last_updated":"2025-07-15T21:32:14Z","snapshot_observed_at":"2026-08-17T15:52:58.550275Z","submitted_at":"2023-09-19T10:45:15Z","title":"Polynomial-time Solver of Tridiagonal QUBO, QUDO and Tensor QUDO problems with Tensor Networks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.10509","snapshot_observed_at":"2026-08-08T17:16:31.550996Z","title":"de Leceta","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.550996Z"},"links":{"cited_paper":"/paper/2309.10509","citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:fe550de58ec7475a81b8446a86a52c7f576c9f212cd9e04c0f77fa17d22bc417","observation_id":"c6fbf0a7-a42a-4ac2-b185-cae747be7e3d","resolution":{"observed_at":"2026-08-08T17:16:31.550996Z","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-08T17:16:33.358033Z","title":"Chakrabarti","venue":null,"work_id":"83273f3e-d5a5-43e8-8ae2-ee7258f5469b","year":null},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.574142Z"},"links":{"citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:9f636ef300261c9471108c8a578a5971cf5c6de676c8d743732e3f6ec04dfbae","observation_id":"2629240e-9598-4aad-9cc4-7d71c2068472","resolution":{"observed_at":"2026-08-08T17:16:33.361597Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08T17:16:31.582426Z","title":null,"venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.582426Z"},"links":{"citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:687942a94b64a6cd621c6830efbfbf88edaeca5341d08449553b7583e32d48d2","observation_id":"1a037b89-1fb5-424f-a65b-4cfe5a1d694e","resolution":{"observed_at":"2026-08-08T17:16:31.582426Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T17:16:31.586139Z","title":"Optimizing Variational Circuits for Higher-Order Binary Optimization","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.586139Z"},"links":{"citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:aa199b336db443a0e4c47929ee4e67f34f06b84b154e3e7208fc9e0fca715e73","observation_id":"c5739afe-20fd-491b-8cbc-fa1dd0a13a1d","resolution":{"observed_at":"2026-08-08T17:16:31.586139Z","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-08T17:16:33.369568Z","title":null,"venue":null,"work_id":"0cd694a7-b563-4a8c-960e-559c16d1ca26","year":null},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.566569Z"},"links":{"citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:7559ed5ab1ddd0d55bfbb82eb401301b973bd9af8de886c27ebc3d1724c134aa","observation_id":"01afffb5-3d37-4584-bd04-6514200298a8","resolution":{"observed_at":"2026-08-08T17:16:33.373536Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08T17:16:31.598158Z","title":"Quantum Algorithms for Graph Coloring and Other Partitioning, Covering, and Packing Problems","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.598158Z"},"links":{"citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:d4af041f24ab02e0853159c0f97e9785fce8ef3560f1f2c5a30a2f04f19bcb98","observation_id":"9662042b-4a6b-4c50-9a08-7078c43f86ee","resolution":{"observed_at":"2026-08-08T17:16:31.598158Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/s0004-3702(98)00086-1","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":null,"venue":"Artificial Intelligence","work_id":"2287659d-aaa6-4ac8-8508-e9156743e829","year":1998},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.601690Z"},"links":{"citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:497398bf65a18b8b578c0c27b16593b2d11bc64c2021a5d3d31aca190494c7c4","observation_id":"1b0fcc7d-0399-4e1c-af67-ac3704d48b3c","resolution":{"observed_at":"2026-08-08T17:16:31.842548Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s11590-023-02029-1","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":null,"venue":"Optimization Letters","work_id":"ed4c886c-e4d3-420f-8a34-ae5c7998e3d4","year":2024},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.605318Z"},"links":{"citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:c9ba12576caf51e8224d87af3e83421f7b1bb263c5c29f1da7849981e0f6a10d","observation_id":"58bf7843-631b-490c-96f9-c2f2e6bbb4bc","resolution":{"observed_at":"2026-08-08T17:16:31.830815Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08T17:16:33.332674Z","title":"Quantum Annealing and GNN for Solving TSP with QUBO, page 134–145","venue":null,"work_id":"3e5393b7-3535-4b29-b883-365be1ed7be2","year":null},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.608844Z"},"links":{"citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:63404a34a7bc591ea6000ee7a75357251d3e7bc1260ab82118cb9e5ecac298b3","observation_id":"6d3a2963-c77a-41d3-8509-1f3c3d5d5d85","resolution":{"observed_at":"2026-08-08T17:16:33.337342Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08T17:16:31.616194Z","title":"The truck dispatching problem","venue":null,"work_id":null,"year":1959},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.616194Z"},"links":{"citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:f9c71293a64f141cf147b94bfc6583c98a3ba9d68d6817029bbf825a94a012ce","observation_id":"b9ecd621-bc2d-42fc-8467-40ffb35bd714","resolution":{"observed_at":"2026-08-08T17:16:31.616194Z","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-08T17:16:33.346491Z","title":"Quantum algorithm for higher-order unconstrained binary optimization and mimo maximum likelihood detection","venue":null,"work_id":"65a71320-61bd-4b5e-8044-15fa3380ba77","year":1926},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.589665Z"},"links":{"citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:40538c3ac761421d544b3d364cfbce5e4f72b37f7304450c2f81278b559c944c","observation_id":"1dc1926a-1910-419b-bad9-e3b67dfeb52d","resolution":{"observed_at":"2026-08-08T17:16:33.350754Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s42484-023-00111-6","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Pion, Christian F","venue":"Quantum Machine Intelligence","work_id":"2c92015e-ca2d-4956-a496-bd20a3eeb90a","year":2023},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.623353Z"},"links":{"citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:108e30ef19058962846d3fa520786aef2c1d4619bf3e16de478bac02df140f77","observation_id":"15dbb079-f7f7-4454-8943-a5df31b4eb32","resolution":{"observed_at":"2026-08-08T17:16:31.802294Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08T17:16:33.311939Z","title":null,"venue":null,"work_id":"4d63e4d8-f1f7-467b-b2c5-a7216e7b2b48","year":1955},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.627013Z"},"links":{"citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:b8585c87725b3cd759cccf9077cb51e6911ea148fa68dd25dbeefefb9f5dc5e5","observation_id":"70f9c894-6d53-4464-b7d6-cfc8e13ed401","resolution":{"observed_at":"2026-08-08T17:16:33.316071Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2020.30310","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T17:16:32.447171Z","title":"Michaels","venue":null,"work_id":"cdba4ca8-ee19-4072-aaf5-e56520eec480","year":2020},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.630623Z"},"links":{"citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:9720d9a22cd04f2342fedf8a4eb5ac60153354fb107a56eccb1d99adaee80523","observation_id":"75a404bf-0b03-4034-90c2-7b344a2cc9d4","resolution":{"observed_at":"2026-08-08T17:16:32.453924Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1038/s41597-024-02926-9","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Quantum computing dataset of maximum independent set problem on king lattice of over hundred rydberg atoms","venue":"Scientific Data","work_id":"4fa137a5-d752-420e-8622-1b33685debd0","year":2024},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.634279Z"},"links":{"citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:063d67b2612afd9c4122e1170db1abdc7d4a911ae5b2a188590c800bc7279016","observation_id":"5fd793ed-435c-493a-bbea-9225ada4a909","resolution":{"observed_at":"2026-08-08T17:16:31.790566Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.proeng.2016.01.248","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"An approximation algorithm for the minimum vertex cover problem","venue":"Procedia Engineering","work_id":"b66b3686-4de5-4f66-922a-11f1a2e101f7","year":2016},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.638046Z"},"links":{"citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:b95deb1cbcdf05975d6ab4a7f883b119aaf311d501c30bedc96681e08aa02f8d","observation_id":"341b6f9d-6e33-4b4e-bfee-29511298b75e","resolution":{"observed_at":"2026-08-08T17:16:31.776987Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s11128-023-04010-4","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Quantum speedup for solving the minimum vertex cover problem based on grover search algorithm","venue":"Quantum Information Processing","work_id":"a3601347-99ff-4e6a-b1c4-092de26e0243","year":2023},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.641765Z"},"links":{"citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:e39b41941be4182ae8236570ddd5457a3070c140a93808c7072f05a8dcf54dad","observation_id":"c0d019ad-2f49-43f9-a73a-27a24035cc50","resolution":{"observed_at":"2026-08-08T17:16:31.764176Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08T17:16:31.646995Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.646995Z"},"links":{"citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:aa2d3d2e7ce5c2711c96b08d5776147ede99ece69968acd25d897d1747dadef8","observation_id":"df12d62a-df8b-4f2e-8cb9-3699246f0044","resolution":{"observed_at":"2026-08-08T17:16:31.646995Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T17:16:31.619741Z","title":"Qubit efficient quantum algorithms for the vehicle routing problem on noisy intermediate-scale quantum processors.Advanced Quantum Technologies, 7, 04 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.619741Z"},"links":{"citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:9a5460b05ddf37e83fbf8a045ba4f404c95768df955bf2da72406a167b669171","observation_id":"ff5e74ba-61d1-42da-9107-915d23509f84","resolution":{"observed_at":"2026-08-08T17:16:31.619741Z","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":"10.1038/s41598-023-30600-4","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Vasilakos","venue":"Scientific Reports","work_id":"638c8a55-aa86-4912-8294-ab534bf490b8","year":2023},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.657775Z"},"links":{"citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:85ccdceaf5ed44f93acedd6d1d7013585c2107b0770163e0908ab339f0c96990","observation_id":"507350a6-6e89-4f3c-af5a-af7ac64a80fb","resolution":{"observed_at":"2026-08-08T17:16:31.751290Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08T17:16:31.661966Z","title":"Cattrysse and Luk N","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.661966Z"},"links":{"citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:86742abc470b4ab96022577e9e3851fd492bd37f90fa8ecb9462f757969b7bbc","observation_id":"337a0a2f-ea17-4f29-a825-ceac3e430976","resolution":{"observed_at":"2026-08-08T17:16:31.661966Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.06623","last_updated":"2024-11-19T10:06:50Z","snapshot_observed_at":"2026-08-16T17:31:58.067241Z","submitted_at":"2023-10-10T13:40:30Z","title":"A quantum algorithm for solving 0-1 Knapsack problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.06623","snapshot_observed_at":"2026-08-08T17:16:31.666010Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.666010Z"},"links":{"cited_paper":"/paper/2310.06623","citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:5c6e4d09ec4c68fbf7f9208f88a40ecb4c51d1826984b77bca2f5ff764d8e6e7","observation_id":"11017c90-4284-4377-a720-8d0d3321dd0e","resolution":{"observed_at":"2026-08-08T17:16:31.666010Z","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":"pii/0925527","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T17:16:32.241871Z","title":"The cutting stock problem — a survey","venue":null,"work_id":"5adb9cbb-2475-4bb1-b8db-d12f1dbc6dd6","year":1994},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.670191Z"},"links":{"citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:f00f1b6b9f3910d9a7c8f10629168c5522c2a5e07702dff0c2483cd5dab64b64","observation_id":"26e72492-4574-4747-aa19-722bc900ac32","resolution":{"observed_at":"2026-08-08T17:16:32.247414Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08T17:16:33.291132Z","title":"Coffman Jr., János Csirik, Gábor Galambos, Silvano Martello, and Daniele Vigo","venue":null,"work_id":"922a5cc6-0c8c-4172-abd6-bbdae020fb29","year":null},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.674565Z"},"links":{"citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:f45d31c901bcbb913d9ce38e7c1ed65887612433b9c8d8712fae30184b242a12","observation_id":"7b8b2093-f14d-49e8-8746-dc1392f14253","resolution":{"observed_at":"2026-08-08T17:16:33.295385Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08T17:16:31.683093Z","title":"Qal-bp: an augmented lagrangian quantum approach for bin packing","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.683093Z"},"links":{"citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:a7241da1f2ceac63250ba2e9cf11f1108a37de61d0b0c5cdc90623ce8ed08021","observation_id":"e86cd510-9dae-473b-b19f-74bb2898a254","resolution":{"observed_at":"2026-08-08T17:16:31.683093Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T17:16:31.687239Z","title":"Comparative benchmark of a quantum algorithm for the bin packing problem","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.687239Z"},"links":{"citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:e66229bafd85c194d9126921a6701f4a05f1fbd04608c4b8417383d5ec39ac9b","observation_id":"06f95360-a14a-408e-a9d0-41847773f0e8","resolution":{"observed_at":"2026-08-08T17:16:31.687239Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T17:16:31.690841Z","title":"Quantum solution for solving the bin packing problem","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.690841Z"},"links":{"citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:875a3cefb952fb35ea80c1bb9f03eb1913a17b325ce673e8200ae95e7bb23e65","observation_id":"f1f902cf-979a-4dc1-bd7f-69f16422760f","resolution":{"observed_at":"2026-08-08T17:16:31.690841Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.09388","last_updated":"2023-12-14T23:00:35Z","snapshot_observed_at":"2026-08-16T14:34:34.991228Z","submitted_at":"2023-12-14T23:00:35Z","title":"Utilizing Novel Quantum Counters for Grover's Algorithm to Solve the Dominating Set Problem","version":1},"cited_work":{"arxiv_id":"2312.09388","doi":null,"metadata_source":"pith","pith_arxiv_id":"2312.09388","snapshot_observed_at":"2026-08-08T17:16:32.270076Z","title":"Utilizing Novel Quantum Counters for Grover's Algorithm to Solve the Dominating Set Problem","venue":"cs.CC","work_id":"1f6f193c-d159-4f53-b0cc-c1576f725c09","year":2023},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.654213Z"},"links":{"cited_paper":"/paper/2312.09388","citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:1c768bcfcfd802f34e72fa41f333dfe3f17a3b887ba6a48755656e3083d831ce","observation_id":"94872c76-f096-488c-be26-3f6e689791c8","resolution":{"observed_at":"2026-08-08T17:16:32.275019Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08T17:16:31.694824Z","title":"Romero, Eneko Osaba, Esther Villar-Rodriguez, Izaskun Oregi, and Yue Ban","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.694824Z"},"links":{"citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:63db4230dc00c2ae24974f1f4bf1b6a7551b31641b41a1bd4b902ecaf4d96a43","observation_id":"df3cacbf-29cf-42a0-b48a-ee893141bf06","resolution":{"observed_at":"2026-08-08T17:16:31.694824Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T17:16:31.415361Z","title":"doi: 10.1007/BF01386390","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":1959,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.415361Z"},"links":{"citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:2896ef9d3296daebd783d5a670cb095c2cbbb4be413998bb5d4e18bb47311d5f","observation_id":"0120c970-18bb-43c4-9e62-d677af441c40","resolution":{"observed_at":"2026-08-08T17:16:31.415361Z","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":"10.1137/1012004","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"URL https://doi.org/10.1137/1012004","venue":"SIAM Review","work_id":"4146fef1-0a1f-4cb6-a162-e4b8824213a4","year":null},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":1970,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.570439Z"},"links":{"citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:b21574e971e764f1ac4cf16f312552408e38f5a8f0396083197151fe8b7bc90e","observation_id":"55417f92-ab9e-4ace-9c74-35c8b63951c2","resolution":{"observed_at":"2026-08-08T17:16:31.866916Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08T17:16:31.650594Z","title":"ISBN 0897917855","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":1996,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.650594Z"},"links":{"citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:7fcf1fc060eebb77a6bd9bdd63dc073232606fb9f6d47d0ddad37227574883ad","observation_id":"abb74e77-e33b-4de4-8820-44c44aa6cee0","resolution":{"observed_at":"2026-08-08T17:16:31.650594Z","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":"10.1007/978-3-662-21708-5_18","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"doi: 10.1007/978-3-662-21708-5_18","venue":"Algorithms and combinatorics","work_id":"e8d205a3-68b8-4d3c-b28b-6284d353317d","year":null},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":2000,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.465631Z"},"links":{"citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:953db0bf20d5d1c987c401b3ef4262e2a5ff4d76db07f4f93ddca2d7872fed32","observation_id":"3a77f577-9f3d-4173-ae43-21a7c9a16cc1","resolution":{"observed_at":"2026-08-08T17:16:31.969457Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08T17:16:31.678507Z","title":"doi: 10.1007/978-1-4419-7997-1_35","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":2013,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.678507Z"},"links":{"citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:1ee6c07e95cae3ba7b59f1f21a77fa4d1a682c7a415301985a2bc7d3e7f60ec5","observation_id":"396c9ad6-72e5-4dbb-a70e-514464ef276c","resolution":{"observed_at":"2026-08-08T17:16:31.678507Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T17:16:31.578544Z","title":"doi: 10.1098/rsta.2021.0417","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.578544Z"},"links":{"citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:7ad24dfe1fbefdc89e5a90551dedf510fb142eae1521d6490d5ac06e0763659b","observation_id":"1cf08d22-abe2-4a71-9114-08c15773a856","resolution":{"observed_at":"2026-08-08T17:16:31.578544Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T17:16:31.594193Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.594193Z"},"links":{"citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:4a747d913499b494a55119801d531113edb64a7fd6128aecd77bd50dd0e563a2","observation_id":"e7ad91a2-e603-4cc2-8b0a-ca8da0536d70","resolution":{"observed_at":"2026-08-08T17:16:31.594193Z","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":"10.1007/978-981-97-7801-0_12","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"doi: 10.1007/978-981-97-7801-0_12","venue":"Lecture notes in computer science","work_id":"c49fc49f-c85b-4d35-9c0b-b5d6899d7a8f","year":null},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.612544Z"},"links":{"citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:f3bed582103bf9da7487b52a4673e132cbc298b6ba32e234f7d67ea60a744fbd","observation_id":"cae8ea69-b296-4962-a1fa-7b8acc83c632","resolution":{"observed_at":"2026-08-08T17:16:31.819880Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08T17:16:31.433541Z","title":"URL https://www.sciencedirect.com/science/ article/pii/S0377221724002959","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":2217,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.433541Z"},"links":{"citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:882faf304b5af5809fc7ee3e04595baa626db1b5c322e996411b28a2813eda93","observation_id":"30840fde-4d90-41a8-b5ea-c88198c2e0b2","resolution":{"observed_at":"2026-08-08T17:16:31.433541Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","latest_version":1,"primary_category":"cs.ET","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN"},"reference_resolution":{"displayed":79,"state_counts":{"malformed_identifier":3,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":39,"verified_exact":26,"verified_fuzzy":9},"total_outbound_references":79},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 79 of 79 outbound references and 4 inbound Pith citation observations for arXiv:2502.05981."}