{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:5IIRZZOEL46I4ZXRTAZULU3TNW","short_pith_number":"pith:5IIRZZOE","schema_version":"1.0","canonical_sha256":"ea111ce5c45f3c8e66f1983345d3736d8b5b85a8dca056f963a99f5e1a883683","source":{"kind":"arxiv","id":"1412.8581","version":2},"attestation_state":"computed","paper":{"title":"Sweeping by a tame process","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Aris Daniilidis, Dmitriy Drusvyatskiy","submitted_at":"2014-12-30T08:41:32Z","abstract_excerpt":"We show that any semi-algebraic sweeping process admits piecewise absolutely continuous solutions, and any such bounded trajectory must have finite length. Analogous results hold more generally for sweeping processes definable in o-minimal structures. This extends previous work on (sub)gradient dynamical systems beyond monotone sweeping sets."},"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":"1412.8581","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-12-30T08:41:32Z","cross_cats_sorted":[],"title_canon_sha256":"667b75d70577103ea654e0a3f06982f5741363d3a42cb383659233f4af37adbb","abstract_canon_sha256":"83ec2449bd61803cf9cc709aaddc5e8a89fd3f8db3d0bff48103f3f1abe9c978"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:38.301523Z","signature_b64":"fjH8wynCoZr8y26LaJZ12UiETfh6nlwfsJLIVD9Ig8hWgi2AgGsOLYrLFzubdKvXn7J/VrUtx+vD+2XHE0P5DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea111ce5c45f3c8e66f1983345d3736d8b5b85a8dca056f963a99f5e1a883683","last_reissued_at":"2026-05-18T00:56:38.300545Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:38.300545Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sweeping by a tame process","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Aris Daniilidis, Dmitriy Drusvyatskiy","submitted_at":"2014-12-30T08:41:32Z","abstract_excerpt":"We show that any semi-algebraic sweeping process admits piecewise absolutely continuous solutions, and any such bounded trajectory must have finite length. Analogous results hold more generally for sweeping processes definable in o-minimal structures. This extends previous work on (sub)gradient dynamical systems beyond monotone sweeping sets."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.8581","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":""},"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":"1412.8581","created_at":"2026-05-18T00:56:38.300747+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.8581v2","created_at":"2026-05-18T00:56:38.300747+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.8581","created_at":"2026-05-18T00:56:38.300747+00:00"},{"alias_kind":"pith_short_12","alias_value":"5IIRZZOEL46I","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"5IIRZZOEL46I4ZXR","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"5IIRZZOE","created_at":"2026-05-18T12:28:14.216126+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/5IIRZZOEL46I4ZXRTAZULU3TNW","json":"https://pith.science/pith/5IIRZZOEL46I4ZXRTAZULU3TNW.json","graph_json":"https://pith.science/api/pith-number/5IIRZZOEL46I4ZXRTAZULU3TNW/graph.json","events_json":"https://pith.science/api/pith-number/5IIRZZOEL46I4ZXRTAZULU3TNW/events.json","paper":"https://pith.science/paper/5IIRZZOE"},"agent_actions":{"view_html":"https://pith.science/pith/5IIRZZOEL46I4ZXRTAZULU3TNW","download_json":"https://pith.science/pith/5IIRZZOEL46I4ZXRTAZULU3TNW.json","view_paper":"https://pith.science/paper/5IIRZZOE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.8581&json=true","fetch_graph":"https://pith.science/api/pith-number/5IIRZZOEL46I4ZXRTAZULU3TNW/graph.json","fetch_events":"https://pith.science/api/pith-number/5IIRZZOEL46I4ZXRTAZULU3TNW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5IIRZZOEL46I4ZXRTAZULU3TNW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5IIRZZOEL46I4ZXRTAZULU3TNW/action/storage_attestation","attest_author":"https://pith.science/pith/5IIRZZOEL46I4ZXRTAZULU3TNW/action/author_attestation","sign_citation":"https://pith.science/pith/5IIRZZOEL46I4ZXRTAZULU3TNW/action/citation_signature","submit_replication":"https://pith.science/pith/5IIRZZOEL46I4ZXRTAZULU3TNW/action/replication_record"}},"created_at":"2026-05-18T00:56:38.300747+00:00","updated_at":"2026-05-18T00:56:38.300747+00:00"}