{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:72AMZEZC4TYFKJK4EDBDSRKMZ2","short_pith_number":"pith:72AMZEZC","canonical_record":{"source":{"id":"1202.6001","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-02-27T17:17:16Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"62fe8cf0119094a847a22f19e5d99e0ff2d3181a22f427dc79c9f0a497545298","abstract_canon_sha256":"d4d51e3a3f76237729b260ece1e6a659d1e2374e0c26c0a0c2e4f20cfea219b8"},"schema_version":"1.0"},"canonical_sha256":"fe80cc9322e4f055255c20c239454cceb80824bd2754bacc866e7dfeeedf2eef","source":{"kind":"arxiv","id":"1202.6001","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.6001","created_at":"2026-05-18T04:01:23Z"},{"alias_kind":"arxiv_version","alias_value":"1202.6001v2","created_at":"2026-05-18T04:01:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.6001","created_at":"2026-05-18T04:01:23Z"},{"alias_kind":"pith_short_12","alias_value":"72AMZEZC4TYF","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"72AMZEZC4TYFKJK4","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"72AMZEZC","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:72AMZEZC4TYFKJK4EDBDSRKMZ2","target":"record","payload":{"canonical_record":{"source":{"id":"1202.6001","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-02-27T17:17:16Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"62fe8cf0119094a847a22f19e5d99e0ff2d3181a22f427dc79c9f0a497545298","abstract_canon_sha256":"d4d51e3a3f76237729b260ece1e6a659d1e2374e0c26c0a0c2e4f20cfea219b8"},"schema_version":"1.0"},"canonical_sha256":"fe80cc9322e4f055255c20c239454cceb80824bd2754bacc866e7dfeeedf2eef","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:01:23.662354Z","signature_b64":"mej1tM6k4uKq+dDddyS0KVS+H++u3AjSeCyfrZZfJ0uV6x+1ItlvrABzS4oH842iQfZnLMQ4kzE1dI8wtW0VBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe80cc9322e4f055255c20c239454cceb80824bd2754bacc866e7dfeeedf2eef","last_reissued_at":"2026-05-18T04:01:23.661788Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:01:23.661788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.6001","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:01:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IkySGCJEZS/Dwg5dH/f/X7cmMr8f3vSwBHZY+pl7IoseaSon2+H8hKXqho7rukUL7wGwX0OjqxtM3D5A/tm5BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:19:04.933648Z"},"content_sha256":"ca03eddbead371126ec9e91a738bd9e42a0d7ab60ec3478ed0978b9e3c9c5217","schema_version":"1.0","event_id":"sha256:ca03eddbead371126ec9e91a738bd9e42a0d7ab60ec3478ed0978b9e3c9c5217"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:72AMZEZC4TYFKJK4EDBDSRKMZ2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficiently Sampling Multiplicative Attribute Graphs Using a Ball-Dropping Process","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Hyokun Yun, S. V. N. Vishwanathan","submitted_at":"2012-02-27T17:17:16Z","abstract_excerpt":"We introduce a novel and efficient sampling algorithm for the Multiplicative Attribute Graph Model (MAGM - Kim and Leskovec (2010)}). Our algorithm is \\emph{strictly} more efficient than the algorithm proposed by Yun and Vishwanathan (2012), in the sense that our method extends the \\emph{best} time complexity guarantee of their algorithm to a larger fraction of parameter space. Both in theory and in empirical evaluation on sparse graphs, our new algorithm outperforms the previous one. To design our algorithm, we first define a stochastic \\emph{ball-dropping process} (BDP). Although a special c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.6001","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:01:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F4e38Y0/dd/jEypyn2AvsCPGuHE+q06wHd3c+1KX6G0CqXKHLVTBYW57M1dXrOpkLoXeS4336u8eZ7UCd30mCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:19:04.934030Z"},"content_sha256":"c39824009ade400f325faa5c595d39c27b2d90a05474ea7352b6c24afaf33374","schema_version":"1.0","event_id":"sha256:c39824009ade400f325faa5c595d39c27b2d90a05474ea7352b6c24afaf33374"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/72AMZEZC4TYFKJK4EDBDSRKMZ2/bundle.json","state_url":"https://pith.science/pith/72AMZEZC4TYFKJK4EDBDSRKMZ2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/72AMZEZC4TYFKJK4EDBDSRKMZ2/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-27T00:19:04Z","links":{"resolver":"https://pith.science/pith/72AMZEZC4TYFKJK4EDBDSRKMZ2","bundle":"https://pith.science/pith/72AMZEZC4TYFKJK4EDBDSRKMZ2/bundle.json","state":"https://pith.science/pith/72AMZEZC4TYFKJK4EDBDSRKMZ2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/72AMZEZC4TYFKJK4EDBDSRKMZ2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:72AMZEZC4TYFKJK4EDBDSRKMZ2","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":"d4d51e3a3f76237729b260ece1e6a659d1e2374e0c26c0a0c2e4f20cfea219b8","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-02-27T17:17:16Z","title_canon_sha256":"62fe8cf0119094a847a22f19e5d99e0ff2d3181a22f427dc79c9f0a497545298"},"schema_version":"1.0","source":{"id":"1202.6001","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.6001","created_at":"2026-05-18T04:01:23Z"},{"alias_kind":"arxiv_version","alias_value":"1202.6001v2","created_at":"2026-05-18T04:01:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.6001","created_at":"2026-05-18T04:01:23Z"},{"alias_kind":"pith_short_12","alias_value":"72AMZEZC4TYF","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"72AMZEZC4TYFKJK4","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"72AMZEZC","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:c39824009ade400f325faa5c595d39c27b2d90a05474ea7352b6c24afaf33374","target":"graph","created_at":"2026-05-18T04:01:23Z","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 introduce a novel and efficient sampling algorithm for the Multiplicative Attribute Graph Model (MAGM - Kim and Leskovec (2010)}). Our algorithm is \\emph{strictly} more efficient than the algorithm proposed by Yun and Vishwanathan (2012), in the sense that our method extends the \\emph{best} time complexity guarantee of their algorithm to a larger fraction of parameter space. Both in theory and in empirical evaluation on sparse graphs, our new algorithm outperforms the previous one. To design our algorithm, we first define a stochastic \\emph{ball-dropping process} (BDP). Although a special c","authors_text":"Hyokun Yun, S. V. N. Vishwanathan","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-02-27T17:17:16Z","title":"Efficiently Sampling Multiplicative Attribute Graphs Using a Ball-Dropping Process"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.6001","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:ca03eddbead371126ec9e91a738bd9e42a0d7ab60ec3478ed0978b9e3c9c5217","target":"record","created_at":"2026-05-18T04:01:23Z","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":"d4d51e3a3f76237729b260ece1e6a659d1e2374e0c26c0a0c2e4f20cfea219b8","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-02-27T17:17:16Z","title_canon_sha256":"62fe8cf0119094a847a22f19e5d99e0ff2d3181a22f427dc79c9f0a497545298"},"schema_version":"1.0","source":{"id":"1202.6001","kind":"arxiv","version":2}},"canonical_sha256":"fe80cc9322e4f055255c20c239454cceb80824bd2754bacc866e7dfeeedf2eef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fe80cc9322e4f055255c20c239454cceb80824bd2754bacc866e7dfeeedf2eef","first_computed_at":"2026-05-18T04:01:23.661788Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:01:23.661788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mej1tM6k4uKq+dDddyS0KVS+H++u3AjSeCyfrZZfJ0uV6x+1ItlvrABzS4oH842iQfZnLMQ4kzE1dI8wtW0VBw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:01:23.662354Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.6001","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ca03eddbead371126ec9e91a738bd9e42a0d7ab60ec3478ed0978b9e3c9c5217","sha256:c39824009ade400f325faa5c595d39c27b2d90a05474ea7352b6c24afaf33374"],"state_sha256":"270e5c94115d14fe15d956f46629025aea00b4c25923cb5c8aa43a0d25ece490"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fCtQV/zxuMHcHRVf/klCGUwSgbt9K0XGuMvd1dxKlB0Fnc9oTlfiSq+Kgns3p4cGOL+JbSGoR0EnwxlkBBZSDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T00:19:04.936912Z","bundle_sha256":"9da61dc80ac3f6141b28987efc9d4f37befb57f7f1c5869c5baaaa398594cb07"}}