{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:DRVGD2HI7O77JJNCNVWZ2HRTBY","short_pith_number":"pith:DRVGD2HI","schema_version":"1.0","canonical_sha256":"1c6a61e8e8fbbff4a5a26d6d9d1e330e2dec3e731aed53a17885292c60f332da","source":{"kind":"arxiv","id":"2509.09388","version":1},"attestation_state":"computed","paper":{"title":"Hierarchical Bracketing Encodings Work for Dependency Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Ana Ezquerro, Carlos G\\'omez-Rodr\\'iguez, David Vilares","submitted_at":"2025-09-11T12:08:22Z","abstract_excerpt":"We revisit hierarchical bracketing encodings from a practical perspective in the context of dependency graph parsing. The approach encodes graphs as sequences, enabling linear-time parsing with $n$ tagging actions, and still representing reentrancies, cycles, and empty nodes. Compared to existing graph linearizations, this representation substantially reduces the label space while preserving structural information. We evaluate it on a multilingual and multi-formalism benchmark, showing competitive results and consistent improvements over other methods in exact match accuracy."},"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":"2509.09388","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-09-11T12:08:22Z","cross_cats_sorted":[],"title_canon_sha256":"e8a15b8476d0020f2c5fe18821b36b8d68b08477934848ec084507c40bbc8731","abstract_canon_sha256":"f29e71675cc76afde280533c612eb17339ba1201940b5f7c0e4b17e37569522e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:09:35.260345Z","signature_b64":"h6arUsJTorX4wUaJelh0kH42b6tn3HExIYuBJSTwNc1AsTVt+Uyv9T39QAyNZqLfnjPtH0LU5qHvpzWuEbulAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c6a61e8e8fbbff4a5a26d6d9d1e330e2dec3e731aed53a17885292c60f332da","last_reissued_at":"2026-07-05T12:09:35.259815Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:09:35.259815Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hierarchical Bracketing Encodings Work for Dependency Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Ana Ezquerro, Carlos G\\'omez-Rodr\\'iguez, David Vilares","submitted_at":"2025-09-11T12:08:22Z","abstract_excerpt":"We revisit hierarchical bracketing encodings from a practical perspective in the context of dependency graph parsing. The approach encodes graphs as sequences, enabling linear-time parsing with $n$ tagging actions, and still representing reentrancies, cycles, and empty nodes. Compared to existing graph linearizations, this representation substantially reduces the label space while preserving structural information. We evaluate it on a multilingual and multi-formalism benchmark, showing competitive results and consistent improvements over other methods in exact match accuracy."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.09388","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/2509.09388/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":"2509.09388","created_at":"2026-07-05T12:09:35.259875+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.09388v1","created_at":"2026-07-05T12:09:35.259875+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.09388","created_at":"2026-07-05T12:09:35.259875+00:00"},{"alias_kind":"pith_short_12","alias_value":"DRVGD2HI7O77","created_at":"2026-07-05T12:09:35.259875+00:00"},{"alias_kind":"pith_short_16","alias_value":"DRVGD2HI7O77JJNC","created_at":"2026-07-05T12:09:35.259875+00:00"},{"alias_kind":"pith_short_8","alias_value":"DRVGD2HI","created_at":"2026-07-05T12:09:35.259875+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/DRVGD2HI7O77JJNCNVWZ2HRTBY","json":"https://pith.science/pith/DRVGD2HI7O77JJNCNVWZ2HRTBY.json","graph_json":"https://pith.science/api/pith-number/DRVGD2HI7O77JJNCNVWZ2HRTBY/graph.json","events_json":"https://pith.science/api/pith-number/DRVGD2HI7O77JJNCNVWZ2HRTBY/events.json","paper":"https://pith.science/paper/DRVGD2HI"},"agent_actions":{"view_html":"https://pith.science/pith/DRVGD2HI7O77JJNCNVWZ2HRTBY","download_json":"https://pith.science/pith/DRVGD2HI7O77JJNCNVWZ2HRTBY.json","view_paper":"https://pith.science/paper/DRVGD2HI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.09388&json=true","fetch_graph":"https://pith.science/api/pith-number/DRVGD2HI7O77JJNCNVWZ2HRTBY/graph.json","fetch_events":"https://pith.science/api/pith-number/DRVGD2HI7O77JJNCNVWZ2HRTBY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DRVGD2HI7O77JJNCNVWZ2HRTBY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DRVGD2HI7O77JJNCNVWZ2HRTBY/action/storage_attestation","attest_author":"https://pith.science/pith/DRVGD2HI7O77JJNCNVWZ2HRTBY/action/author_attestation","sign_citation":"https://pith.science/pith/DRVGD2HI7O77JJNCNVWZ2HRTBY/action/citation_signature","submit_replication":"https://pith.science/pith/DRVGD2HI7O77JJNCNVWZ2HRTBY/action/replication_record"}},"created_at":"2026-07-05T12:09:35.259875+00:00","updated_at":"2026-07-05T12:09:35.259875+00:00"}