{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:RKB2DHOTQFK77PMHGMYI6XCTE7","short_pith_number":"pith:RKB2DHOT","schema_version":"1.0","canonical_sha256":"8a83a19dd38155ffbd8733308f5c5327fb7ecc679c8dae21215c7e821d22bf4b","source":{"kind":"arxiv","id":"1204.0734","version":1},"attestation_state":"computed","paper":{"title":"A new graph parameter related to bounded rank positive semidefinite matrix completions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"math.OC","authors_text":"Antonios Varvitsiotis, Monique Laurent","submitted_at":"2012-04-03T17:10:31Z","abstract_excerpt":"The Gram dimension $\\gd(G)$ of a graph $G$ is the smallest integer $k\\ge 1$ such that any partial real symmetric matrix, whose entries are specified on the diagonal and at the off-diagonal positions corresponding to edges of $G$, can be completed to a positive semidefinite matrix of rank at most $k$ (assuming a positive semidefinite completion exists). For any fixed $k$ the class of graphs satisfying $\\gd(G) \\le k$ is minor closed, hence it can characterized by a finite list of forbidden minors. We show that the only minimal forbidden minor is $K_{k+1}$ for $k\\le 3$ and that there are two mini"},"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":"1204.0734","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-04-03T17:10:31Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"21a8e2059ea2a148065596f25d928b1d145b342d3b26b41029d681cbae42edfa","abstract_canon_sha256":"3b62a1a5aea5ec4629b424e6e39af3522bb8dd436994574c86e551d96889d168"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:58:38.617859Z","signature_b64":"MSLIgAHI5HqrGpdCDmhiogn2rJJn1pcanEJ2kn2CkYLdOE3V0cFyUWJyVoZeXyfqEqRVj7GSHpeB307/mS5iBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a83a19dd38155ffbd8733308f5c5327fb7ecc679c8dae21215c7e821d22bf4b","last_reissued_at":"2026-05-18T03:58:38.617342Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:58:38.617342Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A new graph parameter related to bounded rank positive semidefinite matrix completions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"math.OC","authors_text":"Antonios Varvitsiotis, Monique Laurent","submitted_at":"2012-04-03T17:10:31Z","abstract_excerpt":"The Gram dimension $\\gd(G)$ of a graph $G$ is the smallest integer $k\\ge 1$ such that any partial real symmetric matrix, whose entries are specified on the diagonal and at the off-diagonal positions corresponding to edges of $G$, can be completed to a positive semidefinite matrix of rank at most $k$ (assuming a positive semidefinite completion exists). For any fixed $k$ the class of graphs satisfying $\\gd(G) \\le k$ is minor closed, hence it can characterized by a finite list of forbidden minors. We show that the only minimal forbidden minor is $K_{k+1}$ for $k\\le 3$ and that there are two mini"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.0734","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":"1204.0734","created_at":"2026-05-18T03:58:38.617415+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.0734v1","created_at":"2026-05-18T03:58:38.617415+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.0734","created_at":"2026-05-18T03:58:38.617415+00:00"},{"alias_kind":"pith_short_12","alias_value":"RKB2DHOTQFK7","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_16","alias_value":"RKB2DHOTQFK77PMH","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_8","alias_value":"RKB2DHOT","created_at":"2026-05-18T12:27:20.899486+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/RKB2DHOTQFK77PMHGMYI6XCTE7","json":"https://pith.science/pith/RKB2DHOTQFK77PMHGMYI6XCTE7.json","graph_json":"https://pith.science/api/pith-number/RKB2DHOTQFK77PMHGMYI6XCTE7/graph.json","events_json":"https://pith.science/api/pith-number/RKB2DHOTQFK77PMHGMYI6XCTE7/events.json","paper":"https://pith.science/paper/RKB2DHOT"},"agent_actions":{"view_html":"https://pith.science/pith/RKB2DHOTQFK77PMHGMYI6XCTE7","download_json":"https://pith.science/pith/RKB2DHOTQFK77PMHGMYI6XCTE7.json","view_paper":"https://pith.science/paper/RKB2DHOT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.0734&json=true","fetch_graph":"https://pith.science/api/pith-number/RKB2DHOTQFK77PMHGMYI6XCTE7/graph.json","fetch_events":"https://pith.science/api/pith-number/RKB2DHOTQFK77PMHGMYI6XCTE7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RKB2DHOTQFK77PMHGMYI6XCTE7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RKB2DHOTQFK77PMHGMYI6XCTE7/action/storage_attestation","attest_author":"https://pith.science/pith/RKB2DHOTQFK77PMHGMYI6XCTE7/action/author_attestation","sign_citation":"https://pith.science/pith/RKB2DHOTQFK77PMHGMYI6XCTE7/action/citation_signature","submit_replication":"https://pith.science/pith/RKB2DHOTQFK77PMHGMYI6XCTE7/action/replication_record"}},"created_at":"2026-05-18T03:58:38.617415+00:00","updated_at":"2026-05-18T03:58:38.617415+00:00"}