{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:LMWRF2F3ZVIO2MQ652T37FUKBH","short_pith_number":"pith:LMWRF2F3","schema_version":"1.0","canonical_sha256":"5b2d12e8bbcd50ed321eeea7bf968a09c4325b15c43f0c44a59f3ad770d1cc8c","source":{"kind":"arxiv","id":"math/0612720","version":2},"attestation_state":"computed","paper":{"title":"The Colin de Verdi\\`ere Graph Parameter for Threshold Graphs","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Felix Goldberg, Hans Christianson","submitted_at":"2006-12-22T19:23:06Z","abstract_excerpt":"We consider Schr\\\"odinger operators on threshold graphs and prove a formula for the Colin de Verdi\\`ere parameter in terms of the building sequence. We construct an optimal Colin de Verdi\\`ere matrix for each connected threshold graph $G$ of $n$ vertices. For a large subclass of threshold graphs we construct an alternative Colin de Verdi\\`ere matrix depending on a large parameter. As a corollary to this last construction, we give estimates on the size of the non-zero eigenvalues of this matrix."},"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":"math/0612720","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2006-12-22T19:23:06Z","cross_cats_sorted":[],"title_canon_sha256":"d161d4737b58762423c2269e4d6ddf0d3f00f8632aea610afdb3cd9bc3b02c6c","abstract_canon_sha256":"f64403369d18552aeb7f483c4694d2e4aa0fbdab882e47e5d4c51c1b8217728d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:08:53.039290Z","signature_b64":"Dlk+jELUqZU+uKjsh75/6q+nLXZw32REOMkeSF8aMDboxAOC5i7PDZx9lntYh0weDeGkbBPHtckuuqky5tPPBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b2d12e8bbcd50ed321eeea7bf968a09c4325b15c43f0c44a59f3ad770d1cc8c","last_reissued_at":"2026-05-18T04:08:53.038586Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:08:53.038586Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Colin de Verdi\\`ere Graph Parameter for Threshold Graphs","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Felix Goldberg, Hans Christianson","submitted_at":"2006-12-22T19:23:06Z","abstract_excerpt":"We consider Schr\\\"odinger operators on threshold graphs and prove a formula for the Colin de Verdi\\`ere parameter in terms of the building sequence. We construct an optimal Colin de Verdi\\`ere matrix for each connected threshold graph $G$ of $n$ vertices. For a large subclass of threshold graphs we construct an alternative Colin de Verdi\\`ere matrix depending on a large parameter. As a corollary to this last construction, we give estimates on the size of the non-zero eigenvalues of this matrix."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0612720","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":"math/0612720","created_at":"2026-05-18T04:08:53.038714+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0612720v2","created_at":"2026-05-18T04:08:53.038714+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0612720","created_at":"2026-05-18T04:08:53.038714+00:00"},{"alias_kind":"pith_short_12","alias_value":"LMWRF2F3ZVIO","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_16","alias_value":"LMWRF2F3ZVIO2MQ6","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_8","alias_value":"LMWRF2F3","created_at":"2026-05-18T12:25:54.717736+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/LMWRF2F3ZVIO2MQ652T37FUKBH","json":"https://pith.science/pith/LMWRF2F3ZVIO2MQ652T37FUKBH.json","graph_json":"https://pith.science/api/pith-number/LMWRF2F3ZVIO2MQ652T37FUKBH/graph.json","events_json":"https://pith.science/api/pith-number/LMWRF2F3ZVIO2MQ652T37FUKBH/events.json","paper":"https://pith.science/paper/LMWRF2F3"},"agent_actions":{"view_html":"https://pith.science/pith/LMWRF2F3ZVIO2MQ652T37FUKBH","download_json":"https://pith.science/pith/LMWRF2F3ZVIO2MQ652T37FUKBH.json","view_paper":"https://pith.science/paper/LMWRF2F3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0612720&json=true","fetch_graph":"https://pith.science/api/pith-number/LMWRF2F3ZVIO2MQ652T37FUKBH/graph.json","fetch_events":"https://pith.science/api/pith-number/LMWRF2F3ZVIO2MQ652T37FUKBH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LMWRF2F3ZVIO2MQ652T37FUKBH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LMWRF2F3ZVIO2MQ652T37FUKBH/action/storage_attestation","attest_author":"https://pith.science/pith/LMWRF2F3ZVIO2MQ652T37FUKBH/action/author_attestation","sign_citation":"https://pith.science/pith/LMWRF2F3ZVIO2MQ652T37FUKBH/action/citation_signature","submit_replication":"https://pith.science/pith/LMWRF2F3ZVIO2MQ652T37FUKBH/action/replication_record"}},"created_at":"2026-05-18T04:08:53.038714+00:00","updated_at":"2026-05-18T04:08:53.038714+00:00"}