{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:5VFFNCUX4FFLGPHSBMTNVVDKUQ","short_pith_number":"pith:5VFFNCUX","schema_version":"1.0","canonical_sha256":"ed4a568a97e14ab33cf20b26dad46aa43915597c0d7bcd04b22818debf163e36","source":{"kind":"arxiv","id":"2507.04949","version":3},"attestation_state":"computed","paper":{"title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Amirreza Razmjoo, Sylvain Calinon, Teng Xue, Yan Zhang","submitted_at":"2025-07-07T12:49:20Z","abstract_excerpt":"Many robotic tasks, such as inverse kinematics, motion planning, and contact-rich manipulation, can be formulated as optimization problems. Solving these problems requires addressing inherent nonlinear kinematics, complex contact dynamics, long-horizon correlations, and multi-modal optimization landscapes, each posing distinct challenges for state-of-the-art optimizers. While existing methods tackle these issues through problem-specific strategies, such specialization inherently limits cross-task generalization, requires heavy engineering effort in problem reformulation, and hinders multi-task"},"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":"2507.04949","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2025-07-07T12:49:20Z","cross_cats_sorted":[],"title_canon_sha256":"ef77b456ec6f827006564184963cb79d75bb1df4f9082e7c057e558454066acc","abstract_canon_sha256":"96fc3949ca97380ba90cb8d9e7b0044fcd42512f70746c096bf0463eb906c91c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-26T01:15:44.848157Z","signature_b64":"Vk8r15EYhiSwCoqsEwLxmJeC+n10wCfjfaU7AeR/dLXwhzfZ5oPqSaBEFk072MFpyJeiYZclohQxuRBRdjYUBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed4a568a97e14ab33cf20b26dad46aa43915597c0d7bcd04b22818debf163e36","last_reissued_at":"2026-06-26T01:15:44.847650Z","signature_status":"signed_v1","first_computed_at":"2026-06-26T01:15:44.847650Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Amirreza Razmjoo, Sylvain Calinon, Teng Xue, Yan Zhang","submitted_at":"2025-07-07T12:49:20Z","abstract_excerpt":"Many robotic tasks, such as inverse kinematics, motion planning, and contact-rich manipulation, can be formulated as optimization problems. Solving these problems requires addressing inherent nonlinear kinematics, complex contact dynamics, long-horizon correlations, and multi-modal optimization landscapes, each posing distinct challenges for state-of-the-art optimizers. While existing methods tackle these issues through problem-specific strategies, such specialization inherently limits cross-task generalization, requires heavy engineering effort in problem reformulation, and hinders multi-task"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.04949","kind":"arxiv","version":3},"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/2507.04949/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":"2507.04949","created_at":"2026-06-26T01:15:44.847708+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.04949v3","created_at":"2026-06-26T01:15:44.847708+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.04949","created_at":"2026-06-26T01:15:44.847708+00:00"},{"alias_kind":"pith_short_12","alias_value":"5VFFNCUX4FFL","created_at":"2026-06-26T01:15:44.847708+00:00"},{"alias_kind":"pith_short_16","alias_value":"5VFFNCUX4FFLGPHS","created_at":"2026-06-26T01:15:44.847708+00:00"},{"alias_kind":"pith_short_8","alias_value":"5VFFNCUX","created_at":"2026-06-26T01:15:44.847708+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5VFFNCUX4FFLGPHSBMTNVVDKUQ","json":"https://pith.science/pith/5VFFNCUX4FFLGPHSBMTNVVDKUQ.json","graph_json":"https://pith.science/api/pith-number/5VFFNCUX4FFLGPHSBMTNVVDKUQ/graph.json","events_json":"https://pith.science/api/pith-number/5VFFNCUX4FFLGPHSBMTNVVDKUQ/events.json","paper":"https://pith.science/paper/5VFFNCUX"},"agent_actions":{"view_html":"https://pith.science/pith/5VFFNCUX4FFLGPHSBMTNVVDKUQ","download_json":"https://pith.science/pith/5VFFNCUX4FFLGPHSBMTNVVDKUQ.json","view_paper":"https://pith.science/paper/5VFFNCUX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.04949&json=true","fetch_graph":"https://pith.science/api/pith-number/5VFFNCUX4FFLGPHSBMTNVVDKUQ/graph.json","fetch_events":"https://pith.science/api/pith-number/5VFFNCUX4FFLGPHSBMTNVVDKUQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5VFFNCUX4FFLGPHSBMTNVVDKUQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5VFFNCUX4FFLGPHSBMTNVVDKUQ/action/storage_attestation","attest_author":"https://pith.science/pith/5VFFNCUX4FFLGPHSBMTNVVDKUQ/action/author_attestation","sign_citation":"https://pith.science/pith/5VFFNCUX4FFLGPHSBMTNVVDKUQ/action/citation_signature","submit_replication":"https://pith.science/pith/5VFFNCUX4FFLGPHSBMTNVVDKUQ/action/replication_record"}},"created_at":"2026-06-26T01:15:44.847708+00:00","updated_at":"2026-06-26T01:15:44.847708+00:00"}