{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:BVSQAJR2SWZMR2G5YFQPU3FLA6","short_pith_number":"pith:BVSQAJR2","schema_version":"1.0","canonical_sha256":"0d6500263a95b2c8e8ddc160fa6cab07a230e1ef2756b8bf9dafe66f5d51cf4b","source":{"kind":"arxiv","id":"1806.08467","version":1},"attestation_state":"computed","paper":{"title":"Paragraph-based complex networks: application to document classification and authenticity verification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.CL","authors_text":"Diego R. Amancio, Henrique F. de Arruda, Luciano da F. Costa, Vanessa Q. Marinho","submitted_at":"2018-06-22T01:58:44Z","abstract_excerpt":"With the increasing number of texts made available on the Internet, many applications have relied on text mining tools to tackle a diversity of problems. A relevant model to represent texts is the so-called word adjacency (co-occurrence) representation, which is known to capture mainly syntactical features of texts.In this study, we introduce a novel network representation that considers the semantic similarity between paragraphs. Two main properties of paragraph networks are considered: (i) their ability to incorporate characteristics that can discriminate real from artificial, shuffled manus"},"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":"1806.08467","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-06-22T01:58:44Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"d83382eb70640b2f50151fa8221181dbcefe3a1081f9c8a463c5c2910d9356da","abstract_canon_sha256":"ba5cc132b292c31826d9f99707b1ebe063b0e8369525f3202ae72d8f70ce5e49"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:59.091071Z","signature_b64":"eXWFOETqf43DLGJhRPvCqLRdFnQGDtUKWUUxL6jKN8Rv6ME0epVg2Jc/zaPiP3bvby9omY4dTKDGnKLRVcKiAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d6500263a95b2c8e8ddc160fa6cab07a230e1ef2756b8bf9dafe66f5d51cf4b","last_reissued_at":"2026-05-17T23:52:59.090502Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:59.090502Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Paragraph-based complex networks: application to document classification and authenticity verification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.CL","authors_text":"Diego R. Amancio, Henrique F. de Arruda, Luciano da F. Costa, Vanessa Q. Marinho","submitted_at":"2018-06-22T01:58:44Z","abstract_excerpt":"With the increasing number of texts made available on the Internet, many applications have relied on text mining tools to tackle a diversity of problems. A relevant model to represent texts is the so-called word adjacency (co-occurrence) representation, which is known to capture mainly syntactical features of texts.In this study, we introduce a novel network representation that considers the semantic similarity between paragraphs. Two main properties of paragraph networks are considered: (i) their ability to incorporate characteristics that can discriminate real from artificial, shuffled manus"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.08467","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":"1806.08467","created_at":"2026-05-17T23:52:59.090585+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.08467v1","created_at":"2026-05-17T23:52:59.090585+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.08467","created_at":"2026-05-17T23:52:59.090585+00:00"},{"alias_kind":"pith_short_12","alias_value":"BVSQAJR2SWZM","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"BVSQAJR2SWZMR2G5","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"BVSQAJR2","created_at":"2026-05-18T12:32:16.446611+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BVSQAJR2SWZMR2G5YFQPU3FLA6","json":"https://pith.science/pith/BVSQAJR2SWZMR2G5YFQPU3FLA6.json","graph_json":"https://pith.science/api/pith-number/BVSQAJR2SWZMR2G5YFQPU3FLA6/graph.json","events_json":"https://pith.science/api/pith-number/BVSQAJR2SWZMR2G5YFQPU3FLA6/events.json","paper":"https://pith.science/paper/BVSQAJR2"},"agent_actions":{"view_html":"https://pith.science/pith/BVSQAJR2SWZMR2G5YFQPU3FLA6","download_json":"https://pith.science/pith/BVSQAJR2SWZMR2G5YFQPU3FLA6.json","view_paper":"https://pith.science/paper/BVSQAJR2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.08467&json=true","fetch_graph":"https://pith.science/api/pith-number/BVSQAJR2SWZMR2G5YFQPU3FLA6/graph.json","fetch_events":"https://pith.science/api/pith-number/BVSQAJR2SWZMR2G5YFQPU3FLA6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BVSQAJR2SWZMR2G5YFQPU3FLA6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BVSQAJR2SWZMR2G5YFQPU3FLA6/action/storage_attestation","attest_author":"https://pith.science/pith/BVSQAJR2SWZMR2G5YFQPU3FLA6/action/author_attestation","sign_citation":"https://pith.science/pith/BVSQAJR2SWZMR2G5YFQPU3FLA6/action/citation_signature","submit_replication":"https://pith.science/pith/BVSQAJR2SWZMR2G5YFQPU3FLA6/action/replication_record"}},"created_at":"2026-05-17T23:52:59.090585+00:00","updated_at":"2026-05-17T23:52:59.090585+00:00"}