{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:BYUT54PDEGZODTSON6P4S7IZVA","short_pith_number":"pith:BYUT54PD","schema_version":"1.0","canonical_sha256":"0e293ef1e321b2e1ce4e6f9fc97d19a82ca47367640c3d2ec88378195e170ced","source":{"kind":"arxiv","id":"1803.09189","version":1},"attestation_state":"computed","paper":{"title":"Scene Graph Parsing as Dependency Parsing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.CL","authors_text":"Alan Yuille, Chenxi Liu, Xiaohui Zeng, Yu-Siang Wang","submitted_at":"2018-03-25T01:53:29Z","abstract_excerpt":"In this paper, we study the problem of parsing structured knowledge graphs from textual descriptions. In particular, we consider the scene graph representation that considers objects together with their attributes and relations: this representation has been proved useful across a variety of vision and language applications. We begin by introducing an alternative but equivalent edge-centric view of scene graphs that connect to dependency parses. Together with a careful redesign of label and action space, we combine the two-stage pipeline used in prior work (generic dependency parsing followed b"},"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":"1803.09189","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-03-25T01:53:29Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"58f48e855a5a415bc0d4f7eb0eb3eb7d6a8d6fb658361cdb201b1986544a6644","abstract_canon_sha256":"3ae161da25a5be703a4155c2c6324010f6ff7b1e95e48632e7f695817887a021"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:12.339528Z","signature_b64":"pjmUGdNRlJTSBiOjzEK3OSj1+2g7SMxn3aF5ZIMlH+xDdh7v06n6V5eN/6kB+zj+zEd9RiUcHDspKvB9C7kOBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e293ef1e321b2e1ce4e6f9fc97d19a82ca47367640c3d2ec88378195e170ced","last_reissued_at":"2026-05-18T00:20:12.338937Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:12.338937Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scene Graph Parsing as Dependency Parsing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.CL","authors_text":"Alan Yuille, Chenxi Liu, Xiaohui Zeng, Yu-Siang Wang","submitted_at":"2018-03-25T01:53:29Z","abstract_excerpt":"In this paper, we study the problem of parsing structured knowledge graphs from textual descriptions. In particular, we consider the scene graph representation that considers objects together with their attributes and relations: this representation has been proved useful across a variety of vision and language applications. We begin by introducing an alternative but equivalent edge-centric view of scene graphs that connect to dependency parses. Together with a careful redesign of label and action space, we combine the two-stage pipeline used in prior work (generic dependency parsing followed b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.09189","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":"1803.09189","created_at":"2026-05-18T00:20:12.339016+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.09189v1","created_at":"2026-05-18T00:20:12.339016+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.09189","created_at":"2026-05-18T00:20:12.339016+00:00"},{"alias_kind":"pith_short_12","alias_value":"BYUT54PDEGZO","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"BYUT54PDEGZODTSO","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"BYUT54PD","created_at":"2026-05-18T12:32:16.446611+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.17118","citing_title":"Differentiable Optimization Layers for Guaranteed Fairness in Deep Learning","ref_index":38,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BYUT54PDEGZODTSON6P4S7IZVA","json":"https://pith.science/pith/BYUT54PDEGZODTSON6P4S7IZVA.json","graph_json":"https://pith.science/api/pith-number/BYUT54PDEGZODTSON6P4S7IZVA/graph.json","events_json":"https://pith.science/api/pith-number/BYUT54PDEGZODTSON6P4S7IZVA/events.json","paper":"https://pith.science/paper/BYUT54PD"},"agent_actions":{"view_html":"https://pith.science/pith/BYUT54PDEGZODTSON6P4S7IZVA","download_json":"https://pith.science/pith/BYUT54PDEGZODTSON6P4S7IZVA.json","view_paper":"https://pith.science/paper/BYUT54PD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.09189&json=true","fetch_graph":"https://pith.science/api/pith-number/BYUT54PDEGZODTSON6P4S7IZVA/graph.json","fetch_events":"https://pith.science/api/pith-number/BYUT54PDEGZODTSON6P4S7IZVA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BYUT54PDEGZODTSON6P4S7IZVA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BYUT54PDEGZODTSON6P4S7IZVA/action/storage_attestation","attest_author":"https://pith.science/pith/BYUT54PDEGZODTSON6P4S7IZVA/action/author_attestation","sign_citation":"https://pith.science/pith/BYUT54PDEGZODTSON6P4S7IZVA/action/citation_signature","submit_replication":"https://pith.science/pith/BYUT54PDEGZODTSON6P4S7IZVA/action/replication_record"}},"created_at":"2026-05-18T00:20:12.339016+00:00","updated_at":"2026-05-18T00:20:12.339016+00:00"}