{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:B5EQBMF2WQ4YG7YSODCDIXPXKT","short_pith_number":"pith:B5EQBMF2","canonical_record":{"source":{"id":"1606.05979","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-06-20T05:54:25Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"2afd02ef584d1f9c9bc550e873f8edc20ab7cb33ccc5ba34bcfbb067b8adeda9","abstract_canon_sha256":"4ebb942853fc12d0cf105458fe170156b5cfb28a9feb9a85ac06200581b5bb6d"},"schema_version":"1.0"},"canonical_sha256":"0f4900b0bab439837f1270c4345df754f48378862622039696c65a4fe9ed17e2","source":{"kind":"arxiv","id":"1606.05979","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.05979","created_at":"2026-05-18T01:12:15Z"},{"alias_kind":"arxiv_version","alias_value":"1606.05979v1","created_at":"2026-05-18T01:12:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.05979","created_at":"2026-05-18T01:12:15Z"},{"alias_kind":"pith_short_12","alias_value":"B5EQBMF2WQ4Y","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"B5EQBMF2WQ4YG7YS","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"B5EQBMF2","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:B5EQBMF2WQ4YG7YSODCDIXPXKT","target":"record","payload":{"canonical_record":{"source":{"id":"1606.05979","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-06-20T05:54:25Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"2afd02ef584d1f9c9bc550e873f8edc20ab7cb33ccc5ba34bcfbb067b8adeda9","abstract_canon_sha256":"4ebb942853fc12d0cf105458fe170156b5cfb28a9feb9a85ac06200581b5bb6d"},"schema_version":"1.0"},"canonical_sha256":"0f4900b0bab439837f1270c4345df754f48378862622039696c65a4fe9ed17e2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:15.646063Z","signature_b64":"61AfPVcnysH/FcIqBcjJtOuhPfInxvfHJh3GKhrAivziy/FPgAMw761bi4cbJqSDI+OdMdtOTe3veAOftk6hDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f4900b0bab439837f1270c4345df754f48378862622039696c65a4fe9ed17e2","last_reissued_at":"2026-05-18T01:12:15.645730Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:15.645730Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.05979","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-18T01:12:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2tTdLj7mkPX35Vxoi6kUfvWSG4f1exiqVXIGfnMJoLbfv8/eQuMov08gJr6ut3kgpfAvPc2iSDYL7Xqbo3x/AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:22:18.770909Z"},"content_sha256":"ace451ec7a70ce7edb5f2aee6104ebe3af45430b57171546e3b40e9aada0a2ba","schema_version":"1.0","event_id":"sha256:ace451ec7a70ce7edb5f2aee6104ebe3af45430b57171546e3b40e9aada0a2ba"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:B5EQBMF2WQ4YG7YSODCDIXPXKT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Strategic Bidding for Producers in Nodal Electricity Markets: A Convex Relaxation Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.OC","authors_text":"Ashkan Sadeghi-Mobarakeh, Hamed Mohsenian-Rad, Mahdi Ghamkhari","submitted_at":"2016-06-20T05:54:25Z","abstract_excerpt":"Strategic bidding problems in electricity markets are widely studied in power systems, often by formulating complex bi-level optimization problems that are hard to solve. The state-of-the-art approach to solve such problems is to reformulate them as mixed-integer linear programs (MILPs). However, the computational time of such MILP reformulations grows dramatically, once the network size increases, scheduling horizon increases, or randomness is taken into consideration. In this paper, we take a fundamentally different approach and propose effective and customized convex programming tools to so"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.05979","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-18T01:12:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NIm42Hb0CMbV+ydzLOMqorMj3uQYt56Y3Ur/9J9uox3X2tjdQ4a9gPug5Ca8/2Mjk/Y/AjClsQ0ZyQQYUONPDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:22:18.771252Z"},"content_sha256":"14e42995ab9410cec367e8badc2f8017ad3dd664eb7df18a86bda241c104cfb3","schema_version":"1.0","event_id":"sha256:14e42995ab9410cec367e8badc2f8017ad3dd664eb7df18a86bda241c104cfb3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B5EQBMF2WQ4YG7YSODCDIXPXKT/bundle.json","state_url":"https://pith.science/pith/B5EQBMF2WQ4YG7YSODCDIXPXKT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B5EQBMF2WQ4YG7YSODCDIXPXKT/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-01T21:22:18Z","links":{"resolver":"https://pith.science/pith/B5EQBMF2WQ4YG7YSODCDIXPXKT","bundle":"https://pith.science/pith/B5EQBMF2WQ4YG7YSODCDIXPXKT/bundle.json","state":"https://pith.science/pith/B5EQBMF2WQ4YG7YSODCDIXPXKT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B5EQBMF2WQ4YG7YSODCDIXPXKT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:B5EQBMF2WQ4YG7YSODCDIXPXKT","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":"4ebb942853fc12d0cf105458fe170156b5cfb28a9feb9a85ac06200581b5bb6d","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-06-20T05:54:25Z","title_canon_sha256":"2afd02ef584d1f9c9bc550e873f8edc20ab7cb33ccc5ba34bcfbb067b8adeda9"},"schema_version":"1.0","source":{"id":"1606.05979","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.05979","created_at":"2026-05-18T01:12:15Z"},{"alias_kind":"arxiv_version","alias_value":"1606.05979v1","created_at":"2026-05-18T01:12:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.05979","created_at":"2026-05-18T01:12:15Z"},{"alias_kind":"pith_short_12","alias_value":"B5EQBMF2WQ4Y","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"B5EQBMF2WQ4YG7YS","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"B5EQBMF2","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:14e42995ab9410cec367e8badc2f8017ad3dd664eb7df18a86bda241c104cfb3","target":"graph","created_at":"2026-05-18T01:12:15Z","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":"Strategic bidding problems in electricity markets are widely studied in power systems, often by formulating complex bi-level optimization problems that are hard to solve. The state-of-the-art approach to solve such problems is to reformulate them as mixed-integer linear programs (MILPs). However, the computational time of such MILP reformulations grows dramatically, once the network size increases, scheduling horizon increases, or randomness is taken into consideration. In this paper, we take a fundamentally different approach and propose effective and customized convex programming tools to so","authors_text":"Ashkan Sadeghi-Mobarakeh, Hamed Mohsenian-Rad, Mahdi Ghamkhari","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-06-20T05:54:25Z","title":"Strategic Bidding for Producers in Nodal Electricity Markets: A Convex Relaxation Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.05979","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:ace451ec7a70ce7edb5f2aee6104ebe3af45430b57171546e3b40e9aada0a2ba","target":"record","created_at":"2026-05-18T01:12:15Z","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":"4ebb942853fc12d0cf105458fe170156b5cfb28a9feb9a85ac06200581b5bb6d","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-06-20T05:54:25Z","title_canon_sha256":"2afd02ef584d1f9c9bc550e873f8edc20ab7cb33ccc5ba34bcfbb067b8adeda9"},"schema_version":"1.0","source":{"id":"1606.05979","kind":"arxiv","version":1}},"canonical_sha256":"0f4900b0bab439837f1270c4345df754f48378862622039696c65a4fe9ed17e2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0f4900b0bab439837f1270c4345df754f48378862622039696c65a4fe9ed17e2","first_computed_at":"2026-05-18T01:12:15.645730Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:15.645730Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"61AfPVcnysH/FcIqBcjJtOuhPfInxvfHJh3GKhrAivziy/FPgAMw761bi4cbJqSDI+OdMdtOTe3veAOftk6hDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:15.646063Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.05979","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ace451ec7a70ce7edb5f2aee6104ebe3af45430b57171546e3b40e9aada0a2ba","sha256:14e42995ab9410cec367e8badc2f8017ad3dd664eb7df18a86bda241c104cfb3"],"state_sha256":"e774f5a1aca7ce73155a104df2d30675f76ef8c335c1f950af2e2fb3e0b36d2e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kYv5MTEjbMm8XStP9u0IIrOiXR4Umxl7btsRxrLv1ALSyJZHzQ0hff3jJKfaF2OVGREdODP0qsrJmKPqGsTHBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T21:22:18.773133Z","bundle_sha256":"391377c56586ed9b1a3eddbfd8d545cfc1fa700e827e47e86982d0c0a733b7c4"}}