{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:3DP6WAUUSZNEEKTXBVSOQWTJDS","short_pith_number":"pith:3DP6WAUU","schema_version":"1.0","canonical_sha256":"d8dfeb0294965a422a770d64e85a691c808e04d1fa84150ecf8220dc523c0307","source":{"kind":"arxiv","id":"2606.11194","version":1},"attestation_state":"computed","paper":{"title":"The SOS Rank of a $5 \\times 4$ Biquadratic Form via Orthogonality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.CO","authors_text":"Yannan Chen","submitted_at":"2026-03-28T12:03:16Z","abstract_excerpt":"Biquadratic forms arise naturally in polynomial optimization, tensor analysis, and quantum information theory. A key problem is determining the minimal number of squares needed in a sum-of-squares (SOS) representation of such a form, known as its SOS rank. For fixed dimensions $(m,n)$, the maximum possible SOS rank over all biquadratic forms in $m$ and $n$ variables is denoted $\\operatorname{BSR}(m,n)$. Recent advances have established lower bounds on $\\operatorname{BSR}(m,n)$ via combinatorial constructions involving bipartite graphs and the orthogonality method. In particular, for the case $"},"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":"2606.11194","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-03-28T12:03:16Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"1df77c390cb08c7a45a63ff9cb5349282232592b07226e1bb911e836f82f1ed9","abstract_canon_sha256":"f787aa5ca1fdc4005bab1589e5e3bf5c9b2eb934754bab1fbe93c636190a6c29"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-11T00:08:05.713645Z","signature_b64":"iwp8ZmZTMUC77LKhu1ILYgwehuA0lh8guIJBpFthITHpVjW+iHM/ktLp4XV5Qybs7V9PU9YpDFikgUEfkWmkBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d8dfeb0294965a422a770d64e85a691c808e04d1fa84150ecf8220dc523c0307","last_reissued_at":"2026-06-11T00:08:05.712633Z","signature_status":"signed_v1","first_computed_at":"2026-06-11T00:08:05.712633Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The SOS Rank of a $5 \\times 4$ Biquadratic Form via Orthogonality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.CO","authors_text":"Yannan Chen","submitted_at":"2026-03-28T12:03:16Z","abstract_excerpt":"Biquadratic forms arise naturally in polynomial optimization, tensor analysis, and quantum information theory. A key problem is determining the minimal number of squares needed in a sum-of-squares (SOS) representation of such a form, known as its SOS rank. For fixed dimensions $(m,n)$, the maximum possible SOS rank over all biquadratic forms in $m$ and $n$ variables is denoted $\\operatorname{BSR}(m,n)$. Recent advances have established lower bounds on $\\operatorname{BSR}(m,n)$ via combinatorial constructions involving bipartite graphs and the orthogonality method. In particular, for the case $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.11194","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.11194/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":"2606.11194","created_at":"2026-06-11T00:08:05.712779+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.11194v1","created_at":"2026-06-11T00:08:05.712779+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.11194","created_at":"2026-06-11T00:08:05.712779+00:00"},{"alias_kind":"pith_short_12","alias_value":"3DP6WAUUSZNE","created_at":"2026-06-11T00:08:05.712779+00:00"},{"alias_kind":"pith_short_16","alias_value":"3DP6WAUUSZNEEKTX","created_at":"2026-06-11T00:08:05.712779+00:00"},{"alias_kind":"pith_short_8","alias_value":"3DP6WAUU","created_at":"2026-06-11T00:08:05.712779+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/3DP6WAUUSZNEEKTXBVSOQWTJDS","json":"https://pith.science/pith/3DP6WAUUSZNEEKTXBVSOQWTJDS.json","graph_json":"https://pith.science/api/pith-number/3DP6WAUUSZNEEKTXBVSOQWTJDS/graph.json","events_json":"https://pith.science/api/pith-number/3DP6WAUUSZNEEKTXBVSOQWTJDS/events.json","paper":"https://pith.science/paper/3DP6WAUU"},"agent_actions":{"view_html":"https://pith.science/pith/3DP6WAUUSZNEEKTXBVSOQWTJDS","download_json":"https://pith.science/pith/3DP6WAUUSZNEEKTXBVSOQWTJDS.json","view_paper":"https://pith.science/paper/3DP6WAUU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.11194&json=true","fetch_graph":"https://pith.science/api/pith-number/3DP6WAUUSZNEEKTXBVSOQWTJDS/graph.json","fetch_events":"https://pith.science/api/pith-number/3DP6WAUUSZNEEKTXBVSOQWTJDS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3DP6WAUUSZNEEKTXBVSOQWTJDS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3DP6WAUUSZNEEKTXBVSOQWTJDS/action/storage_attestation","attest_author":"https://pith.science/pith/3DP6WAUUSZNEEKTXBVSOQWTJDS/action/author_attestation","sign_citation":"https://pith.science/pith/3DP6WAUUSZNEEKTXBVSOQWTJDS/action/citation_signature","submit_replication":"https://pith.science/pith/3DP6WAUUSZNEEKTXBVSOQWTJDS/action/replication_record"}},"created_at":"2026-06-11T00:08:05.712779+00:00","updated_at":"2026-06-11T00:08:05.712779+00:00"}