{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:BWPKNGJT4TN6GR5HEHTQO7ZREF","short_pith_number":"pith:BWPKNGJT","schema_version":"1.0","canonical_sha256":"0d9ea69933e4dbe347a721e7077f312162c31b1a1389346ff95774eedc5554f3","source":{"kind":"arxiv","id":"1210.1300","version":1},"attestation_state":"computed","paper":{"title":"Properties of Stochastic Kronecker Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.SI","authors_text":"Ahmed Mehedi Nizam, Md. Nasim Adnan, Md. Rashedul Islam, Mohammad Akbar Kabir","submitted_at":"2012-10-04T05:36:15Z","abstract_excerpt":"The stochastic Kronecker Graph model can generate large random graph that closely resembles many real world networks. For example, the output graph has a heavy-tailed degree distribution, has a (low) diameter that effectively remains constant over time and obeys the so-called densification power law [1]. Aside from this list of very important graph properties, one may ask for some additional information about the output graph: What will be the expected number of isolated vertices? How many edges, self loops are there in the graph? What will be the expected number of triangles in a random reali"},"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":"1210.1300","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2012-10-04T05:36:15Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"be884732fd5d717be236be048d88fee8883e8ea87bc4e90e22b1dd7e03d643c8","abstract_canon_sha256":"2646d3e88f2511daa072d9762785a94f86990a35e7cc58edb9c111216656df71"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:44:03.996767Z","signature_b64":"nqLPGSsK24N+W9/WvKjKkLHsxTdHJ+g9oNcsbiLRGBSPTed2J+sEkOEi7lkyHi843lBplMoEVefKAb6Y+TY0Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d9ea69933e4dbe347a721e7077f312162c31b1a1389346ff95774eedc5554f3","last_reissued_at":"2026-05-18T03:44:03.995901Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:44:03.995901Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Properties of Stochastic Kronecker Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.SI","authors_text":"Ahmed Mehedi Nizam, Md. Nasim Adnan, Md. Rashedul Islam, Mohammad Akbar Kabir","submitted_at":"2012-10-04T05:36:15Z","abstract_excerpt":"The stochastic Kronecker Graph model can generate large random graph that closely resembles many real world networks. For example, the output graph has a heavy-tailed degree distribution, has a (low) diameter that effectively remains constant over time and obeys the so-called densification power law [1]. Aside from this list of very important graph properties, one may ask for some additional information about the output graph: What will be the expected number of isolated vertices? How many edges, self loops are there in the graph? What will be the expected number of triangles in a random reali"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.1300","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":"1210.1300","created_at":"2026-05-18T03:44:03.996055+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.1300v1","created_at":"2026-05-18T03:44:03.996055+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.1300","created_at":"2026-05-18T03:44:03.996055+00:00"},{"alias_kind":"pith_short_12","alias_value":"BWPKNGJT4TN6","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"BWPKNGJT4TN6GR5H","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"BWPKNGJT","created_at":"2026-05-18T12:27:01.376967+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/BWPKNGJT4TN6GR5HEHTQO7ZREF","json":"https://pith.science/pith/BWPKNGJT4TN6GR5HEHTQO7ZREF.json","graph_json":"https://pith.science/api/pith-number/BWPKNGJT4TN6GR5HEHTQO7ZREF/graph.json","events_json":"https://pith.science/api/pith-number/BWPKNGJT4TN6GR5HEHTQO7ZREF/events.json","paper":"https://pith.science/paper/BWPKNGJT"},"agent_actions":{"view_html":"https://pith.science/pith/BWPKNGJT4TN6GR5HEHTQO7ZREF","download_json":"https://pith.science/pith/BWPKNGJT4TN6GR5HEHTQO7ZREF.json","view_paper":"https://pith.science/paper/BWPKNGJT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.1300&json=true","fetch_graph":"https://pith.science/api/pith-number/BWPKNGJT4TN6GR5HEHTQO7ZREF/graph.json","fetch_events":"https://pith.science/api/pith-number/BWPKNGJT4TN6GR5HEHTQO7ZREF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BWPKNGJT4TN6GR5HEHTQO7ZREF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BWPKNGJT4TN6GR5HEHTQO7ZREF/action/storage_attestation","attest_author":"https://pith.science/pith/BWPKNGJT4TN6GR5HEHTQO7ZREF/action/author_attestation","sign_citation":"https://pith.science/pith/BWPKNGJT4TN6GR5HEHTQO7ZREF/action/citation_signature","submit_replication":"https://pith.science/pith/BWPKNGJT4TN6GR5HEHTQO7ZREF/action/replication_record"}},"created_at":"2026-05-18T03:44:03.996055+00:00","updated_at":"2026-05-18T03:44:03.996055+00:00"}