{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:AZ4E7A4RQZQNSRMLGLNW2WVA7X","short_pith_number":"pith:AZ4E7A4R","schema_version":"1.0","canonical_sha256":"06784f83918660d9458b32db6d5aa0fdd98ede92fc42688b630d6e8197b44103","source":{"kind":"arxiv","id":"1707.04696","version":1},"attestation_state":"computed","paper":{"title":"Best rank k approximation for binary forms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AG","authors_text":"Alicia Tocino, Giorgio Ottaviani","submitted_at":"2017-07-15T06:57:11Z","abstract_excerpt":"In the tensor space $\\mathrm{Sym}^d {\\mathbb R}^2$ of binary forms we study the best rank $k$ approximation problem. The critical points of the best rank $1$ approximation problem are the eigenvectors and it is known that they span a hyperplane. We prove that the critical points of the best rank $k$ approximation problem lie in the same hyperplane."},"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":"1707.04696","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2017-07-15T06:57:11Z","cross_cats_sorted":[],"title_canon_sha256":"3ef7f645dc918decec1407ba785aa3c73c4c07f56f899b95044ca0ca734011aa","abstract_canon_sha256":"e9dd7727090cfbdaf94281c7bdcd782482a0de6c91218515dc6bf9c4231bd290"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:12.561540Z","signature_b64":"XfMgGH2rOH4c34bHQax1mAigusw4xwjSQIXmJ6CGHPqBDUvJlHhOXJofPAXiKiKhdxTIaOUnIRGMm7q8/TZFCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06784f83918660d9458b32db6d5aa0fdd98ede92fc42688b630d6e8197b44103","last_reissued_at":"2026-05-18T00:40:12.560989Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:12.560989Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Best rank k approximation for binary forms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AG","authors_text":"Alicia Tocino, Giorgio Ottaviani","submitted_at":"2017-07-15T06:57:11Z","abstract_excerpt":"In the tensor space $\\mathrm{Sym}^d {\\mathbb R}^2$ of binary forms we study the best rank $k$ approximation problem. The critical points of the best rank $1$ approximation problem are the eigenvectors and it is known that they span a hyperplane. We prove that the critical points of the best rank $k$ approximation problem lie in the same hyperplane."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04696","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":"1707.04696","created_at":"2026-05-18T00:40:12.561075+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.04696v1","created_at":"2026-05-18T00:40:12.561075+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04696","created_at":"2026-05-18T00:40:12.561075+00:00"},{"alias_kind":"pith_short_12","alias_value":"AZ4E7A4RQZQN","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"AZ4E7A4RQZQNSRML","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"AZ4E7A4R","created_at":"2026-05-18T12:31:08.081275+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/AZ4E7A4RQZQNSRMLGLNW2WVA7X","json":"https://pith.science/pith/AZ4E7A4RQZQNSRMLGLNW2WVA7X.json","graph_json":"https://pith.science/api/pith-number/AZ4E7A4RQZQNSRMLGLNW2WVA7X/graph.json","events_json":"https://pith.science/api/pith-number/AZ4E7A4RQZQNSRMLGLNW2WVA7X/events.json","paper":"https://pith.science/paper/AZ4E7A4R"},"agent_actions":{"view_html":"https://pith.science/pith/AZ4E7A4RQZQNSRMLGLNW2WVA7X","download_json":"https://pith.science/pith/AZ4E7A4RQZQNSRMLGLNW2WVA7X.json","view_paper":"https://pith.science/paper/AZ4E7A4R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.04696&json=true","fetch_graph":"https://pith.science/api/pith-number/AZ4E7A4RQZQNSRMLGLNW2WVA7X/graph.json","fetch_events":"https://pith.science/api/pith-number/AZ4E7A4RQZQNSRMLGLNW2WVA7X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AZ4E7A4RQZQNSRMLGLNW2WVA7X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AZ4E7A4RQZQNSRMLGLNW2WVA7X/action/storage_attestation","attest_author":"https://pith.science/pith/AZ4E7A4RQZQNSRMLGLNW2WVA7X/action/author_attestation","sign_citation":"https://pith.science/pith/AZ4E7A4RQZQNSRMLGLNW2WVA7X/action/citation_signature","submit_replication":"https://pith.science/pith/AZ4E7A4RQZQNSRMLGLNW2WVA7X/action/replication_record"}},"created_at":"2026-05-18T00:40:12.561075+00:00","updated_at":"2026-05-18T00:40:12.561075+00:00"}