{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:3JRNLA73MG3A6LKEJH7PGU2H7U","short_pith_number":"pith:3JRNLA73","schema_version":"1.0","canonical_sha256":"da62d583fb61b60f2d4449fef35347fd0cf89b7f708b6f560f8a37d7929ec3ae","source":{"kind":"arxiv","id":"1509.04733","version":3},"attestation_state":"computed","paper":{"title":"Factorization threshold models for scale-free networks generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Akmal Artikov, Aleksandr Dorodnykh, Egor Samosvat, Yana Kashinskaya","submitted_at":"2015-09-15T20:43:45Z","abstract_excerpt":"Many real networks such as the World Wide Web, financial, biological, citation and social networks have a power-law degree distribution. Networks with this feature are also called scale-free. Several models for producing scale-free networks have been obtained by now and most of them are based on the preferential attachment approach. We will offer the model with another scale-free property explanation. The main idea is to approximate the network's adjacency matrix by multiplication of the matrices $V$ and $V^T$, where $V$ is the matrix of vertices' latent features. This approach is called matri"},"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":"1509.04733","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-09-15T20:43:45Z","cross_cats_sorted":[],"title_canon_sha256":"d00b5b66238c1d04089c05cc1b871612485e969c6d8041c2c042e956770fcd0a","abstract_canon_sha256":"f32887d1ac11c6b5fee6eb91be70653a0ba7f3f7ed6b792dc75409ce557f5292"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:10.949595Z","signature_b64":"4f4FT9HpBeOA1jtLY3bM8zT6lWWqTKIwbgTCjXqi+2cDZOrNgNLyuUNsGgAaOk/sbXI90jdZRbdb/a7kInbbDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da62d583fb61b60f2d4449fef35347fd0cf89b7f708b6f560f8a37d7929ec3ae","last_reissued_at":"2026-05-18T00:54:10.949132Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:10.949132Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Factorization threshold models for scale-free networks generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Akmal Artikov, Aleksandr Dorodnykh, Egor Samosvat, Yana Kashinskaya","submitted_at":"2015-09-15T20:43:45Z","abstract_excerpt":"Many real networks such as the World Wide Web, financial, biological, citation and social networks have a power-law degree distribution. Networks with this feature are also called scale-free. Several models for producing scale-free networks have been obtained by now and most of them are based on the preferential attachment approach. We will offer the model with another scale-free property explanation. The main idea is to approximate the network's adjacency matrix by multiplication of the matrices $V$ and $V^T$, where $V$ is the matrix of vertices' latent features. This approach is called matri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.04733","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":""},"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":"1509.04733","created_at":"2026-05-18T00:54:10.949206+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.04733v3","created_at":"2026-05-18T00:54:10.949206+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.04733","created_at":"2026-05-18T00:54:10.949206+00:00"},{"alias_kind":"pith_short_12","alias_value":"3JRNLA73MG3A","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"3JRNLA73MG3A6LKE","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"3JRNLA73","created_at":"2026-05-18T12:29:02.477457+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/3JRNLA73MG3A6LKEJH7PGU2H7U","json":"https://pith.science/pith/3JRNLA73MG3A6LKEJH7PGU2H7U.json","graph_json":"https://pith.science/api/pith-number/3JRNLA73MG3A6LKEJH7PGU2H7U/graph.json","events_json":"https://pith.science/api/pith-number/3JRNLA73MG3A6LKEJH7PGU2H7U/events.json","paper":"https://pith.science/paper/3JRNLA73"},"agent_actions":{"view_html":"https://pith.science/pith/3JRNLA73MG3A6LKEJH7PGU2H7U","download_json":"https://pith.science/pith/3JRNLA73MG3A6LKEJH7PGU2H7U.json","view_paper":"https://pith.science/paper/3JRNLA73","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.04733&json=true","fetch_graph":"https://pith.science/api/pith-number/3JRNLA73MG3A6LKEJH7PGU2H7U/graph.json","fetch_events":"https://pith.science/api/pith-number/3JRNLA73MG3A6LKEJH7PGU2H7U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3JRNLA73MG3A6LKEJH7PGU2H7U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3JRNLA73MG3A6LKEJH7PGU2H7U/action/storage_attestation","attest_author":"https://pith.science/pith/3JRNLA73MG3A6LKEJH7PGU2H7U/action/author_attestation","sign_citation":"https://pith.science/pith/3JRNLA73MG3A6LKEJH7PGU2H7U/action/citation_signature","submit_replication":"https://pith.science/pith/3JRNLA73MG3A6LKEJH7PGU2H7U/action/replication_record"}},"created_at":"2026-05-18T00:54:10.949206+00:00","updated_at":"2026-05-18T00:54:10.949206+00:00"}