{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:DQ7GNX3GTAQYBUXFU5AC6I5MWD","short_pith_number":"pith:DQ7GNX3G","schema_version":"1.0","canonical_sha256":"1c3e66df66982180d2e5a7402f23acb0e63296b92a7b40b494b5034ddcdd17ac","source":{"kind":"arxiv","id":"1305.3031","version":1},"attestation_state":"computed","paper":{"title":"Clustering Algorithms for Scale-free Networks and Applications to Cloud Resource Management","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Ashkan Paya, Dan C. Marinescu","submitted_at":"2013-05-14T06:19:43Z","abstract_excerpt":"In this paper we introduce algorithms for the construction of scale-free networks and for clustering around the nerve centers, nodes with a high connectivity in a scale-free networks. We argue that such overlay networks could support self-organization in a complex system like a cloud computing infrastructure and allow the implementation of optimal resource management policies."},"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":"1305.3031","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-05-14T06:19:43Z","cross_cats_sorted":[],"title_canon_sha256":"576dbadcdb2866d5778ccbbcce447ba909f60cf3fdc5a7f4f2af01a56cd992ae","abstract_canon_sha256":"373b09419e337e9f810e5556c8a9b67dd4614d8b2c85eec9b94670fce34e03a3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:45.064284Z","signature_b64":"Bfz5EkJVmEtdgynClA9mIPgr0KmjKosVTAm5BZDbaKuZk3z3Q/mxEKwiq8sgHHbXJM9t3UnWg+ISC6/KAOgSDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c3e66df66982180d2e5a7402f23acb0e63296b92a7b40b494b5034ddcdd17ac","last_reissued_at":"2026-05-18T03:25:45.063471Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:45.063471Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Clustering Algorithms for Scale-free Networks and Applications to Cloud Resource Management","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Ashkan Paya, Dan C. Marinescu","submitted_at":"2013-05-14T06:19:43Z","abstract_excerpt":"In this paper we introduce algorithms for the construction of scale-free networks and for clustering around the nerve centers, nodes with a high connectivity in a scale-free networks. We argue that such overlay networks could support self-organization in a complex system like a cloud computing infrastructure and allow the implementation of optimal resource management policies."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.3031","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":"1305.3031","created_at":"2026-05-18T03:25:45.063602+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.3031v1","created_at":"2026-05-18T03:25:45.063602+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.3031","created_at":"2026-05-18T03:25:45.063602+00:00"},{"alias_kind":"pith_short_12","alias_value":"DQ7GNX3GTAQY","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"DQ7GNX3GTAQYBUXF","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"DQ7GNX3G","created_at":"2026-05-18T12:27:43.054852+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/DQ7GNX3GTAQYBUXFU5AC6I5MWD","json":"https://pith.science/pith/DQ7GNX3GTAQYBUXFU5AC6I5MWD.json","graph_json":"https://pith.science/api/pith-number/DQ7GNX3GTAQYBUXFU5AC6I5MWD/graph.json","events_json":"https://pith.science/api/pith-number/DQ7GNX3GTAQYBUXFU5AC6I5MWD/events.json","paper":"https://pith.science/paper/DQ7GNX3G"},"agent_actions":{"view_html":"https://pith.science/pith/DQ7GNX3GTAQYBUXFU5AC6I5MWD","download_json":"https://pith.science/pith/DQ7GNX3GTAQYBUXFU5AC6I5MWD.json","view_paper":"https://pith.science/paper/DQ7GNX3G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.3031&json=true","fetch_graph":"https://pith.science/api/pith-number/DQ7GNX3GTAQYBUXFU5AC6I5MWD/graph.json","fetch_events":"https://pith.science/api/pith-number/DQ7GNX3GTAQYBUXFU5AC6I5MWD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DQ7GNX3GTAQYBUXFU5AC6I5MWD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DQ7GNX3GTAQYBUXFU5AC6I5MWD/action/storage_attestation","attest_author":"https://pith.science/pith/DQ7GNX3GTAQYBUXFU5AC6I5MWD/action/author_attestation","sign_citation":"https://pith.science/pith/DQ7GNX3GTAQYBUXFU5AC6I5MWD/action/citation_signature","submit_replication":"https://pith.science/pith/DQ7GNX3GTAQYBUXFU5AC6I5MWD/action/replication_record"}},"created_at":"2026-05-18T03:25:45.063602+00:00","updated_at":"2026-05-18T03:25:45.063602+00:00"}