{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:I6FQXHYR4D77TZNYWEZHTECG6I","short_pith_number":"pith:I6FQXHYR","schema_version":"1.0","canonical_sha256":"478b0b9f11e0fff9e5b8b132799046f21d5689ac0ae24b82fb1de36458b4a24b","source":{"kind":"arxiv","id":"2401.07698","version":2},"attestation_state":"computed","paper":{"title":"Online Learning of Continuous Signed Distance Fields Using Piecewise Polynomials","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Ante Mari\\'c, Sylvain Calinon, Yiming Li","submitted_at":"2024-01-15T14:15:30Z","abstract_excerpt":"Reasoning about distance is indispensable for establishing or avoiding contact in manipulation tasks. To this end, we present an online approach for learning implicit representations of signed distance using piecewise polynomial basis functions. Starting from an arbitrary prior shape, our method incrementally constructs a continuous and smooth distance representation from incoming surface points, with analytical access to gradient information. The underlying model does not store training data for prediction, and its performance can be balanced through interpretable hyperparameters such as poly"},"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":"2401.07698","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-01-15T14:15:30Z","cross_cats_sorted":[],"title_canon_sha256":"bf928ae2fe66b5eaed809af6040b06a8d7c4c76646c32b6a7c03d31700088c88","abstract_canon_sha256":"5153aee3f6c4825ad9b7f2c1357eb4ef41148b734ea7a223c594035ceb6e2905"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:16:46.084143Z","signature_b64":"Vr7EBqifJ0E91hDIJEf1w2o50ml/D5pUTSfhkD0IoV6VcA5At1HuK8E6XFttKgcZqQhDIOwhfTfRlmMQUogZAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"478b0b9f11e0fff9e5b8b132799046f21d5689ac0ae24b82fb1de36458b4a24b","last_reissued_at":"2026-07-05T08:16:46.083638Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:16:46.083638Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Learning of Continuous Signed Distance Fields Using Piecewise Polynomials","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Ante Mari\\'c, Sylvain Calinon, Yiming Li","submitted_at":"2024-01-15T14:15:30Z","abstract_excerpt":"Reasoning about distance is indispensable for establishing or avoiding contact in manipulation tasks. To this end, we present an online approach for learning implicit representations of signed distance using piecewise polynomial basis functions. Starting from an arbitrary prior shape, our method incrementally constructs a continuous and smooth distance representation from incoming surface points, with analytical access to gradient information. The underlying model does not store training data for prediction, and its performance can be balanced through interpretable hyperparameters such as poly"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.07698","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/2401.07698/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":"2401.07698","created_at":"2026-07-05T08:16:46.083702+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.07698v2","created_at":"2026-07-05T08:16:46.083702+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.07698","created_at":"2026-07-05T08:16:46.083702+00:00"},{"alias_kind":"pith_short_12","alias_value":"I6FQXHYR4D77","created_at":"2026-07-05T08:16:46.083702+00:00"},{"alias_kind":"pith_short_16","alias_value":"I6FQXHYR4D77TZNY","created_at":"2026-07-05T08:16:46.083702+00:00"},{"alias_kind":"pith_short_8","alias_value":"I6FQXHYR","created_at":"2026-07-05T08:16:46.083702+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2504.18860","citing_title":"Diffeomorphic Obstacle Avoidance for Contractive Dynamical Systems via Implicit Representations","ref_index":48,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/I6FQXHYR4D77TZNYWEZHTECG6I","json":"https://pith.science/pith/I6FQXHYR4D77TZNYWEZHTECG6I.json","graph_json":"https://pith.science/api/pith-number/I6FQXHYR4D77TZNYWEZHTECG6I/graph.json","events_json":"https://pith.science/api/pith-number/I6FQXHYR4D77TZNYWEZHTECG6I/events.json","paper":"https://pith.science/paper/I6FQXHYR"},"agent_actions":{"view_html":"https://pith.science/pith/I6FQXHYR4D77TZNYWEZHTECG6I","download_json":"https://pith.science/pith/I6FQXHYR4D77TZNYWEZHTECG6I.json","view_paper":"https://pith.science/paper/I6FQXHYR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.07698&json=true","fetch_graph":"https://pith.science/api/pith-number/I6FQXHYR4D77TZNYWEZHTECG6I/graph.json","fetch_events":"https://pith.science/api/pith-number/I6FQXHYR4D77TZNYWEZHTECG6I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I6FQXHYR4D77TZNYWEZHTECG6I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I6FQXHYR4D77TZNYWEZHTECG6I/action/storage_attestation","attest_author":"https://pith.science/pith/I6FQXHYR4D77TZNYWEZHTECG6I/action/author_attestation","sign_citation":"https://pith.science/pith/I6FQXHYR4D77TZNYWEZHTECG6I/action/citation_signature","submit_replication":"https://pith.science/pith/I6FQXHYR4D77TZNYWEZHTECG6I/action/replication_record"}},"created_at":"2026-07-05T08:16:46.083702+00:00","updated_at":"2026-07-05T08:16:46.083702+00:00"}