{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:H6GVN7YMWXC7EP3W4MQT5MJOM3","short_pith_number":"pith:H6GVN7YM","schema_version":"1.0","canonical_sha256":"3f8d56ff0cb5c5f23f76e3213eb12e66c8a681671d9568479762c8cd824f165f","source":{"kind":"arxiv","id":"1710.09876","version":3},"attestation_state":"computed","paper":{"title":"Computing the Line Index of Balance Using Integer Programming Optimisation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.SI","authors_text":"Andrew J. Mason, Mark C. Wilson, Samin Aref","submitted_at":"2017-10-26T19:09:57Z","abstract_excerpt":"An important measure of signed graphs is the line index of balance which has several applications in many fields. However, this graph-theoretic measure was underused for decades because of the inherent complexity in its computation which is closely related to solving NP-hard graph optimisation problems like MAXCUT. We develop new quadratic and linear programming models to compute the line index of balance exactly. Using the Gurobi integer programming optimisation solver, we evaluate the line index of balance on real-world and synthetic datasets. The synthetic data involves Erd\\H{o}s-R\\'{e}nyi "},"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":"1710.09876","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-10-26T19:09:57Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"1cb60de7855e9ba721270b3fa4c9923cdcdf5791a366f56166c93a96fb8411af","abstract_canon_sha256":"a97e862c2b86f66197675d25c9de1c88c6bb0aef6171c7f27ee50e13c3528dad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:09.679334Z","signature_b64":"GeMtOM8tRFUu9FkvFUGjGxsrum67/pm01nmsNC2cXs4KirMVEH6RHgQ6dHdbu5S5ZRO2L/ebVR6z9uTGTqjECQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f8d56ff0cb5c5f23f76e3213eb12e66c8a681671d9568479762c8cd824f165f","last_reissued_at":"2026-05-18T00:24:09.678651Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:09.678651Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing the Line Index of Balance Using Integer Programming Optimisation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.SI","authors_text":"Andrew J. Mason, Mark C. Wilson, Samin Aref","submitted_at":"2017-10-26T19:09:57Z","abstract_excerpt":"An important measure of signed graphs is the line index of balance which has several applications in many fields. However, this graph-theoretic measure was underused for decades because of the inherent complexity in its computation which is closely related to solving NP-hard graph optimisation problems like MAXCUT. We develop new quadratic and linear programming models to compute the line index of balance exactly. Using the Gurobi integer programming optimisation solver, we evaluate the line index of balance on real-world and synthetic datasets. The synthetic data involves Erd\\H{o}s-R\\'{e}nyi "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.09876","kind":"arxiv","version":3},"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":"1710.09876","created_at":"2026-05-18T00:24:09.678760+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.09876v3","created_at":"2026-05-18T00:24:09.678760+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.09876","created_at":"2026-05-18T00:24:09.678760+00:00"},{"alias_kind":"pith_short_12","alias_value":"H6GVN7YMWXC7","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"H6GVN7YMWXC7EP3W","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"H6GVN7YM","created_at":"2026-05-18T12:31:18.294218+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/H6GVN7YMWXC7EP3W4MQT5MJOM3","json":"https://pith.science/pith/H6GVN7YMWXC7EP3W4MQT5MJOM3.json","graph_json":"https://pith.science/api/pith-number/H6GVN7YMWXC7EP3W4MQT5MJOM3/graph.json","events_json":"https://pith.science/api/pith-number/H6GVN7YMWXC7EP3W4MQT5MJOM3/events.json","paper":"https://pith.science/paper/H6GVN7YM"},"agent_actions":{"view_html":"https://pith.science/pith/H6GVN7YMWXC7EP3W4MQT5MJOM3","download_json":"https://pith.science/pith/H6GVN7YMWXC7EP3W4MQT5MJOM3.json","view_paper":"https://pith.science/paper/H6GVN7YM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.09876&json=true","fetch_graph":"https://pith.science/api/pith-number/H6GVN7YMWXC7EP3W4MQT5MJOM3/graph.json","fetch_events":"https://pith.science/api/pith-number/H6GVN7YMWXC7EP3W4MQT5MJOM3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H6GVN7YMWXC7EP3W4MQT5MJOM3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H6GVN7YMWXC7EP3W4MQT5MJOM3/action/storage_attestation","attest_author":"https://pith.science/pith/H6GVN7YMWXC7EP3W4MQT5MJOM3/action/author_attestation","sign_citation":"https://pith.science/pith/H6GVN7YMWXC7EP3W4MQT5MJOM3/action/citation_signature","submit_replication":"https://pith.science/pith/H6GVN7YMWXC7EP3W4MQT5MJOM3/action/replication_record"}},"created_at":"2026-05-18T00:24:09.678760+00:00","updated_at":"2026-05-18T00:24:09.678760+00:00"}