{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:VIRYVP5MJDN4VKMTZ7G2TVURAF","short_pith_number":"pith:VIRYVP5M","canonical_record":{"source":{"id":"2505.21071","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-05-27T11:56:38Z","cross_cats_sorted":[],"title_canon_sha256":"911b5ae285680e75e62bfd50dc25463cc60ff2819059f4b7571920d96053850d","abstract_canon_sha256":"01a6655b7b7b765b2f68cf97aacfb6b5e48e9e33a761397abef0c1f56d4e5a4c"},"schema_version":"1.0"},"canonical_sha256":"aa238abfac48dbcaa993cfcda9d6910170b63acec7558c157b7c290df8c4e827","source":{"kind":"arxiv","id":"2505.21071","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.21071","created_at":"2026-07-05T11:20:54Z"},{"alias_kind":"arxiv_version","alias_value":"2505.21071v2","created_at":"2026-07-05T11:20:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.21071","created_at":"2026-07-05T11:20:54Z"},{"alias_kind":"pith_short_12","alias_value":"VIRYVP5MJDN4","created_at":"2026-07-05T11:20:54Z"},{"alias_kind":"pith_short_16","alias_value":"VIRYVP5MJDN4VKMT","created_at":"2026-07-05T11:20:54Z"},{"alias_kind":"pith_short_8","alias_value":"VIRYVP5M","created_at":"2026-07-05T11:20:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:VIRYVP5MJDN4VKMTZ7G2TVURAF","target":"record","payload":{"canonical_record":{"source":{"id":"2505.21071","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-05-27T11:56:38Z","cross_cats_sorted":[],"title_canon_sha256":"911b5ae285680e75e62bfd50dc25463cc60ff2819059f4b7571920d96053850d","abstract_canon_sha256":"01a6655b7b7b765b2f68cf97aacfb6b5e48e9e33a761397abef0c1f56d4e5a4c"},"schema_version":"1.0"},"canonical_sha256":"aa238abfac48dbcaa993cfcda9d6910170b63acec7558c157b7c290df8c4e827","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:20:54.505967Z","signature_b64":"7yvKErUfafYwQsafi9BU6QX+Ssqwk6VWODHuSwUeuBMxy9+B4L6/Dmvwc01xGNMDA+Jars64k+nUEpvJqKyDBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa238abfac48dbcaa993cfcda9d6910170b63acec7558c157b7c290df8c4e827","last_reissued_at":"2026-07-05T11:20:54.505512Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:20:54.505512Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.21071","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:20:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SrI5dwJOBOB697r6TlCWsdFKAYy8xWSMOisVA0yYarIt46Z3v5zVJ54vIQv02Xl+bC9t9eahvpeIrgoKALA0Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T08:51:22.857640Z"},"content_sha256":"1c0b5fad372b8f4949818a59175ebb54655173bee99af67c7234df2022a46a26","schema_version":"1.0","event_id":"sha256:1c0b5fad372b8f4949818a59175ebb54655173bee99af67c7234df2022a46a26"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:VIRYVP5MJDN4VKMTZ7G2TVURAF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dual Hierarchical Least-Squares Programming with Equality Constraints","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Kai Pfeiffer","submitted_at":"2025-05-27T11:56:38Z","abstract_excerpt":"Hierarchical least-squares programming (HLSP) is an important tool in optimization as it enables the stacking of any number of priority levels in order to reflect complex constraint relationships, for example in physical systems like robots. Existing solvers typically address the primal formulation of HLSP's, which is computationally efficient due to sequential treatment of the priority levels. This way, already identified active constraints can be eliminated after each priority level, leading to smaller problems as the solver progresses through the hierarchy. However, this sequential progress"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.21071","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.21071/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:20:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K0YaN4aOEGmxcurwmMEONZVG9pJdsxVfa6pra0mxN+5nl+lKMWA+A7+wsK+kqpi5w9mI734dza15VH1u7m9DAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T08:51:22.858376Z"},"content_sha256":"0d29fd5ddcc440e3d73f3862fb82c4e6e137e1a30fc15e1e041ecf55814d1c01","schema_version":"1.0","event_id":"sha256:0d29fd5ddcc440e3d73f3862fb82c4e6e137e1a30fc15e1e041ecf55814d1c01"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VIRYVP5MJDN4VKMTZ7G2TVURAF/bundle.json","state_url":"https://pith.science/pith/VIRYVP5MJDN4VKMTZ7G2TVURAF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VIRYVP5MJDN4VKMTZ7G2TVURAF/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-09T08:51:22Z","links":{"resolver":"https://pith.science/pith/VIRYVP5MJDN4VKMTZ7G2TVURAF","bundle":"https://pith.science/pith/VIRYVP5MJDN4VKMTZ7G2TVURAF/bundle.json","state":"https://pith.science/pith/VIRYVP5MJDN4VKMTZ7G2TVURAF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VIRYVP5MJDN4VKMTZ7G2TVURAF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:VIRYVP5MJDN4VKMTZ7G2TVURAF","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"01a6655b7b7b765b2f68cf97aacfb6b5e48e9e33a761397abef0c1f56d4e5a4c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-05-27T11:56:38Z","title_canon_sha256":"911b5ae285680e75e62bfd50dc25463cc60ff2819059f4b7571920d96053850d"},"schema_version":"1.0","source":{"id":"2505.21071","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.21071","created_at":"2026-07-05T11:20:54Z"},{"alias_kind":"arxiv_version","alias_value":"2505.21071v2","created_at":"2026-07-05T11:20:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.21071","created_at":"2026-07-05T11:20:54Z"},{"alias_kind":"pith_short_12","alias_value":"VIRYVP5MJDN4","created_at":"2026-07-05T11:20:54Z"},{"alias_kind":"pith_short_16","alias_value":"VIRYVP5MJDN4VKMT","created_at":"2026-07-05T11:20:54Z"},{"alias_kind":"pith_short_8","alias_value":"VIRYVP5M","created_at":"2026-07-05T11:20:54Z"}],"graph_snapshots":[{"event_id":"sha256:0d29fd5ddcc440e3d73f3862fb82c4e6e137e1a30fc15e1e041ecf55814d1c01","target":"graph","created_at":"2026-07-05T11:20:54Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2505.21071/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Hierarchical least-squares programming (HLSP) is an important tool in optimization as it enables the stacking of any number of priority levels in order to reflect complex constraint relationships, for example in physical systems like robots. Existing solvers typically address the primal formulation of HLSP's, which is computationally efficient due to sequential treatment of the priority levels. This way, already identified active constraints can be eliminated after each priority level, leading to smaller problems as the solver progresses through the hierarchy. However, this sequential progress","authors_text":"Kai Pfeiffer","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-05-27T11:56:38Z","title":"Dual Hierarchical Least-Squares Programming with Equality Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.21071","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:1c0b5fad372b8f4949818a59175ebb54655173bee99af67c7234df2022a46a26","target":"record","created_at":"2026-07-05T11:20:54Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"01a6655b7b7b765b2f68cf97aacfb6b5e48e9e33a761397abef0c1f56d4e5a4c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-05-27T11:56:38Z","title_canon_sha256":"911b5ae285680e75e62bfd50dc25463cc60ff2819059f4b7571920d96053850d"},"schema_version":"1.0","source":{"id":"2505.21071","kind":"arxiv","version":2}},"canonical_sha256":"aa238abfac48dbcaa993cfcda9d6910170b63acec7558c157b7c290df8c4e827","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aa238abfac48dbcaa993cfcda9d6910170b63acec7558c157b7c290df8c4e827","first_computed_at":"2026-07-05T11:20:54.505512Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:20:54.505512Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7yvKErUfafYwQsafi9BU6QX+Ssqwk6VWODHuSwUeuBMxy9+B4L6/Dmvwc01xGNMDA+Jars64k+nUEpvJqKyDBw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:20:54.505967Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.21071","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1c0b5fad372b8f4949818a59175ebb54655173bee99af67c7234df2022a46a26","sha256:0d29fd5ddcc440e3d73f3862fb82c4e6e137e1a30fc15e1e041ecf55814d1c01"],"state_sha256":"7e37c9bc2fbbd9a0f42652a9f35f37601fec53a9d785d5ed431724c3df0de389"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LdNr3AYP2glmfoySEu7rnsmaouAvvoU9OQ91OWpyVF4VzGywgs3pUachYswxX4RvEUDqkOPMhUbXUDKyBoalBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T08:51:22.862460Z","bundle_sha256":"bf88526d07454620c0c87aa58f91c0fd890c058a84114d09608a24b447e9a0a9"}}