{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:HNSIBNQ6SWWWZ5BHEP7V5JDHZN","short_pith_number":"pith:HNSIBNQ6","canonical_record":{"source":{"id":"1703.00782","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-03-02T13:49:23Z","cross_cats_sorted":[],"title_canon_sha256":"9275e94105642319371ebed00df1cea1058b80f1c940496afb20b46a8651ed30","abstract_canon_sha256":"234b4e36934b4579522837bda8a7507cb1fdb3fbce5a4d4f73b8d05bea88e4e3"},"schema_version":"1.0"},"canonical_sha256":"3b6480b61e95ad6cf42723ff5ea467cb415cdc9821540087f8eef78a396faec9","source":{"kind":"arxiv","id":"1703.00782","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.00782","created_at":"2026-05-18T00:49:40Z"},{"alias_kind":"arxiv_version","alias_value":"1703.00782v1","created_at":"2026-05-18T00:49:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.00782","created_at":"2026-05-18T00:49:40Z"},{"alias_kind":"pith_short_12","alias_value":"HNSIBNQ6SWWW","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HNSIBNQ6SWWWZ5BH","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HNSIBNQ6","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:HNSIBNQ6SWWWZ5BHEP7V5JDHZN","target":"record","payload":{"canonical_record":{"source":{"id":"1703.00782","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-03-02T13:49:23Z","cross_cats_sorted":[],"title_canon_sha256":"9275e94105642319371ebed00df1cea1058b80f1c940496afb20b46a8651ed30","abstract_canon_sha256":"234b4e36934b4579522837bda8a7507cb1fdb3fbce5a4d4f73b8d05bea88e4e3"},"schema_version":"1.0"},"canonical_sha256":"3b6480b61e95ad6cf42723ff5ea467cb415cdc9821540087f8eef78a396faec9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:40.778807Z","signature_b64":"8NhtkxXWS3Z+4TCemS1r3B2Vlq9O+6ZusyXR5gUu90d95q0oXBwhA1OM0BIDYqt/Kj7J/wQ9E54vIKRhozTDBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b6480b61e95ad6cf42723ff5ea467cb415cdc9821540087f8eef78a396faec9","last_reissued_at":"2026-05-18T00:49:40.778168Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:40.778168Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.00782","source_version":1,"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:49:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TzKYh9+S7m+Ajl42C8QCktJpr3BUL+BT5NwoS51vVn1dAyLkmMe8M73PTRhTPtozyvZp2dRUdKelFjIKCGeNAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T16:53:44.292348Z"},"content_sha256":"a83059b22c4bcb494dc77222c6eaf1a719fdc6b369606bc83951eb8934003ade","schema_version":"1.0","event_id":"sha256:a83059b22c4bcb494dc77222c6eaf1a719fdc6b369606bc83951eb8934003ade"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:HNSIBNQ6SWWWZ5BHEP7V5JDHZN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lock-Free Parallel Perceptron for Graph-based Dependency Parsing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Shuming Ma, Xu Sun","submitted_at":"2017-03-02T13:49:23Z","abstract_excerpt":"Dependency parsing is an important NLP task. A popular approach for dependency parsing is structured perceptron. Still, graph-based dependency parsing has the time complexity of $O(n^3)$, and it suffers from slow training. To deal with this problem, we propose a parallel algorithm called parallel perceptron. The parallel algorithm can make full use of a multi-core computer which saves a lot of training time. Based on experiments we observe that dependency parsing with parallel perceptron can achieve 8-fold faster training speed than traditional structured perceptron methods when using 10 threa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.00782","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"},"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:49:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fuIjGqwcAnp+xpqrsapoDr2uTBcqpiziHodlfF1SdRhYa/QKSJ4YfBHUhemaZKGX7OZgNuZwji+VkmfkYZRbCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T16:53:44.292702Z"},"content_sha256":"d6834dc4bc1eca549f18c0b731483f115972dd8ced00835f5e9af872d48dd10b","schema_version":"1.0","event_id":"sha256:d6834dc4bc1eca549f18c0b731483f115972dd8ced00835f5e9af872d48dd10b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HNSIBNQ6SWWWZ5BHEP7V5JDHZN/bundle.json","state_url":"https://pith.science/pith/HNSIBNQ6SWWWZ5BHEP7V5JDHZN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HNSIBNQ6SWWWZ5BHEP7V5JDHZN/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-06-02T16:53:44Z","links":{"resolver":"https://pith.science/pith/HNSIBNQ6SWWWZ5BHEP7V5JDHZN","bundle":"https://pith.science/pith/HNSIBNQ6SWWWZ5BHEP7V5JDHZN/bundle.json","state":"https://pith.science/pith/HNSIBNQ6SWWWZ5BHEP7V5JDHZN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HNSIBNQ6SWWWZ5BHEP7V5JDHZN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:HNSIBNQ6SWWWZ5BHEP7V5JDHZN","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":"234b4e36934b4579522837bda8a7507cb1fdb3fbce5a4d4f73b8d05bea88e4e3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-03-02T13:49:23Z","title_canon_sha256":"9275e94105642319371ebed00df1cea1058b80f1c940496afb20b46a8651ed30"},"schema_version":"1.0","source":{"id":"1703.00782","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.00782","created_at":"2026-05-18T00:49:40Z"},{"alias_kind":"arxiv_version","alias_value":"1703.00782v1","created_at":"2026-05-18T00:49:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.00782","created_at":"2026-05-18T00:49:40Z"},{"alias_kind":"pith_short_12","alias_value":"HNSIBNQ6SWWW","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HNSIBNQ6SWWWZ5BH","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HNSIBNQ6","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:d6834dc4bc1eca549f18c0b731483f115972dd8ced00835f5e9af872d48dd10b","target":"graph","created_at":"2026-05-18T00:49:40Z","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 parsing is an important NLP task. A popular approach for dependency parsing is structured perceptron. Still, graph-based dependency parsing has the time complexity of $O(n^3)$, and it suffers from slow training. To deal with this problem, we propose a parallel algorithm called parallel perceptron. The parallel algorithm can make full use of a multi-core computer which saves a lot of training time. Based on experiments we observe that dependency parsing with parallel perceptron can achieve 8-fold faster training speed than traditional structured perceptron methods when using 10 threa","authors_text":"Shuming Ma, Xu Sun","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-03-02T13:49:23Z","title":"Lock-Free Parallel Perceptron for Graph-based Dependency Parsing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.00782","kind":"arxiv","version":1},"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:a83059b22c4bcb494dc77222c6eaf1a719fdc6b369606bc83951eb8934003ade","target":"record","created_at":"2026-05-18T00:49:40Z","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":"234b4e36934b4579522837bda8a7507cb1fdb3fbce5a4d4f73b8d05bea88e4e3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-03-02T13:49:23Z","title_canon_sha256":"9275e94105642319371ebed00df1cea1058b80f1c940496afb20b46a8651ed30"},"schema_version":"1.0","source":{"id":"1703.00782","kind":"arxiv","version":1}},"canonical_sha256":"3b6480b61e95ad6cf42723ff5ea467cb415cdc9821540087f8eef78a396faec9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3b6480b61e95ad6cf42723ff5ea467cb415cdc9821540087f8eef78a396faec9","first_computed_at":"2026-05-18T00:49:40.778168Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:40.778168Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8NhtkxXWS3Z+4TCemS1r3B2Vlq9O+6ZusyXR5gUu90d95q0oXBwhA1OM0BIDYqt/Kj7J/wQ9E54vIKRhozTDBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:40.778807Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.00782","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a83059b22c4bcb494dc77222c6eaf1a719fdc6b369606bc83951eb8934003ade","sha256:d6834dc4bc1eca549f18c0b731483f115972dd8ced00835f5e9af872d48dd10b"],"state_sha256":"3964b22284222253ca395db3a504ff708cb2b143bb418e7ebda44f07dd0f6209"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fmQFcpF27P0mNuJFO1HbDMXd6dnTPdUz0cloLVPRQoh/By85GK7BM6Lt2c7vUgWF9ODILv2CnPwPpRhD1AsdBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T16:53:44.294577Z","bundle_sha256":"c450c979d928b959e9ab1a3bef5e984f9088b2f45e7a98d83fc90100e7bc89f3"}}