{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:H5KD6X3XA6OLDFTRIRC25637V5","short_pith_number":"pith:H5KD6X3X","canonical_record":{"source":{"id":"1503.02129","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-03-07T03:35:26Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"20d4173b85f97c80d79237494ce57004c5f2a259478a249542effbc0504fd156","abstract_canon_sha256":"70f102f46d8667badba5d63e7d6716689c37c5b2d9bb44241755879cd7d45eae"},"schema_version":"1.0"},"canonical_sha256":"3f543f5f77079cb196714445aefb7faf409e9ac5a8bc1252277f8255dab6373a","source":{"kind":"arxiv","id":"1503.02129","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.02129","created_at":"2026-05-18T01:44:11Z"},{"alias_kind":"arxiv_version","alias_value":"1503.02129v3","created_at":"2026-05-18T01:44:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.02129","created_at":"2026-05-18T01:44:11Z"},{"alias_kind":"pith_short_12","alias_value":"H5KD6X3XA6OL","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"H5KD6X3XA6OLDFTR","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"H5KD6X3X","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:H5KD6X3XA6OLDFTRIRC25637V5","target":"record","payload":{"canonical_record":{"source":{"id":"1503.02129","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-03-07T03:35:26Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"20d4173b85f97c80d79237494ce57004c5f2a259478a249542effbc0504fd156","abstract_canon_sha256":"70f102f46d8667badba5d63e7d6716689c37c5b2d9bb44241755879cd7d45eae"},"schema_version":"1.0"},"canonical_sha256":"3f543f5f77079cb196714445aefb7faf409e9ac5a8bc1252277f8255dab6373a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:44:11.251548Z","signature_b64":"TcZHIlmA2Gj0wUUGV171gbuC0nzuKm4LUnav1OfuPHrml3it7m1DGyx+XJZvGGWndkoVAldJgiR0yCZrJ/aLAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f543f5f77079cb196714445aefb7faf409e9ac5a8bc1252277f8255dab6373a","last_reissued_at":"2026-05-18T01:44:11.250729Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:44:11.250729Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.02129","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-18T01:44:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nKuK+Hw2DOTz5VDhqLT+CTsKn168zjWgVzXaaxsFxLmCI8POJvTc1L5dqo/sFi2Q4edIttNzPMMkywqU5+2TDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T05:42:27.650771Z"},"content_sha256":"6e801afb2e27a2d81de234d948c48ce81e35169b436a9cc19a9bb2c0c25bcd92","schema_version":"1.0","event_id":"sha256:6e801afb2e27a2d81de234d948c48ce81e35169b436a9cc19a9bb2c0c25bcd92"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:H5KD6X3XA6OLDFTRIRC25637V5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Scale-Free Networks by Dynamic Node-Specific Degree Prior","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Jinbo Xu, Qingming Tang, Siqi Sun","submitted_at":"2015-03-07T03:35:26Z","abstract_excerpt":"Learning the network structure underlying data is an important problem in machine learning. This paper introduces a novel prior to study the inference of scale-free networks, which are widely used to model social and biological networks. The prior not only favors a desirable global node degree distribution, but also takes into consideration the relative strength of all the possible edges adjacent to the same node and the estimated degree of each individual node.\n  To fulfill this, ranking is incorporated into the prior, which makes the problem challenging to solve. We employ an ADMM (alternati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.02129","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-18T01:44:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TFzxuhruGuIFpD/6xADu+HeTxCe/olYU7I0C3fxcCG5HQzwnlttSaxr2xnn3C+ZxA32rWoNAEcD0SRQeJMfZAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T05:42:27.651118Z"},"content_sha256":"2b930f6c72ee39b91419a2574c2a18abebf28d8a8d712295f6b6e01c5dc38e40","schema_version":"1.0","event_id":"sha256:2b930f6c72ee39b91419a2574c2a18abebf28d8a8d712295f6b6e01c5dc38e40"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H5KD6X3XA6OLDFTRIRC25637V5/bundle.json","state_url":"https://pith.science/pith/H5KD6X3XA6OLDFTRIRC25637V5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H5KD6X3XA6OLDFTRIRC25637V5/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-07-05T05:42:27Z","links":{"resolver":"https://pith.science/pith/H5KD6X3XA6OLDFTRIRC25637V5","bundle":"https://pith.science/pith/H5KD6X3XA6OLDFTRIRC25637V5/bundle.json","state":"https://pith.science/pith/H5KD6X3XA6OLDFTRIRC25637V5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H5KD6X3XA6OLDFTRIRC25637V5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:H5KD6X3XA6OLDFTRIRC25637V5","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":"70f102f46d8667badba5d63e7d6716689c37c5b2d9bb44241755879cd7d45eae","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-03-07T03:35:26Z","title_canon_sha256":"20d4173b85f97c80d79237494ce57004c5f2a259478a249542effbc0504fd156"},"schema_version":"1.0","source":{"id":"1503.02129","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.02129","created_at":"2026-05-18T01:44:11Z"},{"alias_kind":"arxiv_version","alias_value":"1503.02129v3","created_at":"2026-05-18T01:44:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.02129","created_at":"2026-05-18T01:44:11Z"},{"alias_kind":"pith_short_12","alias_value":"H5KD6X3XA6OL","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"H5KD6X3XA6OLDFTR","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"H5KD6X3X","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:2b930f6c72ee39b91419a2574c2a18abebf28d8a8d712295f6b6e01c5dc38e40","target":"graph","created_at":"2026-05-18T01:44:11Z","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":"Learning the network structure underlying data is an important problem in machine learning. This paper introduces a novel prior to study the inference of scale-free networks, which are widely used to model social and biological networks. The prior not only favors a desirable global node degree distribution, but also takes into consideration the relative strength of all the possible edges adjacent to the same node and the estimated degree of each individual node.\n  To fulfill this, ranking is incorporated into the prior, which makes the problem challenging to solve. We employ an ADMM (alternati","authors_text":"Jinbo Xu, Qingming Tang, Siqi Sun","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-03-07T03:35:26Z","title":"Learning Scale-Free Networks by Dynamic Node-Specific Degree Prior"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.02129","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:6e801afb2e27a2d81de234d948c48ce81e35169b436a9cc19a9bb2c0c25bcd92","target":"record","created_at":"2026-05-18T01:44:11Z","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":"70f102f46d8667badba5d63e7d6716689c37c5b2d9bb44241755879cd7d45eae","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-03-07T03:35:26Z","title_canon_sha256":"20d4173b85f97c80d79237494ce57004c5f2a259478a249542effbc0504fd156"},"schema_version":"1.0","source":{"id":"1503.02129","kind":"arxiv","version":3}},"canonical_sha256":"3f543f5f77079cb196714445aefb7faf409e9ac5a8bc1252277f8255dab6373a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3f543f5f77079cb196714445aefb7faf409e9ac5a8bc1252277f8255dab6373a","first_computed_at":"2026-05-18T01:44:11.250729Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:44:11.250729Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TcZHIlmA2Gj0wUUGV171gbuC0nzuKm4LUnav1OfuPHrml3it7m1DGyx+XJZvGGWndkoVAldJgiR0yCZrJ/aLAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:44:11.251548Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.02129","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6e801afb2e27a2d81de234d948c48ce81e35169b436a9cc19a9bb2c0c25bcd92","sha256:2b930f6c72ee39b91419a2574c2a18abebf28d8a8d712295f6b6e01c5dc38e40"],"state_sha256":"390e69a8278f9cb6d51f7ebc91a679ee96a6672af3489cd30f4412911468cac0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uPVIuOPkXI9fldwVXNtGbUxXROQlUMrfOvqziHX1TvVRT61xw1zQeNTrdJjd/2DJ9NXRqxmc3eVtIpgtvhLeDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T05:42:27.653106Z","bundle_sha256":"25a39d25641e9dbf6a7ecda7de289583830d42e6db1882f576ea6f417c75bf2b"}}