{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:R6FNVUBXILINLJ5W7GPERQGWXJ","short_pith_number":"pith:R6FNVUBX","schema_version":"1.0","canonical_sha256":"8f8adad03742d0d5a7b6f99e48c0d6ba7f156132edd02d75392eab75d0997922","source":{"kind":"arxiv","id":"2606.11108","version":1},"attestation_state":"computed","paper":{"title":"On the maximum and negative frustration indices of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Huiying Zeng, Maximilien Gadouleau","submitted_at":"2026-06-09T17:03:57Z","abstract_excerpt":"A signed graph is a graph with signatures ($+1$ or $-1$) on its edges. A cycle is called positive if the product of its edge signatures is positive, and a signed graph is called balanced if each cycle in it is positive. The frustration index is the minimum number of edges whose deletion makes the signed graph balanced, which is considered to be a measurement of the imbalance of the signed graph. In this paper, we compare the frustration index of the all-negative signature with the maximum frustration index of all possible signatures on the unsigned graph. We classify some families of graphs in"},"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":"2606.11108","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-09T17:03:57Z","cross_cats_sorted":[],"title_canon_sha256":"3505c59d8214f6ca337e83b7c46ea59b5035c401a7f4b3e33e574963e326abef","abstract_canon_sha256":"8774cc39b8526931c8754b27a641725f4c4ee3bfdfe9fd6bf76fab328f129b11"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-10T01:11:10.699140Z","signature_b64":"dx8pbMXov8UA1aZ0KbJpLEGpGuv7iTAwmZq1UDNYnhxzHXLu9/CfvGxYjpCfnpDtRKcU2+KaPPfPcqNZndtjAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f8adad03742d0d5a7b6f99e48c0d6ba7f156132edd02d75392eab75d0997922","last_reissued_at":"2026-06-10T01:11:10.698225Z","signature_status":"signed_v1","first_computed_at":"2026-06-10T01:11:10.698225Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the maximum and negative frustration indices of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Huiying Zeng, Maximilien Gadouleau","submitted_at":"2026-06-09T17:03:57Z","abstract_excerpt":"A signed graph is a graph with signatures ($+1$ or $-1$) on its edges. A cycle is called positive if the product of its edge signatures is positive, and a signed graph is called balanced if each cycle in it is positive. The frustration index is the minimum number of edges whose deletion makes the signed graph balanced, which is considered to be a measurement of the imbalance of the signed graph. In this paper, we compare the frustration index of the all-negative signature with the maximum frustration index of all possible signatures on the unsigned graph. We classify some families of graphs in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.11108","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.11108/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2606.11108","created_at":"2026-06-10T01:11:10.698388+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.11108v1","created_at":"2026-06-10T01:11:10.698388+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.11108","created_at":"2026-06-10T01:11:10.698388+00:00"},{"alias_kind":"pith_short_12","alias_value":"R6FNVUBXILIN","created_at":"2026-06-10T01:11:10.698388+00:00"},{"alias_kind":"pith_short_16","alias_value":"R6FNVUBXILINLJ5W","created_at":"2026-06-10T01:11:10.698388+00:00"},{"alias_kind":"pith_short_8","alias_value":"R6FNVUBX","created_at":"2026-06-10T01:11:10.698388+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/R6FNVUBXILINLJ5W7GPERQGWXJ","json":"https://pith.science/pith/R6FNVUBXILINLJ5W7GPERQGWXJ.json","graph_json":"https://pith.science/api/pith-number/R6FNVUBXILINLJ5W7GPERQGWXJ/graph.json","events_json":"https://pith.science/api/pith-number/R6FNVUBXILINLJ5W7GPERQGWXJ/events.json","paper":"https://pith.science/paper/R6FNVUBX"},"agent_actions":{"view_html":"https://pith.science/pith/R6FNVUBXILINLJ5W7GPERQGWXJ","download_json":"https://pith.science/pith/R6FNVUBXILINLJ5W7GPERQGWXJ.json","view_paper":"https://pith.science/paper/R6FNVUBX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.11108&json=true","fetch_graph":"https://pith.science/api/pith-number/R6FNVUBXILINLJ5W7GPERQGWXJ/graph.json","fetch_events":"https://pith.science/api/pith-number/R6FNVUBXILINLJ5W7GPERQGWXJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R6FNVUBXILINLJ5W7GPERQGWXJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R6FNVUBXILINLJ5W7GPERQGWXJ/action/storage_attestation","attest_author":"https://pith.science/pith/R6FNVUBXILINLJ5W7GPERQGWXJ/action/author_attestation","sign_citation":"https://pith.science/pith/R6FNVUBXILINLJ5W7GPERQGWXJ/action/citation_signature","submit_replication":"https://pith.science/pith/R6FNVUBXILINLJ5W7GPERQGWXJ/action/replication_record"}},"created_at":"2026-06-10T01:11:10.698388+00:00","updated_at":"2026-06-10T01:11:10.698388+00:00"}