{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:6ZHSNBNEWHKB5C56LHBHB4A4IT","short_pith_number":"pith:6ZHSNBNE","canonical_record":{"source":{"id":"1307.0905","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-03T03:39:09Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"b188c2e42825a3574563c3c31503338bea5a1d8f7574e5fb05bee4d5a75f5787","abstract_canon_sha256":"8e231ee8e66568099d61dc9749511b4aa8a366740c0b23ea70f5097479643295"},"schema_version":"1.0"},"canonical_sha256":"f64f2685a4b1d41e8bbe59c270f01c44e7f2666b9771dc718203656e01de37ad","source":{"kind":"arxiv","id":"1307.0905","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.0905","created_at":"2026-05-18T02:49:47Z"},{"alias_kind":"arxiv_version","alias_value":"1307.0905v2","created_at":"2026-05-18T02:49:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.0905","created_at":"2026-05-18T02:49:47Z"},{"alias_kind":"pith_short_12","alias_value":"6ZHSNBNEWHKB","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6ZHSNBNEWHKB5C56","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6ZHSNBNE","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:6ZHSNBNEWHKB5C56LHBHB4A4IT","target":"record","payload":{"canonical_record":{"source":{"id":"1307.0905","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-03T03:39:09Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"b188c2e42825a3574563c3c31503338bea5a1d8f7574e5fb05bee4d5a75f5787","abstract_canon_sha256":"8e231ee8e66568099d61dc9749511b4aa8a366740c0b23ea70f5097479643295"},"schema_version":"1.0"},"canonical_sha256":"f64f2685a4b1d41e8bbe59c270f01c44e7f2666b9771dc718203656e01de37ad","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:47.179306Z","signature_b64":"HtqVfFSNNmUfuUuE908hsOZQGMlNqi+EpdXhBg2CyLrxzIx3xsnQqZingBPXCtILHqaOjOB//hSuAFtfHxgNCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f64f2685a4b1d41e8bbe59c270f01c44e7f2666b9771dc718203656e01de37ad","last_reissued_at":"2026-05-18T02:49:47.178890Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:47.178890Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.0905","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-18T02:49:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QpZOsjlo3wFHTAXlnwoXGRmdbOEg9zs4vfB1qCbYzpJGrvP3Ese4VFZtm3DZhH+Yx9F+nA8X4Y59dZ0gYt8kCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T15:33:49.599391Z"},"content_sha256":"aa7ce5347ebb451a519d1dae7e0eff45b5fd321529c4815f8a2e47765d0c7f99","schema_version":"1.0","event_id":"sha256:aa7ce5347ebb451a519d1dae7e0eff45b5fd321529c4815f8a2e47765d0c7f99"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:6ZHSNBNEWHKB5C56LHBHB4A4IT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algorithm and Complexity for a Network Assortativity Measure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"David Phillips, M. Drew Lamar, Rex K. Kincaid, Sarah J. Kunkler","submitted_at":"2013-07-03T03:39:09Z","abstract_excerpt":"We show that finding a graph realization with the minimum Randi\\'c index for a given degree sequence is solvable in polynomial time by formulating the problem as a minimum weight perfect b-matching problem. However, the realization found via this reduction is not guaranteed to be connected. Approximating the minimum weight b-matching problem subject to a connectivity constraint is shown to be NP-Hard. For instances in which the optimal solution to the minimum Randi\\'c index problem is not connected, we describe a heuristic to connect the graph using pairwise edge exchanges that preserves the d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.0905","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-18T02:49:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B1SNJGbdcElpe8HxFj7PS/qnh1ulp7T9cB1iSpun6C9mSo6Vx5AvM/NraXKzGErEyK58DxHHemuXUep0nfNmAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T15:33:49.599738Z"},"content_sha256":"0a4f25e9db04483031ad0ea4889d2dd4a3bbf8d17681f889d40761fd10f94b96","schema_version":"1.0","event_id":"sha256:0a4f25e9db04483031ad0ea4889d2dd4a3bbf8d17681f889d40761fd10f94b96"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6ZHSNBNEWHKB5C56LHBHB4A4IT/bundle.json","state_url":"https://pith.science/pith/6ZHSNBNEWHKB5C56LHBHB4A4IT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6ZHSNBNEWHKB5C56LHBHB4A4IT/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-26T15:33:49Z","links":{"resolver":"https://pith.science/pith/6ZHSNBNEWHKB5C56LHBHB4A4IT","bundle":"https://pith.science/pith/6ZHSNBNEWHKB5C56LHBHB4A4IT/bundle.json","state":"https://pith.science/pith/6ZHSNBNEWHKB5C56LHBHB4A4IT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6ZHSNBNEWHKB5C56LHBHB4A4IT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:6ZHSNBNEWHKB5C56LHBHB4A4IT","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":"8e231ee8e66568099d61dc9749511b4aa8a366740c0b23ea70f5097479643295","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-03T03:39:09Z","title_canon_sha256":"b188c2e42825a3574563c3c31503338bea5a1d8f7574e5fb05bee4d5a75f5787"},"schema_version":"1.0","source":{"id":"1307.0905","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.0905","created_at":"2026-05-18T02:49:47Z"},{"alias_kind":"arxiv_version","alias_value":"1307.0905v2","created_at":"2026-05-18T02:49:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.0905","created_at":"2026-05-18T02:49:47Z"},{"alias_kind":"pith_short_12","alias_value":"6ZHSNBNEWHKB","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6ZHSNBNEWHKB5C56","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6ZHSNBNE","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:0a4f25e9db04483031ad0ea4889d2dd4a3bbf8d17681f889d40761fd10f94b96","target":"graph","created_at":"2026-05-18T02:49:47Z","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 show that finding a graph realization with the minimum Randi\\'c index for a given degree sequence is solvable in polynomial time by formulating the problem as a minimum weight perfect b-matching problem. However, the realization found via this reduction is not guaranteed to be connected. Approximating the minimum weight b-matching problem subject to a connectivity constraint is shown to be NP-Hard. For instances in which the optimal solution to the minimum Randi\\'c index problem is not connected, we describe a heuristic to connect the graph using pairwise edge exchanges that preserves the d","authors_text":"David Phillips, M. Drew Lamar, Rex K. Kincaid, Sarah J. Kunkler","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-03T03:39:09Z","title":"Algorithm and Complexity for a Network Assortativity Measure"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.0905","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:aa7ce5347ebb451a519d1dae7e0eff45b5fd321529c4815f8a2e47765d0c7f99","target":"record","created_at":"2026-05-18T02:49:47Z","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":"8e231ee8e66568099d61dc9749511b4aa8a366740c0b23ea70f5097479643295","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-03T03:39:09Z","title_canon_sha256":"b188c2e42825a3574563c3c31503338bea5a1d8f7574e5fb05bee4d5a75f5787"},"schema_version":"1.0","source":{"id":"1307.0905","kind":"arxiv","version":2}},"canonical_sha256":"f64f2685a4b1d41e8bbe59c270f01c44e7f2666b9771dc718203656e01de37ad","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f64f2685a4b1d41e8bbe59c270f01c44e7f2666b9771dc718203656e01de37ad","first_computed_at":"2026-05-18T02:49:47.178890Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:49:47.178890Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HtqVfFSNNmUfuUuE908hsOZQGMlNqi+EpdXhBg2CyLrxzIx3xsnQqZingBPXCtILHqaOjOB//hSuAFtfHxgNCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:49:47.179306Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.0905","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aa7ce5347ebb451a519d1dae7e0eff45b5fd321529c4815f8a2e47765d0c7f99","sha256:0a4f25e9db04483031ad0ea4889d2dd4a3bbf8d17681f889d40761fd10f94b96"],"state_sha256":"f562d607de697f8188c638b3e3e37eb051405063a272e25f433c1023b50545df"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N+wdv5n8cJUF2LJ/X9xs9brnxUZaiuoO5Xb0nZ6OuOUc+PF8Z19RWyiJ5ATh+S5V/o4PQ/sW3IlEJrRCRlG5BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T15:33:49.601870Z","bundle_sha256":"113322901ae405aa80659e8308b2b423b62c23983c8e3b8d74e92cf6d108220c"}}