{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:FS6SUGQRPUBLGG7N5QFT4BAI27","short_pith_number":"pith:FS6SUGQR","schema_version":"1.0","canonical_sha256":"2cbd2a1a117d02b31bedec0b3e0408d7cebc6c9f8c54a65053c06e72c2c04d3f","source":{"kind":"arxiv","id":"2212.01515","version":3},"attestation_state":"computed","paper":{"title":"Orders Are Unwanted: Dynamic Deep Graph Convolutional Network for Personality Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Jinghao Deng, Qifan Wang, Tao Yang, Xiaojun Quan","submitted_at":"2022-12-03T02:55:14Z","abstract_excerpt":"Predicting personality traits based on online posts has emerged as an important task in many fields such as social network analysis. One of the challenges of this task is assembling information from various posts into an overall profile for each user. While many previous solutions simply concatenate the posts into a long document and then encode the document by sequential or hierarchical models, they introduce unwarranted orders for the posts, which may mislead the models. In this paper, we propose a dynamic deep graph convolutional network (D-DGCN) to overcome the above limitation. Specifical"},"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":"2212.01515","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2022-12-03T02:55:14Z","cross_cats_sorted":[],"title_canon_sha256":"e87d95065730a6decab618202730a0309a309f4c4693957214eec1f91cd17bb2","abstract_canon_sha256":"ad1376a31a748d4ede86466db60c2e487eb6e703d18216c60928bccc4b9dd947"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:57:34.615804Z","signature_b64":"KdfWPKkcFZiJkyi5ulMikR68jstlB3OmovaJj72mbvbFi0WbR12VW5AX2RJlQO57kjbj/TkHU+7FMbu2CNCEAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2cbd2a1a117d02b31bedec0b3e0408d7cebc6c9f8c54a65053c06e72c2c04d3f","last_reissued_at":"2026-07-05T05:57:34.615305Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:57:34.615305Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Orders Are Unwanted: Dynamic Deep Graph Convolutional Network for Personality Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Jinghao Deng, Qifan Wang, Tao Yang, Xiaojun Quan","submitted_at":"2022-12-03T02:55:14Z","abstract_excerpt":"Predicting personality traits based on online posts has emerged as an important task in many fields such as social network analysis. One of the challenges of this task is assembling information from various posts into an overall profile for each user. While many previous solutions simply concatenate the posts into a long document and then encode the document by sequential or hierarchical models, they introduce unwarranted orders for the posts, which may mislead the models. In this paper, we propose a dynamic deep graph convolutional network (D-DGCN) to overcome the above limitation. Specifical"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.01515","kind":"arxiv","version":3},"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/2212.01515/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":"2212.01515","created_at":"2026-07-05T05:57:34.615375+00:00"},{"alias_kind":"arxiv_version","alias_value":"2212.01515v3","created_at":"2026-07-05T05:57:34.615375+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.01515","created_at":"2026-07-05T05:57:34.615375+00:00"},{"alias_kind":"pith_short_12","alias_value":"FS6SUGQRPUBL","created_at":"2026-07-05T05:57:34.615375+00:00"},{"alias_kind":"pith_short_16","alias_value":"FS6SUGQRPUBLGG7N","created_at":"2026-07-05T05:57:34.615375+00:00"},{"alias_kind":"pith_short_8","alias_value":"FS6SUGQR","created_at":"2026-07-05T05:57:34.615375+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.08374","citing_title":"Large-Language-Models-as-a-Judge in Theory-Agnostic Adaptive Metric-Alignment for Prototypical Networks in Personality Recognition","ref_index":61,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FS6SUGQRPUBLGG7N5QFT4BAI27","json":"https://pith.science/pith/FS6SUGQRPUBLGG7N5QFT4BAI27.json","graph_json":"https://pith.science/api/pith-number/FS6SUGQRPUBLGG7N5QFT4BAI27/graph.json","events_json":"https://pith.science/api/pith-number/FS6SUGQRPUBLGG7N5QFT4BAI27/events.json","paper":"https://pith.science/paper/FS6SUGQR"},"agent_actions":{"view_html":"https://pith.science/pith/FS6SUGQRPUBLGG7N5QFT4BAI27","download_json":"https://pith.science/pith/FS6SUGQRPUBLGG7N5QFT4BAI27.json","view_paper":"https://pith.science/paper/FS6SUGQR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2212.01515&json=true","fetch_graph":"https://pith.science/api/pith-number/FS6SUGQRPUBLGG7N5QFT4BAI27/graph.json","fetch_events":"https://pith.science/api/pith-number/FS6SUGQRPUBLGG7N5QFT4BAI27/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FS6SUGQRPUBLGG7N5QFT4BAI27/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FS6SUGQRPUBLGG7N5QFT4BAI27/action/storage_attestation","attest_author":"https://pith.science/pith/FS6SUGQRPUBLGG7N5QFT4BAI27/action/author_attestation","sign_citation":"https://pith.science/pith/FS6SUGQRPUBLGG7N5QFT4BAI27/action/citation_signature","submit_replication":"https://pith.science/pith/FS6SUGQRPUBLGG7N5QFT4BAI27/action/replication_record"}},"created_at":"2026-07-05T05:57:34.615375+00:00","updated_at":"2026-07-05T05:57:34.615375+00:00"}