{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:UIXWNT4SBZSBUCRUHBDHHZRZFU","short_pith_number":"pith:UIXWNT4S","schema_version":"1.0","canonical_sha256":"a22f66cf920e641a0a34384673e6392d2fc2ff933b65c833e9f2c467135a23b8","source":{"kind":"arxiv","id":"1703.03366","version":1},"attestation_state":"computed","paper":{"title":"Knowledge Acquisition: A Complex Networks Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Diego R. Amancio, Filipi N. Silva, Henrique F. de Arruda, Luciano da F. Costa","submitted_at":"2017-03-09T17:41:18Z","abstract_excerpt":"Complex networks have been found to provide a good representation of the structure of knowledge, as understood in terms of discoverable concepts and their relationships. In this context, the discovery process can be modeled as agents walking in a knowledge space. Recent studies proposed more realistic dynamics, including the possibility of agents being influenced by others with higher visibility or by their own memory. However, rather than dealing with these two concepts separately, as previously approached, in this study we propose a multi-agent random walk model for knowledge acquisition tha"},"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":"1703.03366","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-03-09T17:41:18Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"a6d60caf86c646ab1c8a39bd825b72a75eb622e91d713eef3873c1ee24925ab6","abstract_canon_sha256":"2e98239411858c613c0f52e01bac32a6b11d9d984c7dc2c8c511cbc2c1d67436"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:55.351009Z","signature_b64":"tjMYtRzpckeiIhIDCTAL49sy9TEEKBleWMeIV445b4OtH7WpYXwjQxML5oWS7parZ+Bi2vWE9/QabjT8dYVKAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a22f66cf920e641a0a34384673e6392d2fc2ff933b65c833e9f2c467135a23b8","last_reissued_at":"2026-05-18T00:35:55.350574Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:55.350574Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Knowledge Acquisition: A Complex Networks Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Diego R. Amancio, Filipi N. Silva, Henrique F. de Arruda, Luciano da F. Costa","submitted_at":"2017-03-09T17:41:18Z","abstract_excerpt":"Complex networks have been found to provide a good representation of the structure of knowledge, as understood in terms of discoverable concepts and their relationships. In this context, the discovery process can be modeled as agents walking in a knowledge space. Recent studies proposed more realistic dynamics, including the possibility of agents being influenced by others with higher visibility or by their own memory. However, rather than dealing with these two concepts separately, as previously approached, in this study we propose a multi-agent random walk model for knowledge acquisition tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.03366","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":"1703.03366","created_at":"2026-05-18T00:35:55.350622+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.03366v1","created_at":"2026-05-18T00:35:55.350622+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.03366","created_at":"2026-05-18T00:35:55.350622+00:00"},{"alias_kind":"pith_short_12","alias_value":"UIXWNT4SBZSB","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"UIXWNT4SBZSBUCRU","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"UIXWNT4S","created_at":"2026-05-18T12:31:46.661854+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/UIXWNT4SBZSBUCRUHBDHHZRZFU","json":"https://pith.science/pith/UIXWNT4SBZSBUCRUHBDHHZRZFU.json","graph_json":"https://pith.science/api/pith-number/UIXWNT4SBZSBUCRUHBDHHZRZFU/graph.json","events_json":"https://pith.science/api/pith-number/UIXWNT4SBZSBUCRUHBDHHZRZFU/events.json","paper":"https://pith.science/paper/UIXWNT4S"},"agent_actions":{"view_html":"https://pith.science/pith/UIXWNT4SBZSBUCRUHBDHHZRZFU","download_json":"https://pith.science/pith/UIXWNT4SBZSBUCRUHBDHHZRZFU.json","view_paper":"https://pith.science/paper/UIXWNT4S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.03366&json=true","fetch_graph":"https://pith.science/api/pith-number/UIXWNT4SBZSBUCRUHBDHHZRZFU/graph.json","fetch_events":"https://pith.science/api/pith-number/UIXWNT4SBZSBUCRUHBDHHZRZFU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UIXWNT4SBZSBUCRUHBDHHZRZFU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UIXWNT4SBZSBUCRUHBDHHZRZFU/action/storage_attestation","attest_author":"https://pith.science/pith/UIXWNT4SBZSBUCRUHBDHHZRZFU/action/author_attestation","sign_citation":"https://pith.science/pith/UIXWNT4SBZSBUCRUHBDHHZRZFU/action/citation_signature","submit_replication":"https://pith.science/pith/UIXWNT4SBZSBUCRUHBDHHZRZFU/action/replication_record"}},"created_at":"2026-05-18T00:35:55.350622+00:00","updated_at":"2026-05-18T00:35:55.350622+00:00"}