{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:QXBDBFSHIBN6BQW7W6K37XXMPD","short_pith_number":"pith:QXBDBFSH","canonical_record":{"source":{"id":"1705.00403","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-05-01T02:39:00Z","cross_cats_sorted":[],"title_canon_sha256":"dd44306950413bf8e491b19ba47864e8a1585126558580f1c0af6ed54c0c2d33","abstract_canon_sha256":"1d25f6389d5cf30b1f2ca7d6e87257559c6295f221b216a17015c0ca0cd29445"},"schema_version":"1.0"},"canonical_sha256":"85c2309647405be0c2dfb795bfdeec78d380ca04bcbdfc6944fd987033d8bbdb","source":{"kind":"arxiv","id":"1705.00403","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.00403","created_at":"2026-05-18T00:39:46Z"},{"alias_kind":"arxiv_version","alias_value":"1705.00403v2","created_at":"2026-05-18T00:39:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.00403","created_at":"2026-05-18T00:39:46Z"},{"alias_kind":"pith_short_12","alias_value":"QXBDBFSHIBN6","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QXBDBFSHIBN6BQW7","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QXBDBFSH","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:QXBDBFSHIBN6BQW7W6K37XXMPD","target":"record","payload":{"canonical_record":{"source":{"id":"1705.00403","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-05-01T02:39:00Z","cross_cats_sorted":[],"title_canon_sha256":"dd44306950413bf8e491b19ba47864e8a1585126558580f1c0af6ed54c0c2d33","abstract_canon_sha256":"1d25f6389d5cf30b1f2ca7d6e87257559c6295f221b216a17015c0ca0cd29445"},"schema_version":"1.0"},"canonical_sha256":"85c2309647405be0c2dfb795bfdeec78d380ca04bcbdfc6944fd987033d8bbdb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:46.226215Z","signature_b64":"TBGjUanUJ/iEUMu9JNbv6cm9U6WEKJpZwvUK8Squj/5BKoW+/MgvOWijbJz8tpwiOsA86zyF2+VnK+N9D2TPDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85c2309647405be0c2dfb795bfdeec78d380ca04bcbdfc6944fd987033d8bbdb","last_reissued_at":"2026-05-18T00:39:46.225532Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:46.225532Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.00403","source_version":2,"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-05-18T00:39:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vhDeOyLJmTHRUJAoom3DM7Y2g1ROK2dMsXRd4wJNpciQ3u/rbmobqTao/kLR2Oe4ysLRkASGaFkfIv0Si4ekAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:44:59.114631Z"},"content_sha256":"eb8b369d3c05f3867f85332dd094df3c62b66069c040d1b66bbbb75e0be32686","schema_version":"1.0","event_id":"sha256:eb8b369d3c05f3867f85332dd094df3c62b66069c040d1b66bbbb75e0be32686"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:QXBDBFSHIBN6BQW7W6K37XXMPD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dependency Parsing with Dilated Iterated Graph CNNs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Andrew McCallum, Emma Strubell","submitted_at":"2017-05-01T02:39:00Z","abstract_excerpt":"Dependency parses are an effective way to inject linguistic knowledge into many downstream tasks, and many practitioners wish to efficiently parse sentences at scale. Recent advances in GPU hardware have enabled neural networks to achieve significant gains over the previous best models, these models still fail to leverage GPUs' capability for massive parallelism due to their requirement of sequential processing of the sentence. In response, we propose Dilated Iterated Graph Convolutional Neural Networks (DIG-CNNs) for graph-based dependency parsing, a graph convolutional architecture that allo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.00403","kind":"arxiv","version":2},"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"},"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-05-18T00:39:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iUZ5YsZ1ghGIhrPuvkzrIpBjWuxMcJ6YEzLP9zp0Zabba9kPnMczxMRpth0jcKQhOn/Lnbt7ViPJcRKGIu7LDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:44:59.115003Z"},"content_sha256":"41ec82f094327548a6e8dd4e632e86da58d1dbb56a92ae99438bf7d041c27d8a","schema_version":"1.0","event_id":"sha256:41ec82f094327548a6e8dd4e632e86da58d1dbb56a92ae99438bf7d041c27d8a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QXBDBFSHIBN6BQW7W6K37XXMPD/bundle.json","state_url":"https://pith.science/pith/QXBDBFSHIBN6BQW7W6K37XXMPD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QXBDBFSHIBN6BQW7W6K37XXMPD/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-05-27T22:44:59Z","links":{"resolver":"https://pith.science/pith/QXBDBFSHIBN6BQW7W6K37XXMPD","bundle":"https://pith.science/pith/QXBDBFSHIBN6BQW7W6K37XXMPD/bundle.json","state":"https://pith.science/pith/QXBDBFSHIBN6BQW7W6K37XXMPD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QXBDBFSHIBN6BQW7W6K37XXMPD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:QXBDBFSHIBN6BQW7W6K37XXMPD","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":"1d25f6389d5cf30b1f2ca7d6e87257559c6295f221b216a17015c0ca0cd29445","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-05-01T02:39:00Z","title_canon_sha256":"dd44306950413bf8e491b19ba47864e8a1585126558580f1c0af6ed54c0c2d33"},"schema_version":"1.0","source":{"id":"1705.00403","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.00403","created_at":"2026-05-18T00:39:46Z"},{"alias_kind":"arxiv_version","alias_value":"1705.00403v2","created_at":"2026-05-18T00:39:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.00403","created_at":"2026-05-18T00:39:46Z"},{"alias_kind":"pith_short_12","alias_value":"QXBDBFSHIBN6","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QXBDBFSHIBN6BQW7","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QXBDBFSH","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:41ec82f094327548a6e8dd4e632e86da58d1dbb56a92ae99438bf7d041c27d8a","target":"graph","created_at":"2026-05-18T00:39:46Z","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"},"paper":{"abstract_excerpt":"Dependency parses are an effective way to inject linguistic knowledge into many downstream tasks, and many practitioners wish to efficiently parse sentences at scale. Recent advances in GPU hardware have enabled neural networks to achieve significant gains over the previous best models, these models still fail to leverage GPUs' capability for massive parallelism due to their requirement of sequential processing of the sentence. In response, we propose Dilated Iterated Graph Convolutional Neural Networks (DIG-CNNs) for graph-based dependency parsing, a graph convolutional architecture that allo","authors_text":"Andrew McCallum, Emma Strubell","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-05-01T02:39:00Z","title":"Dependency Parsing with Dilated Iterated Graph CNNs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.00403","kind":"arxiv","version":2},"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:eb8b369d3c05f3867f85332dd094df3c62b66069c040d1b66bbbb75e0be32686","target":"record","created_at":"2026-05-18T00:39:46Z","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":"1d25f6389d5cf30b1f2ca7d6e87257559c6295f221b216a17015c0ca0cd29445","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-05-01T02:39:00Z","title_canon_sha256":"dd44306950413bf8e491b19ba47864e8a1585126558580f1c0af6ed54c0c2d33"},"schema_version":"1.0","source":{"id":"1705.00403","kind":"arxiv","version":2}},"canonical_sha256":"85c2309647405be0c2dfb795bfdeec78d380ca04bcbdfc6944fd987033d8bbdb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"85c2309647405be0c2dfb795bfdeec78d380ca04bcbdfc6944fd987033d8bbdb","first_computed_at":"2026-05-18T00:39:46.225532Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:46.225532Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TBGjUanUJ/iEUMu9JNbv6cm9U6WEKJpZwvUK8Squj/5BKoW+/MgvOWijbJz8tpwiOsA86zyF2+VnK+N9D2TPDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:46.226215Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.00403","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eb8b369d3c05f3867f85332dd094df3c62b66069c040d1b66bbbb75e0be32686","sha256:41ec82f094327548a6e8dd4e632e86da58d1dbb56a92ae99438bf7d041c27d8a"],"state_sha256":"bdde653cf8dab76382b23fabeb34ba7b16e8f027d9d579d917df90251e5c877e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n7uQ4fQiCDyISqJU6Q9R0clgpda45cEN8Xpra+bxellwK9DNTajZZKNZhqWpD1F1vXz9ApNHbWuUpMlXOQUQDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T22:44:59.117074Z","bundle_sha256":"0abea89a95190d835bd54819214e6bd5280c048d607a31f288e3e49e4e9a19c6"}}