{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:DDNL74XWGCJMYH2432D6S4YZKF","short_pith_number":"pith:DDNL74XW","canonical_record":{"source":{"id":"1205.2040","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-05-09T17:20:59Z","cross_cats_sorted":["cs.DM","math.OC"],"title_canon_sha256":"a7e0ef21e630203cb92b1924cafa40047185b68393a7e2297e9b7800cd3bfcb3","abstract_canon_sha256":"87aacc8f96dbe826b1b41037db355a55ff16ff3b866d3fe0a468455f897be3f0"},"schema_version":"1.0"},"canonical_sha256":"18dabff2f63092cc1f5cde87e973195176f0e8c34119c34fb84075508f40b0dd","source":{"kind":"arxiv","id":"1205.2040","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.2040","created_at":"2026-05-18T03:02:57Z"},{"alias_kind":"arxiv_version","alias_value":"1205.2040v2","created_at":"2026-05-18T03:02:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.2040","created_at":"2026-05-18T03:02:57Z"},{"alias_kind":"pith_short_12","alias_value":"DDNL74XWGCJM","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"DDNL74XWGCJMYH24","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"DDNL74XW","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:DDNL74XWGCJMYH2432D6S4YZKF","target":"record","payload":{"canonical_record":{"source":{"id":"1205.2040","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-05-09T17:20:59Z","cross_cats_sorted":["cs.DM","math.OC"],"title_canon_sha256":"a7e0ef21e630203cb92b1924cafa40047185b68393a7e2297e9b7800cd3bfcb3","abstract_canon_sha256":"87aacc8f96dbe826b1b41037db355a55ff16ff3b866d3fe0a468455f897be3f0"},"schema_version":"1.0"},"canonical_sha256":"18dabff2f63092cc1f5cde87e973195176f0e8c34119c34fb84075508f40b0dd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:57.501934Z","signature_b64":"+gTrodstT/g63TEuRHfHrOPSIn37u2EWyisqcWJDq1oDFyEodU8zv5Iz1oy8cozO0PFY7wgIzYr97OvBgl/1Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18dabff2f63092cc1f5cde87e973195176f0e8c34119c34fb84075508f40b0dd","last_reissued_at":"2026-05-18T03:02:57.501276Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:57.501276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1205.2040","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:02:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0BNM+bIWBILwDeBfh2qnJaDttW9JESO2IqAG9bnBrfKknvg9SQtpobL2rlfNoGAYAU39+IlCL1khLsxqJXMuAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T16:54:47.107419Z"},"content_sha256":"481a84dc3b1aa53f15949de2b54fab0e004e9594b8aaecbfd3a96d3cd73105bc","schema_version":"1.0","event_id":"sha256:481a84dc3b1aa53f15949de2b54fab0e004e9594b8aaecbfd3a96d3cd73105bc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:DDNL74XWGCJMYH2432D6S4YZKF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Forbidden minor characterizations for low-rank optimal solutions to semidefinite programs over the elliptope","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.OC"],"primary_cat":"math.CO","authors_text":"Antonios Varvitsiotis, Marianna Eisenberg-Nagy, Monique Laurent","submitted_at":"2012-05-09T17:20:59Z","abstract_excerpt":"We study a new geometric graph parameter $\\egd(G)$, defined as the smallest integer $r\\ge 1$ for which any partial symmetric matrix which is completable to a correlation matrix and whose entries are specified at the positions of the edges of $G$, can be completed to a matrix in the convex hull of correlation matrices of $\\rank $ at most $r$. This graph parameter is motivated by its relevance to the problem of finding low rank solutions to semidefinite programs over the elliptope, and also by its relevance to the bounded rank Grothendieck constant. Indeed, $\\egd(G)\\le r$ if and only if the rank"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.2040","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:02:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X4JVbeK4BVdsbgTpFWpockP1fPjKlx1Zp9b64TtYBwnZ9dcYaF4m/vatGFm7XUdK/QWmEHQuSnjxqN6OnfnIAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T16:54:47.107960Z"},"content_sha256":"a7b09d538fba72088dffba84d8b6b506798c7a1784f6482795c70a768eb6d4c7","schema_version":"1.0","event_id":"sha256:a7b09d538fba72088dffba84d8b6b506798c7a1784f6482795c70a768eb6d4c7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DDNL74XWGCJMYH2432D6S4YZKF/bundle.json","state_url":"https://pith.science/pith/DDNL74XWGCJMYH2432D6S4YZKF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DDNL74XWGCJMYH2432D6S4YZKF/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-30T16:54:47Z","links":{"resolver":"https://pith.science/pith/DDNL74XWGCJMYH2432D6S4YZKF","bundle":"https://pith.science/pith/DDNL74XWGCJMYH2432D6S4YZKF/bundle.json","state":"https://pith.science/pith/DDNL74XWGCJMYH2432D6S4YZKF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DDNL74XWGCJMYH2432D6S4YZKF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:DDNL74XWGCJMYH2432D6S4YZKF","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":"87aacc8f96dbe826b1b41037db355a55ff16ff3b866d3fe0a468455f897be3f0","cross_cats_sorted":["cs.DM","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-05-09T17:20:59Z","title_canon_sha256":"a7e0ef21e630203cb92b1924cafa40047185b68393a7e2297e9b7800cd3bfcb3"},"schema_version":"1.0","source":{"id":"1205.2040","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.2040","created_at":"2026-05-18T03:02:57Z"},{"alias_kind":"arxiv_version","alias_value":"1205.2040v2","created_at":"2026-05-18T03:02:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.2040","created_at":"2026-05-18T03:02:57Z"},{"alias_kind":"pith_short_12","alias_value":"DDNL74XWGCJM","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"DDNL74XWGCJMYH24","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"DDNL74XW","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:a7b09d538fba72088dffba84d8b6b506798c7a1784f6482795c70a768eb6d4c7","target":"graph","created_at":"2026-05-18T03:02:57Z","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":"We study a new geometric graph parameter $\\egd(G)$, defined as the smallest integer $r\\ge 1$ for which any partial symmetric matrix which is completable to a correlation matrix and whose entries are specified at the positions of the edges of $G$, can be completed to a matrix in the convex hull of correlation matrices of $\\rank $ at most $r$. This graph parameter is motivated by its relevance to the problem of finding low rank solutions to semidefinite programs over the elliptope, and also by its relevance to the bounded rank Grothendieck constant. Indeed, $\\egd(G)\\le r$ if and only if the rank","authors_text":"Antonios Varvitsiotis, Marianna Eisenberg-Nagy, Monique Laurent","cross_cats":["cs.DM","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-05-09T17:20:59Z","title":"Forbidden minor characterizations for low-rank optimal solutions to semidefinite programs over the elliptope"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.2040","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:481a84dc3b1aa53f15949de2b54fab0e004e9594b8aaecbfd3a96d3cd73105bc","target":"record","created_at":"2026-05-18T03:02:57Z","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":"87aacc8f96dbe826b1b41037db355a55ff16ff3b866d3fe0a468455f897be3f0","cross_cats_sorted":["cs.DM","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-05-09T17:20:59Z","title_canon_sha256":"a7e0ef21e630203cb92b1924cafa40047185b68393a7e2297e9b7800cd3bfcb3"},"schema_version":"1.0","source":{"id":"1205.2040","kind":"arxiv","version":2}},"canonical_sha256":"18dabff2f63092cc1f5cde87e973195176f0e8c34119c34fb84075508f40b0dd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"18dabff2f63092cc1f5cde87e973195176f0e8c34119c34fb84075508f40b0dd","first_computed_at":"2026-05-18T03:02:57.501276Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:02:57.501276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+gTrodstT/g63TEuRHfHrOPSIn37u2EWyisqcWJDq1oDFyEodU8zv5Iz1oy8cozO0PFY7wgIzYr97OvBgl/1Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:02:57.501934Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.2040","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:481a84dc3b1aa53f15949de2b54fab0e004e9594b8aaecbfd3a96d3cd73105bc","sha256:a7b09d538fba72088dffba84d8b6b506798c7a1784f6482795c70a768eb6d4c7"],"state_sha256":"c444c7e8fd9a185b4a9167b5437d3baf0a426e289fc3ffeeb4ad1502bd3a7457"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dQk2jXfnyq9Z8ZqABIuUot00I5m7XIOR2rRLjmGYLjOcb0CQLvyiAe31UF5pNWO2wPY2g7rymXpWuoyteBXFCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T16:54:47.111543Z","bundle_sha256":"d35791feb6c6ed82365ef4c375abb0ddc3f4746d3fa0fe6b57e642cd908cd2ee"}}