{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2003:35JKIPNRDZEAIAWBPKKRTLQB6V","short_pith_number":"pith:35JKIPNR","canonical_record":{"source":{"id":"math/0302092","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"math.OC","submitted_at":"2003-02-09T21:31:42Z","cross_cats_sorted":[],"title_canon_sha256":"273675ccbf40f9a28179ae24b0be122217a807aa1b32d9154544d5cabb1d7f6b","abstract_canon_sha256":"a6ef0ad9b77d589f362155877d101b2285d581b54015cdce70666dd65fe5d921"},"schema_version":"1.0"},"canonical_sha256":"df52a43db11e480402c17a9519ae01f57e06de8c6c210847737298036c816df8","source":{"kind":"arxiv","id":"math/0302092","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0302092","created_at":"2026-07-04T14:37:04Z"},{"alias_kind":"arxiv_version","alias_value":"math/0302092v2","created_at":"2026-07-04T14:37:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0302092","created_at":"2026-07-04T14:37:04Z"},{"alias_kind":"pith_short_12","alias_value":"35JKIPNRDZEA","created_at":"2026-07-04T14:37:04Z"},{"alias_kind":"pith_short_16","alias_value":"35JKIPNRDZEAIAWB","created_at":"2026-07-04T14:37:04Z"},{"alias_kind":"pith_short_8","alias_value":"35JKIPNR","created_at":"2026-07-04T14:37:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2003:35JKIPNRDZEAIAWBPKKRTLQB6V","target":"record","payload":{"canonical_record":{"source":{"id":"math/0302092","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"math.OC","submitted_at":"2003-02-09T21:31:42Z","cross_cats_sorted":[],"title_canon_sha256":"273675ccbf40f9a28179ae24b0be122217a807aa1b32d9154544d5cabb1d7f6b","abstract_canon_sha256":"a6ef0ad9b77d589f362155877d101b2285d581b54015cdce70666dd65fe5d921"},"schema_version":"1.0"},"canonical_sha256":"df52a43db11e480402c17a9519ae01f57e06de8c6c210847737298036c816df8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:37:04.189531Z","signature_b64":"PJ6UMO9oSmAN5HnrBnoWrezQdy4q9J1ChYPDvBN7mzKjL1VaHAJ5lK8Pk54GO4fq4ra+BWDBWUiO/PwJI8aEDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df52a43db11e480402c17a9519ae01f57e06de8c6c210847737298036c816df8","last_reissued_at":"2026-07-04T14:37:04.189037Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:37:04.189037Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"math/0302092","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-07-04T14:37:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oa+hzL7XeWVi8VqmvC7bHMCpMGx9ffLZBdZjFbXNpDcDYE5q2GNFK9AnzXvCLjM2hcsBUxgBK4+SflKmcSCZBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T00:20:00.048296Z"},"content_sha256":"ed67245eed6025a842e5801b678dd15e312249ab5ea18763cbd6bdf96df044b1","schema_version":"1.0","event_id":"sha256:ed67245eed6025a842e5801b678dd15e312249ab5ea18763cbd6bdf96df044b1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2003:35JKIPNRDZEAIAWBPKKRTLQB6V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Semidefinite Representation for some Minimum Cardinality Problems","license":"","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexandre d'Aspremont","submitted_at":"2003-02-09T21:31:42Z","abstract_excerpt":"Using techniques developed in [Lasserre02], we show that some minimum cardinality problems subject to linear inequalities can be represented as finite sequences of semidefinite programs. In particular, we provide a semidefinite representation of the minimum rank problem on positive semidefinite matrices. We also use this technique to cast the problem of finding convex lower bounds on the objective as a semidefinite program."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0302092","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/math/0302092/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T14:37:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UDvNDE8vfSfXHtoWdams4hn5lZJ/cdix3kf0yQlg88RLYOn+G2DdV1rrJmRM/gfaiJMfGYwPe7WC6M9Rls5yBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T00:20:00.048716Z"},"content_sha256":"16b11a1261246110975deaa7443978665e291da9848a0c3a3f5c687c2d5daf4d","schema_version":"1.0","event_id":"sha256:16b11a1261246110975deaa7443978665e291da9848a0c3a3f5c687c2d5daf4d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/35JKIPNRDZEAIAWBPKKRTLQB6V/bundle.json","state_url":"https://pith.science/pith/35JKIPNRDZEAIAWBPKKRTLQB6V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/35JKIPNRDZEAIAWBPKKRTLQB6V/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-08-06T00:20:00Z","links":{"resolver":"https://pith.science/pith/35JKIPNRDZEAIAWBPKKRTLQB6V","bundle":"https://pith.science/pith/35JKIPNRDZEAIAWBPKKRTLQB6V/bundle.json","state":"https://pith.science/pith/35JKIPNRDZEAIAWBPKKRTLQB6V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/35JKIPNRDZEAIAWBPKKRTLQB6V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2003:35JKIPNRDZEAIAWBPKKRTLQB6V","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":"a6ef0ad9b77d589f362155877d101b2285d581b54015cdce70666dd65fe5d921","cross_cats_sorted":[],"license":"","primary_cat":"math.OC","submitted_at":"2003-02-09T21:31:42Z","title_canon_sha256":"273675ccbf40f9a28179ae24b0be122217a807aa1b32d9154544d5cabb1d7f6b"},"schema_version":"1.0","source":{"id":"math/0302092","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0302092","created_at":"2026-07-04T14:37:04Z"},{"alias_kind":"arxiv_version","alias_value":"math/0302092v2","created_at":"2026-07-04T14:37:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0302092","created_at":"2026-07-04T14:37:04Z"},{"alias_kind":"pith_short_12","alias_value":"35JKIPNRDZEA","created_at":"2026-07-04T14:37:04Z"},{"alias_kind":"pith_short_16","alias_value":"35JKIPNRDZEAIAWB","created_at":"2026-07-04T14:37:04Z"},{"alias_kind":"pith_short_8","alias_value":"35JKIPNR","created_at":"2026-07-04T14:37:04Z"}],"graph_snapshots":[{"event_id":"sha256:16b11a1261246110975deaa7443978665e291da9848a0c3a3f5c687c2d5daf4d","target":"graph","created_at":"2026-07-04T14:37:04Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/math/0302092/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Using techniques developed in [Lasserre02], we show that some minimum cardinality problems subject to linear inequalities can be represented as finite sequences of semidefinite programs. In particular, we provide a semidefinite representation of the minimum rank problem on positive semidefinite matrices. We also use this technique to cast the problem of finding convex lower bounds on the objective as a semidefinite program.","authors_text":"Alexandre d'Aspremont","cross_cats":[],"headline":"","license":"","primary_cat":"math.OC","submitted_at":"2003-02-09T21:31:42Z","title":"A Semidefinite Representation for some Minimum Cardinality Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0302092","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:ed67245eed6025a842e5801b678dd15e312249ab5ea18763cbd6bdf96df044b1","target":"record","created_at":"2026-07-04T14:37:04Z","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":"a6ef0ad9b77d589f362155877d101b2285d581b54015cdce70666dd65fe5d921","cross_cats_sorted":[],"license":"","primary_cat":"math.OC","submitted_at":"2003-02-09T21:31:42Z","title_canon_sha256":"273675ccbf40f9a28179ae24b0be122217a807aa1b32d9154544d5cabb1d7f6b"},"schema_version":"1.0","source":{"id":"math/0302092","kind":"arxiv","version":2}},"canonical_sha256":"df52a43db11e480402c17a9519ae01f57e06de8c6c210847737298036c816df8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"df52a43db11e480402c17a9519ae01f57e06de8c6c210847737298036c816df8","first_computed_at":"2026-07-04T14:37:04.189037Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:37:04.189037Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PJ6UMO9oSmAN5HnrBnoWrezQdy4q9J1ChYPDvBN7mzKjL1VaHAJ5lK8Pk54GO4fq4ra+BWDBWUiO/PwJI8aEDA==","signature_status":"signed_v1","signed_at":"2026-07-04T14:37:04.189531Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0302092","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ed67245eed6025a842e5801b678dd15e312249ab5ea18763cbd6bdf96df044b1","sha256:16b11a1261246110975deaa7443978665e291da9848a0c3a3f5c687c2d5daf4d"],"state_sha256":"2ec527298141c56927404ac793d5306f16ef9ab5f1c6bca497539e617c76c3f0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZoGVW+5MjuBoGhc+KG/EMYqAUgf1t6HnqzyuK6DZT0PMbGH5OmhFYQYE/Owa6fBENcF0AX8THaGyxfkztYz3BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T00:20:00.051083Z","bundle_sha256":"5b8be8e83c0c0d59492b1acd54268916ee2545413cd850f2031edf6bb3c0e761"}}