{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:IJRGFT6XIZIOA3MJOJNTP4TWYQ","short_pith_number":"pith:IJRGFT6X","schema_version":"1.0","canonical_sha256":"426262cfd74650e06d89725b37f276c42eea4ea0bd3222636956d8b65bc5d545","source":{"kind":"arxiv","id":"1308.4067","version":1},"attestation_state":"computed","paper":{"title":"The S-metric, the Beichl-Cloteaux approximation, and preferential attachment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","physics.soc-ph"],"primary_cat":"math.CO","authors_text":"Jason Cory Brunson","submitted_at":"2013-08-19T16:13:54Z","abstract_excerpt":"The S-metric has grown popular in network studies, as a measure of ``scale-freeness'' restricted to the collection G(D) of connected graphs with a common degree sequence D=(d_1,\\ldots,d_n). The calculation of S depends on the maximum possible degree assortativity r among graphs in G(D). The original method involves a heuristic construction of a maximally assortative graph g*. The approximation by Beichl and Cloteaux involves constructing a possibly disconnected graph g' with r(g') >= r(g*) and requires O(n^2) tests for the graphicality of a degree sequence. The present paper uses the Tripathi-"},"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":"1308.4067","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-19T16:13:54Z","cross_cats_sorted":["cs.SI","physics.soc-ph"],"title_canon_sha256":"8221f55143764913dc13aed396c149396f8defe8871bf76dbb3894feefadf65e","abstract_canon_sha256":"fa7348d63fcb3ec3e9fec0264f08974c91de428ce94c8e8fcb36c2d8cd010ea7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:34.946995Z","signature_b64":"PanZIbbCWFEzAlQ4mjxLvKsP7Z54MONzHUWAJYLQZnPkXFo/gJb2RzdPm7jWbKCq44ne9OLXQVsyWo4AY51YCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"426262cfd74650e06d89725b37f276c42eea4ea0bd3222636956d8b65bc5d545","last_reissued_at":"2026-05-18T03:15:34.946302Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:34.946302Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The S-metric, the Beichl-Cloteaux approximation, and preferential attachment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","physics.soc-ph"],"primary_cat":"math.CO","authors_text":"Jason Cory Brunson","submitted_at":"2013-08-19T16:13:54Z","abstract_excerpt":"The S-metric has grown popular in network studies, as a measure of ``scale-freeness'' restricted to the collection G(D) of connected graphs with a common degree sequence D=(d_1,\\ldots,d_n). The calculation of S depends on the maximum possible degree assortativity r among graphs in G(D). The original method involves a heuristic construction of a maximally assortative graph g*. The approximation by Beichl and Cloteaux involves constructing a possibly disconnected graph g' with r(g') >= r(g*) and requires O(n^2) tests for the graphicality of a degree sequence. The present paper uses the Tripathi-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.4067","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1308.4067","created_at":"2026-05-18T03:15:34.946420+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.4067v1","created_at":"2026-05-18T03:15:34.946420+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.4067","created_at":"2026-05-18T03:15:34.946420+00:00"},{"alias_kind":"pith_short_12","alias_value":"IJRGFT6XIZIO","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"IJRGFT6XIZIOA3MJ","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"IJRGFT6X","created_at":"2026-05-18T12:27:46.883200+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/IJRGFT6XIZIOA3MJOJNTP4TWYQ","json":"https://pith.science/pith/IJRGFT6XIZIOA3MJOJNTP4TWYQ.json","graph_json":"https://pith.science/api/pith-number/IJRGFT6XIZIOA3MJOJNTP4TWYQ/graph.json","events_json":"https://pith.science/api/pith-number/IJRGFT6XIZIOA3MJOJNTP4TWYQ/events.json","paper":"https://pith.science/paper/IJRGFT6X"},"agent_actions":{"view_html":"https://pith.science/pith/IJRGFT6XIZIOA3MJOJNTP4TWYQ","download_json":"https://pith.science/pith/IJRGFT6XIZIOA3MJOJNTP4TWYQ.json","view_paper":"https://pith.science/paper/IJRGFT6X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.4067&json=true","fetch_graph":"https://pith.science/api/pith-number/IJRGFT6XIZIOA3MJOJNTP4TWYQ/graph.json","fetch_events":"https://pith.science/api/pith-number/IJRGFT6XIZIOA3MJOJNTP4TWYQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IJRGFT6XIZIOA3MJOJNTP4TWYQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IJRGFT6XIZIOA3MJOJNTP4TWYQ/action/storage_attestation","attest_author":"https://pith.science/pith/IJRGFT6XIZIOA3MJOJNTP4TWYQ/action/author_attestation","sign_citation":"https://pith.science/pith/IJRGFT6XIZIOA3MJOJNTP4TWYQ/action/citation_signature","submit_replication":"https://pith.science/pith/IJRGFT6XIZIOA3MJOJNTP4TWYQ/action/replication_record"}},"created_at":"2026-05-18T03:15:34.946420+00:00","updated_at":"2026-05-18T03:15:34.946420+00:00"}