{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:3JRNLA73MG3A6LKEJH7PGU2H7U","short_pith_number":"pith:3JRNLA73","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"},"canonical_sha256":"da62d583fb61b60f2d4449fef35347fd0cf89b7f708b6f560f8a37d7929ec3ae","source":{"kind":"arxiv","id":"1509.04733","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.04733","created_at":"2026-05-18T00:54:10Z"},{"alias_kind":"arxiv_version","alias_value":"1509.04733v3","created_at":"2026-05-18T00:54:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.04733","created_at":"2026-05-18T00:54:10Z"},{"alias_kind":"pith_short_12","alias_value":"3JRNLA73MG3A","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3JRNLA73MG3A6LKE","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3JRNLA73","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:3JRNLA73MG3A6LKEJH7PGU2H7U","target":"record","payload":{"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"},"canonical_sha256":"da62d583fb61b60f2d4449fef35347fd0cf89b7f708b6f560f8a37d7929ec3ae","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"},"source_kind":"arxiv","source_id":"1509.04733","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:54:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BpR7EgqJFycXnKwcUFMNpLUFqQ1lyWO+g/Y14Fl4pvW9SsLJECEEcKf/H22RzyxtjMDZw8JMIpCRN3MpGcaBDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T23:26:47.721725Z"},"content_sha256":"bc5e5a0128789bf2bb23e94dde32a72bb2403bb8fc812cea33c06ad8d45333ec","schema_version":"1.0","event_id":"sha256:bc5e5a0128789bf2bb23e94dde32a72bb2403bb8fc812cea33c06ad8d45333ec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:3JRNLA73MG3A6LKEJH7PGU2H7U","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:54:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S3dNeFWyu3QJnksr3zjAydDiK6vEQehX9ZCdfzJQD3zB1kwytZe/BGfXFbNXx1tyxsZe+raX1aV/L1czVuGsCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T23:26:47.722065Z"},"content_sha256":"ff475037ac9787664725838bfc4acc4267a14d0f50d588d027f494aa4b0f5c41","schema_version":"1.0","event_id":"sha256:ff475037ac9787664725838bfc4acc4267a14d0f50d588d027f494aa4b0f5c41"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3JRNLA73MG3A6LKEJH7PGU2H7U/bundle.json","state_url":"https://pith.science/pith/3JRNLA73MG3A6LKEJH7PGU2H7U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3JRNLA73MG3A6LKEJH7PGU2H7U/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-28T23:26:47Z","links":{"resolver":"https://pith.science/pith/3JRNLA73MG3A6LKEJH7PGU2H7U","bundle":"https://pith.science/pith/3JRNLA73MG3A6LKEJH7PGU2H7U/bundle.json","state":"https://pith.science/pith/3JRNLA73MG3A6LKEJH7PGU2H7U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3JRNLA73MG3A6LKEJH7PGU2H7U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:3JRNLA73MG3A6LKEJH7PGU2H7U","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"f32887d1ac11c6b5fee6eb91be70653a0ba7f3f7ed6b792dc75409ce557f5292","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-09-15T20:43:45Z","title_canon_sha256":"d00b5b66238c1d04089c05cc1b871612485e969c6d8041c2c042e956770fcd0a"},"schema_version":"1.0","source":{"id":"1509.04733","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.04733","created_at":"2026-05-18T00:54:10Z"},{"alias_kind":"arxiv_version","alias_value":"1509.04733v3","created_at":"2026-05-18T00:54:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.04733","created_at":"2026-05-18T00:54:10Z"},{"alias_kind":"pith_short_12","alias_value":"3JRNLA73MG3A","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3JRNLA73MG3A6LKE","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3JRNLA73","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:ff475037ac9787664725838bfc4acc4267a14d0f50d588d027f494aa4b0f5c41","target":"graph","created_at":"2026-05-18T00:54:10Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Akmal Artikov, Aleksandr Dorodnykh, Egor Samosvat, Yana Kashinskaya","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-09-15T20:43:45Z","title":"Factorization threshold models for scale-free networks generation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.04733","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:bc5e5a0128789bf2bb23e94dde32a72bb2403bb8fc812cea33c06ad8d45333ec","target":"record","created_at":"2026-05-18T00:54:10Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"f32887d1ac11c6b5fee6eb91be70653a0ba7f3f7ed6b792dc75409ce557f5292","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-09-15T20:43:45Z","title_canon_sha256":"d00b5b66238c1d04089c05cc1b871612485e969c6d8041c2c042e956770fcd0a"},"schema_version":"1.0","source":{"id":"1509.04733","kind":"arxiv","version":3}},"canonical_sha256":"da62d583fb61b60f2d4449fef35347fd0cf89b7f708b6f560f8a37d7929ec3ae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"da62d583fb61b60f2d4449fef35347fd0cf89b7f708b6f560f8a37d7929ec3ae","first_computed_at":"2026-05-18T00:54:10.949132Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:54:10.949132Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4f4FT9HpBeOA1jtLY3bM8zT6lWWqTKIwbgTCjXqi+2cDZOrNgNLyuUNsGgAaOk/sbXI90jdZRbdb/a7kInbbDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:54:10.949595Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.04733","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bc5e5a0128789bf2bb23e94dde32a72bb2403bb8fc812cea33c06ad8d45333ec","sha256:ff475037ac9787664725838bfc4acc4267a14d0f50d588d027f494aa4b0f5c41"],"state_sha256":"d8201b26ee16e1a8afb291bec4ac544299d0a4e47580dcec4e5979cb90211d83"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OM9Gop4WGVzswnKpHLSDZRU4p5v+E43BF/pcg8+vFdyAgRKtSSawOqRQgMvAD7tTz9mir9eCB1+JStqPcvcvAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T23:26:47.723891Z","bundle_sha256":"85c8adda4f58f7d153b88c111b28cc4ba9a911014e8264f4c044c7e08ee50965"}}