{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:T2BUO3UTKDEAFXQWYIOA6FIWYY","short_pith_number":"pith:T2BUO3UT","schema_version":"1.0","canonical_sha256":"9e83476e9350c802de16c21c0f1516c62aadf841bd4d983c4939b54082a4457e","source":{"kind":"arxiv","id":"1707.03541","version":1},"attestation_state":"computed","paper":{"title":"A Scalable Semidefinite Relaxation Approach to Grid Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ali Davoudi, Alper Atamturk, Ramtin Madani","submitted_at":"2017-07-12T05:01:01Z","abstract_excerpt":"Determination of the most economic strategies for supply and transmission of electricity is a daunting computational challenge. Due to theoretical barriers, so-called NP-hardness, the amount of effort to optimize the schedule of generating units and route of power, can grow exponentially with the number of decision variables. Practical approaches to this problem involve legacy approximations and ad-hoc heuristics that may undermine the efficiency and reliability of power system operations, that are ever growing in scale and complexity. Therefore, the development of powerful optimization method"},"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":"1707.03541","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-07-12T05:01:01Z","cross_cats_sorted":[],"title_canon_sha256":"a421e19edf21090ce741395e9647257ded0c77b13b5d2a66943825fe7b96196e","abstract_canon_sha256":"48fe5c4626db753dd062e7d2ba15cc771fd16e7a8080041eb1f5d1cad790d0d9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:25.681116Z","signature_b64":"80k1Qz2n43qw0YD07+Za8ZojMLcqpQXvxnt1ezPT+hJ1Rq9OgK4GPxjT5em5j61unah10AeA+MuURiafi2fTAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e83476e9350c802de16c21c0f1516c62aadf841bd4d983c4939b54082a4457e","last_reissued_at":"2026-05-18T00:40:25.680370Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:25.680370Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Scalable Semidefinite Relaxation Approach to Grid Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ali Davoudi, Alper Atamturk, Ramtin Madani","submitted_at":"2017-07-12T05:01:01Z","abstract_excerpt":"Determination of the most economic strategies for supply and transmission of electricity is a daunting computational challenge. Due to theoretical barriers, so-called NP-hardness, the amount of effort to optimize the schedule of generating units and route of power, can grow exponentially with the number of decision variables. Practical approaches to this problem involve legacy approximations and ad-hoc heuristics that may undermine the efficiency and reliability of power system operations, that are ever growing in scale and complexity. Therefore, the development of powerful optimization method"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.03541","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1707.03541","created_at":"2026-05-18T00:40:25.680509+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.03541v1","created_at":"2026-05-18T00:40:25.680509+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.03541","created_at":"2026-05-18T00:40:25.680509+00:00"},{"alias_kind":"pith_short_12","alias_value":"T2BUO3UTKDEA","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"T2BUO3UTKDEAFXQW","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"T2BUO3UT","created_at":"2026-05-18T12:31:43.269735+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/T2BUO3UTKDEAFXQWYIOA6FIWYY","json":"https://pith.science/pith/T2BUO3UTKDEAFXQWYIOA6FIWYY.json","graph_json":"https://pith.science/api/pith-number/T2BUO3UTKDEAFXQWYIOA6FIWYY/graph.json","events_json":"https://pith.science/api/pith-number/T2BUO3UTKDEAFXQWYIOA6FIWYY/events.json","paper":"https://pith.science/paper/T2BUO3UT"},"agent_actions":{"view_html":"https://pith.science/pith/T2BUO3UTKDEAFXQWYIOA6FIWYY","download_json":"https://pith.science/pith/T2BUO3UTKDEAFXQWYIOA6FIWYY.json","view_paper":"https://pith.science/paper/T2BUO3UT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.03541&json=true","fetch_graph":"https://pith.science/api/pith-number/T2BUO3UTKDEAFXQWYIOA6FIWYY/graph.json","fetch_events":"https://pith.science/api/pith-number/T2BUO3UTKDEAFXQWYIOA6FIWYY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T2BUO3UTKDEAFXQWYIOA6FIWYY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T2BUO3UTKDEAFXQWYIOA6FIWYY/action/storage_attestation","attest_author":"https://pith.science/pith/T2BUO3UTKDEAFXQWYIOA6FIWYY/action/author_attestation","sign_citation":"https://pith.science/pith/T2BUO3UTKDEAFXQWYIOA6FIWYY/action/citation_signature","submit_replication":"https://pith.science/pith/T2BUO3UTKDEAFXQWYIOA6FIWYY/action/replication_record"}},"created_at":"2026-05-18T00:40:25.680509+00:00","updated_at":"2026-05-18T00:40:25.680509+00:00"}