{"as_of":"2026-08-16T17:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:71fba861ab6b9d558c230772d4b88b499df0dac595ecd6869635ec98ad16fe5d","coverage":[{"denominator":27,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":27,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T20:07:45.043580Z","state":"measured"},{"denominator":27,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":27,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2411.10062/citation-record","integrity":"/paper/2411.10062/integrity","json":"/paper/2411.10062/citation-record.json","paper":"/paper/2411.10062"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T20:07:45.525659Z","title":null,"venue":null,"work_id":"0439ba64-77b3-4381-ac63-22e830db1f36","year":2019},"citing_paper":{"arxiv_id":"2411.10062","last_updated":"2024-11-15T09:23:52Z","snapshot_observed_at":"2026-08-13T20:40:12.534859Z","submitted_at":"2024-11-15T09:23:52Z","title":"Quadratic versus Polynomial Unconstrained Binary Models for Quantum Optimization illustrated on Railway Timetabling","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-12T20:07:44.900790Z"},"links":{"citing_paper":"/paper/2411.10062"},"observation_digest":"sha256:9145d6c00a9ddff1f70150aebbddf0440c957ec3e751202b185a6e02beaf4e14","observation_id":"bf6c1bad-b01c-474d-b1a1-a39a0d59c85d","resolution":{"observed_at":"2026-08-12T20:07:45.530447Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T20:07:45.510039Z","title":"K., Ahmed, E","venue":null,"work_id":"607353ba-4976-4633-88bf-d0d91fac927d","year":2022},"citing_paper":{"arxiv_id":"2411.10062","last_updated":"2024-11-15T09:23:52Z","snapshot_observed_at":"2026-08-13T20:40:12.534859Z","submitted_at":"2024-11-15T09:23:52Z","title":"Quadratic versus Polynomial Unconstrained Binary Models for Quantum Optimization illustrated on Railway Timetabling","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-12T20:07:44.907263Z"},"links":{"citing_paper":"/paper/2411.10062"},"observation_digest":"sha256:ab6a8d00c51454522c681aa8e6269c69dfb978d0137936c2663a85b49e1228f7","observation_id":"3ff0de68-67c7-4907-ae33-dd9ca0e85278","resolution":{"observed_at":"2026-08-12T20:07:45.514863Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T20:07:45.494822Z","title":"K., Nannicini, G., Robert, A., Tavernelli, I., and Woerner, S","venue":null,"work_id":"c5b4e2ac-21ea-4cfb-bf73-7767dee72d7b","year":2020},"citing_paper":{"arxiv_id":"2411.10062","last_updated":"2024-11-15T09:23:52Z","snapshot_observed_at":"2026-08-13T20:40:12.534859Z","submitted_at":"2024-11-15T09:23:52Z","title":"Quadratic versus Polynomial Unconstrained Binary Models for Quantum Optimization illustrated on Railway Timetabling","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-12T20:07:44.912731Z"},"links":{"citing_paper":"/paper/2411.10062"},"observation_digest":"sha256:f4c00b8bc4bba47f2b7656e92f3c821fc19b9c362fd8e3f3b7e87f3957719a5f","observation_id":"e8acef34-17df-49a0-895f-5731b05846f5","resolution":{"observed_at":"2026-08-12T20:07:45.499824Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T20:07:45.479496Z","title":"and Dahl, E","venue":null,"work_id":"1f820502-2dd2-473c-b2d5-cd207a78fdda","year":2022},"citing_paper":{"arxiv_id":"2411.10062","last_updated":"2024-11-15T09:23:52Z","snapshot_observed_at":"2026-08-13T20:40:12.534859Z","submitted_at":"2024-11-15T09:23:52Z","title":"Quadratic versus Polynomial Unconstrained Binary Models for Quantum Optimization illustrated on Railway Timetabling","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-12T20:07:44.917561Z"},"links":{"citing_paper":"/paper/2411.10062"},"observation_digest":"sha256:7f9c901e1f268d9b3dfa919b34d975f1ae4debc77234fc1af81c131391af736e","observation_id":"e998ca30-f740-44b7-a4f7-c24323f6d28d","resolution":{"observed_at":"2026-08-12T20:07:45.484416Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T20:07:44.922495Z","title":"C., Endo, S., Fujii, K., McClean, J","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.10062","last_updated":"2024-11-15T09:23:52Z","snapshot_observed_at":"2026-08-13T20:40:12.534859Z","submitted_at":"2024-11-15T09:23:52Z","title":"Quadratic versus Polynomial Unconstrained Binary Models for Quantum Optimization illustrated on Railway Timetabling","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-12T20:07:44.922495Z"},"links":{"citing_paper":"/paper/2411.10062"},"observation_digest":"sha256:caa03a841b0cbbcb0a3f58221905c9f17df2a1f5e761519d8922faefb0720caa","observation_id":"a75f1e64-8cb2-45dd-948c-22359418b823","resolution":{"observed_at":"2026-08-12T20:07:44.922495Z","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-12T20:07:45.451094Z","title":null,"venue":null,"work_id":"0371d302-40ed-480f-b01d-0ac21a071dca","year":2021},"citing_paper":{"arxiv_id":"2411.10062","last_updated":"2024-11-15T09:23:52Z","snapshot_observed_at":"2026-08-13T20:40:12.534859Z","submitted_at":"2024-11-15T09:23:52Z","title":"Quadratic versus Polynomial Unconstrained Binary Models for Quantum Optimization illustrated on Railway Timetabling","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-12T20:07:44.927512Z"},"links":{"citing_paper":"/paper/2411.10062"},"observation_digest":"sha256:89702e06de07d17ba1c13a943e69aa1c5afe821cc99c2816ab866d445e1e6cfc","observation_id":"8a8d8b9c-c41a-43e5-909b-b3543d79f274","resolution":{"observed_at":"2026-08-12T20:07:45.457243Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1908.02210","last_updated":"2019-08-15T12:51:24Z","snapshot_observed_at":"2026-08-16T04:45:13.087716Z","submitted_at":"2019-08-06T15:23:34Z","title":"Knapsack Problem variants of QAOA for battery revenue optimisation","version":2},"cited_work":{"arxiv_id":"1908.02210","doi":null,"metadata_source":"pith","pith_arxiv_id":"1908.02210","snapshot_observed_at":"2026-08-12T20:07:45.106537Z","title":"Knapsack Problem variants of QAOA for battery revenue optimisation","venue":"cs.ET","work_id":"0dc12266-31eb-456a-a6e6-c51c729b4a9d","year":2019},"citing_paper":{"arxiv_id":"2411.10062","last_updated":"2024-11-15T09:23:52Z","snapshot_observed_at":"2026-08-13T20:40:12.534859Z","submitted_at":"2024-11-15T09:23:52Z","title":"Quadratic versus Polynomial Unconstrained Binary Models for Quantum Optimization illustrated on Railway Timetabling","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-12T20:07:44.933258Z"},"links":{"cited_paper":"/paper/1908.02210","citing_paper":"/paper/2411.10062"},"observation_digest":"sha256:282b084b11b353ddb4068bad17af8a180fb88de6421259888a84fb06a9b2cf56","observation_id":"f0f84e79-bbd0-43c5-98dc-02a623ba2962","resolution":{"observed_at":"2026-08-12T20:07:45.114553Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1411.4028","last_updated":"2014-11-14T19:57:57Z","snapshot_observed_at":"2026-08-16T13:04:52.702745Z","submitted_at":"2014-11-14T19:57:57Z","title":"A Quantum Approximate Optimization Algorithm","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1411.4028","snapshot_observed_at":"2026-08-12T20:07:44.940646Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2411.10062","last_updated":"2024-11-15T09:23:52Z","snapshot_observed_at":"2026-08-13T20:40:12.534859Z","submitted_at":"2024-11-15T09:23:52Z","title":"Quadratic versus Polynomial Unconstrained Binary Models for Quantum Optimization illustrated on Railway Timetabling","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-12T20:07:44.940646Z"},"links":{"cited_paper":"/paper/1411.4028","citing_paper":"/paper/2411.10062"},"observation_digest":"sha256:c03675b32b3f6b51a684940c8e0856ac881a93c6cdd92376a8076af63b23c8d6","observation_id":"5a9d63e0-b5b5-4791-9d9a-1026cd1f5903","resolution":{"observed_at":"2026-08-12T20:07:44.940646Z","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-12T20:07:45.431694Z","title":null,"venue":null,"work_id":"0e1c90a8-85c3-497f-b211-e0b7893e48de","year":2022},"citing_paper":{"arxiv_id":"2411.10062","last_updated":"2024-11-15T09:23:52Z","snapshot_observed_at":"2026-08-13T20:40:12.534859Z","submitted_at":"2024-11-15T09:23:52Z","title":"Quadratic versus Polynomial Unconstrained Binary Models for Quantum Optimization illustrated on Railway Timetabling","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-12T20:07:44.947556Z"},"links":{"citing_paper":"/paper/2411.10062"},"observation_digest":"sha256:e101cc9669ef3db49f4fa9f404597c279e0585dfe8979438a11fec0797bf3c65","observation_id":"7e3e4783-7bb5-4e3c-a503-34f3b4c91923","resolution":{"observed_at":"2026-08-12T20:07:45.437209Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T20:07:45.415912Z","title":null,"venue":null,"work_id":"77296a8e-aaf5-4815-b890-323f97b45635","year":2023},"citing_paper":{"arxiv_id":"2411.10062","last_updated":"2024-11-15T09:23:52Z","snapshot_observed_at":"2026-08-13T20:40:12.534859Z","submitted_at":"2024-11-15T09:23:52Z","title":"Quadratic versus Polynomial Unconstrained Binary Models for Quantum Optimization illustrated on Railway Timetabling","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-12T20:07:44.952658Z"},"links":{"citing_paper":"/paper/2411.10062"},"observation_digest":"sha256:7ec48d7b377ec85609c5daf91b1f4e0681e886e01542a704c998d2a8aa5961cc","observation_id":"c5965109-8266-488d-8e7d-5c02c344087f","resolution":{"observed_at":"2026-08-12T20:07:45.421040Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T20:07:45.400963Z","title":null,"venue":null,"work_id":"7b990c86-1fc2-465f-afb2-d7f1afbaf813","year":2024},"citing_paper":{"arxiv_id":"2411.10062","last_updated":"2024-11-15T09:23:52Z","snapshot_observed_at":"2026-08-13T20:40:12.534859Z","submitted_at":"2024-11-15T09:23:52Z","title":"Quadratic versus Polynomial Unconstrained Binary Models for Quantum Optimization illustrated on Railway Timetabling","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-12T20:07:44.958179Z"},"links":{"citing_paper":"/paper/2411.10062"},"observation_digest":"sha256:d3b83091e208d9fda5883a43b3005ed0a646ad5f847303001d92279899d3f50f","observation_id":"0c72d83c-7b0b-4234-9d48-32d45e37c839","resolution":{"observed_at":"2026-08-12T20:07:45.405594Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T20:07:45.386039Z","title":"G., Venturelli, D., and Biswas, R","venue":null,"work_id":"f582dfbb-c9c1-4476-b58a-28e54cf2d979","year":2019},"citing_paper":{"arxiv_id":"2411.10062","last_updated":"2024-11-15T09:23:52Z","snapshot_observed_at":"2026-08-13T20:40:12.534859Z","submitted_at":"2024-11-15T09:23:52Z","title":"Quadratic versus Polynomial Unconstrained Binary Models for Quantum Optimization illustrated on Railway Timetabling","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-12T20:07:44.963273Z"},"links":{"citing_paper":"/paper/2411.10062"},"observation_digest":"sha256:ce9038073b201c50aaed18624d3d2bd0559538c445e06d2b8c2d8955d1078862","observation_id":"956ceb08-8b14-45cf-a5ef-ffbe1de2a99b","resolution":{"observed_at":"2026-08-12T20:07:45.390305Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T20:07:45.369603Z","title":"and Nishimori, H","venue":null,"work_id":"e1338e0b-6e53-4cc4-8f91-f8ef2b1358c5","year":1998},"citing_paper":{"arxiv_id":"2411.10062","last_updated":"2024-11-15T09:23:52Z","snapshot_observed_at":"2026-08-13T20:40:12.534859Z","submitted_at":"2024-11-15T09:23:52Z","title":"Quadratic versus Polynomial Unconstrained Binary Models for Quantum Optimization illustrated on Railway Timetabling","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-12T20:07:44.969607Z"},"links":{"citing_paper":"/paper/2411.10062"},"observation_digest":"sha256:6df2cc91e28a672bd3772e71d1d20edc8f1996e8f8d1e0e91eb658083ea69b93","observation_id":"feb67fb9-7803-4de6-9852-bb1371debd11","resolution":{"observed_at":"2026-08-12T20:07:45.374878Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T20:07:45.352949Z","title":null,"venue":null,"work_id":"ecdc56c2-57cd-49ff-a396-eca0834cc9be","year":2023},"citing_paper":{"arxiv_id":"2411.10062","last_updated":"2024-11-15T09:23:52Z","snapshot_observed_at":"2026-08-13T20:40:12.534859Z","submitted_at":"2024-11-15T09:23:52Z","title":"Quadratic versus Polynomial Unconstrained Binary Models for Quantum Optimization illustrated on Railway Timetabling","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-12T20:07:44.975022Z"},"links":{"citing_paper":"/paper/2411.10062"},"observation_digest":"sha256:0c99c6aef5afceb20aaeea3a3d2d012d16658d19d54c1f52fee4f6f7350013bd","observation_id":"1670d102-6503-4d69-9f2f-9c8b09c830b8","resolution":{"observed_at":"2026-08-12T20:07:45.358478Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T20:07:45.337111Z","title":"and Prakash, A","venue":null,"work_id":"f49f12d5-e8c9-47de-85fa-bae2f1ea9280","year":2020},"citing_paper":{"arxiv_id":"2411.10062","last_updated":"2024-11-15T09:23:52Z","snapshot_observed_at":"2026-08-13T20:40:12.534859Z","submitted_at":"2024-11-15T09:23:52Z","title":"Quadratic versus Polynomial Unconstrained Binary Models for Quantum Optimization illustrated on Railway Timetabling","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-12T20:07:44.979918Z"},"links":{"citing_paper":"/paper/2411.10062"},"observation_digest":"sha256:1d4dfb699124485decd366df050789c38152c2b7a568652a92e0fbfb0e7904bb","observation_id":"d7977171-0bab-4208-be7b-e97dc248ba82","resolution":{"observed_at":"2026-08-12T20:07:45.342115Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T20:07:45.319495Z","title":null,"venue":null,"work_id":"78145efb-66f4-41da-af8b-5da78a40f64c","year":2023},"citing_paper":{"arxiv_id":"2411.10062","last_updated":"2024-11-15T09:23:52Z","snapshot_observed_at":"2026-08-13T20:40:12.534859Z","submitted_at":"2024-11-15T09:23:52Z","title":"Quadratic versus Polynomial Unconstrained Binary Models for Quantum Optimization illustrated on Railway Timetabling","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-12T20:07:44.984739Z"},"links":{"citing_paper":"/paper/2411.10062"},"observation_digest":"sha256:63728f74ca3959e06d304dcaa4ddf8b63aa4b867a037dce8d6ce5c34f6da0793","observation_id":"5d402412-6782-4d93-b61c-52a51effac50","resolution":{"observed_at":"2026-08-12T20:07:45.325808Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T20:07:45.299551Z","title":null,"venue":null,"work_id":"0599b16a-b053-4e41-9335-565c20897489","year":2020},"citing_paper":{"arxiv_id":"2411.10062","last_updated":"2024-11-15T09:23:52Z","snapshot_observed_at":"2026-08-13T20:40:12.534859Z","submitted_at":"2024-11-15T09:23:52Z","title":"Quadratic versus Polynomial Unconstrained Binary Models for Quantum Optimization illustrated on Railway Timetabling","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-12T20:07:44.989435Z"},"links":{"citing_paper":"/paper/2411.10062"},"observation_digest":"sha256:00bb976b53e82f23845d2556680a52683dd199880701aabedd6de19a42a101c8","observation_id":"863f87b2-5095-458f-b77e-742c17b3ab0e","resolution":{"observed_at":"2026-08-12T20:07:45.306710Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T20:07:45.283449Z","title":null,"venue":null,"work_id":"4502477f-ec30-40fc-924e-a4621c8ecc05","year":2014},"citing_paper":{"arxiv_id":"2411.10062","last_updated":"2024-11-15T09:23:52Z","snapshot_observed_at":"2026-08-13T20:40:12.534859Z","submitted_at":"2024-11-15T09:23:52Z","title":"Quadratic versus Polynomial Unconstrained Binary Models for Quantum Optimization illustrated on Railway Timetabling","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-12T20:07:44.994693Z"},"links":{"citing_paper":"/paper/2411.10062"},"observation_digest":"sha256:543444b08c1891b3396b8c4c12ddb86f00182b52d18a921a475086a20274d338","observation_id":"55d9b938-5dcc-41c8-a1cd-68f8d4b6525f","resolution":{"observed_at":"2026-08-12T20:07:45.288839Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T20:07:45.266051Z","title":null,"venue":null,"work_id":"ce82542e-f3e7-4b8a-8d9a-fb043b6602ed","year":2020},"citing_paper":{"arxiv_id":"2411.10062","last_updated":"2024-11-15T09:23:52Z","snapshot_observed_at":"2026-08-13T20:40:12.534859Z","submitted_at":"2024-11-15T09:23:52Z","title":"Quadratic versus Polynomial Unconstrained Binary Models for Quantum Optimization illustrated on Railway Timetabling","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-12T20:07:44.999340Z"},"links":{"citing_paper":"/paper/2411.10062"},"observation_digest":"sha256:4181695e3e336481a618ca9e719734af744e9b125187e110ddd18dbca7d3646d","observation_id":"8ad59793-6e4c-4fcc-b088-d9bb5e7d45c0","resolution":{"observed_at":"2026-08-12T20:07:45.271704Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T20:07:45.247651Z","title":null,"venue":null,"work_id":"ade996a9-638a-4da6-b38a-c09d97acbc54","year":2019},"citing_paper":{"arxiv_id":"2411.10062","last_updated":"2024-11-15T09:23:52Z","snapshot_observed_at":"2026-08-13T20:40:12.534859Z","submitted_at":"2024-11-15T09:23:52Z","title":"Quadratic versus Polynomial Unconstrained Binary Models for Quantum Optimization illustrated on Railway Timetabling","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-12T20:07:45.004863Z"},"links":{"citing_paper":"/paper/2411.10062"},"observation_digest":"sha256:7762715e6bea7dbd78e95bcbf07f841aeb71bc5a4afbbb63841ca64a7d24d4a9","observation_id":"4d6803ed-110a-4faa-9158-60509b1810ee","resolution":{"observed_at":"2026-08-12T20:07:45.252699Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T20:07:45.230805Z","title":null,"venue":null,"work_id":"56a31631-4497-46c9-ac48-b38c646d9a85","year":2021},"citing_paper":{"arxiv_id":"2411.10062","last_updated":"2024-11-15T09:23:52Z","snapshot_observed_at":"2026-08-13T20:40:12.534859Z","submitted_at":"2024-11-15T09:23:52Z","title":"Quadratic versus Polynomial Unconstrained Binary Models for Quantum Optimization illustrated on Railway Timetabling","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-12T20:07:45.010475Z"},"links":{"citing_paper":"/paper/2411.10062"},"observation_digest":"sha256:eacafdc2e6c9258109ae3546157c46b30a707b9f99393f31720cefd776daee09","observation_id":"fd387df5-583a-44a5-a7fd-613740f3ee42","resolution":{"observed_at":"2026-08-12T20:07:45.235713Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T20:07:45.015784Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2411.10062","last_updated":"2024-11-15T09:23:52Z","snapshot_observed_at":"2026-08-13T20:40:12.534859Z","submitted_at":"2024-11-15T09:23:52Z","title":"Quadratic versus Polynomial Unconstrained Binary Models for Quantum Optimization illustrated on Railway Timetabling","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-12T20:07:45.015784Z"},"links":{"citing_paper":"/paper/2411.10062"},"observation_digest":"sha256:e4f565ce5c2f3ecd6e4bbdbf1dba326fb34047c664ff8fb9cd7807637af710cc","observation_id":"ef043ba7-34c3-4e13-8621-8c0f6b44d341","resolution":{"observed_at":"2026-08-12T20:07:45.015784Z","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-12T20:07:45.198681Z","title":null,"venue":null,"work_id":"f610f84e-3546-409a-82be-28d5091a42ab","year":2022},"citing_paper":{"arxiv_id":"2411.10062","last_updated":"2024-11-15T09:23:52Z","snapshot_observed_at":"2026-08-13T20:40:12.534859Z","submitted_at":"2024-11-15T09:23:52Z","title":"Quadratic versus Polynomial Unconstrained Binary Models for Quantum Optimization illustrated on Railway Timetabling","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-12T20:07:45.021234Z"},"links":{"citing_paper":"/paper/2411.10062"},"observation_digest":"sha256:de191ef00632f9480b1f1956f46a9719d15f7603c63b086a11d3f5c157103fc1","observation_id":"3bc281b8-77c7-4850-a670-28d27ef5de39","resolution":{"observed_at":"2026-08-12T20:07:45.204279Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T20:07:45.181960Z","title":null,"venue":null,"work_id":"898ad8bc-fdb3-4da3-ab3c-ea19b5d865b6","year":2020},"citing_paper":{"arxiv_id":"2411.10062","last_updated":"2024-11-15T09:23:52Z","snapshot_observed_at":"2026-08-13T20:40:12.534859Z","submitted_at":"2024-11-15T09:23:52Z","title":"Quadratic versus Polynomial Unconstrained Binary Models for Quantum Optimization illustrated on Railway Timetabling","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-12T20:07:45.026425Z"},"links":{"citing_paper":"/paper/2411.10062"},"observation_digest":"sha256:5c6aecbbce6c318b0536c2349940b6a111cc1f590e54d2bdcde1d4d4533598fa","observation_id":"c1e0cbf3-1ad6-4751-8558-fccfdcd8c569","resolution":{"observed_at":"2026-08-12T20:07:45.187134Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T20:07:45.164287Z","title":null,"venue":null,"work_id":"a919f7c7-e139-4daa-903d-77a2e932ad7d","year":2022},"citing_paper":{"arxiv_id":"2411.10062","last_updated":"2024-11-15T09:23:52Z","snapshot_observed_at":"2026-08-13T20:40:12.534859Z","submitted_at":"2024-11-15T09:23:52Z","title":"Quadratic versus Polynomial Unconstrained Binary Models for Quantum Optimization illustrated on Railway Timetabling","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-12T20:07:45.032324Z"},"links":{"citing_paper":"/paper/2411.10062"},"observation_digest":"sha256:f79221ea859c1e6962599222392705731ba58179927e7f1296391db250fd0aaf","observation_id":"2956e757-2503-4654-be48-f205e48d9cd0","resolution":{"observed_at":"2026-08-12T20:07:45.168937Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T20:07:45.145080Z","title":"u lein, J., Zielinski, S., K \\","venue":null,"work_id":"f1ce9d13-cf31-4664-b35b-a02266ed3d91","year":2023},"citing_paper":{"arxiv_id":"2411.10062","last_updated":"2024-11-15T09:23:52Z","snapshot_observed_at":"2026-08-13T20:40:12.534859Z","submitted_at":"2024-11-15T09:23:52Z","title":"Quadratic versus Polynomial Unconstrained Binary Models for Quantum Optimization illustrated on Railway Timetabling","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-12T20:07:45.038067Z"},"links":{"citing_paper":"/paper/2411.10062"},"observation_digest":"sha256:88b0af67901eb9845752cc8532db8b4cf043d6ba16ee72160ef4a933cee2e5c8","observation_id":"210bf9f3-4cbc-40bb-bbf8-97c7b4d61c66","resolution":{"observed_at":"2026-08-12T20:07:45.150161Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T20:07:45.127545Z","title":"H., Kallus, Z., H \\'a ga, P., Kozsik, T., Glos, A., and Zimbor \\'a s, Z","venue":null,"work_id":"14a08295-e988-4cb5-a7bb-9dd5c71fa007","year":2020},"citing_paper":{"arxiv_id":"2411.10062","last_updated":"2024-11-15T09:23:52Z","snapshot_observed_at":"2026-08-13T20:40:12.534859Z","submitted_at":"2024-11-15T09:23:52Z","title":"Quadratic versus Polynomial Unconstrained Binary Models for Quantum Optimization illustrated on Railway Timetabling","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-12T20:07:45.043580Z"},"links":{"citing_paper":"/paper/2411.10062"},"observation_digest":"sha256:47dcf85356d2ed81e0eb4d8d63d484e8ab53433c37773529229f540e6cdfc28e","observation_id":"c47c2728-2003-4282-94f9-4c1a0ee46b04","resolution":{"observed_at":"2026-08-12T20:07:45.133041Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2411.10062","last_updated":"2024-11-15T09:23:52Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-13T20:40:12.534859Z","submitted_at":"2024-11-15T09:23:52Z","title":"Quadratic versus Polynomial Unconstrained Binary Models for Quantum Optimization illustrated on Railway Timetabling"},"reference_resolution":{"displayed":27,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":18,"verified_exact":1,"verified_fuzzy":8},"total_outbound_references":27},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 27 of 27 outbound references and 0 inbound Pith citation observations for arXiv:2411.10062."}