{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:GBJP546NUGAAYRJ4WYLOQMO3ST","short_pith_number":"pith:GBJP546N","canonical_record":{"source":{"id":"2407.02499","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2024-06-01T22:55:33Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"56d058eb7bd34f7397cf28dc7463e10af26abf1d4b246e30f54f6abbf1a58fa4","abstract_canon_sha256":"2d1e5419c5ec84f5def7d569c1262c3cc8095d991a0257573a10c6116bc34acb"},"schema_version":"1.0"},"canonical_sha256":"3052fef3cda1800c453cb616e831db94ca31fd2750f5c4dc2aa5638afbcdcd95","source":{"kind":"arxiv","id":"2407.02499","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.02499","created_at":"2026-07-05T08:44:39Z"},{"alias_kind":"arxiv_version","alias_value":"2407.02499v1","created_at":"2026-07-05T08:44:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.02499","created_at":"2026-07-05T08:44:39Z"},{"alias_kind":"pith_short_12","alias_value":"GBJP546NUGAA","created_at":"2026-07-05T08:44:39Z"},{"alias_kind":"pith_short_16","alias_value":"GBJP546NUGAAYRJ4","created_at":"2026-07-05T08:44:39Z"},{"alias_kind":"pith_short_8","alias_value":"GBJP546N","created_at":"2026-07-05T08:44:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:GBJP546NUGAAYRJ4WYLOQMO3ST","target":"record","payload":{"canonical_record":{"source":{"id":"2407.02499","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2024-06-01T22:55:33Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"56d058eb7bd34f7397cf28dc7463e10af26abf1d4b246e30f54f6abbf1a58fa4","abstract_canon_sha256":"2d1e5419c5ec84f5def7d569c1262c3cc8095d991a0257573a10c6116bc34acb"},"schema_version":"1.0"},"canonical_sha256":"3052fef3cda1800c453cb616e831db94ca31fd2750f5c4dc2aa5638afbcdcd95","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:44:39.149785Z","signature_b64":"6rFS4ZDbRcS6hy/nH46Sqr0nP1rYD71dNgVvrNkTeTRw/OzeLq+4atUywRTuZN7HfJcqoQCpZQRXY+3YMigEAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3052fef3cda1800c453cb616e831db94ca31fd2750f5c4dc2aa5638afbcdcd95","last_reissued_at":"2026-07-05T08:44:39.149409Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:44:39.149409Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2407.02499","source_version":1,"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-07-05T08:44:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EbW1Os/0beyH3EA1DWzOmny1Ffn8eiB0ztY+2NESd5Lz612jiq1yORbV/p8yiYMN9zni6Eur/5ZivvjyXL5WDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T13:28:58.413037Z"},"content_sha256":"dbe02ac45d953ff1e017b99841d5ebde6c074f6657afb552051df7014090f299","schema_version":"1.0","event_id":"sha256:dbe02ac45d953ff1e017b99841d5ebde6c074f6657afb552051df7014090f299"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:GBJP546NUGAAYRJ4WYLOQMO3ST","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Amortizing Pragmatic Program Synthesis with Rankings","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.PL","authors_text":"Daniel Fried, Elena Glassman, Priyan Vaithilingam, Saujas Vaduguru, Yewen Pu","submitted_at":"2024-06-01T22:55:33Z","abstract_excerpt":"The usage of Rational Speech Acts (RSA) framework has been successful in building \\emph{pragmatic} program synthesizers that return programs which, in addition to being logically consistent with user-generated examples, account for the fact that a user chooses their examples informatively. We present a general method of amortizing the slow, exact RSA synthesizer. Our method first query the exact RSA synthesizer to compile a communication dataset. The dataset contains a number of example-dependent rankings of subsets of programs. It then distills a \\textit{single} global ranking of all programs"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.02499","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/2407.02499/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"},"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-07-05T08:44:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vBIBaQofYVbMSqDXwENRUyA+CdByh0QAmdTx/7LghIAmVpbOrb62QgbyII6O8gvknKhDUMAHz3pvcoVcOM/cAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T13:28:58.414189Z"},"content_sha256":"f93e2c50d4c7351ea347c43c451eac23be4cb0a6c45238e188dab140c50416e0","schema_version":"1.0","event_id":"sha256:f93e2c50d4c7351ea347c43c451eac23be4cb0a6c45238e188dab140c50416e0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GBJP546NUGAAYRJ4WYLOQMO3ST/bundle.json","state_url":"https://pith.science/pith/GBJP546NUGAAYRJ4WYLOQMO3ST/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GBJP546NUGAAYRJ4WYLOQMO3ST/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-08-18T13:28:58Z","links":{"resolver":"https://pith.science/pith/GBJP546NUGAAYRJ4WYLOQMO3ST","bundle":"https://pith.science/pith/GBJP546NUGAAYRJ4WYLOQMO3ST/bundle.json","state":"https://pith.science/pith/GBJP546NUGAAYRJ4WYLOQMO3ST/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GBJP546NUGAAYRJ4WYLOQMO3ST/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:GBJP546NUGAAYRJ4WYLOQMO3ST","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":"2d1e5419c5ec84f5def7d569c1262c3cc8095d991a0257573a10c6116bc34acb","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2024-06-01T22:55:33Z","title_canon_sha256":"56d058eb7bd34f7397cf28dc7463e10af26abf1d4b246e30f54f6abbf1a58fa4"},"schema_version":"1.0","source":{"id":"2407.02499","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.02499","created_at":"2026-07-05T08:44:39Z"},{"alias_kind":"arxiv_version","alias_value":"2407.02499v1","created_at":"2026-07-05T08:44:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.02499","created_at":"2026-07-05T08:44:39Z"},{"alias_kind":"pith_short_12","alias_value":"GBJP546NUGAA","created_at":"2026-07-05T08:44:39Z"},{"alias_kind":"pith_short_16","alias_value":"GBJP546NUGAAYRJ4","created_at":"2026-07-05T08:44:39Z"},{"alias_kind":"pith_short_8","alias_value":"GBJP546N","created_at":"2026-07-05T08:44:39Z"}],"graph_snapshots":[{"event_id":"sha256:f93e2c50d4c7351ea347c43c451eac23be4cb0a6c45238e188dab140c50416e0","target":"graph","created_at":"2026-07-05T08:44:39Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2407.02499/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The usage of Rational Speech Acts (RSA) framework has been successful in building \\emph{pragmatic} program synthesizers that return programs which, in addition to being logically consistent with user-generated examples, account for the fact that a user chooses their examples informatively. We present a general method of amortizing the slow, exact RSA synthesizer. Our method first query the exact RSA synthesizer to compile a communication dataset. The dataset contains a number of example-dependent rankings of subsets of programs. It then distills a \\textit{single} global ranking of all programs","authors_text":"Daniel Fried, Elena Glassman, Priyan Vaithilingam, Saujas Vaduguru, Yewen Pu","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2024-06-01T22:55:33Z","title":"Amortizing Pragmatic Program Synthesis with Rankings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.02499","kind":"arxiv","version":1},"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:dbe02ac45d953ff1e017b99841d5ebde6c074f6657afb552051df7014090f299","target":"record","created_at":"2026-07-05T08:44:39Z","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":"2d1e5419c5ec84f5def7d569c1262c3cc8095d991a0257573a10c6116bc34acb","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2024-06-01T22:55:33Z","title_canon_sha256":"56d058eb7bd34f7397cf28dc7463e10af26abf1d4b246e30f54f6abbf1a58fa4"},"schema_version":"1.0","source":{"id":"2407.02499","kind":"arxiv","version":1}},"canonical_sha256":"3052fef3cda1800c453cb616e831db94ca31fd2750f5c4dc2aa5638afbcdcd95","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3052fef3cda1800c453cb616e831db94ca31fd2750f5c4dc2aa5638afbcdcd95","first_computed_at":"2026-07-05T08:44:39.149409Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:44:39.149409Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6rFS4ZDbRcS6hy/nH46Sqr0nP1rYD71dNgVvrNkTeTRw/OzeLq+4atUywRTuZN7HfJcqoQCpZQRXY+3YMigEAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:44:39.149785Z","signed_message":"canonical_sha256_bytes"},"source_id":"2407.02499","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dbe02ac45d953ff1e017b99841d5ebde6c074f6657afb552051df7014090f299","sha256:f93e2c50d4c7351ea347c43c451eac23be4cb0a6c45238e188dab140c50416e0"],"state_sha256":"33e0f8352b0ecfb1f49c2c8c75b3e9b7fce4f8a26526a6f615e001e7cbefd367"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"empeEfCIYnBAJmlNHfnewx2Wch7HRC0ZSr2BWWCUVUc5QpaWFZIklDCo2f9GutbXnGdZqUTw7g1SoSYxf4A8Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T13:28:58.421882Z","bundle_sha256":"3a64f7d66d05a8970dfbc5be207ee529618107904f9bd5b930adf13be884d4a4"}}