{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:AQZZYFXNGKK65E4FXHAKNJ5PVB","short_pith_number":"pith:AQZZYFXN","schema_version":"1.0","canonical_sha256":"04339c16ed3295ee9385b9c0a6a7afa856688a3bbfb0c293463c87bc0170efb0","source":{"kind":"arxiv","id":"1809.05245","version":1},"attestation_state":"computed","paper":{"title":"Distributed and Efficient Resource Balancing Among Many Suppliers and Consumers","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.MA","authors_text":"Jia Yuan Yu, Kamal Chaturvedi, Shrisha Rao","submitted_at":"2018-09-14T04:02:21Z","abstract_excerpt":"Achieving a balance of supply and demand in a multi-agent system with many individual self-interested and rational agents that act as suppliers and consumers is a natural problem in a variety of real-life domains---smart power grids, data centers, and others. In this paper, we address the profit-maximization problem for a group of distributed supplier and consumer agents, with no inter-agent communication. We simulate a scenario of a market with $S$ suppliers and $C$ consumers such that at every instant, each supplier agent supplies a certain quantity and simultaneously, each consumer agent co"},"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":"1809.05245","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.MA","submitted_at":"2018-09-14T04:02:21Z","cross_cats_sorted":[],"title_canon_sha256":"283d2d3b0b126b57caaa716daec4e8c74a912035b919f9979a4d18acca4a79d7","abstract_canon_sha256":"f3f77d20c21a6e7eb7fceda5fa34030ff4ddbc1b0262bed8dca6de518cbe5228"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:44.255445Z","signature_b64":"FSGbwF0UXUmJiTqmA5tbokyfUEr4xLma9y+/EP1U6UPALlRMQ1EoAwwgZ9Y+Qyo/iiukZtwZqL+63jX74SsjBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"04339c16ed3295ee9385b9c0a6a7afa856688a3bbfb0c293463c87bc0170efb0","last_reissued_at":"2026-05-18T00:05:44.254844Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:44.254844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed and Efficient Resource Balancing Among Many Suppliers and Consumers","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.MA","authors_text":"Jia Yuan Yu, Kamal Chaturvedi, Shrisha Rao","submitted_at":"2018-09-14T04:02:21Z","abstract_excerpt":"Achieving a balance of supply and demand in a multi-agent system with many individual self-interested and rational agents that act as suppliers and consumers is a natural problem in a variety of real-life domains---smart power grids, data centers, and others. In this paper, we address the profit-maximization problem for a group of distributed supplier and consumer agents, with no inter-agent communication. We simulate a scenario of a market with $S$ suppliers and $C$ consumers such that at every instant, each supplier agent supplies a certain quantity and simultaneously, each consumer agent co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.05245","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":"1809.05245","created_at":"2026-05-18T00:05:44.254942+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.05245v1","created_at":"2026-05-18T00:05:44.254942+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.05245","created_at":"2026-05-18T00:05:44.254942+00:00"},{"alias_kind":"pith_short_12","alias_value":"AQZZYFXNGKK6","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"AQZZYFXNGKK65E4F","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"AQZZYFXN","created_at":"2026-05-18T12:32:13.499390+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/AQZZYFXNGKK65E4FXHAKNJ5PVB","json":"https://pith.science/pith/AQZZYFXNGKK65E4FXHAKNJ5PVB.json","graph_json":"https://pith.science/api/pith-number/AQZZYFXNGKK65E4FXHAKNJ5PVB/graph.json","events_json":"https://pith.science/api/pith-number/AQZZYFXNGKK65E4FXHAKNJ5PVB/events.json","paper":"https://pith.science/paper/AQZZYFXN"},"agent_actions":{"view_html":"https://pith.science/pith/AQZZYFXNGKK65E4FXHAKNJ5PVB","download_json":"https://pith.science/pith/AQZZYFXNGKK65E4FXHAKNJ5PVB.json","view_paper":"https://pith.science/paper/AQZZYFXN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.05245&json=true","fetch_graph":"https://pith.science/api/pith-number/AQZZYFXNGKK65E4FXHAKNJ5PVB/graph.json","fetch_events":"https://pith.science/api/pith-number/AQZZYFXNGKK65E4FXHAKNJ5PVB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AQZZYFXNGKK65E4FXHAKNJ5PVB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AQZZYFXNGKK65E4FXHAKNJ5PVB/action/storage_attestation","attest_author":"https://pith.science/pith/AQZZYFXNGKK65E4FXHAKNJ5PVB/action/author_attestation","sign_citation":"https://pith.science/pith/AQZZYFXNGKK65E4FXHAKNJ5PVB/action/citation_signature","submit_replication":"https://pith.science/pith/AQZZYFXNGKK65E4FXHAKNJ5PVB/action/replication_record"}},"created_at":"2026-05-18T00:05:44.254942+00:00","updated_at":"2026-05-18T00:05:44.254942+00:00"}