{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:K7RVIPTMP5WXMK4U5UUPRJT7O3","short_pith_number":"pith:K7RVIPTM","canonical_record":{"source":{"id":"1209.4493","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-09-20T11:09:13Z","cross_cats_sorted":["physics.comp-ph"],"title_canon_sha256":"b890f86bc580d6ad6f5ab203c5380fe09bcb69531aa8759b80e87ee6d5ad2c05","abstract_canon_sha256":"951bbf3a9a15351d1e96b049737dd3fd58a191e1f87f8f9318f6b7c86d7050d4"},"schema_version":"1.0"},"canonical_sha256":"57e3543e6c7f6d762b94ed28f8a67f76d5348d0630a4330627e851edc4b2ad08","source":{"kind":"arxiv","id":"1209.4493","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.4493","created_at":"2026-05-18T03:45:11Z"},{"alias_kind":"arxiv_version","alias_value":"1209.4493v1","created_at":"2026-05-18T03:45:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.4493","created_at":"2026-05-18T03:45:11Z"},{"alias_kind":"pith_short_12","alias_value":"K7RVIPTMP5WX","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"K7RVIPTMP5WXMK4U","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"K7RVIPTM","created_at":"2026-05-18T12:27:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:K7RVIPTMP5WXMK4U5UUPRJT7O3","target":"record","payload":{"canonical_record":{"source":{"id":"1209.4493","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-09-20T11:09:13Z","cross_cats_sorted":["physics.comp-ph"],"title_canon_sha256":"b890f86bc580d6ad6f5ab203c5380fe09bcb69531aa8759b80e87ee6d5ad2c05","abstract_canon_sha256":"951bbf3a9a15351d1e96b049737dd3fd58a191e1f87f8f9318f6b7c86d7050d4"},"schema_version":"1.0"},"canonical_sha256":"57e3543e6c7f6d762b94ed28f8a67f76d5348d0630a4330627e851edc4b2ad08","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:45:11.539661Z","signature_b64":"dGvZYYXjdB16aHzfNZ7RKyHkQikwE9+b8iDzPBRkTrpQ9KC1ul5ftmHqWLVjc0eAC20xW9ebKVD9xgy9/7ewDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57e3543e6c7f6d762b94ed28f8a67f76d5348d0630a4330627e851edc4b2ad08","last_reissued_at":"2026-05-18T03:45:11.538773Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:45:11.538773Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1209.4493","source_version":1,"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-18T03:45:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ldGsa3S11R3Qs00m2YnGBRsMIoUQo1aTyZAKdoCKuP0nulH6GI6on/CAv/iYjSKbPoOikPutMaMJ4U3pgRdXBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T00:39:01.754624Z"},"content_sha256":"45dec3134b88904c4bce97f71029e38156f53ff265251ea4d4b86bd27b2b93ed","schema_version":"1.0","event_id":"sha256:45dec3134b88904c4bce97f71029e38156f53ff265251ea4d4b86bd27b2b93ed"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:K7RVIPTMP5WXMK4U5UUPRJT7O3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimum weight spanning trees of weighted scale free networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.comp-ph"],"primary_cat":"cs.DS","authors_text":"O. Melchert","submitted_at":"2012-09-20T11:09:13Z","abstract_excerpt":"In this lecture we will consider the minimum weight spanning tree (MST) problem, i.e., one of the simplest and most vital combinatorial optimization problems. We will discuss a particular greedy algorithm that allows to compute a MST for undirected weighted graphs, namely Kruskal's algorithm, and we will study the structure of MSTs obtained for weighted scale free random graphs. This is meant to clarify whether the structure of MSTs is sensitive to correlations between edge weights and topology of the underlying scale free graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.4493","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"},"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-18T03:45:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lSzl9LBQLs9XlDP06K/WlXwyqblRS8fUcmPnwoHptBaFqHvxhabz9nDnYYxLSQpYyXpusjzSaMHqqEYEh2wxBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T00:39:01.754971Z"},"content_sha256":"0fed41f1d48f6cad7b71be2732cdfe308c2318eb8df84cefa6b4a05eafee4a9d","schema_version":"1.0","event_id":"sha256:0fed41f1d48f6cad7b71be2732cdfe308c2318eb8df84cefa6b4a05eafee4a9d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K7RVIPTMP5WXMK4U5UUPRJT7O3/bundle.json","state_url":"https://pith.science/pith/K7RVIPTMP5WXMK4U5UUPRJT7O3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K7RVIPTMP5WXMK4U5UUPRJT7O3/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-09T00:39:01Z","links":{"resolver":"https://pith.science/pith/K7RVIPTMP5WXMK4U5UUPRJT7O3","bundle":"https://pith.science/pith/K7RVIPTMP5WXMK4U5UUPRJT7O3/bundle.json","state":"https://pith.science/pith/K7RVIPTMP5WXMK4U5UUPRJT7O3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K7RVIPTMP5WXMK4U5UUPRJT7O3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:K7RVIPTMP5WXMK4U5UUPRJT7O3","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":"951bbf3a9a15351d1e96b049737dd3fd58a191e1f87f8f9318f6b7c86d7050d4","cross_cats_sorted":["physics.comp-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-09-20T11:09:13Z","title_canon_sha256":"b890f86bc580d6ad6f5ab203c5380fe09bcb69531aa8759b80e87ee6d5ad2c05"},"schema_version":"1.0","source":{"id":"1209.4493","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.4493","created_at":"2026-05-18T03:45:11Z"},{"alias_kind":"arxiv_version","alias_value":"1209.4493v1","created_at":"2026-05-18T03:45:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.4493","created_at":"2026-05-18T03:45:11Z"},{"alias_kind":"pith_short_12","alias_value":"K7RVIPTMP5WX","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"K7RVIPTMP5WXMK4U","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"K7RVIPTM","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:0fed41f1d48f6cad7b71be2732cdfe308c2318eb8df84cefa6b4a05eafee4a9d","target":"graph","created_at":"2026-05-18T03:45: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":"In this lecture we will consider the minimum weight spanning tree (MST) problem, i.e., one of the simplest and most vital combinatorial optimization problems. We will discuss a particular greedy algorithm that allows to compute a MST for undirected weighted graphs, namely Kruskal's algorithm, and we will study the structure of MSTs obtained for weighted scale free random graphs. This is meant to clarify whether the structure of MSTs is sensitive to correlations between edge weights and topology of the underlying scale free graphs.","authors_text":"O. Melchert","cross_cats":["physics.comp-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-09-20T11:09:13Z","title":"Minimum weight spanning trees of weighted scale free networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.4493","kind":"arxiv","version":1},"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:45dec3134b88904c4bce97f71029e38156f53ff265251ea4d4b86bd27b2b93ed","target":"record","created_at":"2026-05-18T03:45: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":"951bbf3a9a15351d1e96b049737dd3fd58a191e1f87f8f9318f6b7c86d7050d4","cross_cats_sorted":["physics.comp-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-09-20T11:09:13Z","title_canon_sha256":"b890f86bc580d6ad6f5ab203c5380fe09bcb69531aa8759b80e87ee6d5ad2c05"},"schema_version":"1.0","source":{"id":"1209.4493","kind":"arxiv","version":1}},"canonical_sha256":"57e3543e6c7f6d762b94ed28f8a67f76d5348d0630a4330627e851edc4b2ad08","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"57e3543e6c7f6d762b94ed28f8a67f76d5348d0630a4330627e851edc4b2ad08","first_computed_at":"2026-05-18T03:45:11.538773Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:45:11.538773Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dGvZYYXjdB16aHzfNZ7RKyHkQikwE9+b8iDzPBRkTrpQ9KC1ul5ftmHqWLVjc0eAC20xW9ebKVD9xgy9/7ewDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:45:11.539661Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.4493","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:45dec3134b88904c4bce97f71029e38156f53ff265251ea4d4b86bd27b2b93ed","sha256:0fed41f1d48f6cad7b71be2732cdfe308c2318eb8df84cefa6b4a05eafee4a9d"],"state_sha256":"116ce3513e80c3e8dc4c9f1447b023d84a253022c685c08041352776794370c0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hu/x3UvXcD3sUgGntxw53oLpFViqlMkAcYBXECUqNFTiEHy2n7Ubu0FOVBGWkUE4Hl0lo3X/UBzHFoFLLqKHCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T00:39:01.756811Z","bundle_sha256":"e2f30924d7a6e7b9d999acfcd16242c3275c5a9ba2048f270f206e1efd2509a8"}}