{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:647XTMK4ERW7GTHHBS2VTJZUGS","short_pith_number":"pith:647XTMK4","schema_version":"1.0","canonical_sha256":"f73f79b15c246df34ce70cb559a7343497dac6e8b9a8d372c213deed08192040","source":{"kind":"arxiv","id":"1506.00694","version":1},"attestation_state":"computed","paper":{"title":"An Iterative On-Line Mechanism for Demand-Side Aggregation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.SY","authors_text":"Archie C. Chapman, Gregor Verbic","submitted_at":"2015-06-01T22:24:02Z","abstract_excerpt":"This paper considers a demand-side aggregation scheme specifically for large numbers of small loads, such as households and small and medium-sized businesses. We introduce a novel auction format, called a staggered clock-proxy auction (SCPA), for on-line scheduling of these loads. This is a two phase format, consisting of: a sequence of overlapping iterative ascending-price clock auctions, one for each time-slot over a finite decision horizon, and; a set of proxy auctions that begin at the termination of each individual clock auction, and which determine the final price and allocation for each"},"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":"1506.00694","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-06-01T22:24:02Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"b2bbb8388f17fc410d4bcc628e48bc631eb9bd883ff7bf693f3947419a2f369a","abstract_canon_sha256":"54cc172ac68044900fcb504a99f71ab95f05a43c25039a661017b724ba16b4fc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:57.413163Z","signature_b64":"0gpIS24/CfawBkz2uDd9fJE+L5CW8aQsyhTNlOMJ25Aw0djqyqQVZMGEP48kDlD1GJs4IgFzQZVN8F0/SoiZAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f73f79b15c246df34ce70cb559a7343497dac6e8b9a8d372c213deed08192040","last_reissued_at":"2026-05-18T01:19:57.412492Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:57.412492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Iterative On-Line Mechanism for Demand-Side Aggregation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.SY","authors_text":"Archie C. Chapman, Gregor Verbic","submitted_at":"2015-06-01T22:24:02Z","abstract_excerpt":"This paper considers a demand-side aggregation scheme specifically for large numbers of small loads, such as households and small and medium-sized businesses. We introduce a novel auction format, called a staggered clock-proxy auction (SCPA), for on-line scheduling of these loads. This is a two phase format, consisting of: a sequence of overlapping iterative ascending-price clock auctions, one for each time-slot over a finite decision horizon, and; a set of proxy auctions that begin at the termination of each individual clock auction, and which determine the final price and allocation for each"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.00694","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":"1506.00694","created_at":"2026-05-18T01:19:57.412609+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.00694v1","created_at":"2026-05-18T01:19:57.412609+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.00694","created_at":"2026-05-18T01:19:57.412609+00:00"},{"alias_kind":"pith_short_12","alias_value":"647XTMK4ERW7","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"647XTMK4ERW7GTHH","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"647XTMK4","created_at":"2026-05-18T12:29:07.941421+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/647XTMK4ERW7GTHHBS2VTJZUGS","json":"https://pith.science/pith/647XTMK4ERW7GTHHBS2VTJZUGS.json","graph_json":"https://pith.science/api/pith-number/647XTMK4ERW7GTHHBS2VTJZUGS/graph.json","events_json":"https://pith.science/api/pith-number/647XTMK4ERW7GTHHBS2VTJZUGS/events.json","paper":"https://pith.science/paper/647XTMK4"},"agent_actions":{"view_html":"https://pith.science/pith/647XTMK4ERW7GTHHBS2VTJZUGS","download_json":"https://pith.science/pith/647XTMK4ERW7GTHHBS2VTJZUGS.json","view_paper":"https://pith.science/paper/647XTMK4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.00694&json=true","fetch_graph":"https://pith.science/api/pith-number/647XTMK4ERW7GTHHBS2VTJZUGS/graph.json","fetch_events":"https://pith.science/api/pith-number/647XTMK4ERW7GTHHBS2VTJZUGS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/647XTMK4ERW7GTHHBS2VTJZUGS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/647XTMK4ERW7GTHHBS2VTJZUGS/action/storage_attestation","attest_author":"https://pith.science/pith/647XTMK4ERW7GTHHBS2VTJZUGS/action/author_attestation","sign_citation":"https://pith.science/pith/647XTMK4ERW7GTHHBS2VTJZUGS/action/citation_signature","submit_replication":"https://pith.science/pith/647XTMK4ERW7GTHHBS2VTJZUGS/action/replication_record"}},"created_at":"2026-05-18T01:19:57.412609+00:00","updated_at":"2026-05-18T01:19:57.412609+00:00"}