{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:6ZHSNBNEWHKB5C56LHBHB4A4IT","short_pith_number":"pith:6ZHSNBNE","schema_version":"1.0","canonical_sha256":"f64f2685a4b1d41e8bbe59c270f01c44e7f2666b9771dc718203656e01de37ad","source":{"kind":"arxiv","id":"1307.0905","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1307.0905","created_at":"2026-05-18T02:49:47.178951+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.0905v2","created_at":"2026-05-18T02:49:47.178951+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.0905","created_at":"2026-05-18T02:49:47.178951+00:00"},{"alias_kind":"pith_short_12","alias_value":"6ZHSNBNEWHKB","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_16","alias_value":"6ZHSNBNEWHKB5C56","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_8","alias_value":"6ZHSNBNE","created_at":"2026-05-18T12:27:36.564083+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6ZHSNBNEWHKB5C56LHBHB4A4IT","json":"https://pith.science/pith/6ZHSNBNEWHKB5C56LHBHB4A4IT.json","graph_json":"https://pith.science/api/pith-number/6ZHSNBNEWHKB5C56LHBHB4A4IT/graph.json","events_json":"https://pith.science/api/pith-number/6ZHSNBNEWHKB5C56LHBHB4A4IT/events.json","paper":"https://pith.science/paper/6ZHSNBNE"},"agent_actions":{"view_html":"https://pith.science/pith/6ZHSNBNEWHKB5C56LHBHB4A4IT","download_json":"https://pith.science/pith/6ZHSNBNEWHKB5C56LHBHB4A4IT.json","view_paper":"https://pith.science/paper/6ZHSNBNE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.0905&json=true","fetch_graph":"https://pith.science/api/pith-number/6ZHSNBNEWHKB5C56LHBHB4A4IT/graph.json","fetch_events":"https://pith.science/api/pith-number/6ZHSNBNEWHKB5C56LHBHB4A4IT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6ZHSNBNEWHKB5C56LHBHB4A4IT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6ZHSNBNEWHKB5C56LHBHB4A4IT/action/storage_attestation","attest_author":"https://pith.science/pith/6ZHSNBNEWHKB5C56LHBHB4A4IT/action/author_attestation","sign_citation":"https://pith.science/pith/6ZHSNBNEWHKB5C56LHBHB4A4IT/action/citation_signature","submit_replication":"https://pith.science/pith/6ZHSNBNEWHKB5C56LHBHB4A4IT/action/replication_record"}},"created_at":"2026-05-18T02:49:47.178951+00:00","updated_at":"2026-05-18T02:49:47.178951+00:00"}