{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:HVAYVNR7IN2XGXKSL7SGOVDWOQ","short_pith_number":"pith:HVAYVNR7","canonical_record":{"source":{"id":"1603.06143","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GR","submitted_at":"2016-03-19T20:58:47Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"280c0773d6ed2cc4c4606eee26fe4013a61ea6d14b334b25149cb03a830ced04","abstract_canon_sha256":"104b5ef348e66108069a29bab50f7dd066c5f093b94f83912d71e68867755d78"},"schema_version":"1.0"},"canonical_sha256":"3d418ab63f4375735d525fe467547674132956f125d06eba2dc7102cf8ac4fdb","source":{"kind":"arxiv","id":"1603.06143","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.06143","created_at":"2026-05-18T01:02:20Z"},{"alias_kind":"arxiv_version","alias_value":"1603.06143v2","created_at":"2026-05-18T01:02:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.06143","created_at":"2026-05-18T01:02:20Z"},{"alias_kind":"pith_short_12","alias_value":"HVAYVNR7IN2X","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"HVAYVNR7IN2XGXKS","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"HVAYVNR7","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:HVAYVNR7IN2XGXKSL7SGOVDWOQ","target":"record","payload":{"canonical_record":{"source":{"id":"1603.06143","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GR","submitted_at":"2016-03-19T20:58:47Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"280c0773d6ed2cc4c4606eee26fe4013a61ea6d14b334b25149cb03a830ced04","abstract_canon_sha256":"104b5ef348e66108069a29bab50f7dd066c5f093b94f83912d71e68867755d78"},"schema_version":"1.0"},"canonical_sha256":"3d418ab63f4375735d525fe467547674132956f125d06eba2dc7102cf8ac4fdb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:20.941754Z","signature_b64":"ao4dWCKYwSDmXQaMTWavfwVLSDQ+cfDdblvubrbk+bOLlK36/KYvpWPSq+AyhT83GvzDbE6kLhiv820LQplwCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d418ab63f4375735d525fe467547674132956f125d06eba2dc7102cf8ac4fdb","last_reissued_at":"2026-05-18T01:02:20.941089Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:20.941089Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.06143","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:02:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MsusMvMv6Lb6J+znXSTF+6lydQ1SGWQ9lCpjwH9+rV9TeFKnneGapOLBfe+Iduz2lCTeSomaEuVVghPc0UbIDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:57:25.358157Z"},"content_sha256":"b584d0a4caa204e8d548963e551d7fa52b588d5c6b70d3b444622304c02aa4d8","schema_version":"1.0","event_id":"sha256:b584d0a4caa204e8d548963e551d7fa52b588d5c6b70d3b444622304c02aa4d8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:HVAYVNR7IN2XGXKSL7SGOVDWOQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Neurally-Guided Procedural Models: Amortized Inference for Procedural Graphics Programs using Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.GR","authors_text":"Anna Thomas, Daniel Ritchie, Noah D. Goodman, Pat Hanrahan","submitted_at":"2016-03-19T20:58:47Z","abstract_excerpt":"Probabilistic inference algorithms such as Sequential Monte Carlo (SMC) provide powerful tools for constraining procedural models in computer graphics, but they require many samples to produce desirable results. In this paper, we show how to create procedural models which learn how to satisfy constraints. We augment procedural models with neural networks which control how the model makes random choices based on the output it has generated thus far. We call such models neurally-guided procedural models. As a pre-computation, we train these models to maximize the likelihood of example outputs ge"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.06143","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:02:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z8xnehbGV6hywWJj7V1Ov60Er314YGHWb6vLvL6YFy6rOwehlYPkq/pIioIq/hCEhu5MjBckpIX4aErb4XW8Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:57:25.358819Z"},"content_sha256":"a022e0f2062670f3a0e2fab8d122f49013667126e2e3029aaee7774c38eb7110","schema_version":"1.0","event_id":"sha256:a022e0f2062670f3a0e2fab8d122f49013667126e2e3029aaee7774c38eb7110"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HVAYVNR7IN2XGXKSL7SGOVDWOQ/bundle.json","state_url":"https://pith.science/pith/HVAYVNR7IN2XGXKSL7SGOVDWOQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HVAYVNR7IN2XGXKSL7SGOVDWOQ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T00:57:25Z","links":{"resolver":"https://pith.science/pith/HVAYVNR7IN2XGXKSL7SGOVDWOQ","bundle":"https://pith.science/pith/HVAYVNR7IN2XGXKSL7SGOVDWOQ/bundle.json","state":"https://pith.science/pith/HVAYVNR7IN2XGXKSL7SGOVDWOQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HVAYVNR7IN2XGXKSL7SGOVDWOQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:HVAYVNR7IN2XGXKSL7SGOVDWOQ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"104b5ef348e66108069a29bab50f7dd066c5f093b94f83912d71e68867755d78","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GR","submitted_at":"2016-03-19T20:58:47Z","title_canon_sha256":"280c0773d6ed2cc4c4606eee26fe4013a61ea6d14b334b25149cb03a830ced04"},"schema_version":"1.0","source":{"id":"1603.06143","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.06143","created_at":"2026-05-18T01:02:20Z"},{"alias_kind":"arxiv_version","alias_value":"1603.06143v2","created_at":"2026-05-18T01:02:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.06143","created_at":"2026-05-18T01:02:20Z"},{"alias_kind":"pith_short_12","alias_value":"HVAYVNR7IN2X","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"HVAYVNR7IN2XGXKS","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"HVAYVNR7","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:a022e0f2062670f3a0e2fab8d122f49013667126e2e3029aaee7774c38eb7110","target":"graph","created_at":"2026-05-18T01:02:20Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Probabilistic inference algorithms such as Sequential Monte Carlo (SMC) provide powerful tools for constraining procedural models in computer graphics, but they require many samples to produce desirable results. In this paper, we show how to create procedural models which learn how to satisfy constraints. We augment procedural models with neural networks which control how the model makes random choices based on the output it has generated thus far. We call such models neurally-guided procedural models. As a pre-computation, we train these models to maximize the likelihood of example outputs ge","authors_text":"Anna Thomas, Daniel Ritchie, Noah D. Goodman, Pat Hanrahan","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GR","submitted_at":"2016-03-19T20:58:47Z","title":"Neurally-Guided Procedural Models: Amortized Inference for Procedural Graphics Programs using Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.06143","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b584d0a4caa204e8d548963e551d7fa52b588d5c6b70d3b444622304c02aa4d8","target":"record","created_at":"2026-05-18T01:02:20Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"104b5ef348e66108069a29bab50f7dd066c5f093b94f83912d71e68867755d78","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GR","submitted_at":"2016-03-19T20:58:47Z","title_canon_sha256":"280c0773d6ed2cc4c4606eee26fe4013a61ea6d14b334b25149cb03a830ced04"},"schema_version":"1.0","source":{"id":"1603.06143","kind":"arxiv","version":2}},"canonical_sha256":"3d418ab63f4375735d525fe467547674132956f125d06eba2dc7102cf8ac4fdb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3d418ab63f4375735d525fe467547674132956f125d06eba2dc7102cf8ac4fdb","first_computed_at":"2026-05-18T01:02:20.941089Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:02:20.941089Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ao4dWCKYwSDmXQaMTWavfwVLSDQ+cfDdblvubrbk+bOLlK36/KYvpWPSq+AyhT83GvzDbE6kLhiv820LQplwCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:02:20.941754Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.06143","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b584d0a4caa204e8d548963e551d7fa52b588d5c6b70d3b444622304c02aa4d8","sha256:a022e0f2062670f3a0e2fab8d122f49013667126e2e3029aaee7774c38eb7110"],"state_sha256":"e43514c6b47b0e8292acdd00f8e3d2dcbec6708b9a5e5e4276b51548ea34a8d3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ks5Ljy0jjoq3TEO30CEbMN1XOBfcm/TbxMeab6AAsdw2ZE/6HvTj9Nm3qTiYLKyoPct0C+4kNmQt8nO+xJ3jDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T00:57:25.362935Z","bundle_sha256":"c112ce6e8c000b957ae034541cf0647a197c70982ca37d3d3d7bcfb42fcf4779"}}