{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:JR5LZNSZHB6R6S5FGP6CVGOKBA","short_pith_number":"pith:JR5LZNSZ","schema_version":"1.0","canonical_sha256":"4c7abcb659387d1f4ba533fc2a99ca080356fe943c43319b1e6b2965f363b900","source":{"kind":"arxiv","id":"1612.06475","version":1},"attestation_state":"computed","paper":{"title":"Span-Based Constituency Parsing with a Structure-Label System and Provably Optimal Dynamic Oracles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"James Cross, Liang Huang","submitted_at":"2016-12-20T01:23:00Z","abstract_excerpt":"Parsing accuracy using efficient greedy transition systems has improved dramatically in recent years thanks to neural networks. Despite striking results in dependency parsing, however, neural models have not surpassed state-of-the-art approaches in constituency parsing. To remedy this, we introduce a new shift-reduce system whose stack contains merely sentence spans, represented by a bare minimum of LSTM features. We also design the first provably optimal dynamic oracle for constituency parsing, which runs in amortized O(1) time, compared to O(n^3) oracles for standard dependency parsing. Trai"},"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":"1612.06475","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-12-20T01:23:00Z","cross_cats_sorted":[],"title_canon_sha256":"c961ffaa72545139e68e8d6ce983ee8528c972a26a917fbb0c1fbfca9532ad02","abstract_canon_sha256":"b343370073d2a30322d32e206fabecf9c6f997bfea17881d4e1416ff6cdd7be5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:25.733001Z","signature_b64":"KS+N8PgT7V9NoR+jUOfozUvbNL6fgfyvTAKPSxA2NvBk0KniWdV9rI2gCgbUEW6ph74Fl+p933sRCQp5HV17Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c7abcb659387d1f4ba533fc2a99ca080356fe943c43319b1e6b2965f363b900","last_reissued_at":"2026-05-18T00:54:25.732386Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:25.732386Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Span-Based Constituency Parsing with a Structure-Label System and Provably Optimal Dynamic Oracles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"James Cross, Liang Huang","submitted_at":"2016-12-20T01:23:00Z","abstract_excerpt":"Parsing accuracy using efficient greedy transition systems has improved dramatically in recent years thanks to neural networks. Despite striking results in dependency parsing, however, neural models have not surpassed state-of-the-art approaches in constituency parsing. To remedy this, we introduce a new shift-reduce system whose stack contains merely sentence spans, represented by a bare minimum of LSTM features. We also design the first provably optimal dynamic oracle for constituency parsing, which runs in amortized O(1) time, compared to O(n^3) oracles for standard dependency parsing. Trai"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.06475","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":""},"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":"1612.06475","created_at":"2026-05-18T00:54:25.732486+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.06475v1","created_at":"2026-05-18T00:54:25.732486+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.06475","created_at":"2026-05-18T00:54:25.732486+00:00"},{"alias_kind":"pith_short_12","alias_value":"JR5LZNSZHB6R","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"JR5LZNSZHB6R6S5F","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"JR5LZNSZ","created_at":"2026-05-18T12:30:25.849896+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/JR5LZNSZHB6R6S5FGP6CVGOKBA","json":"https://pith.science/pith/JR5LZNSZHB6R6S5FGP6CVGOKBA.json","graph_json":"https://pith.science/api/pith-number/JR5LZNSZHB6R6S5FGP6CVGOKBA/graph.json","events_json":"https://pith.science/api/pith-number/JR5LZNSZHB6R6S5FGP6CVGOKBA/events.json","paper":"https://pith.science/paper/JR5LZNSZ"},"agent_actions":{"view_html":"https://pith.science/pith/JR5LZNSZHB6R6S5FGP6CVGOKBA","download_json":"https://pith.science/pith/JR5LZNSZHB6R6S5FGP6CVGOKBA.json","view_paper":"https://pith.science/paper/JR5LZNSZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.06475&json=true","fetch_graph":"https://pith.science/api/pith-number/JR5LZNSZHB6R6S5FGP6CVGOKBA/graph.json","fetch_events":"https://pith.science/api/pith-number/JR5LZNSZHB6R6S5FGP6CVGOKBA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JR5LZNSZHB6R6S5FGP6CVGOKBA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JR5LZNSZHB6R6S5FGP6CVGOKBA/action/storage_attestation","attest_author":"https://pith.science/pith/JR5LZNSZHB6R6S5FGP6CVGOKBA/action/author_attestation","sign_citation":"https://pith.science/pith/JR5LZNSZHB6R6S5FGP6CVGOKBA/action/citation_signature","submit_replication":"https://pith.science/pith/JR5LZNSZHB6R6S5FGP6CVGOKBA/action/replication_record"}},"created_at":"2026-05-18T00:54:25.732486+00:00","updated_at":"2026-05-18T00:54:25.732486+00:00"}