{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:R6FNVUBXILINLJ5W7GPERQGWXJ","short_pith_number":"pith:R6FNVUBX","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"},"canonical_sha256":"8f8adad03742d0d5a7b6f99e48c0d6ba7f156132edd02d75392eab75d0997922","source":{"kind":"arxiv","id":"2606.11108","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.11108","created_at":"2026-06-10T01:11:10Z"},{"alias_kind":"arxiv_version","alias_value":"2606.11108v1","created_at":"2026-06-10T01:11:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.11108","created_at":"2026-06-10T01:11:10Z"},{"alias_kind":"pith_short_12","alias_value":"R6FNVUBXILIN","created_at":"2026-06-10T01:11:10Z"},{"alias_kind":"pith_short_16","alias_value":"R6FNVUBXILINLJ5W","created_at":"2026-06-10T01:11:10Z"},{"alias_kind":"pith_short_8","alias_value":"R6FNVUBX","created_at":"2026-06-10T01:11:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:R6FNVUBXILINLJ5W7GPERQGWXJ","target":"record","payload":{"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"},"canonical_sha256":"8f8adad03742d0d5a7b6f99e48c0d6ba7f156132edd02d75392eab75d0997922","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"},"source_kind":"arxiv","source_id":"2606.11108","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-10T01:11:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RSwyuSEb6wRsEaMF2vAKB0jA2ghNzxBHnTC/8vZSZbfTHZGceLFTTFsm8kibnIaZ2U2CB7vKgGrKRcBlNiiZBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T13:51:25.995171Z"},"content_sha256":"6422588e7bb20fa29c99d81ccccd7b81cd0edc116dd5075ef02579a46211a913","schema_version":"1.0","event_id":"sha256:6422588e7bb20fa29c99d81ccccd7b81cd0edc116dd5075ef02579a46211a913"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:R6FNVUBXILINLJ5W7GPERQGWXJ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-10T01:11:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2+vIVMc0yacmYEZyv0MDiJMsT9ySdpZCRvJxBuBu+gBETrjEmz1+X/c6EoYsx9LEMBx0N+CpJ5EPHEEGvSKrBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T13:51:25.995611Z"},"content_sha256":"f64e02cab275621c394dc10c0be3821a68426d2e1df4099964f7a81821a64653","schema_version":"1.0","event_id":"sha256:f64e02cab275621c394dc10c0be3821a68426d2e1df4099964f7a81821a64653"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R6FNVUBXILINLJ5W7GPERQGWXJ/bundle.json","state_url":"https://pith.science/pith/R6FNVUBXILINLJ5W7GPERQGWXJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R6FNVUBXILINLJ5W7GPERQGWXJ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-14T13:51:25Z","links":{"resolver":"https://pith.science/pith/R6FNVUBXILINLJ5W7GPERQGWXJ","bundle":"https://pith.science/pith/R6FNVUBXILINLJ5W7GPERQGWXJ/bundle.json","state":"https://pith.science/pith/R6FNVUBXILINLJ5W7GPERQGWXJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R6FNVUBXILINLJ5W7GPERQGWXJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:R6FNVUBXILINLJ5W7GPERQGWXJ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"8774cc39b8526931c8754b27a641725f4c4ee3bfdfe9fd6bf76fab328f129b11","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-09T17:03:57Z","title_canon_sha256":"3505c59d8214f6ca337e83b7c46ea59b5035c401a7f4b3e33e574963e326abef"},"schema_version":"1.0","source":{"id":"2606.11108","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.11108","created_at":"2026-06-10T01:11:10Z"},{"alias_kind":"arxiv_version","alias_value":"2606.11108v1","created_at":"2026-06-10T01:11:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.11108","created_at":"2026-06-10T01:11:10Z"},{"alias_kind":"pith_short_12","alias_value":"R6FNVUBXILIN","created_at":"2026-06-10T01:11:10Z"},{"alias_kind":"pith_short_16","alias_value":"R6FNVUBXILINLJ5W","created_at":"2026-06-10T01:11:10Z"},{"alias_kind":"pith_short_8","alias_value":"R6FNVUBX","created_at":"2026-06-10T01:11:10Z"}],"graph_snapshots":[{"event_id":"sha256:f64e02cab275621c394dc10c0be3821a68426d2e1df4099964f7a81821a64653","target":"graph","created_at":"2026-06-10T01:11:10Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.11108/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Huiying Zeng, Maximilien Gadouleau","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-09T17:03:57Z","title":"On the maximum and negative frustration indices of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.11108","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:6422588e7bb20fa29c99d81ccccd7b81cd0edc116dd5075ef02579a46211a913","target":"record","created_at":"2026-06-10T01:11:10Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"8774cc39b8526931c8754b27a641725f4c4ee3bfdfe9fd6bf76fab328f129b11","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-09T17:03:57Z","title_canon_sha256":"3505c59d8214f6ca337e83b7c46ea59b5035c401a7f4b3e33e574963e326abef"},"schema_version":"1.0","source":{"id":"2606.11108","kind":"arxiv","version":1}},"canonical_sha256":"8f8adad03742d0d5a7b6f99e48c0d6ba7f156132edd02d75392eab75d0997922","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8f8adad03742d0d5a7b6f99e48c0d6ba7f156132edd02d75392eab75d0997922","first_computed_at":"2026-06-10T01:11:10.698225Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-10T01:11:10.698225Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dx8pbMXov8UA1aZ0KbJpLEGpGuv7iTAwmZq1UDNYnhxzHXLu9/CfvGxYjpCfnpDtRKcU2+KaPPfPcqNZndtjAg==","signature_status":"signed_v1","signed_at":"2026-06-10T01:11:10.699140Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.11108","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6422588e7bb20fa29c99d81ccccd7b81cd0edc116dd5075ef02579a46211a913","sha256:f64e02cab275621c394dc10c0be3821a68426d2e1df4099964f7a81821a64653"],"state_sha256":"0025dfe9a5c680682015074528a3de4ce3a5c0614fe94850f303351f44572475"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EJCwS9ZNRy0BC29+L/Qz3NhEYCVfcWKDxOmGv+dTlkZO/xhHEw3eO6plX616cXh2TNt1EXHN8XichFzqGmFTCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T13:51:25.999353Z","bundle_sha256":"a5f13fca92653059f4a8dfc406deea45e28d22ad217740d43531d704de5101d3"}}