{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:GBJP546NUGAAYRJ4WYLOQMO3ST","short_pith_number":"pith:GBJP546N","schema_version":"1.0","canonical_sha256":"3052fef3cda1800c453cb616e831db94ca31fd2750f5c4dc2aa5638afbcdcd95","source":{"kind":"arxiv","id":"2407.02499","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2407.02499","created_at":"2026-07-05T08:44:39.149463+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.02499v1","created_at":"2026-07-05T08:44:39.149463+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.02499","created_at":"2026-07-05T08:44:39.149463+00:00"},{"alias_kind":"pith_short_12","alias_value":"GBJP546NUGAA","created_at":"2026-07-05T08:44:39.149463+00:00"},{"alias_kind":"pith_short_16","alias_value":"GBJP546NUGAAYRJ4","created_at":"2026-07-05T08:44:39.149463+00:00"},{"alias_kind":"pith_short_8","alias_value":"GBJP546N","created_at":"2026-07-05T08:44:39.149463+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/GBJP546NUGAAYRJ4WYLOQMO3ST","json":"https://pith.science/pith/GBJP546NUGAAYRJ4WYLOQMO3ST.json","graph_json":"https://pith.science/api/pith-number/GBJP546NUGAAYRJ4WYLOQMO3ST/graph.json","events_json":"https://pith.science/api/pith-number/GBJP546NUGAAYRJ4WYLOQMO3ST/events.json","paper":"https://pith.science/paper/GBJP546N"},"agent_actions":{"view_html":"https://pith.science/pith/GBJP546NUGAAYRJ4WYLOQMO3ST","download_json":"https://pith.science/pith/GBJP546NUGAAYRJ4WYLOQMO3ST.json","view_paper":"https://pith.science/paper/GBJP546N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.02499&json=true","fetch_graph":"https://pith.science/api/pith-number/GBJP546NUGAAYRJ4WYLOQMO3ST/graph.json","fetch_events":"https://pith.science/api/pith-number/GBJP546NUGAAYRJ4WYLOQMO3ST/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GBJP546NUGAAYRJ4WYLOQMO3ST/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GBJP546NUGAAYRJ4WYLOQMO3ST/action/storage_attestation","attest_author":"https://pith.science/pith/GBJP546NUGAAYRJ4WYLOQMO3ST/action/author_attestation","sign_citation":"https://pith.science/pith/GBJP546NUGAAYRJ4WYLOQMO3ST/action/citation_signature","submit_replication":"https://pith.science/pith/GBJP546NUGAAYRJ4WYLOQMO3ST/action/replication_record"}},"created_at":"2026-07-05T08:44:39.149463+00:00","updated_at":"2026-07-05T08:44:39.149463+00:00"}