{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:N4S5GRUPL2SFF5T3TX2Y2SPQTB","short_pith_number":"pith:N4S5GRUP","schema_version":"1.0","canonical_sha256":"6f25d3468f5ea452f67b9df58d49f09862c3d395af676086ca4a3c0783b76b68","source":{"kind":"arxiv","id":"2010.02474","version":2},"attestation_state":"computed","paper":{"title":"Reward Propagation Using Graph Convolutional Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Doina Precup, Martin Klissarov","submitted_at":"2020-10-06T04:38:16Z","abstract_excerpt":"Potential-based reward shaping provides an approach for designing good reward functions, with the purpose of speeding up learning. However, automatically finding potential functions for complex environments is a difficult problem (in fact, of the same difficulty as learning a value function from scratch). We propose a new framework for learning potential functions by leveraging ideas from graph representation learning. Our approach relies on Graph Convolutional Networks which we use as a key ingredient in combination with the probabilistic inference view of reinforcement learning. More precise"},"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":"2010.02474","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-06T04:38:16Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"ae8edf8c1ec9f2d10116bbbc0b9add96d1a6a4c0f9f8d7f48a7ab277b3ec8a88","abstract_canon_sha256":"add46f60d1580c46e4d71f99b85f87417cf17887a6305913803900ca51c3d2b3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:16:27.583380Z","signature_b64":"wH00w64lU5jUsHZPeW/jTdoMNXrOsUrlXZ291Gw7fFpd99Dk78Lf4UOF26rAg96yibiuvSTFm+S0DS0PVL5QCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f25d3468f5ea452f67b9df58d49f09862c3d395af676086ca4a3c0783b76b68","last_reissued_at":"2026-07-05T02:16:27.582822Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:16:27.582822Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reward Propagation Using Graph Convolutional Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Doina Precup, Martin Klissarov","submitted_at":"2020-10-06T04:38:16Z","abstract_excerpt":"Potential-based reward shaping provides an approach for designing good reward functions, with the purpose of speeding up learning. However, automatically finding potential functions for complex environments is a difficult problem (in fact, of the same difficulty as learning a value function from scratch). We propose a new framework for learning potential functions by leveraging ideas from graph representation learning. Our approach relies on Graph Convolutional Networks which we use as a key ingredient in combination with the probabilistic inference view of reinforcement learning. More precise"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.02474","kind":"arxiv","version":2},"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/2010.02474/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":"2010.02474","created_at":"2026-07-05T02:16:27.582888+00:00"},{"alias_kind":"arxiv_version","alias_value":"2010.02474v2","created_at":"2026-07-05T02:16:27.582888+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.02474","created_at":"2026-07-05T02:16:27.582888+00:00"},{"alias_kind":"pith_short_12","alias_value":"N4S5GRUPL2SF","created_at":"2026-07-05T02:16:27.582888+00:00"},{"alias_kind":"pith_short_16","alias_value":"N4S5GRUPL2SFF5T3","created_at":"2026-07-05T02:16:27.582888+00:00"},{"alias_kind":"pith_short_8","alias_value":"N4S5GRUP","created_at":"2026-07-05T02:16:27.582888+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/N4S5GRUPL2SFF5T3TX2Y2SPQTB","json":"https://pith.science/pith/N4S5GRUPL2SFF5T3TX2Y2SPQTB.json","graph_json":"https://pith.science/api/pith-number/N4S5GRUPL2SFF5T3TX2Y2SPQTB/graph.json","events_json":"https://pith.science/api/pith-number/N4S5GRUPL2SFF5T3TX2Y2SPQTB/events.json","paper":"https://pith.science/paper/N4S5GRUP"},"agent_actions":{"view_html":"https://pith.science/pith/N4S5GRUPL2SFF5T3TX2Y2SPQTB","download_json":"https://pith.science/pith/N4S5GRUPL2SFF5T3TX2Y2SPQTB.json","view_paper":"https://pith.science/paper/N4S5GRUP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2010.02474&json=true","fetch_graph":"https://pith.science/api/pith-number/N4S5GRUPL2SFF5T3TX2Y2SPQTB/graph.json","fetch_events":"https://pith.science/api/pith-number/N4S5GRUPL2SFF5T3TX2Y2SPQTB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N4S5GRUPL2SFF5T3TX2Y2SPQTB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N4S5GRUPL2SFF5T3TX2Y2SPQTB/action/storage_attestation","attest_author":"https://pith.science/pith/N4S5GRUPL2SFF5T3TX2Y2SPQTB/action/author_attestation","sign_citation":"https://pith.science/pith/N4S5GRUPL2SFF5T3TX2Y2SPQTB/action/citation_signature","submit_replication":"https://pith.science/pith/N4S5GRUPL2SFF5T3TX2Y2SPQTB/action/replication_record"}},"created_at":"2026-07-05T02:16:27.582888+00:00","updated_at":"2026-07-05T02:16:27.582888+00:00"}