{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:QW6JLEOBIAGMEA6JHCEK775CDN","short_pith_number":"pith:QW6JLEOB","schema_version":"1.0","canonical_sha256":"85bc9591c1400cc203c93888afffa21b693f7e143364baedfbf6a1256240fd0e","source":{"kind":"arxiv","id":"1112.5960","version":2},"attestation_state":"computed","paper":{"title":"The Gram dimension of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.CO","authors_text":"Antonios Varvitsiotis, Monique Laurent","submitted_at":"2011-12-27T13:50:38Z","abstract_excerpt":"The Gram dimension $\\gd(G)$ of a graph is the smallest integer $k \\ge 1$ such that, for every assignment of unit vectors to the nodes of the graph, there exists another assignment of unit vectors lying in $\\oR^k$, having the same inner products on the edges of the graph. The class of graphs satisfying $\\gd(G) \\le k$ is minor closed for fixed $k$, so it can characterized by a finite list of forbidden minors. For $k\\le 3$, the only forbidden minor is $K_{k+1}$. We show that a graph has Gram dimension at most 4 if and only if it does not have $K_5$ and $K_{2,2,2}$ as minors. We also show some clo"},"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":"1112.5960","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-12-27T13:50:38Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"1fe81985f2da8f452c8b980cd44839dbcd0e13a8dd1a834bd94f4fec51ceb80c","abstract_canon_sha256":"64c7ab72f60b9e3cadcf45d1386a5d3bc2d3e3f3ed08b862d2f202d5f57b0722"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:58:39.434088Z","signature_b64":"LvjU7aZmvvV0WV6ha4N9NVw2KH8b7d5u3fbmMFXWq8tobRS4Fwm3FhMGr0OnG5C+1HdcvpKscHFjg61K2TKbCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85bc9591c1400cc203c93888afffa21b693f7e143364baedfbf6a1256240fd0e","last_reissued_at":"2026-05-18T03:58:39.433619Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:58:39.433619Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Gram dimension of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.CO","authors_text":"Antonios Varvitsiotis, Monique Laurent","submitted_at":"2011-12-27T13:50:38Z","abstract_excerpt":"The Gram dimension $\\gd(G)$ of a graph is the smallest integer $k \\ge 1$ such that, for every assignment of unit vectors to the nodes of the graph, there exists another assignment of unit vectors lying in $\\oR^k$, having the same inner products on the edges of the graph. The class of graphs satisfying $\\gd(G) \\le k$ is minor closed for fixed $k$, so it can characterized by a finite list of forbidden minors. For $k\\le 3$, the only forbidden minor is $K_{k+1}$. We show that a graph has Gram dimension at most 4 if and only if it does not have $K_5$ and $K_{2,2,2}$ as minors. We also show some clo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.5960","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":"1112.5960","created_at":"2026-05-18T03:58:39.433687+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.5960v2","created_at":"2026-05-18T03:58:39.433687+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.5960","created_at":"2026-05-18T03:58:39.433687+00:00"},{"alias_kind":"pith_short_12","alias_value":"QW6JLEOBIAGM","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_16","alias_value":"QW6JLEOBIAGMEA6J","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_8","alias_value":"QW6JLEOB","created_at":"2026-05-18T12:26:39.201973+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/QW6JLEOBIAGMEA6JHCEK775CDN","json":"https://pith.science/pith/QW6JLEOBIAGMEA6JHCEK775CDN.json","graph_json":"https://pith.science/api/pith-number/QW6JLEOBIAGMEA6JHCEK775CDN/graph.json","events_json":"https://pith.science/api/pith-number/QW6JLEOBIAGMEA6JHCEK775CDN/events.json","paper":"https://pith.science/paper/QW6JLEOB"},"agent_actions":{"view_html":"https://pith.science/pith/QW6JLEOBIAGMEA6JHCEK775CDN","download_json":"https://pith.science/pith/QW6JLEOBIAGMEA6JHCEK775CDN.json","view_paper":"https://pith.science/paper/QW6JLEOB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.5960&json=true","fetch_graph":"https://pith.science/api/pith-number/QW6JLEOBIAGMEA6JHCEK775CDN/graph.json","fetch_events":"https://pith.science/api/pith-number/QW6JLEOBIAGMEA6JHCEK775CDN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QW6JLEOBIAGMEA6JHCEK775CDN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QW6JLEOBIAGMEA6JHCEK775CDN/action/storage_attestation","attest_author":"https://pith.science/pith/QW6JLEOBIAGMEA6JHCEK775CDN/action/author_attestation","sign_citation":"https://pith.science/pith/QW6JLEOBIAGMEA6JHCEK775CDN/action/citation_signature","submit_replication":"https://pith.science/pith/QW6JLEOBIAGMEA6JHCEK775CDN/action/replication_record"}},"created_at":"2026-05-18T03:58:39.433687+00:00","updated_at":"2026-05-18T03:58:39.433687+00:00"}