{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:MLBH25NXXVCG54XKUOQ2V3EYPG","short_pith_number":"pith:MLBH25NX","canonical_record":{"source":{"id":"1110.5383","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-10-24T23:47:21Z","cross_cats_sorted":["cs.LG","stat.CO"],"title_canon_sha256":"6f3978acc934567bc4a142cd0d07e22408709be9ca9ed5f53762d9c84b4da308","abstract_canon_sha256":"52d77a6a9769008107eaff5c16c5a4327991405984d5497f389c288c2e42f2d1"},"schema_version":"1.0"},"canonical_sha256":"62c27d75b7bd446ef2eaa3a1aaec9879bcf7bc5d0849c803cc241dbac22d4278","source":{"kind":"arxiv","id":"1110.5383","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.5383","created_at":"2026-05-18T04:02:39Z"},{"alias_kind":"arxiv_version","alias_value":"1110.5383v2","created_at":"2026-05-18T04:02:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.5383","created_at":"2026-05-18T04:02:39Z"},{"alias_kind":"pith_short_12","alias_value":"MLBH25NXXVCG","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"MLBH25NXXVCG54XK","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"MLBH25NX","created_at":"2026-05-18T12:26:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:MLBH25NXXVCG54XKUOQ2V3EYPG","target":"record","payload":{"canonical_record":{"source":{"id":"1110.5383","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-10-24T23:47:21Z","cross_cats_sorted":["cs.LG","stat.CO"],"title_canon_sha256":"6f3978acc934567bc4a142cd0d07e22408709be9ca9ed5f53762d9c84b4da308","abstract_canon_sha256":"52d77a6a9769008107eaff5c16c5a4327991405984d5497f389c288c2e42f2d1"},"schema_version":"1.0"},"canonical_sha256":"62c27d75b7bd446ef2eaa3a1aaec9879bcf7bc5d0849c803cc241dbac22d4278","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:02:39.350107Z","signature_b64":"c2HahVDit2JE75ATIPCeGBpI3J6kXsqpLWQcZ42I8iNvrVj6hqarkCLJu2HHYIX+izwu971I5jhstVRH6fADBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"62c27d75b7bd446ef2eaa3a1aaec9879bcf7bc5d0849c803cc241dbac22d4278","last_reissued_at":"2026-05-18T04:02:39.349393Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:02:39.349393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1110.5383","source_version":2,"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-18T04:02:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GKW9o0Gy2uLvRn6SYlBBVdK8V0EkjGNYf/h2f21T+8xJUcb6BCKrVeXvbCShC2NRFxe3gXQomQkYy2I/kawKCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:06:31.953094Z"},"content_sha256":"bc1efde78fee3ca4aed8898c51e463a702f72e6f2c84d29db7c025685813e619","schema_version":"1.0","event_id":"sha256:bc1efde78fee3ca4aed8898c51e463a702f72e6f2c84d29db7c025685813e619"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:MLBH25NXXVCG54XKUOQ2V3EYPG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quilting Stochastic Kronecker Product Graphs to Generate Multiplicative Attribute Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.CO"],"primary_cat":"stat.ML","authors_text":"Hyokun Yun, S. V. N. Vishwanathan","submitted_at":"2011-10-24T23:47:21Z","abstract_excerpt":"We describe the first sub-quadratic sampling algorithm for the Multiplicative Attribute Graph Model (MAGM) of Kim and Leskovec (2010). We exploit the close connection between MAGM and the Kronecker Product Graph Model (KPGM) of Leskovec et al. (2010), and show that to sample a graph from a MAGM it suffices to sample small number of KPGM graphs and \\emph{quilt} them together. Under a restricted set of technical conditions our algorithm runs in $O((\\log_2(n))^3 |E|)$ time, where $n$ is the number of nodes and $|E|$ is the number of edges in the sampled graph. We demonstrate the scalability of ou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.5383","kind":"arxiv","version":2},"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-18T04:02:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ucS9xAWR7cOcxxVgadZ70PBMZLhK3Kc+PKE78oXcbjdJ2KYMgQ35vNiDlJw9TRMPIUwAJOE5yXESaErRMdknBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:06:31.953792Z"},"content_sha256":"53be97d60162dd9d52d2919a111b2575e36e9a5b87d1b963bd778bda7de8fba8","schema_version":"1.0","event_id":"sha256:53be97d60162dd9d52d2919a111b2575e36e9a5b87d1b963bd778bda7de8fba8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MLBH25NXXVCG54XKUOQ2V3EYPG/bundle.json","state_url":"https://pith.science/pith/MLBH25NXXVCG54XKUOQ2V3EYPG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MLBH25NXXVCG54XKUOQ2V3EYPG/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-05-26T20:06:31Z","links":{"resolver":"https://pith.science/pith/MLBH25NXXVCG54XKUOQ2V3EYPG","bundle":"https://pith.science/pith/MLBH25NXXVCG54XKUOQ2V3EYPG/bundle.json","state":"https://pith.science/pith/MLBH25NXXVCG54XKUOQ2V3EYPG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MLBH25NXXVCG54XKUOQ2V3EYPG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:MLBH25NXXVCG54XKUOQ2V3EYPG","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":"52d77a6a9769008107eaff5c16c5a4327991405984d5497f389c288c2e42f2d1","cross_cats_sorted":["cs.LG","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-10-24T23:47:21Z","title_canon_sha256":"6f3978acc934567bc4a142cd0d07e22408709be9ca9ed5f53762d9c84b4da308"},"schema_version":"1.0","source":{"id":"1110.5383","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.5383","created_at":"2026-05-18T04:02:39Z"},{"alias_kind":"arxiv_version","alias_value":"1110.5383v2","created_at":"2026-05-18T04:02:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.5383","created_at":"2026-05-18T04:02:39Z"},{"alias_kind":"pith_short_12","alias_value":"MLBH25NXXVCG","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"MLBH25NXXVCG54XK","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"MLBH25NX","created_at":"2026-05-18T12:26:34Z"}],"graph_snapshots":[{"event_id":"sha256:53be97d60162dd9d52d2919a111b2575e36e9a5b87d1b963bd778bda7de8fba8","target":"graph","created_at":"2026-05-18T04:02:39Z","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":"We describe the first sub-quadratic sampling algorithm for the Multiplicative Attribute Graph Model (MAGM) of Kim and Leskovec (2010). We exploit the close connection between MAGM and the Kronecker Product Graph Model (KPGM) of Leskovec et al. (2010), and show that to sample a graph from a MAGM it suffices to sample small number of KPGM graphs and \\emph{quilt} them together. Under a restricted set of technical conditions our algorithm runs in $O((\\log_2(n))^3 |E|)$ time, where $n$ is the number of nodes and $|E|$ is the number of edges in the sampled graph. We demonstrate the scalability of ou","authors_text":"Hyokun Yun, S. V. N. Vishwanathan","cross_cats":["cs.LG","stat.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-10-24T23:47:21Z","title":"Quilting Stochastic Kronecker Product Graphs to Generate Multiplicative Attribute Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.5383","kind":"arxiv","version":2},"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:bc1efde78fee3ca4aed8898c51e463a702f72e6f2c84d29db7c025685813e619","target":"record","created_at":"2026-05-18T04:02:39Z","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":"52d77a6a9769008107eaff5c16c5a4327991405984d5497f389c288c2e42f2d1","cross_cats_sorted":["cs.LG","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-10-24T23:47:21Z","title_canon_sha256":"6f3978acc934567bc4a142cd0d07e22408709be9ca9ed5f53762d9c84b4da308"},"schema_version":"1.0","source":{"id":"1110.5383","kind":"arxiv","version":2}},"canonical_sha256":"62c27d75b7bd446ef2eaa3a1aaec9879bcf7bc5d0849c803cc241dbac22d4278","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"62c27d75b7bd446ef2eaa3a1aaec9879bcf7bc5d0849c803cc241dbac22d4278","first_computed_at":"2026-05-18T04:02:39.349393Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:02:39.349393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c2HahVDit2JE75ATIPCeGBpI3J6kXsqpLWQcZ42I8iNvrVj6hqarkCLJu2HHYIX+izwu971I5jhstVRH6fADBw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:02:39.350107Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.5383","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bc1efde78fee3ca4aed8898c51e463a702f72e6f2c84d29db7c025685813e619","sha256:53be97d60162dd9d52d2919a111b2575e36e9a5b87d1b963bd778bda7de8fba8"],"state_sha256":"8587f409699417e1d17a2f748b00bfe8354138e9bd144b33a75ca50e79971f46"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hAc5ueSCREkbKi+pcrGytLrc7rrXWJjYWit/JiudBWuN6Hh7y9lg4o/B516NuJzQkRdOKMDTu5NDzYcbIid0DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T20:06:31.957271Z","bundle_sha256":"626d9a540d0e999613ff542303ce15f24407cccd4d71b2da5ddb879b63f9b5b2"}}