{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:32A5STYGBMJWI7W7NENYJH4OQ3","short_pith_number":"pith:32A5STYG","canonical_record":{"source":{"id":"2605.24668","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-23T17:10:37Z","cross_cats_sorted":[],"title_canon_sha256":"bb070e5d41d039e8e8c37487435c7c6200f2ed71393a89f14b61b4c708db04fa","abstract_canon_sha256":"2bae8710eca0fbcac5b9f4a6346d2c0ffa9eb59e88581e1d616991297a8c0f50"},"schema_version":"1.0"},"canonical_sha256":"de81d94f060b13647edf691b849f8e86febc1ff463ba6346573ce866e8558854","source":{"kind":"arxiv","id":"2605.24668","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.24668","created_at":"2026-05-26T01:03:52Z"},{"alias_kind":"arxiv_version","alias_value":"2605.24668v1","created_at":"2026-05-26T01:03:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.24668","created_at":"2026-05-26T01:03:52Z"},{"alias_kind":"pith_short_12","alias_value":"32A5STYGBMJW","created_at":"2026-05-26T01:03:52Z"},{"alias_kind":"pith_short_16","alias_value":"32A5STYGBMJWI7W7","created_at":"2026-05-26T01:03:52Z"},{"alias_kind":"pith_short_8","alias_value":"32A5STYG","created_at":"2026-05-26T01:03:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:32A5STYGBMJWI7W7NENYJH4OQ3","target":"record","payload":{"canonical_record":{"source":{"id":"2605.24668","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-23T17:10:37Z","cross_cats_sorted":[],"title_canon_sha256":"bb070e5d41d039e8e8c37487435c7c6200f2ed71393a89f14b61b4c708db04fa","abstract_canon_sha256":"2bae8710eca0fbcac5b9f4a6346d2c0ffa9eb59e88581e1d616991297a8c0f50"},"schema_version":"1.0"},"canonical_sha256":"de81d94f060b13647edf691b849f8e86febc1ff463ba6346573ce866e8558854","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T01:03:52.249173Z","signature_b64":"MjQWE0ROOzaaTzYH5k+1D4LrRTUi4KVBPPGlZukWmXmQYujJ4U/hKC5MEgA0ocIY5WV2VJDpEB1ulv/6AW/GAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de81d94f060b13647edf691b849f8e86febc1ff463ba6346573ce866e8558854","last_reissued_at":"2026-05-26T01:03:52.248151Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T01:03:52.248151Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.24668","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-05-26T01:03:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jE0kma0GR+/Y1gVeuKRXu6eDSZLUbdVEL52sxzpGuGmyoMBuVD9wtBqXDA4MdJHth/9NhKfBi2MrpMuvY4drAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T22:28:29.352303Z"},"content_sha256":"740173caeda6352b5fd7a2ae5d169f18d9cefa274001cd8985224742312ba538","schema_version":"1.0","event_id":"sha256:740173caeda6352b5fd7a2ae5d169f18d9cefa274001cd8985224742312ba538"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:32A5STYGBMJWI7W7NENYJH4OQ3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bo Ning, Jing Zeng","submitted_at":"2026-05-23T17:10:37Z","abstract_excerpt":"Let $G$ be a unicyclic graph of order $n$, and let $k$ be the length of the unique cycle of $G$. For the adjacency eigenvalues of $G$, let $s^{+}(G)$ and $s^{-}(G)$ denote the sums of the squares of the positive and negative eigenvalues, respectively. Akbari, Kumar, Mohar, Pragada, and Zhang conjectured that, when $k$ is odd, the value of $k$ modulo $4$ determines which of $s^+(G)$ and $s^-(G)$ is greater than $n$. More precisely, if $k\\equiv 3\\pmod 4$, then $s^+(G)>n>s^-(G)$; if $k\\equiv 1\\pmod 4$, then $s^+(G)<n<s^-(G)$. We confirm this conjecture."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.24668","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/2605.24668/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-05-26T01:03:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cwQqwGzgfLmY+ZitzdcVlMOpl3FK2pgTC40SnzSMnCf+cCjLzwQ/uB8jeKjp7VQWHsMsoOx3+jPBeVLobm4XCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T22:28:29.352687Z"},"content_sha256":"bb499cf1f44062020da1411ea991b556cf0be657545a11f48c90567e9e65bb22","schema_version":"1.0","event_id":"sha256:bb499cf1f44062020da1411ea991b556cf0be657545a11f48c90567e9e65bb22"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/32A5STYGBMJWI7W7NENYJH4OQ3/bundle.json","state_url":"https://pith.science/pith/32A5STYGBMJWI7W7NENYJH4OQ3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/32A5STYGBMJWI7W7NENYJH4OQ3/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-06-01T22:28:29Z","links":{"resolver":"https://pith.science/pith/32A5STYGBMJWI7W7NENYJH4OQ3","bundle":"https://pith.science/pith/32A5STYGBMJWI7W7NENYJH4OQ3/bundle.json","state":"https://pith.science/pith/32A5STYGBMJWI7W7NENYJH4OQ3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/32A5STYGBMJWI7W7NENYJH4OQ3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:32A5STYGBMJWI7W7NENYJH4OQ3","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":"2bae8710eca0fbcac5b9f4a6346d2c0ffa9eb59e88581e1d616991297a8c0f50","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-23T17:10:37Z","title_canon_sha256":"bb070e5d41d039e8e8c37487435c7c6200f2ed71393a89f14b61b4c708db04fa"},"schema_version":"1.0","source":{"id":"2605.24668","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.24668","created_at":"2026-05-26T01:03:52Z"},{"alias_kind":"arxiv_version","alias_value":"2605.24668v1","created_at":"2026-05-26T01:03:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.24668","created_at":"2026-05-26T01:03:52Z"},{"alias_kind":"pith_short_12","alias_value":"32A5STYGBMJW","created_at":"2026-05-26T01:03:52Z"},{"alias_kind":"pith_short_16","alias_value":"32A5STYGBMJWI7W7","created_at":"2026-05-26T01:03:52Z"},{"alias_kind":"pith_short_8","alias_value":"32A5STYG","created_at":"2026-05-26T01:03:52Z"}],"graph_snapshots":[{"event_id":"sha256:bb499cf1f44062020da1411ea991b556cf0be657545a11f48c90567e9e65bb22","target":"graph","created_at":"2026-05-26T01:03:52Z","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/2605.24668/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $G$ be a unicyclic graph of order $n$, and let $k$ be the length of the unique cycle of $G$. For the adjacency eigenvalues of $G$, let $s^{+}(G)$ and $s^{-}(G)$ denote the sums of the squares of the positive and negative eigenvalues, respectively. Akbari, Kumar, Mohar, Pragada, and Zhang conjectured that, when $k$ is odd, the value of $k$ modulo $4$ determines which of $s^+(G)$ and $s^-(G)$ is greater than $n$. More precisely, if $k\\equiv 3\\pmod 4$, then $s^+(G)>n>s^-(G)$; if $k\\equiv 1\\pmod 4$, then $s^+(G)<n<s^-(G)$. We confirm this conjecture.","authors_text":"Bo Ning, Jing Zeng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-23T17:10:37Z","title":"A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.24668","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:740173caeda6352b5fd7a2ae5d169f18d9cefa274001cd8985224742312ba538","target":"record","created_at":"2026-05-26T01:03:52Z","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":"2bae8710eca0fbcac5b9f4a6346d2c0ffa9eb59e88581e1d616991297a8c0f50","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-23T17:10:37Z","title_canon_sha256":"bb070e5d41d039e8e8c37487435c7c6200f2ed71393a89f14b61b4c708db04fa"},"schema_version":"1.0","source":{"id":"2605.24668","kind":"arxiv","version":1}},"canonical_sha256":"de81d94f060b13647edf691b849f8e86febc1ff463ba6346573ce866e8558854","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"de81d94f060b13647edf691b849f8e86febc1ff463ba6346573ce866e8558854","first_computed_at":"2026-05-26T01:03:52.248151Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-26T01:03:52.248151Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MjQWE0ROOzaaTzYH5k+1D4LrRTUi4KVBPPGlZukWmXmQYujJ4U/hKC5MEgA0ocIY5WV2VJDpEB1ulv/6AW/GAg==","signature_status":"signed_v1","signed_at":"2026-05-26T01:03:52.249173Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.24668","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:740173caeda6352b5fd7a2ae5d169f18d9cefa274001cd8985224742312ba538","sha256:bb499cf1f44062020da1411ea991b556cf0be657545a11f48c90567e9e65bb22"],"state_sha256":"f62d2305ba29d1244ab078c4abe846fa78e6758edb383866fdff11ac653546ae"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZbQ52+0H8r1gDEJqpVulaCzcDhXTBRBIfvZOlj23WHE6BjkWA8L3sHKuVF47ZB9/9ez+//sW+lQDyzDPngv1Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T22:28:29.354647Z","bundle_sha256":"436ba52c6dc9d5b98c4566a89ab0798379e7c838783b9d9e09cdbad33065fd96"}}