{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:QW6JLEOBIAGMEA6JHCEK775CDN","short_pith_number":"pith:QW6JLEOB","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"},"canonical_sha256":"85bc9591c1400cc203c93888afffa21b693f7e143364baedfbf6a1256240fd0e","source":{"kind":"arxiv","id":"1112.5960","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.5960","created_at":"2026-05-18T03:58:39Z"},{"alias_kind":"arxiv_version","alias_value":"1112.5960v2","created_at":"2026-05-18T03:58:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.5960","created_at":"2026-05-18T03:58:39Z"},{"alias_kind":"pith_short_12","alias_value":"QW6JLEOBIAGM","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"QW6JLEOBIAGMEA6J","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"QW6JLEOB","created_at":"2026-05-18T12:26:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:QW6JLEOBIAGMEA6JHCEK775CDN","target":"record","payload":{"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"},"canonical_sha256":"85bc9591c1400cc203c93888afffa21b693f7e143364baedfbf6a1256240fd0e","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"},"source_kind":"arxiv","source_id":"1112.5960","source_version":2,"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-18T03:58:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5K8hrzzJrBxQsPFiRFFogVmoyQ3/MiioFVQd9AFI4tJWqzFu1fLN4E5PSL3QKvQtP/tff4ZHsC1bmZ4LuSSxBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:08:41.088658Z"},"content_sha256":"e0c65119563c1c3a08d1a0103ced0758a0999415a95d3b4b47cb5fb1211784d4","schema_version":"1.0","event_id":"sha256:e0c65119563c1c3a08d1a0103ced0758a0999415a95d3b4b47cb5fb1211784d4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:QW6JLEOBIAGMEA6JHCEK775CDN","target":"graph","payload":{"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"},"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-18T03:58:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4kiLfiyT42K9uhi//gF8XwUZf9lewGrqN5PNd4TAim472N8gWEyUEAdNEgm2X0gQaj8vTNTx0K+dKYD4uQaJCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:08:41.089041Z"},"content_sha256":"a1829ac6572aa08847e778f7329967f79436cd21fa4e71bdd39343ebeb504036","schema_version":"1.0","event_id":"sha256:a1829ac6572aa08847e778f7329967f79436cd21fa4e71bdd39343ebeb504036"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QW6JLEOBIAGMEA6JHCEK775CDN/bundle.json","state_url":"https://pith.science/pith/QW6JLEOBIAGMEA6JHCEK775CDN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QW6JLEOBIAGMEA6JHCEK775CDN/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-05-30T12:08:41Z","links":{"resolver":"https://pith.science/pith/QW6JLEOBIAGMEA6JHCEK775CDN","bundle":"https://pith.science/pith/QW6JLEOBIAGMEA6JHCEK775CDN/bundle.json","state":"https://pith.science/pith/QW6JLEOBIAGMEA6JHCEK775CDN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QW6JLEOBIAGMEA6JHCEK775CDN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:QW6JLEOBIAGMEA6JHCEK775CDN","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":"64c7ab72f60b9e3cadcf45d1386a5d3bc2d3e3f3ed08b862d2f202d5f57b0722","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-12-27T13:50:38Z","title_canon_sha256":"1fe81985f2da8f452c8b980cd44839dbcd0e13a8dd1a834bd94f4fec51ceb80c"},"schema_version":"1.0","source":{"id":"1112.5960","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.5960","created_at":"2026-05-18T03:58:39Z"},{"alias_kind":"arxiv_version","alias_value":"1112.5960v2","created_at":"2026-05-18T03:58:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.5960","created_at":"2026-05-18T03:58:39Z"},{"alias_kind":"pith_short_12","alias_value":"QW6JLEOBIAGM","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"QW6JLEOBIAGMEA6J","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"QW6JLEOB","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:a1829ac6572aa08847e778f7329967f79436cd21fa4e71bdd39343ebeb504036","target":"graph","created_at":"2026-05-18T03:58:39Z","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":"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","authors_text":"Antonios Varvitsiotis, Monique Laurent","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-12-27T13:50:38Z","title":"The Gram dimension of a graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.5960","kind":"arxiv","version":2},"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:e0c65119563c1c3a08d1a0103ced0758a0999415a95d3b4b47cb5fb1211784d4","target":"record","created_at":"2026-05-18T03:58:39Z","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":"64c7ab72f60b9e3cadcf45d1386a5d3bc2d3e3f3ed08b862d2f202d5f57b0722","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-12-27T13:50:38Z","title_canon_sha256":"1fe81985f2da8f452c8b980cd44839dbcd0e13a8dd1a834bd94f4fec51ceb80c"},"schema_version":"1.0","source":{"id":"1112.5960","kind":"arxiv","version":2}},"canonical_sha256":"85bc9591c1400cc203c93888afffa21b693f7e143364baedfbf6a1256240fd0e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"85bc9591c1400cc203c93888afffa21b693f7e143364baedfbf6a1256240fd0e","first_computed_at":"2026-05-18T03:58:39.433619Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:58:39.433619Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LvjU7aZmvvV0WV6ha4N9NVw2KH8b7d5u3fbmMFXWq8tobRS4Fwm3FhMGr0OnG5C+1HdcvpKscHFjg61K2TKbCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:58:39.434088Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.5960","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e0c65119563c1c3a08d1a0103ced0758a0999415a95d3b4b47cb5fb1211784d4","sha256:a1829ac6572aa08847e778f7329967f79436cd21fa4e71bdd39343ebeb504036"],"state_sha256":"0969ffad91c4143f57783fac7c0096017f8acfe5c7999b814f7a76c30d8a7ed2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t71+kkwObuksQgE4KRGIVveggsg2cFB2uPapqI4QLvnrf5RvXVshshRB5zUH4UGA4XtP2D+krq6ciJbJ6Hl1CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T12:08:41.092057Z","bundle_sha256":"68385cf652336e62e3d1a8448bef9d7a71b57e70e0db77be5cbfe989cd7e56d8"}}