{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:TDV6QPA6WVGTQAHEV4Y2DJYWCH","short_pith_number":"pith:TDV6QPA6","canonical_record":{"source":{"id":"1603.05075","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-03-16T13:01:44Z","cross_cats_sorted":["cs.CC","math.CO","math.OC"],"title_canon_sha256":"b10eec5bb79b8041018ad2bd22cd4a86560be442427624792903c76dd9f88422","abstract_canon_sha256":"b7331e740ab553869a1de35bd1a35509de071fbca560dfbc6eb3a21c80dbb3ba"},"schema_version":"1.0"},"canonical_sha256":"98ebe83c1eb54d3800e4af31a1a71611d1e9d09af7cd2cf162d4b8db676b0d52","source":{"kind":"arxiv","id":"1603.05075","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.05075","created_at":"2026-05-18T00:02:55Z"},{"alias_kind":"arxiv_version","alias_value":"1603.05075v1","created_at":"2026-05-18T00:02:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.05075","created_at":"2026-05-18T00:02:55Z"},{"alias_kind":"pith_short_12","alias_value":"TDV6QPA6WVGT","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"TDV6QPA6WVGTQAHE","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"TDV6QPA6","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:TDV6QPA6WVGTQAHEV4Y2DJYWCH","target":"record","payload":{"canonical_record":{"source":{"id":"1603.05075","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-03-16T13:01:44Z","cross_cats_sorted":["cs.CC","math.CO","math.OC"],"title_canon_sha256":"b10eec5bb79b8041018ad2bd22cd4a86560be442427624792903c76dd9f88422","abstract_canon_sha256":"b7331e740ab553869a1de35bd1a35509de071fbca560dfbc6eb3a21c80dbb3ba"},"schema_version":"1.0"},"canonical_sha256":"98ebe83c1eb54d3800e4af31a1a71611d1e9d09af7cd2cf162d4b8db676b0d52","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:55.342047Z","signature_b64":"90NWz6XwIgPGc8XOuIGKeDyPet0TNGj0qFjTjIUlQC3x0jwIrP/rwlsss2qH9VxfM4Mxcw8EHQt3rBHzx35+Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"98ebe83c1eb54d3800e4af31a1a71611d1e9d09af7cd2cf162d4b8db676b0d52","last_reissued_at":"2026-05-18T00:02:55.341352Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:55.341352Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.05075","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-05-18T00:02:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xRYlwEjN2/aF+qAU3Vn740emKrqA/0eipMtICKSoYfhNs0hGQsNttX6fKSDRZrg+V62emZu57WeEkricZ7FhAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T18:22:45.896355Z"},"content_sha256":"bf1132aac8a30b7d8a4381be147665a421f1ba12ec21983f9ececef7d5d8cc3e","schema_version":"1.0","event_id":"sha256:bf1132aac8a30b7d8a4381be147665a421f1ba12ec21983f9ececef7d5d8cc3e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:TDV6QPA6WVGTQAHEV4Y2DJYWCH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A linear complementarity based characterization of the weighted independence number and the independent domination number in graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.CO","math.OC"],"primary_cat":"cs.DM","authors_text":"Ankur A. Kulkarni, Parthe Pandit","submitted_at":"2016-03-16T13:01:44Z","abstract_excerpt":"The linear complementarity problem is a continuous optimization problem that generalizes convex quadratic programming, Nash equilibria of bimatrix games and several such problems. This paper presents a continuous optimization formulation for the weighted independence number of a graph by characterizing it as the maximum weighted $\\ell_1$ norm over the solution set of a linear complementarity problem (LCP). The minimum $\\ell_1$ norm of solutions of this LCP is a lower bound on the independent domination number of the graph. Unlike the case of the maximum $\\ell_1$ norm, this lower bound is in ge"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.05075","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"},"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-18T00:02:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L0IJW/+k+C84HXAOUeQWhd8dMhECZKkYAQucqJGe7Lil9Qw6Ayx3exZkBK+S0XF17Bahpoo16mKgWMQvq15yDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T18:22:45.896707Z"},"content_sha256":"63f9293bad158714f322ca327c9fee671b59140a0c1b698d8e7322223becf2a5","schema_version":"1.0","event_id":"sha256:63f9293bad158714f322ca327c9fee671b59140a0c1b698d8e7322223becf2a5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TDV6QPA6WVGTQAHEV4Y2DJYWCH/bundle.json","state_url":"https://pith.science/pith/TDV6QPA6WVGTQAHEV4Y2DJYWCH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TDV6QPA6WVGTQAHEV4Y2DJYWCH/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-06-28T18:22:45Z","links":{"resolver":"https://pith.science/pith/TDV6QPA6WVGTQAHEV4Y2DJYWCH","bundle":"https://pith.science/pith/TDV6QPA6WVGTQAHEV4Y2DJYWCH/bundle.json","state":"https://pith.science/pith/TDV6QPA6WVGTQAHEV4Y2DJYWCH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TDV6QPA6WVGTQAHEV4Y2DJYWCH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:TDV6QPA6WVGTQAHEV4Y2DJYWCH","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":"b7331e740ab553869a1de35bd1a35509de071fbca560dfbc6eb3a21c80dbb3ba","cross_cats_sorted":["cs.CC","math.CO","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-03-16T13:01:44Z","title_canon_sha256":"b10eec5bb79b8041018ad2bd22cd4a86560be442427624792903c76dd9f88422"},"schema_version":"1.0","source":{"id":"1603.05075","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.05075","created_at":"2026-05-18T00:02:55Z"},{"alias_kind":"arxiv_version","alias_value":"1603.05075v1","created_at":"2026-05-18T00:02:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.05075","created_at":"2026-05-18T00:02:55Z"},{"alias_kind":"pith_short_12","alias_value":"TDV6QPA6WVGT","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"TDV6QPA6WVGTQAHE","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"TDV6QPA6","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:63f9293bad158714f322ca327c9fee671b59140a0c1b698d8e7322223becf2a5","target":"graph","created_at":"2026-05-18T00:02:55Z","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":"The linear complementarity problem is a continuous optimization problem that generalizes convex quadratic programming, Nash equilibria of bimatrix games and several such problems. This paper presents a continuous optimization formulation for the weighted independence number of a graph by characterizing it as the maximum weighted $\\ell_1$ norm over the solution set of a linear complementarity problem (LCP). The minimum $\\ell_1$ norm of solutions of this LCP is a lower bound on the independent domination number of the graph. Unlike the case of the maximum $\\ell_1$ norm, this lower bound is in ge","authors_text":"Ankur A. Kulkarni, Parthe Pandit","cross_cats":["cs.CC","math.CO","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-03-16T13:01:44Z","title":"A linear complementarity based characterization of the weighted independence number and the independent domination number in graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.05075","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:bf1132aac8a30b7d8a4381be147665a421f1ba12ec21983f9ececef7d5d8cc3e","target":"record","created_at":"2026-05-18T00:02:55Z","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":"b7331e740ab553869a1de35bd1a35509de071fbca560dfbc6eb3a21c80dbb3ba","cross_cats_sorted":["cs.CC","math.CO","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-03-16T13:01:44Z","title_canon_sha256":"b10eec5bb79b8041018ad2bd22cd4a86560be442427624792903c76dd9f88422"},"schema_version":"1.0","source":{"id":"1603.05075","kind":"arxiv","version":1}},"canonical_sha256":"98ebe83c1eb54d3800e4af31a1a71611d1e9d09af7cd2cf162d4b8db676b0d52","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"98ebe83c1eb54d3800e4af31a1a71611d1e9d09af7cd2cf162d4b8db676b0d52","first_computed_at":"2026-05-18T00:02:55.341352Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:55.341352Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"90NWz6XwIgPGc8XOuIGKeDyPet0TNGj0qFjTjIUlQC3x0jwIrP/rwlsss2qH9VxfM4Mxcw8EHQt3rBHzx35+Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:55.342047Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.05075","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bf1132aac8a30b7d8a4381be147665a421f1ba12ec21983f9ececef7d5d8cc3e","sha256:63f9293bad158714f322ca327c9fee671b59140a0c1b698d8e7322223becf2a5"],"state_sha256":"6b3398b7e816426836d8372d0611fe07c1d7da1dad427a05827bcfbac7580dee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sFD/HvvB1QnX8JJm+qhMQ29UjxqBtGyvwRy54zVWYrOu2V0xBy8Gmfw97FRh8OWJ+2Y7lrKFWGorCdaN9TwhDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T18:22:45.898828Z","bundle_sha256":"8c37db700c2cbc7871f06ffde50593fc4f0389de845a40e7d2388fe82273bf3f"}}