{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:2PDP5SUE26ZWOIFXGZ4Q5D6GNT","short_pith_number":"pith:2PDP5SUE","canonical_record":{"source":{"id":"2411.11722","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-11-18T16:53:07Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"659e0cc4d069bcb2c511179b95a998f3a64be436cd8a6d1f3d8fd51ff0daf86a","abstract_canon_sha256":"a986a5f1503ec15e82841595baa0e2e0c57d73efb9179d7f728fc5299bea0f29"},"schema_version":"1.0"},"canonical_sha256":"d3c6feca84d7b36720b736790e8fc66ce9d5aa020d77bf7a408bbef547cbc777","source":{"kind":"arxiv","id":"2411.11722","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.11722","created_at":"2026-07-05T09:37:00Z"},{"alias_kind":"arxiv_version","alias_value":"2411.11722v1","created_at":"2026-07-05T09:37:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.11722","created_at":"2026-07-05T09:37:00Z"},{"alias_kind":"pith_short_12","alias_value":"2PDP5SUE26ZW","created_at":"2026-07-05T09:37:00Z"},{"alias_kind":"pith_short_16","alias_value":"2PDP5SUE26ZWOIFX","created_at":"2026-07-05T09:37:00Z"},{"alias_kind":"pith_short_8","alias_value":"2PDP5SUE","created_at":"2026-07-05T09:37:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:2PDP5SUE26ZWOIFXGZ4Q5D6GNT","target":"record","payload":{"canonical_record":{"source":{"id":"2411.11722","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-11-18T16:53:07Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"659e0cc4d069bcb2c511179b95a998f3a64be436cd8a6d1f3d8fd51ff0daf86a","abstract_canon_sha256":"a986a5f1503ec15e82841595baa0e2e0c57d73efb9179d7f728fc5299bea0f29"},"schema_version":"1.0"},"canonical_sha256":"d3c6feca84d7b36720b736790e8fc66ce9d5aa020d77bf7a408bbef547cbc777","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:37:00.190160Z","signature_b64":"NdBnpSzx7OPjPdgCor+54zIjXG1u1zo8qI1ggOa7M4urELAu26orfzYBE4ns/Th6qIjbCZoHyXvoKu9Rfu91Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d3c6feca84d7b36720b736790e8fc66ce9d5aa020d77bf7a408bbef547cbc777","last_reissued_at":"2026-07-05T09:37:00.189347Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:37:00.189347Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2411.11722","source_version":1,"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-05T09:37:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YNNR9/WMEs8U/nssc+eDcA/AdjEX0P1kD/twC/dkwfTo5Q8TvCIdytV1odek9UJXDNuHXh6I8W6deg7AQV+vCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T13:11:22.828283Z"},"content_sha256":"9279f5a28b44f58bd16fd74fef05f4d07c6b59056369348c69958af36a323ca2","schema_version":"1.0","event_id":"sha256:9279f5a28b44f58bd16fd74fef05f4d07c6b59056369348c69958af36a323ca2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:2PDP5SUE26ZWOIFXGZ4Q5D6GNT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Solving convex QPs with structured sparsity under indicator conditions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"math.OC","authors_text":"Daniel Bienstock, Tongtong Chen","submitted_at":"2024-11-18T16:53:07Z","abstract_excerpt":"We study convex optimization problems where disjoint blocks of variables are controlled by binary indicator variables that are also subject to conditions, e.g., cardinality. Several classes of important examples can be formulated in such a way that both the objective and the constraints are separable convex quadratics. We describe a family of polynomial-time approximation algorithms and negative complexity results."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.11722","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.11722/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-05T09:37:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"by/77d9BUBUndlz2tOUUOrsLck9yr4/ErfJmIVtiQQVsZ3puf2U5v37GZIsckIxhooJoDkZr7/dImNlrNpvjDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T13:11:22.828871Z"},"content_sha256":"6a138c8950e839369873d4352b08d89bcb04a2446be7d74ed2d87e6a9c88f0be","schema_version":"1.0","event_id":"sha256:6a138c8950e839369873d4352b08d89bcb04a2446be7d74ed2d87e6a9c88f0be"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2PDP5SUE26ZWOIFXGZ4Q5D6GNT/bundle.json","state_url":"https://pith.science/pith/2PDP5SUE26ZWOIFXGZ4Q5D6GNT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2PDP5SUE26ZWOIFXGZ4Q5D6GNT/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-09T13:11:22Z","links":{"resolver":"https://pith.science/pith/2PDP5SUE26ZWOIFXGZ4Q5D6GNT","bundle":"https://pith.science/pith/2PDP5SUE26ZWOIFXGZ4Q5D6GNT/bundle.json","state":"https://pith.science/pith/2PDP5SUE26ZWOIFXGZ4Q5D6GNT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2PDP5SUE26ZWOIFXGZ4Q5D6GNT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:2PDP5SUE26ZWOIFXGZ4Q5D6GNT","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":"a986a5f1503ec15e82841595baa0e2e0c57d73efb9179d7f728fc5299bea0f29","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-11-18T16:53:07Z","title_canon_sha256":"659e0cc4d069bcb2c511179b95a998f3a64be436cd8a6d1f3d8fd51ff0daf86a"},"schema_version":"1.0","source":{"id":"2411.11722","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.11722","created_at":"2026-07-05T09:37:00Z"},{"alias_kind":"arxiv_version","alias_value":"2411.11722v1","created_at":"2026-07-05T09:37:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.11722","created_at":"2026-07-05T09:37:00Z"},{"alias_kind":"pith_short_12","alias_value":"2PDP5SUE26ZW","created_at":"2026-07-05T09:37:00Z"},{"alias_kind":"pith_short_16","alias_value":"2PDP5SUE26ZWOIFX","created_at":"2026-07-05T09:37:00Z"},{"alias_kind":"pith_short_8","alias_value":"2PDP5SUE","created_at":"2026-07-05T09:37:00Z"}],"graph_snapshots":[{"event_id":"sha256:6a138c8950e839369873d4352b08d89bcb04a2446be7d74ed2d87e6a9c88f0be","target":"graph","created_at":"2026-07-05T09:37:00Z","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/2411.11722/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study convex optimization problems where disjoint blocks of variables are controlled by binary indicator variables that are also subject to conditions, e.g., cardinality. Several classes of important examples can be formulated in such a way that both the objective and the constraints are separable convex quadratics. We describe a family of polynomial-time approximation algorithms and negative complexity results.","authors_text":"Daniel Bienstock, Tongtong Chen","cross_cats":["cs.CC","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-11-18T16:53:07Z","title":"Solving convex QPs with structured sparsity under indicator conditions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.11722","kind":"arxiv","version":1},"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:9279f5a28b44f58bd16fd74fef05f4d07c6b59056369348c69958af36a323ca2","target":"record","created_at":"2026-07-05T09:37:00Z","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":"a986a5f1503ec15e82841595baa0e2e0c57d73efb9179d7f728fc5299bea0f29","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-11-18T16:53:07Z","title_canon_sha256":"659e0cc4d069bcb2c511179b95a998f3a64be436cd8a6d1f3d8fd51ff0daf86a"},"schema_version":"1.0","source":{"id":"2411.11722","kind":"arxiv","version":1}},"canonical_sha256":"d3c6feca84d7b36720b736790e8fc66ce9d5aa020d77bf7a408bbef547cbc777","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d3c6feca84d7b36720b736790e8fc66ce9d5aa020d77bf7a408bbef547cbc777","first_computed_at":"2026-07-05T09:37:00.189347Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:37:00.189347Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NdBnpSzx7OPjPdgCor+54zIjXG1u1zo8qI1ggOa7M4urELAu26orfzYBE4ns/Th6qIjbCZoHyXvoKu9Rfu91Dg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:37:00.190160Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.11722","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9279f5a28b44f58bd16fd74fef05f4d07c6b59056369348c69958af36a323ca2","sha256:6a138c8950e839369873d4352b08d89bcb04a2446be7d74ed2d87e6a9c88f0be"],"state_sha256":"351af40f1fd798eafdc20e945cc10c38dd39685a5a6591be9f1ee3b66b9d891e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wB/II+qoxb0CMzBBx7/hce7nNA/SprvIP1ZDXzdoS1KShiAEuF6m//2znc9k90oDcqTkOr+KlQzWGSVZqWCkBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T13:11:22.832784Z","bundle_sha256":"946f4a53e02e8fd3bd1ae86fb0791f01227114bfd4756af89bbbcbf227d68af9"}}