{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:3VKBV7WS5S2GXOKEV2BSHZLGYZ","short_pith_number":"pith:3VKBV7WS","schema_version":"1.0","canonical_sha256":"dd541afed2ecb46bb944ae8323e566c64b59c23d56cb9e75880e71d4423acbb6","source":{"kind":"arxiv","id":"2012.01013","version":1},"attestation_state":"computed","paper":{"title":"Optimal Dynamic Pricing for Binary Demands in Smart Grids: A Fair and Privacy-Preserving Strategy","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Amir G. Aghdam, Jalal Arabneydi","submitted_at":"2020-12-02T08:05:43Z","abstract_excerpt":"Motivated by demand-side management in smart grids, a decentralized controlled Markov chain formulation is proposed to model a homogeneous population of users with binary demands (i.e., off or on). The binary demands often arise in scheduling applications such as plug-in hybrid vehicles. Normally, an independent service operator (ISO) has a finite number of options when it comes to providing the users with electricity. The options represent various incentive means, generation resources, and price profiles. The objective of the ISO is to find optimal options in order to keep the distribution of"},"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":"2012.01013","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2020-12-02T08:05:43Z","cross_cats_sorted":[],"title_canon_sha256":"5fe0d08b38c0603a31fd4e30b3c8852be83a95ba14a11bb344d72bf3c72f7db9","abstract_canon_sha256":"33f8ec6188fac3d38433c17bbdd4cbd93a42a948c05be2272413cdc907f13759"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:56:34.684168Z","signature_b64":"5aXQfGmhsyDLaXjkyxRIsQ0QCCIjODEAL5/Sp/b4GrU/k2eyAnleCcCb2ygu2n7J/DvdhuVgt+zBzEAabCxGAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd541afed2ecb46bb944ae8323e566c64b59c23d56cb9e75880e71d4423acbb6","last_reissued_at":"2026-07-05T01:56:34.683756Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:56:34.683756Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Dynamic Pricing for Binary Demands in Smart Grids: A Fair and Privacy-Preserving Strategy","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Amir G. Aghdam, Jalal Arabneydi","submitted_at":"2020-12-02T08:05:43Z","abstract_excerpt":"Motivated by demand-side management in smart grids, a decentralized controlled Markov chain formulation is proposed to model a homogeneous population of users with binary demands (i.e., off or on). The binary demands often arise in scheduling applications such as plug-in hybrid vehicles. Normally, an independent service operator (ISO) has a finite number of options when it comes to providing the users with electricity. The options represent various incentive means, generation resources, and price profiles. The objective of the ISO is to find optimal options in order to keep the distribution of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.01013","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/2012.01013/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2012.01013","created_at":"2026-07-05T01:56:34.683811+00:00"},{"alias_kind":"arxiv_version","alias_value":"2012.01013v1","created_at":"2026-07-05T01:56:34.683811+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.01013","created_at":"2026-07-05T01:56:34.683811+00:00"},{"alias_kind":"pith_short_12","alias_value":"3VKBV7WS5S2G","created_at":"2026-07-05T01:56:34.683811+00:00"},{"alias_kind":"pith_short_16","alias_value":"3VKBV7WS5S2GXOKE","created_at":"2026-07-05T01:56:34.683811+00:00"},{"alias_kind":"pith_short_8","alias_value":"3VKBV7WS","created_at":"2026-07-05T01:56:34.683811+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/3VKBV7WS5S2GXOKEV2BSHZLGYZ","json":"https://pith.science/pith/3VKBV7WS5S2GXOKEV2BSHZLGYZ.json","graph_json":"https://pith.science/api/pith-number/3VKBV7WS5S2GXOKEV2BSHZLGYZ/graph.json","events_json":"https://pith.science/api/pith-number/3VKBV7WS5S2GXOKEV2BSHZLGYZ/events.json","paper":"https://pith.science/paper/3VKBV7WS"},"agent_actions":{"view_html":"https://pith.science/pith/3VKBV7WS5S2GXOKEV2BSHZLGYZ","download_json":"https://pith.science/pith/3VKBV7WS5S2GXOKEV2BSHZLGYZ.json","view_paper":"https://pith.science/paper/3VKBV7WS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2012.01013&json=true","fetch_graph":"https://pith.science/api/pith-number/3VKBV7WS5S2GXOKEV2BSHZLGYZ/graph.json","fetch_events":"https://pith.science/api/pith-number/3VKBV7WS5S2GXOKEV2BSHZLGYZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3VKBV7WS5S2GXOKEV2BSHZLGYZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3VKBV7WS5S2GXOKEV2BSHZLGYZ/action/storage_attestation","attest_author":"https://pith.science/pith/3VKBV7WS5S2GXOKEV2BSHZLGYZ/action/author_attestation","sign_citation":"https://pith.science/pith/3VKBV7WS5S2GXOKEV2BSHZLGYZ/action/citation_signature","submit_replication":"https://pith.science/pith/3VKBV7WS5S2GXOKEV2BSHZLGYZ/action/replication_record"}},"created_at":"2026-07-05T01:56:34.683811+00:00","updated_at":"2026-07-05T01:56:34.683811+00:00"}