{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:OWMFZ5LRHUIKLF4NX5EU75R4UH","short_pith_number":"pith:OWMFZ5LR","schema_version":"1.0","canonical_sha256":"75985cf5713d10a5978dbf494ff63ca1c10429849ad356903f55b2e401731716","source":{"kind":"arxiv","id":"2101.10579","version":1},"attestation_state":"computed","paper":{"title":"Generating Syntactically Controlled Paraphrases without Using Annotated Parallel Pairs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Kai-Wei Chang, Kuan-Hao Huang","submitted_at":"2021-01-26T06:13:52Z","abstract_excerpt":"Paraphrase generation plays an essential role in natural language process (NLP), and it has many downstream applications. However, training supervised paraphrase models requires many annotated paraphrase pairs, which are usually costly to obtain. On the other hand, the paraphrases generated by existing unsupervised approaches are usually syntactically similar to the source sentences and are limited in diversity. In this paper, we demonstrate that it is possible to generate syntactically various paraphrases without the need for annotated paraphrase pairs. We propose Syntactically controlled Par"},"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":"2101.10579","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2021-01-26T06:13:52Z","cross_cats_sorted":[],"title_canon_sha256":"334fe663ff2afdf539fb467a9b389a02116e914fac9ad46228d4f0c3b21c694f","abstract_canon_sha256":"6338eea6d0defb55c551dc0a23306941392be4550046db37c99c5b35e14763e9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:10:00.069614Z","signature_b64":"FRrJYPCDvoRCy5qrn95wdQQJbkQ+m8BPBHUFKQxrijA5CfT5GnhMo2UDMOSdw5oZHPLB7RWcE7OlCLY08rxQAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75985cf5713d10a5978dbf494ff63ca1c10429849ad356903f55b2e401731716","last_reissued_at":"2026-07-05T02:10:00.069211Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:10:00.069211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generating Syntactically Controlled Paraphrases without Using Annotated Parallel Pairs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Kai-Wei Chang, Kuan-Hao Huang","submitted_at":"2021-01-26T06:13:52Z","abstract_excerpt":"Paraphrase generation plays an essential role in natural language process (NLP), and it has many downstream applications. However, training supervised paraphrase models requires many annotated paraphrase pairs, which are usually costly to obtain. On the other hand, the paraphrases generated by existing unsupervised approaches are usually syntactically similar to the source sentences and are limited in diversity. In this paper, we demonstrate that it is possible to generate syntactically various paraphrases without the need for annotated paraphrase pairs. We propose Syntactically controlled Par"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.10579","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/2101.10579/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":"2101.10579","created_at":"2026-07-05T02:10:00.069271+00:00"},{"alias_kind":"arxiv_version","alias_value":"2101.10579v1","created_at":"2026-07-05T02:10:00.069271+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.10579","created_at":"2026-07-05T02:10:00.069271+00:00"},{"alias_kind":"pith_short_12","alias_value":"OWMFZ5LRHUIK","created_at":"2026-07-05T02:10:00.069271+00:00"},{"alias_kind":"pith_short_16","alias_value":"OWMFZ5LRHUIKLF4N","created_at":"2026-07-05T02:10:00.069271+00:00"},{"alias_kind":"pith_short_8","alias_value":"OWMFZ5LR","created_at":"2026-07-05T02:10:00.069271+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.05429","citing_title":"Coordinated Robustness Evaluation Framework for Vision-Language Models","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OWMFZ5LRHUIKLF4NX5EU75R4UH","json":"https://pith.science/pith/OWMFZ5LRHUIKLF4NX5EU75R4UH.json","graph_json":"https://pith.science/api/pith-number/OWMFZ5LRHUIKLF4NX5EU75R4UH/graph.json","events_json":"https://pith.science/api/pith-number/OWMFZ5LRHUIKLF4NX5EU75R4UH/events.json","paper":"https://pith.science/paper/OWMFZ5LR"},"agent_actions":{"view_html":"https://pith.science/pith/OWMFZ5LRHUIKLF4NX5EU75R4UH","download_json":"https://pith.science/pith/OWMFZ5LRHUIKLF4NX5EU75R4UH.json","view_paper":"https://pith.science/paper/OWMFZ5LR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2101.10579&json=true","fetch_graph":"https://pith.science/api/pith-number/OWMFZ5LRHUIKLF4NX5EU75R4UH/graph.json","fetch_events":"https://pith.science/api/pith-number/OWMFZ5LRHUIKLF4NX5EU75R4UH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OWMFZ5LRHUIKLF4NX5EU75R4UH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OWMFZ5LRHUIKLF4NX5EU75R4UH/action/storage_attestation","attest_author":"https://pith.science/pith/OWMFZ5LRHUIKLF4NX5EU75R4UH/action/author_attestation","sign_citation":"https://pith.science/pith/OWMFZ5LRHUIKLF4NX5EU75R4UH/action/citation_signature","submit_replication":"https://pith.science/pith/OWMFZ5LRHUIKLF4NX5EU75R4UH/action/replication_record"}},"created_at":"2026-07-05T02:10:00.069271+00:00","updated_at":"2026-07-05T02:10:00.069271+00:00"}