{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:UHEAN6WFD3V7BOPZIVROVVKMKT","short_pith_number":"pith:UHEAN6WF","schema_version":"1.0","canonical_sha256":"a1c806fac51eebf0b9f94562ead54c54cfa846c2ed96447ec234f4ab9414aca3","source":{"kind":"arxiv","id":"1502.02473","version":1},"attestation_state":"computed","paper":{"title":"Real root finding for rank defects in linear Hankel matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Didier Henrion (LAAS), LIP6), Mohab Safey El Din (Syst\\`emes Polynomiaux, Simone Naldi (LAAS)","submitted_at":"2015-02-09T13:12:40Z","abstract_excerpt":"Let $H\\_0, ..., H\\_n$ be $m \\times m$\nmatrices with entries in $\\QQ$ and Hankel structure, i.e. constant skew diagonals.\nWe consider the linear Hankel matrix $H(\\vecx)=H\\_0+\\X\\_1H\\_1+...+\\X\\_nH\\_n$ and the problem of computing      sample  points in  each connected component of the real algebraic set defined by the rank constraint ${\\sf rank}(H(\\vecx))\\leq r$, for a given integer $r \\leq m-1$. Computing sample points in real algebraic sets defined by rank defects in linear matrices is a general problem that finds      applications in many areas such as control theory, computational geometry, o"},"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":"1502.02473","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2015-02-09T13:12:40Z","cross_cats_sorted":[],"title_canon_sha256":"efe284e9881d572127c9d87dc7e3b1a83623d92546fc6d1d4e24df2832e9847a","abstract_canon_sha256":"2339531b8b967ed71441ceb1b0054d7931321fea4f26bb461a467373d2cbf38c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:42.197944Z","signature_b64":"VHq91Z5LRY6dW3zMMVkhC3CiYF/QOX9RAsmz1gyeGeQdqSFOjQrKoPNOFvOXjT1GpQxgBp/gn5bhJDqH5WQ+Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a1c806fac51eebf0b9f94562ead54c54cfa846c2ed96447ec234f4ab9414aca3","last_reissued_at":"2026-05-18T02:27:42.197142Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:42.197142Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Real root finding for rank defects in linear Hankel matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Didier Henrion (LAAS), LIP6), Mohab Safey El Din (Syst\\`emes Polynomiaux, Simone Naldi (LAAS)","submitted_at":"2015-02-09T13:12:40Z","abstract_excerpt":"Let $H\\_0, ..., H\\_n$ be $m \\times m$\nmatrices with entries in $\\QQ$ and Hankel structure, i.e. constant skew diagonals.\nWe consider the linear Hankel matrix $H(\\vecx)=H\\_0+\\X\\_1H\\_1+...+\\X\\_nH\\_n$ and the problem of computing      sample  points in  each connected component of the real algebraic set defined by the rank constraint ${\\sf rank}(H(\\vecx))\\leq r$, for a given integer $r \\leq m-1$. Computing sample points in real algebraic sets defined by rank defects in linear matrices is a general problem that finds      applications in many areas such as control theory, computational geometry, o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.02473","kind":"arxiv","version":1},"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":"1502.02473","created_at":"2026-05-18T02:27:42.197272+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.02473v1","created_at":"2026-05-18T02:27:42.197272+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.02473","created_at":"2026-05-18T02:27:42.197272+00:00"},{"alias_kind":"pith_short_12","alias_value":"UHEAN6WFD3V7","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"UHEAN6WFD3V7BOPZ","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"UHEAN6WF","created_at":"2026-05-18T12:29:44.643036+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/UHEAN6WFD3V7BOPZIVROVVKMKT","json":"https://pith.science/pith/UHEAN6WFD3V7BOPZIVROVVKMKT.json","graph_json":"https://pith.science/api/pith-number/UHEAN6WFD3V7BOPZIVROVVKMKT/graph.json","events_json":"https://pith.science/api/pith-number/UHEAN6WFD3V7BOPZIVROVVKMKT/events.json","paper":"https://pith.science/paper/UHEAN6WF"},"agent_actions":{"view_html":"https://pith.science/pith/UHEAN6WFD3V7BOPZIVROVVKMKT","download_json":"https://pith.science/pith/UHEAN6WFD3V7BOPZIVROVVKMKT.json","view_paper":"https://pith.science/paper/UHEAN6WF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.02473&json=true","fetch_graph":"https://pith.science/api/pith-number/UHEAN6WFD3V7BOPZIVROVVKMKT/graph.json","fetch_events":"https://pith.science/api/pith-number/UHEAN6WFD3V7BOPZIVROVVKMKT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UHEAN6WFD3V7BOPZIVROVVKMKT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UHEAN6WFD3V7BOPZIVROVVKMKT/action/storage_attestation","attest_author":"https://pith.science/pith/UHEAN6WFD3V7BOPZIVROVVKMKT/action/author_attestation","sign_citation":"https://pith.science/pith/UHEAN6WFD3V7BOPZIVROVVKMKT/action/citation_signature","submit_replication":"https://pith.science/pith/UHEAN6WFD3V7BOPZIVROVVKMKT/action/replication_record"}},"created_at":"2026-05-18T02:27:42.197272+00:00","updated_at":"2026-05-18T02:27:42.197272+00:00"}