{"as_of":"2026-08-15T01:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e1ce635b1c9968f56ea8facd8c3d290df35b802b3baec9e460c35f9846e2d3c0","coverage":[{"denominator":34,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":34,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T13:55:56.042087Z","state":"measured"},{"denominator":34,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":34,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2505.21071/citation-record","integrity":"/paper/2505.21071/integrity","json":"/paper/2505.21071/citation-record.json","paper":"/paper/2505.21071"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:55:52.564761Z","title":"Zico Kolter","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.21071","last_updated":"2025-06-13T02:51:30Z","snapshot_observed_at":"2026-08-07T13:34:04.781781Z","submitted_at":"2025-05-27T11:56:38Z","title":"Dual Hierarchical Least-Squares Programming with Equality Constraints","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T13:55:52.564761Z"},"links":{"citing_paper":"/paper/2505.21071"},"observation_digest":"sha256:04b3ff5965c27626b454457c440cc59452fc3eb3871bf168248828bfc82f0077","observation_id":"ce138a3b-1d77-4f3d-ace1-5b11b2dc6fb6","resolution":{"observed_at":"2026-08-07T13:55:52.564761Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:56:01.912950Z","title":"Anstreicher","venue":null,"work_id":"a3e95ba5-8a1c-4065-aa75-22dc3dba46ba","year":2012},"citing_paper":{"arxiv_id":"2505.21071","last_updated":"2025-06-13T02:51:30Z","snapshot_observed_at":"2026-08-07T13:34:04.781781Z","submitted_at":"2025-05-27T11:56:38Z","title":"Dual Hierarchical Least-Squares Programming with Equality Constraints","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T13:55:52.709399Z"},"links":{"citing_paper":"/paper/2505.21071"},"observation_digest":"sha256:f94bcbb53a67a077f03deb6c609f0774cf84eb0291f4fd7e4a583b39a53b549f","observation_id":"625e4587-45f3-4da5-be5b-f9d0d1bf2c00","resolution":{"observed_at":"2026-08-07T13:56:01.993633Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:56:01.780436Z","title":"Distributed optimization and statistical learning via the alternating direction method of multipliers","venue":null,"work_id":"3f21b42f-1041-4615-8bd7-de4e1904db54","year":2011},"citing_paper":{"arxiv_id":"2505.21071","last_updated":"2025-06-13T02:51:30Z","snapshot_observed_at":"2026-08-07T13:34:04.781781Z","submitted_at":"2025-05-27T11:56:38Z","title":"Dual Hierarchical Least-Squares Programming with Equality Constraints","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T13:55:52.800877Z"},"links":{"citing_paper":"/paper/2505.21071"},"observation_digest":"sha256:426d43b319fadf85593fbd0f41bbfc20cee43b08c662506d0b3d693e429279eb","observation_id":"5dafade6-e0a5-4c73-8853-c88f88c91f92","resolution":{"observed_at":"2026-08-07T13:56:01.832113Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:56:01.696575Z","title":"Convex Optimization","venue":null,"work_id":"c2e7a25e-378c-4d90-becc-a97f7c41c68a","year":2004},"citing_paper":{"arxiv_id":"2505.21071","last_updated":"2025-06-13T02:51:30Z","snapshot_observed_at":"2026-08-07T13:34:04.781781Z","submitted_at":"2025-05-27T11:56:38Z","title":"Dual Hierarchical Least-Squares Programming with Equality Constraints","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T13:55:52.897623Z"},"links":{"citing_paper":"/paper/2505.21071"},"observation_digest":"sha256:063f7701f3da2d3e5f09f9c0c5b47997c202c9a32c5cd4aecc488a1c6c531ad6","observation_id":"ee54cfbc-1ec5-4f2a-b544-0a5acb42705c","resolution":{"observed_at":"2026-08-07T13:56:01.739524Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:56:01.576595Z","title":"A sublevel moment-sos hierarchy for polynomial optimization","venue":null,"work_id":"33989b31-013b-4439-a104-b413c8e4dcc9","year":2021},"citing_paper":{"arxiv_id":"2505.21071","last_updated":"2025-06-13T02:51:30Z","snapshot_observed_at":"2026-08-07T13:34:04.781781Z","submitted_at":"2025-05-27T11:56:38Z","title":"Dual Hierarchical Least-Squares Programming with Equality Constraints","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T13:55:53.032223Z"},"links":{"citing_paper":"/paper/2505.21071"},"observation_digest":"sha256:08d808f0deb890a3dac75254438b9dcec308690fc9f1212e586957d5be627c95","observation_id":"7a11d938-d7ab-4066-b5d0-350566a9b44e","resolution":{"observed_at":"2026-08-07T13:56:01.632462Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:56:01.448418Z","title":"A hierarchical framework for collision avoidance in robot-assisted minimally invasive surgery","venue":null,"work_id":"c0331c51-23a6-4ead-bae0-876332eff175","year":2024},"citing_paper":{"arxiv_id":"2505.21071","last_updated":"2025-06-13T02:51:30Z","snapshot_observed_at":"2026-08-07T13:34:04.781781Z","submitted_at":"2025-05-27T11:56:38Z","title":"Dual Hierarchical Least-Squares Programming with Equality Constraints","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T13:55:53.157399Z"},"links":{"citing_paper":"/paper/2505.21071"},"observation_digest":"sha256:6378c124c3719fe3df4b6dccd72d79fbcd9f8cccff53f0701ac72dd0efaf7a74","observation_id":"e50bce8d-ad04-4c31-8abc-a5687cb22b03","resolution":{"observed_at":"2026-08-07T13:56:01.503584Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:56:01.340326Z","title":"Dang, K.V","venue":null,"work_id":"8010bc8f-f04e-4636-a772-5bc1990c5884","year":2015},"citing_paper":{"arxiv_id":"2505.21071","last_updated":"2025-06-13T02:51:30Z","snapshot_observed_at":"2026-08-07T13:34:04.781781Z","submitted_at":"2025-05-27T11:56:38Z","title":"Dual Hierarchical Least-Squares Programming with Equality Constraints","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T13:55:53.275723Z"},"links":{"citing_paper":"/paper/2505.21071"},"observation_digest":"sha256:3657fa54ba9a9d2bfd8e247254a55254578bfc77e761c8af171e8ef50e777323","observation_id":"0b26a65e-dd9c-493a-b3c2-95a586a4251f","resolution":{"observed_at":"2026-08-07T13:56:01.388690Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:56:01.246685Z","title":"Efficient resolution of potentially conflicting linear constraints in robotics","venue":null,"work_id":"e61d938b-fe4e-4f32-b4e0-58ccaaa32d34","year":2015},"citing_paper":{"arxiv_id":"2505.21071","last_updated":"2025-06-13T02:51:30Z","snapshot_observed_at":"2026-08-07T13:34:04.781781Z","submitted_at":"2025-05-27T11:56:38Z","title":"Dual Hierarchical Least-Squares Programming with Equality Constraints","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T13:55:53.394154Z"},"links":{"citing_paper":"/paper/2505.21071"},"observation_digest":"sha256:540b7135c57022c5cb9f132d06ce9607325735071c0e86bc69c6cf3d2c0603e5","observation_id":"451fb557-71cb-45f6-884e-93457e3be848","resolution":{"observed_at":"2026-08-07T13:56:01.302165Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:56:00.996629Z","title":"Hierarchical quadratic programming: Fast online humanoid-robot motion generation","venue":null,"work_id":"f678487f-6109-4f25-996b-cf0d6acad1a5","year":2014},"citing_paper":{"arxiv_id":"2505.21071","last_updated":"2025-06-13T02:51:30Z","snapshot_observed_at":"2026-08-07T13:34:04.781781Z","submitted_at":"2025-05-27T11:56:38Z","title":"Dual Hierarchical Least-Squares Programming with Equality Constraints","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T13:55:53.542740Z"},"links":{"citing_paper":"/paper/2505.21071"},"observation_digest":"sha256:408eda8e3b1f510d6fd5ef19fa3b135aa9fe9d61b1760ddcd97bfdc5b9955c50","observation_id":"50023f20-0159-46af-b5c8-ed781b18e89a","resolution":{"observed_at":"2026-08-07T13:56:01.108387Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:56:00.820221Z","title":null,"venue":null,"work_id":"d7cd6781-e904-4436-99b1-885ee5376d57","year":2002},"citing_paper":{"arxiv_id":"2505.21071","last_updated":"2025-06-13T02:51:30Z","snapshot_observed_at":"2026-08-07T13:34:04.781781Z","submitted_at":"2025-05-27T11:56:38Z","title":"Dual Hierarchical Least-Squares Programming with Equality Constraints","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T13:55:53.661460Z"},"links":{"citing_paper":"/paper/2505.21071"},"observation_digest":"sha256:f0d062b9c03726a0d7f0bbfd86b51eb8f24a042d03ccb855bd56b546fbacaf39","observation_id":"bcce4e08-75f4-4d98-8cad-6c290fce7d4b","resolution":{"observed_at":"2026-08-07T13:56:00.903812Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:56:00.593315Z","title":"Optimal parameter selection for the alternating direction method of multipliers (admm): Quadratic problems","venue":null,"work_id":"0c3fe130-a84d-485c-8103-3c6d1cf90ddd","year":2015},"citing_paper":{"arxiv_id":"2505.21071","last_updated":"2025-06-13T02:51:30Z","snapshot_observed_at":"2026-08-07T13:34:04.781781Z","submitted_at":"2025-05-27T11:56:38Z","title":"Dual Hierarchical Least-Squares Programming with Equality Constraints","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T13:55:53.800354Z"},"links":{"citing_paper":"/paper/2505.21071"},"observation_digest":"sha256:f5c0eb4ee9d40d9a2829ff6e2abaf02f0fbb979557e506cec1c3fcd621a7f3ef","observation_id":"d915d896-9972-4d61-8e28-f83bf78f780d","resolution":{"observed_at":"2026-08-07T13:56:00.723412Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:56:00.382829Z","title":"Gill, Walter Murray, Michael A","venue":null,"work_id":"bcfddeef-918b-413c-b5c2-9fd6e76ebcdb","year":1989},"citing_paper":{"arxiv_id":"2505.21071","last_updated":"2025-06-13T02:51:30Z","snapshot_observed_at":"2026-08-07T13:34:04.781781Z","submitted_at":"2025-05-27T11:56:38Z","title":"Dual Hierarchical Least-Squares Programming with Equality Constraints","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T13:55:53.955580Z"},"links":{"citing_paper":"/paper/2505.21071"},"observation_digest":"sha256:25408f8934e077049ea0c2152fbf2abd7f574c3409385b8c5ba59428a85185d9","observation_id":"0889b556-cb76-4593-9b90-b53670661883","resolution":{"observed_at":"2026-08-07T13:56:00.439828Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:56:00.217836Z","title":"Task priority based design optimization of a kine- matic redundant robot","venue":null,"work_id":"51e16e19-111b-4a8c-9782-3f033db5cf8d","year":2023},"citing_paper":{"arxiv_id":"2505.21071","last_updated":"2025-06-13T02:51:30Z","snapshot_observed_at":"2026-08-07T13:34:04.781781Z","submitted_at":"2025-05-27T11:56:38Z","title":"Dual Hierarchical Least-Squares Programming with Equality Constraints","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T13:55:54.139603Z"},"links":{"citing_paper":"/paper/2505.21071"},"observation_digest":"sha256:e7ec8abfd0b54a719496f9cc38248cfcbfa0b70ac34270ef228d15b5010a4b82","observation_id":"5f821604-ed6f-4d02-a2db-e8b7fb552921","resolution":{"observed_at":"2026-08-07T13:56:00.292728Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:55:54.345768Z","title":"Gurobi Optimizer Reference Manual, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.21071","last_updated":"2025-06-13T02:51:30Z","snapshot_observed_at":"2026-08-07T13:34:04.781781Z","submitted_at":"2025-05-27T11:56:38Z","title":"Dual Hierarchical Least-Squares Programming with Equality Constraints","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T13:55:54.345768Z"},"links":{"citing_paper":"/paper/2505.21071"},"observation_digest":"sha256:5b9e86acaf6df4fdd8543a2f519b1ec6447928a9c052d90d6e808ae50254484b","observation_id":"85c8a42f-bd56-4899-ab7c-60976bece53a","resolution":{"observed_at":"2026-08-07T13:55:54.345768Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:56:00.005793Z","title":"Lexicographic mpc with multiple economic criteria for constrained nonlinear systems","venue":null,"work_id":"c4bc2f42-fb9f-4772-886b-8d3ef14ae706","year":2018},"citing_paper":{"arxiv_id":"2505.21071","last_updated":"2025-06-13T02:51:30Z","snapshot_observed_at":"2026-08-07T13:34:04.781781Z","submitted_at":"2025-05-27T11:56:38Z","title":"Dual Hierarchical Least-Squares Programming with Equality Constraints","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T13:55:54.449928Z"},"links":{"citing_paper":"/paper/2505.21071"},"observation_digest":"sha256:febb0be9a1345d228dd8ed69cdd033404ca3813f0017d99a3715ab25f47584a6","observation_id":"f584f575-bf2b-4604-ac45-769a91ae4765","resolution":{"observed_at":"2026-08-07T13:56:00.110462Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:55:59.828324Z","title":"Momentum control with hierarchical inverse dynamics on a torque-controlled humanoid","venue":null,"work_id":"13fc8182-1496-4a3c-80b7-3724d3f3e4b7","year":2016},"citing_paper":{"arxiv_id":"2505.21071","last_updated":"2025-06-13T02:51:30Z","snapshot_observed_at":"2026-08-07T13:34:04.781781Z","submitted_at":"2025-05-27T11:56:38Z","title":"Dual Hierarchical Least-Squares Programming with Equality Constraints","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T13:55:54.582442Z"},"links":{"citing_paper":"/paper/2505.21071"},"observation_digest":"sha256:ebb6113d8b7a64629a9270d703fe0fe15983db8bee4355589408c61a69cc7645","observation_id":"485c955e-9526-4bb8-9360-473cef8bc3a2","resolution":{"observed_at":"2026-08-07T13:55:59.901274Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:55:59.539008Z","title":null,"venue":null,"work_id":"34cee714-4c2c-4afa-a734-20abcc4be671","year":2011},"citing_paper":{"arxiv_id":"2505.21071","last_updated":"2025-06-13T02:51:30Z","snapshot_observed_at":"2026-08-07T13:34:04.781781Z","submitted_at":"2025-05-27T11:56:38Z","title":"Dual Hierarchical Least-Squares Programming with Equality Constraints","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T13:55:54.664595Z"},"links":{"citing_paper":"/paper/2505.21071"},"observation_digest":"sha256:be48f4f56f54b96e120162b00ac78da246370329c07c35f13f1502465a6741a6","observation_id":"06348744-549c-4b90-82f0-6563d89fd083","resolution":{"observed_at":"2026-08-07T13:55:59.679076Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:55:59.271212Z","title":"Knight, Daniel Ruiz, and Bora Uc ¸ar","venue":null,"work_id":"6edc6d63-6ec3-45aa-9a53-986b29674869","year":2014},"citing_paper":{"arxiv_id":"2505.21071","last_updated":"2025-06-13T02:51:30Z","snapshot_observed_at":"2026-08-07T13:34:04.781781Z","submitted_at":"2025-05-27T11:56:38Z","title":"Dual Hierarchical Least-Squares Programming with Equality Constraints","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T13:55:54.773718Z"},"links":{"citing_paper":"/paper/2505.21071"},"observation_digest":"sha256:b60f01b86c0d47f229439137afa9c3406d8c82892d6f3e4fb9462ab35d9b9aac","observation_id":"ac7804c4-7970-4ef0-a1e6-ebaff0f4adca","resolution":{"observed_at":"2026-08-07T13:55:59.384651Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:55:58.985541Z","title":"Cooperative multi-robot object transportation system based on hierarchical quadratic programming","venue":null,"work_id":"9780a327-7d51-4d9e-8f7e-0decbb5be39f","year":2021},"citing_paper":{"arxiv_id":"2505.21071","last_updated":"2025-06-13T02:51:30Z","snapshot_observed_at":"2026-08-07T13:34:04.781781Z","submitted_at":"2025-05-27T11:56:38Z","title":"Dual Hierarchical Least-Squares Programming with Equality Constraints","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T13:55:54.847538Z"},"links":{"citing_paper":"/paper/2505.21071"},"observation_digest":"sha256:273f97b649691db66522443b53a3a62b21874f1eb62c2bd37838529b7a263df7","observation_id":"0a5fcb20-bf4f-4a13-ab5e-581d887246f8","resolution":{"observed_at":"2026-08-07T13:55:59.161308Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:55:58.797345Z","title":"A sparse admm-based solver for linear mpc subject to terminal quadratic constraint","venue":null,"work_id":"8d93a008-e60d-44db-8078-dc74549bc65f","year":2024},"citing_paper":{"arxiv_id":"2505.21071","last_updated":"2025-06-13T02:51:30Z","snapshot_observed_at":"2026-08-07T13:34:04.781781Z","submitted_at":"2025-05-27T11:56:38Z","title":"Dual Hierarchical Least-Squares Programming with Equality Constraints","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T13:55:54.960787Z"},"links":{"citing_paper":"/paper/2505.21071"},"observation_digest":"sha256:97f8750b2ccba2c6b1a9b39ba7a2e738e50f9bbf281851a425b61f95900650e9","observation_id":"14d64f0c-5609-44eb-bdff-e1e33eaa3885","resolution":{"observed_at":"2026-08-07T13:55:58.887013Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:55:58.590557Z","title":"An efficiently solvable quadratic program for stabilizing dynamic locomotion","venue":null,"work_id":"8150b7b2-a7e0-454b-bb05-4eb4aff8898f","year":2014},"citing_paper":{"arxiv_id":"2505.21071","last_updated":"2025-06-13T02:51:30Z","snapshot_observed_at":"2026-08-07T13:34:04.781781Z","submitted_at":"2025-05-27T11:56:38Z","title":"Dual Hierarchical Least-Squares Programming with Equality Constraints","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T13:55:55.076674Z"},"links":{"citing_paper":"/paper/2505.21071"},"observation_digest":"sha256:60da8ac19a8d81b79e3497c46c915381e2216188640d5d84da8981355a8f230c","observation_id":"d806b50a-2a76-4bfa-b3aa-a55945f57e48","resolution":{"observed_at":"2026-08-07T13:55:58.685078Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:55:58.352459Z","title":"Differentiable simulation for physical system identification","venue":null,"work_id":"7586266e-20ab-4531-926c-1c8adef18070","year":2021},"citing_paper":{"arxiv_id":"2505.21071","last_updated":"2025-06-13T02:51:30Z","snapshot_observed_at":"2026-08-07T13:34:04.781781Z","submitted_at":"2025-05-27T11:56:38Z","title":"Dual Hierarchical Least-Squares Programming with Equality Constraints","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T13:55:55.131498Z"},"links":{"citing_paper":"/paper/2505.21071"},"observation_digest":"sha256:2d768b51435fc3992f0d167c00935cc5a717decdd1a37c29a7ecaa5ccec6ce6d","observation_id":"bfcacf10-d80b-4933-b8a5-79b4ede030a5","resolution":{"observed_at":"2026-08-07T13:55:58.504676Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:55:58.140115Z","title":"Optimal parameter selection for admm: Quadratically constrained quadratic program","venue":null,"work_id":"a7955594-5f80-4335-8cca-13a4f08d25b2","year":2025},"citing_paper":{"arxiv_id":"2505.21071","last_updated":"2025-06-13T02:51:30Z","snapshot_observed_at":"2026-08-07T13:34:04.781781Z","submitted_at":"2025-05-27T11:56:38Z","title":"Dual Hierarchical Least-Squares Programming with Equality Constraints","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T13:55:55.172874Z"},"links":{"citing_paper":"/paper/2505.21071"},"observation_digest":"sha256:98e65192ef1e6ad574eb8248c2198c3d55d09e2cc2df2e4c87d84e2bc6e79b6f","observation_id":"bd1a5e83-e8ef-477f-9413-6584e5ad721d","resolution":{"observed_at":"2026-08-07T13:55:58.258795Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:55:57.903009Z","title":null,"venue":null,"work_id":"3ab0af10-a137-4595-b6f0-7aba7040b804","year":2014},"citing_paper":{"arxiv_id":"2505.21071","last_updated":"2025-06-13T02:51:30Z","snapshot_observed_at":"2026-08-07T13:34:04.781781Z","submitted_at":"2025-05-27T11:56:38Z","title":"Dual Hierarchical Least-Squares Programming with Equality Constraints","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T13:55:55.213851Z"},"links":{"citing_paper":"/paper/2505.21071"},"observation_digest":"sha256:f9a1acd0964dd141f4f7158616abab4b04f0718245b66234cfd969ce1b31b85a","observation_id":"c319f635-dc43-436a-ad4e-f08bf35a2ea1","resolution":{"observed_at":"2026-08-07T13:55:58.007976Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.01324","last_updated":"2026-06-06T05:56:37Z","snapshot_observed_at":"2026-08-12T04:26:33.457393Z","submitted_at":"2024-12-02T09:45:32Z","title":"Integrated Hierarchical Decision-Making in Inverse Kinematic Planning and Control","version":5},"cited_work":{"arxiv_id":"2412.01324","doi":null,"metadata_source":"pith","pith_arxiv_id":"2412.01324","snapshot_observed_at":"2026-08-07T13:55:56.348211Z","title":"Integrated Hierarchical Decision-Making in Inverse Kinematic Planning and Control","venue":"cs.RO","work_id":"562c88c5-2c10-4900-b9b1-c949807e2a72","year":2024},"citing_paper":{"arxiv_id":"2505.21071","last_updated":"2025-06-13T02:51:30Z","snapshot_observed_at":"2026-08-07T13:34:04.781781Z","submitted_at":"2025-05-27T11:56:38Z","title":"Dual Hierarchical Least-Squares Programming with Equality Constraints","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T13:55:55.254791Z"},"links":{"cited_paper":"/paper/2412.01324","citing_paper":"/paper/2505.21071"},"observation_digest":"sha256:bd3d8924843ca50c3e6c829cfd4dadb73231bd56e1941e3cf8707fcfbf784894","observation_id":"87ca4889-d1a8-49c9-88f4-8d0d4ab999a6","resolution":{"observed_at":"2026-08-07T13:55:56.416467Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:55:57.682582Z","title":"The hierarchical newton’s method for numerically stable prioritized dynamic control","venue":null,"work_id":"6e6401e9-1326-4db2-bcde-1891c39e0398","year":2023},"citing_paper":{"arxiv_id":"2505.21071","last_updated":"2025-06-13T02:51:30Z","snapshot_observed_at":"2026-08-07T13:34:04.781781Z","submitted_at":"2025-05-27T11:56:38Z","title":"Dual Hierarchical Least-Squares Programming with Equality Constraints","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T13:55:55.319598Z"},"links":{"citing_paper":"/paper/2505.21071"},"observation_digest":"sha256:161db9a81e84c6fadac3f0dc65688727a5fe76e4c218ecf0391b74028e9e80a8","observation_id":"0ea5bc0a-1d9e-47d8-8cca-a0e7dcbb3d2f","resolution":{"observed_at":"2026-08-07T13:55:57.766649Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:55:57.506506Z","title":"N ipm-hlsp: an efficient interior-point method for hierarchical least-squares programs","venue":null,"work_id":"31a091e5-5b46-4a2d-bfc4-d2e38822055f","year":2024},"citing_paper":{"arxiv_id":"2505.21071","last_updated":"2025-06-13T02:51:30Z","snapshot_observed_at":"2026-08-07T13:34:04.781781Z","submitted_at":"2025-05-27T11:56:38Z","title":"Dual Hierarchical Least-Squares Programming with Equality Constraints","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T13:55:55.437959Z"},"links":{"citing_paper":"/paper/2505.21071"},"observation_digest":"sha256:85eaa728de897e163c1844bcd375d9d8844d4d15dd80ea4fb079a77c573e0af2","observation_id":"5825734e-ed6d-4548-92cd-79a742618477","resolution":{"observed_at":"2026-08-07T13:55:57.589393Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.09160","last_updated":"2024-03-14T08:16:50Z","snapshot_observed_at":"2026-08-13T00:54:33.266359Z","submitted_at":"2024-03-14T08:16:50Z","title":"Efficient Lexicographic Optimization for Prioritized Robot Control and Planning","version":1},"cited_work":{"arxiv_id":"2403.09160","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.09160","snapshot_observed_at":"2026-08-07T13:55:56.184770Z","title":"Efficient Lexicographic Optimization for Prioritized Robot Control and Planning","venue":"cs.RO","work_id":"816eb3c5-4f13-47d2-95a5-7d126eaf446d","year":2024},"citing_paper":{"arxiv_id":"2505.21071","last_updated":"2025-06-13T02:51:30Z","snapshot_observed_at":"2026-08-07T13:34:04.781781Z","submitted_at":"2025-05-27T11:56:38Z","title":"Dual Hierarchical Least-Squares Programming with Equality Constraints","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T13:55:55.508442Z"},"links":{"cited_paper":"/paper/2403.09160","citing_paper":"/paper/2505.21071"},"observation_digest":"sha256:eec558fefc829fb0facc8ba0620aefcbd8e441a55dd5c4806187fdd10d57566b","observation_id":"12b677fe-b8de-42fd-8b88-3685820ec735","resolution":{"observed_at":"2026-08-07T13:55:56.254629Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:55:57.333246Z","title":"Sequential hierarchical least-squares programming for prioritized non-linear optimal control","venue":null,"work_id":"32e4de31-df7a-4af4-a80f-a260662f2fbf","year":2024},"citing_paper":{"arxiv_id":"2505.21071","last_updated":"2025-06-13T02:51:30Z","snapshot_observed_at":"2026-08-07T13:34:04.781781Z","submitted_at":"2025-05-27T11:56:38Z","title":"Dual Hierarchical Least-Squares Programming with Equality Constraints","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T13:55:55.592121Z"},"links":{"citing_paper":"/paper/2505.21071"},"observation_digest":"sha256:4e24533f49587fd97922f068a40cd7c477123a2279fa42d2d13c5f9f19038f38","observation_id":"e91f0863-295a-4cc4-b410-6a7d542ccf14","resolution":{"observed_at":"2026-08-07T13:55:57.423076Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:55:57.136932Z","title":"A weighted method for fast resolution of strictly hi- erarchical robot task specifications using exact penalty functions","venue":null,"work_id":"064190df-7466-4e8c-bd87-e6c9d02b8a02","year":2021},"citing_paper":{"arxiv_id":"2505.21071","last_updated":"2025-06-13T02:51:30Z","snapshot_observed_at":"2026-08-07T13:34:04.781781Z","submitted_at":"2025-05-27T11:56:38Z","title":"Dual Hierarchical Least-Squares Programming with Equality Constraints","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T13:55:55.676736Z"},"links":{"citing_paper":"/paper/2505.21071"},"observation_digest":"sha256:0708bf6df39a0ca549bcdb52c372c9dd1790eb54580d317d26b417727b920e66","observation_id":"cafeb298-6ba7-45fd-8bf4-fab7b43c006a","resolution":{"observed_at":"2026-08-07T13:55:57.218952Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:55:56.988808Z","title":"Sherali and Allen L","venue":null,"work_id":"c3c38a3d-b81a-464e-ba54-dd41820c6099","year":1983},"citing_paper":{"arxiv_id":"2505.21071","last_updated":"2025-06-13T02:51:30Z","snapshot_observed_at":"2026-08-07T13:34:04.781781Z","submitted_at":"2025-05-27T11:56:38Z","title":"Dual Hierarchical Least-Squares Programming with Equality Constraints","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T13:55:55.775503Z"},"links":{"citing_paper":"/paper/2505.21071"},"observation_digest":"sha256:d484a053370020d06c949ebddfb2f26d6f2a35df6758a572ebcb665efc004388","observation_id":"a780b057-6412-463a-9141-19451aa07edf","resolution":{"observed_at":"2026-08-07T13:55:57.055000Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:55:56.880439Z","title":"Stellato, G","venue":null,"work_id":"7e0138f5-260a-4be1-a1a6-886960cdc761","year":2020},"citing_paper":{"arxiv_id":"2505.21071","last_updated":"2025-06-13T02:51:30Z","snapshot_observed_at":"2026-08-07T13:34:04.781781Z","submitted_at":"2025-05-27T11:56:38Z","title":"Dual Hierarchical Least-Squares Programming with Equality Constraints","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T13:55:55.867465Z"},"links":{"citing_paper":"/paper/2505.21071"},"observation_digest":"sha256:9aea84dc07f8fad9b40707e9ddb8b5bbc4c8596e8528ae1a42d36cdbdb668310","observation_id":"346a468b-b3b2-4607-b14d-76a65d3b50ca","resolution":{"observed_at":"2026-08-07T13:55:56.937403Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:55:56.713144Z","title":"Multi- contact vertical ladder climbing with an hrp-2 humanoid","venue":null,"work_id":"925addd2-3136-45b8-88ef-9701307a40d3","year":2016},"citing_paper":{"arxiv_id":"2505.21071","last_updated":"2025-06-13T02:51:30Z","snapshot_observed_at":"2026-08-07T13:34:04.781781Z","submitted_at":"2025-05-27T11:56:38Z","title":"Dual Hierarchical Least-Squares Programming with Equality Constraints","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T13:55:55.937789Z"},"links":{"citing_paper":"/paper/2505.21071"},"observation_digest":"sha256:ca889419a5e9fe888016b754db661596e672720a7db5e43c694e36ac645695ea","observation_id":"b634b028-ffba-47b8-ad76-d476bf2e6297","resolution":{"observed_at":"2026-08-07T13:55:56.771297Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:55:56.528592Z","title":"Hqp-based obstacle avoidance motion planning and control of on-orbit redundant manipulators","venue":null,"work_id":"f32c3638-ef62-4009-a7a7-4d835006e69d","year":2025},"citing_paper":{"arxiv_id":"2505.21071","last_updated":"2025-06-13T02:51:30Z","snapshot_observed_at":"2026-08-07T13:34:04.781781Z","submitted_at":"2025-05-27T11:56:38Z","title":"Dual Hierarchical Least-Squares Programming with Equality Constraints","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T13:55:56.042087Z"},"links":{"citing_paper":"/paper/2505.21071"},"observation_digest":"sha256:7d8671be667e73d4cfd0351d93497938e43f7173ff08f959394bc0569d9c5c1e","observation_id":"9a0657c5-71e2-46d1-ad27-26a1f98fca16","resolution":{"observed_at":"2026-08-07T13:55:56.618094Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.21071","last_updated":"2025-06-13T02:51:30Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-08-07T13:34:04.781781Z","submitted_at":"2025-05-27T11:56:38Z","title":"Dual Hierarchical Least-Squares Programming with Equality Constraints"},"reference_resolution":{"displayed":34,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":5,"verified_exact":2,"verified_fuzzy":27},"total_outbound_references":34},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 34 of 34 outbound references and 0 inbound Pith citation observations for arXiv:2505.21071."}