{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:NDVRYCX6BUDE7POX42BKIZHMVR","short_pith_number":"pith:NDVRYCX6","schema_version":"1.0","canonical_sha256":"68eb1c0afe0d064fbdd7e682a464ecac476627d88101d154aaedfa2f2d3eaf37","source":{"kind":"arxiv","id":"2011.04828","version":2},"attestation_state":"computed","paper":{"title":"Learning Efficient Constraint Graph Sampling for Robotic Sequential Manipulation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Joaquim Ortiz-Haro, Marc Toussaint, Ozgur S. Oguz, Valentin N. Hartmann","submitted_at":"2020-11-09T23:28:47Z","abstract_excerpt":"Efficient sampling from constraint manifolds, and thereby generating a diverse set of solutions for feasibility problems, is a fundamental challenge. We consider the case where a problem is factored, that is, the underlying nonlinear program is decomposed into differentiable equality and inequality constraints, each of which depends only on some variables. Such problems are at the core of efficient and robust sequential robot manipulation planning. Naive sequential conditional sampling of individual variables, as well as fully joint sampling of all variables at once (e.g., leveraging optimizat"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2011.04828","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2020-11-09T23:28:47Z","cross_cats_sorted":[],"title_canon_sha256":"cb6aa4e7b0bfa4ece9bcc8defa691d35b6cf1c1d2d5b79993d4296ee129a764b","abstract_canon_sha256":"28fc6df586c715647e59592b87e3130ddf2ec66087945f21eea7c62985097545"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:26:51.628686Z","signature_b64":"OZswJoX0J/EzsuvlnYUBDbjBka48Qxy0hrBLr1EjgOQ91IiJhK5iIUe8OaJLUFiNbpc1LGpR0Ckwfi3sCM+zCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68eb1c0afe0d064fbdd7e682a464ecac476627d88101d154aaedfa2f2d3eaf37","last_reissued_at":"2026-07-05T02:26:51.628212Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:26:51.628212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Efficient Constraint Graph Sampling for Robotic Sequential Manipulation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Joaquim Ortiz-Haro, Marc Toussaint, Ozgur S. Oguz, Valentin N. Hartmann","submitted_at":"2020-11-09T23:28:47Z","abstract_excerpt":"Efficient sampling from constraint manifolds, and thereby generating a diverse set of solutions for feasibility problems, is a fundamental challenge. We consider the case where a problem is factored, that is, the underlying nonlinear program is decomposed into differentiable equality and inequality constraints, each of which depends only on some variables. Such problems are at the core of efficient and robust sequential robot manipulation planning. Naive sequential conditional sampling of individual variables, as well as fully joint sampling of all variables at once (e.g., leveraging optimizat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.04828","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/2011.04828/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2011.04828","created_at":"2026-07-05T02:26:51.628267+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.04828v2","created_at":"2026-07-05T02:26:51.628267+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.04828","created_at":"2026-07-05T02:26:51.628267+00:00"},{"alias_kind":"pith_short_12","alias_value":"NDVRYCX6BUDE","created_at":"2026-07-05T02:26:51.628267+00:00"},{"alias_kind":"pith_short_16","alias_value":"NDVRYCX6BUDE7POX","created_at":"2026-07-05T02:26:51.628267+00:00"},{"alias_kind":"pith_short_8","alias_value":"NDVRYCX6","created_at":"2026-07-05T02:26:51.628267+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.04645","citing_title":"Planning from Point Clouds over Continuous Actions for Multi-object Rearrangement","ref_index":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NDVRYCX6BUDE7POX42BKIZHMVR","json":"https://pith.science/pith/NDVRYCX6BUDE7POX42BKIZHMVR.json","graph_json":"https://pith.science/api/pith-number/NDVRYCX6BUDE7POX42BKIZHMVR/graph.json","events_json":"https://pith.science/api/pith-number/NDVRYCX6BUDE7POX42BKIZHMVR/events.json","paper":"https://pith.science/paper/NDVRYCX6"},"agent_actions":{"view_html":"https://pith.science/pith/NDVRYCX6BUDE7POX42BKIZHMVR","download_json":"https://pith.science/pith/NDVRYCX6BUDE7POX42BKIZHMVR.json","view_paper":"https://pith.science/paper/NDVRYCX6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.04828&json=true","fetch_graph":"https://pith.science/api/pith-number/NDVRYCX6BUDE7POX42BKIZHMVR/graph.json","fetch_events":"https://pith.science/api/pith-number/NDVRYCX6BUDE7POX42BKIZHMVR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NDVRYCX6BUDE7POX42BKIZHMVR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NDVRYCX6BUDE7POX42BKIZHMVR/action/storage_attestation","attest_author":"https://pith.science/pith/NDVRYCX6BUDE7POX42BKIZHMVR/action/author_attestation","sign_citation":"https://pith.science/pith/NDVRYCX6BUDE7POX42BKIZHMVR/action/citation_signature","submit_replication":"https://pith.science/pith/NDVRYCX6BUDE7POX42BKIZHMVR/action/replication_record"}},"created_at":"2026-07-05T02:26:51.628267+00:00","updated_at":"2026-07-05T02:26:51.628267+00:00"}