{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:VIN63GJ2Q25IVMMZBRW3R33YH3","short_pith_number":"pith:VIN63GJ2","canonical_record":{"source":{"id":"2409.01923","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-09-03T14:13:12Z","cross_cats_sorted":[],"title_canon_sha256":"66394c08f57826d48b73d01f2401728e03b4279b385ea64cc1a1c9a966b5fdd5","abstract_canon_sha256":"4f35c4122e4edb9a836d0ce34f61581872c7bd34a38bdb00def601b61f524789"},"schema_version":"1.0"},"canonical_sha256":"aa1bed993a86ba8ab1990c6db8ef783ec52c4508a13ca75af7c24e5c1cfde966","source":{"kind":"arxiv","id":"2409.01923","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.01923","created_at":"2026-07-05T09:02:36Z"},{"alias_kind":"arxiv_version","alias_value":"2409.01923v1","created_at":"2026-07-05T09:02:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.01923","created_at":"2026-07-05T09:02:36Z"},{"alias_kind":"pith_short_12","alias_value":"VIN63GJ2Q25I","created_at":"2026-07-05T09:02:36Z"},{"alias_kind":"pith_short_16","alias_value":"VIN63GJ2Q25IVMMZ","created_at":"2026-07-05T09:02:36Z"},{"alias_kind":"pith_short_8","alias_value":"VIN63GJ2","created_at":"2026-07-05T09:02:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:VIN63GJ2Q25IVMMZBRW3R33YH3","target":"record","payload":{"canonical_record":{"source":{"id":"2409.01923","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-09-03T14:13:12Z","cross_cats_sorted":[],"title_canon_sha256":"66394c08f57826d48b73d01f2401728e03b4279b385ea64cc1a1c9a966b5fdd5","abstract_canon_sha256":"4f35c4122e4edb9a836d0ce34f61581872c7bd34a38bdb00def601b61f524789"},"schema_version":"1.0"},"canonical_sha256":"aa1bed993a86ba8ab1990c6db8ef783ec52c4508a13ca75af7c24e5c1cfde966","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:02:36.072722Z","signature_b64":"JNR3RyBrYaeMP3R5VGyjrfMidtGsZezsO5P7BUAm9RfaYKxqdPgBlDN9/QNH5T+9AjSUzueWmHDf3OdY6GUSDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa1bed993a86ba8ab1990c6db8ef783ec52c4508a13ca75af7c24e5c1cfde966","last_reissued_at":"2026-07-05T09:02:36.072120Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:02:36.072120Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2409.01923","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-07-05T09:02:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+w4jx6f/14e/21rLrxOs0f0s+tYb6I2KbooFT8jEwMoUHr3Acr4oiRxT66hjVid/p6Q1vi3G5uSpSb6KEMD8CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T12:37:34.079534Z"},"content_sha256":"df8bda3e204c49c01e7a962602b32fb56d766336abde635b3be06db4a414a7e2","schema_version":"1.0","event_id":"sha256:df8bda3e204c49c01e7a962602b32fb56d766336abde635b3be06db4a414a7e2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:VIN63GJ2Q25IVMMZBRW3R33YH3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The maximum index of signed complete graphs whose negative edges induce a bicyclic graph","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fan Chen, Xiying Yuan, Ziyi Fang","submitted_at":"2024-09-03T14:13:12Z","abstract_excerpt":"Let $\\Gamma=(K_n,H)$ be a signed complete graph whose negative edges induce a subgraph $H$. Let $A(\\Gamma)$ be the adjacency matrix of the signed graph $\\Gamma$. The largest eigenvalue of $A(\\Gamma)$ is called the index of $\\Gamma$. In this paper, the index of all the signed complete graphs whose negative edges induce a bicyclic graph $B$ is investigated. Specifically, the structure of the bicyclic graph $B$ such that $\\Gamma=(K_n,B)$ has the maximum index is determined."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.01923","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/2409.01923/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-07-05T09:02:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vol4fDG4TssAsy/EwtP+x+2n6xnWe0v6oi6vt7thZUgLhIVajMfkyBgxC/4COkTzcvO/NHIxsuEUNBTnPW7SBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T12:37:34.080180Z"},"content_sha256":"3243f978f9a420b63251e3cc91766df44bc1e7b2517f93443af620125cadf67f","schema_version":"1.0","event_id":"sha256:3243f978f9a420b63251e3cc91766df44bc1e7b2517f93443af620125cadf67f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VIN63GJ2Q25IVMMZBRW3R33YH3/bundle.json","state_url":"https://pith.science/pith/VIN63GJ2Q25IVMMZBRW3R33YH3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VIN63GJ2Q25IVMMZBRW3R33YH3/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-05T12:37:34Z","links":{"resolver":"https://pith.science/pith/VIN63GJ2Q25IVMMZBRW3R33YH3","bundle":"https://pith.science/pith/VIN63GJ2Q25IVMMZBRW3R33YH3/bundle.json","state":"https://pith.science/pith/VIN63GJ2Q25IVMMZBRW3R33YH3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VIN63GJ2Q25IVMMZBRW3R33YH3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:VIN63GJ2Q25IVMMZBRW3R33YH3","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":"4f35c4122e4edb9a836d0ce34f61581872c7bd34a38bdb00def601b61f524789","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-09-03T14:13:12Z","title_canon_sha256":"66394c08f57826d48b73d01f2401728e03b4279b385ea64cc1a1c9a966b5fdd5"},"schema_version":"1.0","source":{"id":"2409.01923","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.01923","created_at":"2026-07-05T09:02:36Z"},{"alias_kind":"arxiv_version","alias_value":"2409.01923v1","created_at":"2026-07-05T09:02:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.01923","created_at":"2026-07-05T09:02:36Z"},{"alias_kind":"pith_short_12","alias_value":"VIN63GJ2Q25I","created_at":"2026-07-05T09:02:36Z"},{"alias_kind":"pith_short_16","alias_value":"VIN63GJ2Q25IVMMZ","created_at":"2026-07-05T09:02:36Z"},{"alias_kind":"pith_short_8","alias_value":"VIN63GJ2","created_at":"2026-07-05T09:02:36Z"}],"graph_snapshots":[{"event_id":"sha256:3243f978f9a420b63251e3cc91766df44bc1e7b2517f93443af620125cadf67f","target":"graph","created_at":"2026-07-05T09:02:36Z","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/2409.01923/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $\\Gamma=(K_n,H)$ be a signed complete graph whose negative edges induce a subgraph $H$. Let $A(\\Gamma)$ be the adjacency matrix of the signed graph $\\Gamma$. The largest eigenvalue of $A(\\Gamma)$ is called the index of $\\Gamma$. In this paper, the index of all the signed complete graphs whose negative edges induce a bicyclic graph $B$ is investigated. Specifically, the structure of the bicyclic graph $B$ such that $\\Gamma=(K_n,B)$ has the maximum index is determined.","authors_text":"Fan Chen, Xiying Yuan, Ziyi Fang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-09-03T14:13:12Z","title":"The maximum index of signed complete graphs whose negative edges induce a bicyclic graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.01923","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:df8bda3e204c49c01e7a962602b32fb56d766336abde635b3be06db4a414a7e2","target":"record","created_at":"2026-07-05T09:02:36Z","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":"4f35c4122e4edb9a836d0ce34f61581872c7bd34a38bdb00def601b61f524789","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-09-03T14:13:12Z","title_canon_sha256":"66394c08f57826d48b73d01f2401728e03b4279b385ea64cc1a1c9a966b5fdd5"},"schema_version":"1.0","source":{"id":"2409.01923","kind":"arxiv","version":1}},"canonical_sha256":"aa1bed993a86ba8ab1990c6db8ef783ec52c4508a13ca75af7c24e5c1cfde966","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aa1bed993a86ba8ab1990c6db8ef783ec52c4508a13ca75af7c24e5c1cfde966","first_computed_at":"2026-07-05T09:02:36.072120Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:02:36.072120Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JNR3RyBrYaeMP3R5VGyjrfMidtGsZezsO5P7BUAm9RfaYKxqdPgBlDN9/QNH5T+9AjSUzueWmHDf3OdY6GUSDg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:02:36.072722Z","signed_message":"canonical_sha256_bytes"},"source_id":"2409.01923","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:df8bda3e204c49c01e7a962602b32fb56d766336abde635b3be06db4a414a7e2","sha256:3243f978f9a420b63251e3cc91766df44bc1e7b2517f93443af620125cadf67f"],"state_sha256":"641718ac8a178694b0dcb8a4eec5974c9f2bf3605e3605b76ba318152a43420b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/yG3ePW7oWafGy0BD42nGr2JhCIIswJ3VHvvWrKJyraPDwpt4votY1opz6+VEAfQN5hKflR9lGvDCyuQh5kxBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T12:37:34.085560Z","bundle_sha256":"33c0b5811aecdd1553560a26db4ec054945511961ba61fa5b3fcb49265c48444"}}