{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:QMOMHYU66CBKMQV5KQFFENOKQ7","short_pith_number":"pith:QMOMHYU6","canonical_record":{"source":{"id":"1904.03296","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-04-05T21:52:18Z","cross_cats_sorted":[],"title_canon_sha256":"d01927ec7386b2d7ee29ba961d48a9511caf5f590713badf7cd8fbd28c2d0ce8","abstract_canon_sha256":"c88aaefc497cd4c6a96bc41957c1fe29592cb5832f3b4562d774599cff67d12c"},"schema_version":"1.0"},"canonical_sha256":"831cc3e29ef082a642bd540a5235ca87cb86a55a0707ceafd9e35c3d1ff2b2a4","source":{"kind":"arxiv","id":"1904.03296","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.03296","created_at":"2026-05-17T23:49:13Z"},{"alias_kind":"arxiv_version","alias_value":"1904.03296v1","created_at":"2026-05-17T23:49:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.03296","created_at":"2026-05-17T23:49:13Z"},{"alias_kind":"pith_short_12","alias_value":"QMOMHYU66CBK","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"QMOMHYU66CBKMQV5","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"QMOMHYU6","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:QMOMHYU66CBKMQV5KQFFENOKQ7","target":"record","payload":{"canonical_record":{"source":{"id":"1904.03296","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-04-05T21:52:18Z","cross_cats_sorted":[],"title_canon_sha256":"d01927ec7386b2d7ee29ba961d48a9511caf5f590713badf7cd8fbd28c2d0ce8","abstract_canon_sha256":"c88aaefc497cd4c6a96bc41957c1fe29592cb5832f3b4562d774599cff67d12c"},"schema_version":"1.0"},"canonical_sha256":"831cc3e29ef082a642bd540a5235ca87cb86a55a0707ceafd9e35c3d1ff2b2a4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:13.928167Z","signature_b64":"0eOhaMmKeON0a5+L+ORI2UZ977+JEcUhYds3LYUcHiQq83+xxu2R/dCzNy5LtV9tESKnPaPIBJMeDi5XVVvhBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"831cc3e29ef082a642bd540a5235ca87cb86a55a0707ceafd9e35c3d1ff2b2a4","last_reissued_at":"2026-05-17T23:49:13.927516Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:13.927516Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.03296","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-17T23:49:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cjz4/TphGd668q8kLmMidY9I13ggda/WrRafxFIQcMZQKMfau2d0SnlQ/uq5t/li2yYs+cnpRz+71C+Eapr/Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T00:34:43.957662Z"},"content_sha256":"fa81af36d3b49d2cbec7c9bea698f26de0ad7c298a5439e659cd6d7ddcfdae6d","schema_version":"1.0","event_id":"sha256:fa81af36d3b49d2cbec7c9bea698f26de0ad7c298a5439e659cd6d7ddcfdae6d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:QMOMHYU66CBKMQV5KQFFENOKQ7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A General Framework for Information Extraction using Dynamic Span Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Amy Shah, Dave Wadden, Hannaneh Hajishirzi, Luheng He, Mari Ostendorf, Yi Luan","submitted_at":"2019-04-05T21:52:18Z","abstract_excerpt":"We introduce a general framework for several information extraction tasks that share span representations using dynamically constructed span graphs. The graphs are constructed by selecting the most confident entity spans and linking these nodes with confidence-weighted relation types and coreferences. The dynamic span graph allows coreference and relation type confidences to propagate through the graph to iteratively refine the span representations. This is unlike previous multi-task frameworks for information extraction in which the only interaction between tasks is in the shared first-layer "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.03296","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-17T23:49:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yXC5pHXVyc4K4HpJEDJJeI6yey6Az+USpPZnCIhtbhiLfwdeIQmzgRS6rq614XfhwkBtNMU+r/BQsUm5qW9lAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T00:34:43.958364Z"},"content_sha256":"b3157c13343937726a65679b47b6690f3d9a78be20e2d47b83fb3e403f250591","schema_version":"1.0","event_id":"sha256:b3157c13343937726a65679b47b6690f3d9a78be20e2d47b83fb3e403f250591"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QMOMHYU66CBKMQV5KQFFENOKQ7/bundle.json","state_url":"https://pith.science/pith/QMOMHYU66CBKMQV5KQFFENOKQ7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QMOMHYU66CBKMQV5KQFFENOKQ7/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-05T00:34:43Z","links":{"resolver":"https://pith.science/pith/QMOMHYU66CBKMQV5KQFFENOKQ7","bundle":"https://pith.science/pith/QMOMHYU66CBKMQV5KQFFENOKQ7/bundle.json","state":"https://pith.science/pith/QMOMHYU66CBKMQV5KQFFENOKQ7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QMOMHYU66CBKMQV5KQFFENOKQ7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:QMOMHYU66CBKMQV5KQFFENOKQ7","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":"c88aaefc497cd4c6a96bc41957c1fe29592cb5832f3b4562d774599cff67d12c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-04-05T21:52:18Z","title_canon_sha256":"d01927ec7386b2d7ee29ba961d48a9511caf5f590713badf7cd8fbd28c2d0ce8"},"schema_version":"1.0","source":{"id":"1904.03296","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.03296","created_at":"2026-05-17T23:49:13Z"},{"alias_kind":"arxiv_version","alias_value":"1904.03296v1","created_at":"2026-05-17T23:49:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.03296","created_at":"2026-05-17T23:49:13Z"},{"alias_kind":"pith_short_12","alias_value":"QMOMHYU66CBK","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"QMOMHYU66CBKMQV5","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"QMOMHYU6","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:b3157c13343937726a65679b47b6690f3d9a78be20e2d47b83fb3e403f250591","target":"graph","created_at":"2026-05-17T23:49:13Z","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":"We introduce a general framework for several information extraction tasks that share span representations using dynamically constructed span graphs. The graphs are constructed by selecting the most confident entity spans and linking these nodes with confidence-weighted relation types and coreferences. The dynamic span graph allows coreference and relation type confidences to propagate through the graph to iteratively refine the span representations. This is unlike previous multi-task frameworks for information extraction in which the only interaction between tasks is in the shared first-layer ","authors_text":"Amy Shah, Dave Wadden, Hannaneh Hajishirzi, Luheng He, Mari Ostendorf, Yi Luan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-04-05T21:52:18Z","title":"A General Framework for Information Extraction using Dynamic Span Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.03296","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:fa81af36d3b49d2cbec7c9bea698f26de0ad7c298a5439e659cd6d7ddcfdae6d","target":"record","created_at":"2026-05-17T23:49:13Z","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":"c88aaefc497cd4c6a96bc41957c1fe29592cb5832f3b4562d774599cff67d12c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-04-05T21:52:18Z","title_canon_sha256":"d01927ec7386b2d7ee29ba961d48a9511caf5f590713badf7cd8fbd28c2d0ce8"},"schema_version":"1.0","source":{"id":"1904.03296","kind":"arxiv","version":1}},"canonical_sha256":"831cc3e29ef082a642bd540a5235ca87cb86a55a0707ceafd9e35c3d1ff2b2a4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"831cc3e29ef082a642bd540a5235ca87cb86a55a0707ceafd9e35c3d1ff2b2a4","first_computed_at":"2026-05-17T23:49:13.927516Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:13.927516Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0eOhaMmKeON0a5+L+ORI2UZ977+JEcUhYds3LYUcHiQq83+xxu2R/dCzNy5LtV9tESKnPaPIBJMeDi5XVVvhBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:13.928167Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.03296","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fa81af36d3b49d2cbec7c9bea698f26de0ad7c298a5439e659cd6d7ddcfdae6d","sha256:b3157c13343937726a65679b47b6690f3d9a78be20e2d47b83fb3e403f250591"],"state_sha256":"20ffd225db2d131992a301ac202f3f3469ab05fe077cebcd25d60e3b654dee66"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T5ONTOSqnTfChLpmLuKqaMTZrgEJ7uuaGTxm6UsCuH2cTrZcT/NICklMoGyKA0Vf9YAgVzsG/Af/8M5O8X7gBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T00:34:43.961761Z","bundle_sha256":"3f245eed7c4a59bc0638bb43a2319bde39f1eb88dfe5470a47efb0726ffcd3c6"}}