{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:ZLQHTENGJO3QA3APKLG4W3HDFV","short_pith_number":"pith:ZLQHTENG","schema_version":"1.0","canonical_sha256":"cae07991a64bb7006c0f52cdcb6ce32d5d3fdcc3094a1220770e62fe42c87a7a","source":{"kind":"arxiv","id":"1909.03938","version":1},"attestation_state":"computed","paper":{"title":"Network Utility Maximization based on Incentive Mechanism for Truthful Reporting of Local Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Jie Gao, Lian Zhao, Xuemin (Sherman) Shen","submitted_at":"2019-09-09T15:36:48Z","abstract_excerpt":"Classic network utility maximization problems are usually solved assuming all information is available, implying that information not locally available is always truthfully reported. This may not be practical in all scenarios, especially in distributed/semi-distributed networks. In this paper, incentive for truthful reporting in network optimizations with local information is studied. A novel general model for extending network utility maximization (NUM) problems to incorporate local information is proposed, which allows each user to choose its own objective locally and/or privately. Two speci"},"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":"1909.03938","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-09-09T15:36:48Z","cross_cats_sorted":[],"title_canon_sha256":"d7b49f94bd1d59d822771081c1df592e6ffabe0a93c98744c9faee9c59c396a0","abstract_canon_sha256":"be396b4127d32987119b4c2f7f8136d3a5dcf1da1d4211102d0dff9c566157e9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:03:09.944000Z","signature_b64":"4Q6QCdhLW5CGmLwV4OfWcL+xVR6UccEc41/+rkujvevkInr1t0f1NogfUpJjpPVf8YJKIplUD9m9Q50CbSAmAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cae07991a64bb7006c0f52cdcb6ce32d5d3fdcc3094a1220770e62fe42c87a7a","last_reissued_at":"2026-07-05T00:03:09.943538Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:03:09.943538Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Network Utility Maximization based on Incentive Mechanism for Truthful Reporting of Local Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Jie Gao, Lian Zhao, Xuemin (Sherman) Shen","submitted_at":"2019-09-09T15:36:48Z","abstract_excerpt":"Classic network utility maximization problems are usually solved assuming all information is available, implying that information not locally available is always truthfully reported. This may not be practical in all scenarios, especially in distributed/semi-distributed networks. In this paper, incentive for truthful reporting in network optimizations with local information is studied. A novel general model for extending network utility maximization (NUM) problems to incorporate local information is proposed, which allows each user to choose its own objective locally and/or privately. Two speci"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.03938","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/1909.03938/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":"1909.03938","created_at":"2026-07-05T00:03:09.943595+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.03938v1","created_at":"2026-07-05T00:03:09.943595+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.03938","created_at":"2026-07-05T00:03:09.943595+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZLQHTENGJO3Q","created_at":"2026-07-05T00:03:09.943595+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZLQHTENGJO3QA3AP","created_at":"2026-07-05T00:03:09.943595+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZLQHTENG","created_at":"2026-07-05T00:03:09.943595+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/ZLQHTENGJO3QA3APKLG4W3HDFV","json":"https://pith.science/pith/ZLQHTENGJO3QA3APKLG4W3HDFV.json","graph_json":"https://pith.science/api/pith-number/ZLQHTENGJO3QA3APKLG4W3HDFV/graph.json","events_json":"https://pith.science/api/pith-number/ZLQHTENGJO3QA3APKLG4W3HDFV/events.json","paper":"https://pith.science/paper/ZLQHTENG"},"agent_actions":{"view_html":"https://pith.science/pith/ZLQHTENGJO3QA3APKLG4W3HDFV","download_json":"https://pith.science/pith/ZLQHTENGJO3QA3APKLG4W3HDFV.json","view_paper":"https://pith.science/paper/ZLQHTENG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.03938&json=true","fetch_graph":"https://pith.science/api/pith-number/ZLQHTENGJO3QA3APKLG4W3HDFV/graph.json","fetch_events":"https://pith.science/api/pith-number/ZLQHTENGJO3QA3APKLG4W3HDFV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZLQHTENGJO3QA3APKLG4W3HDFV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZLQHTENGJO3QA3APKLG4W3HDFV/action/storage_attestation","attest_author":"https://pith.science/pith/ZLQHTENGJO3QA3APKLG4W3HDFV/action/author_attestation","sign_citation":"https://pith.science/pith/ZLQHTENGJO3QA3APKLG4W3HDFV/action/citation_signature","submit_replication":"https://pith.science/pith/ZLQHTENGJO3QA3APKLG4W3HDFV/action/replication_record"}},"created_at":"2026-07-05T00:03:09.943595+00:00","updated_at":"2026-07-05T00:03:09.943595+00:00"}