{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:SQ57OHXLLL6HQZGNERUZLBCR4T","short_pith_number":"pith:SQ57OHXL","schema_version":"1.0","canonical_sha256":"943bf71eeb5afc7864cd2469958451e4fc7c3f8823f63e7c23e0bfa60bcb267d","source":{"kind":"arxiv","id":"1503.00899","version":1},"attestation_state":"computed","paper":{"title":"An Ant Colony Optimization Algorithm for Partitioning Graphs with Supply and Demand","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Milan Tuba, Raka Jovanovic, Stefan Voss","submitted_at":"2015-03-03T11:26:02Z","abstract_excerpt":"In this paper we focus on finding high quality solutions for the problem of maximum partitioning of graphs with supply and demand (MPGSD). There is a growing interest for the MPGSD due to its close connection to problems appearing in the field of electrical distribution systems, especially for the optimization of self-adequacy of interconnected microgrids. We propose an ant colony optimization algorithm for the problem. With the goal of further improving the algorithm we combine it with a previously developed correction procedure. In our computational experiments we evaluate the performance of"},"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":"1503.00899","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-03-03T11:26:02Z","cross_cats_sorted":[],"title_canon_sha256":"148671ad57b06e93e45207f2e47a1cb50886e84960258c715e784824ea877299","abstract_canon_sha256":"ed8f36d01a648a0cd9997023546948f91160c7804f42eec9b1c807491144e508"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:41.863303Z","signature_b64":"VvuQ1d8YemreFt6806jP+aEdrLm0lv5Fwwn25Vkr7shIqKdXjrr5bM+J70RT+JR8oVcrdL7xKz/DXPsQhGmjAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"943bf71eeb5afc7864cd2469958451e4fc7c3f8823f63e7c23e0bfa60bcb267d","last_reissued_at":"2026-05-18T01:21:41.862876Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:41.862876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Ant Colony Optimization Algorithm for Partitioning Graphs with Supply and Demand","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Milan Tuba, Raka Jovanovic, Stefan Voss","submitted_at":"2015-03-03T11:26:02Z","abstract_excerpt":"In this paper we focus on finding high quality solutions for the problem of maximum partitioning of graphs with supply and demand (MPGSD). There is a growing interest for the MPGSD due to its close connection to problems appearing in the field of electrical distribution systems, especially for the optimization of self-adequacy of interconnected microgrids. We propose an ant colony optimization algorithm for the problem. With the goal of further improving the algorithm we combine it with a previously developed correction procedure. In our computational experiments we evaluate the performance of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.00899","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":"1503.00899","created_at":"2026-05-18T01:21:41.862937+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.00899v1","created_at":"2026-05-18T01:21:41.862937+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.00899","created_at":"2026-05-18T01:21:41.862937+00:00"},{"alias_kind":"pith_short_12","alias_value":"SQ57OHXLLL6H","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"SQ57OHXLLL6HQZGN","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"SQ57OHXL","created_at":"2026-05-18T12:29:42.218222+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/SQ57OHXLLL6HQZGNERUZLBCR4T","json":"https://pith.science/pith/SQ57OHXLLL6HQZGNERUZLBCR4T.json","graph_json":"https://pith.science/api/pith-number/SQ57OHXLLL6HQZGNERUZLBCR4T/graph.json","events_json":"https://pith.science/api/pith-number/SQ57OHXLLL6HQZGNERUZLBCR4T/events.json","paper":"https://pith.science/paper/SQ57OHXL"},"agent_actions":{"view_html":"https://pith.science/pith/SQ57OHXLLL6HQZGNERUZLBCR4T","download_json":"https://pith.science/pith/SQ57OHXLLL6HQZGNERUZLBCR4T.json","view_paper":"https://pith.science/paper/SQ57OHXL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.00899&json=true","fetch_graph":"https://pith.science/api/pith-number/SQ57OHXLLL6HQZGNERUZLBCR4T/graph.json","fetch_events":"https://pith.science/api/pith-number/SQ57OHXLLL6HQZGNERUZLBCR4T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SQ57OHXLLL6HQZGNERUZLBCR4T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SQ57OHXLLL6HQZGNERUZLBCR4T/action/storage_attestation","attest_author":"https://pith.science/pith/SQ57OHXLLL6HQZGNERUZLBCR4T/action/author_attestation","sign_citation":"https://pith.science/pith/SQ57OHXLLL6HQZGNERUZLBCR4T/action/citation_signature","submit_replication":"https://pith.science/pith/SQ57OHXLLL6HQZGNERUZLBCR4T/action/replication_record"}},"created_at":"2026-05-18T01:21:41.862937+00:00","updated_at":"2026-05-18T01:21:41.862937+00:00"}