{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:UHEAN6WFD3V7BOPZIVROVVKMKT","short_pith_number":"pith:UHEAN6WF","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"},"canonical_sha256":"a1c806fac51eebf0b9f94562ead54c54cfa846c2ed96447ec234f4ab9414aca3","source":{"kind":"arxiv","id":"1502.02473","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.02473","created_at":"2026-05-18T02:27:42Z"},{"alias_kind":"arxiv_version","alias_value":"1502.02473v1","created_at":"2026-05-18T02:27:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.02473","created_at":"2026-05-18T02:27:42Z"},{"alias_kind":"pith_short_12","alias_value":"UHEAN6WFD3V7","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UHEAN6WFD3V7BOPZ","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UHEAN6WF","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:UHEAN6WFD3V7BOPZIVROVVKMKT","target":"record","payload":{"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"},"canonical_sha256":"a1c806fac51eebf0b9f94562ead54c54cfa846c2ed96447ec234f4ab9414aca3","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"},"source_kind":"arxiv","source_id":"1502.02473","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:27:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JemmNHe8Cdn1Pd8GyE5nWNT++jNOliEg6FsLzU8NxlKqX8uv251BIZJKfmoV0EKC+f6rR0UUt3j3w/pYv3EYAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:33:50.781467Z"},"content_sha256":"84e3bb3100bb1c78835b2a05068bea99acea2689050ef6ff0797c00649814d1d","schema_version":"1.0","event_id":"sha256:84e3bb3100bb1c78835b2a05068bea99acea2689050ef6ff0797c00649814d1d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:UHEAN6WFD3V7BOPZIVROVVKMKT","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:27:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hh/JNMlV3Cd73HUaape31BCWlOU9mMkViDlGfb/+YoDyQRXA+78heOqpUszAfe2VO6tKQCdX3csSEHVfLwNeCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:33:50.782128Z"},"content_sha256":"e3febbe97fecec090b850d530fa9011c5135a45d358e3489ee2367496646ea76","schema_version":"1.0","event_id":"sha256:e3febbe97fecec090b850d530fa9011c5135a45d358e3489ee2367496646ea76"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UHEAN6WFD3V7BOPZIVROVVKMKT/bundle.json","state_url":"https://pith.science/pith/UHEAN6WFD3V7BOPZIVROVVKMKT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UHEAN6WFD3V7BOPZIVROVVKMKT/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-05T20:33:50Z","links":{"resolver":"https://pith.science/pith/UHEAN6WFD3V7BOPZIVROVVKMKT","bundle":"https://pith.science/pith/UHEAN6WFD3V7BOPZIVROVVKMKT/bundle.json","state":"https://pith.science/pith/UHEAN6WFD3V7BOPZIVROVVKMKT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UHEAN6WFD3V7BOPZIVROVVKMKT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:UHEAN6WFD3V7BOPZIVROVVKMKT","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"2339531b8b967ed71441ceb1b0054d7931321fea4f26bb461a467373d2cbf38c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2015-02-09T13:12:40Z","title_canon_sha256":"efe284e9881d572127c9d87dc7e3b1a83623d92546fc6d1d4e24df2832e9847a"},"schema_version":"1.0","source":{"id":"1502.02473","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.02473","created_at":"2026-05-18T02:27:42Z"},{"alias_kind":"arxiv_version","alias_value":"1502.02473v1","created_at":"2026-05-18T02:27:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.02473","created_at":"2026-05-18T02:27:42Z"},{"alias_kind":"pith_short_12","alias_value":"UHEAN6WFD3V7","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UHEAN6WFD3V7BOPZ","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UHEAN6WF","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:e3febbe97fecec090b850d530fa9011c5135a45d358e3489ee2367496646ea76","target":"graph","created_at":"2026-05-18T02:27:42Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Didier Henrion (LAAS), LIP6), Mohab Safey El Din (Syst\\`emes Polynomiaux, Simone Naldi (LAAS)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2015-02-09T13:12:40Z","title":"Real root finding for rank defects in linear Hankel matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.02473","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:84e3bb3100bb1c78835b2a05068bea99acea2689050ef6ff0797c00649814d1d","target":"record","created_at":"2026-05-18T02:27:42Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"2339531b8b967ed71441ceb1b0054d7931321fea4f26bb461a467373d2cbf38c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2015-02-09T13:12:40Z","title_canon_sha256":"efe284e9881d572127c9d87dc7e3b1a83623d92546fc6d1d4e24df2832e9847a"},"schema_version":"1.0","source":{"id":"1502.02473","kind":"arxiv","version":1}},"canonical_sha256":"a1c806fac51eebf0b9f94562ead54c54cfa846c2ed96447ec234f4ab9414aca3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a1c806fac51eebf0b9f94562ead54c54cfa846c2ed96447ec234f4ab9414aca3","first_computed_at":"2026-05-18T02:27:42.197142Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:27:42.197142Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VHq91Z5LRY6dW3zMMVkhC3CiYF/QOX9RAsmz1gyeGeQdqSFOjQrKoPNOFvOXjT1GpQxgBp/gn5bhJDqH5WQ+Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:27:42.197944Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.02473","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:84e3bb3100bb1c78835b2a05068bea99acea2689050ef6ff0797c00649814d1d","sha256:e3febbe97fecec090b850d530fa9011c5135a45d358e3489ee2367496646ea76"],"state_sha256":"2dbc5258406e9effbf984c102020026df46e8c731db232fb4536fe64924286fd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sBNX9FwB0m2iN3Zs+H3F7yfzk5whayOfqlBJDlTkS08CKHHApgpVbVbyeATHZ2grAeH7zLf2id6w9cBaKFRTCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T20:33:50.786142Z","bundle_sha256":"3d8e9897f3c441e81b7bbb9cdde2e8f08411ee70aa556286c7dfa85e2703536a"}}