{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:RYZA2AUSR2DZLI43S4DKMGO4GJ","short_pith_number":"pith:RYZA2AUS","canonical_record":{"source":{"id":"1401.2315","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-10T12:47:40Z","cross_cats_sorted":[],"title_canon_sha256":"b4fa05071f0a60f67ba30f67a14fb8934075ed6a9631dbbf15e18b9a3d48a594","abstract_canon_sha256":"16360005a65ca2415513087d654e2fcbb0db8f618e531223f3171b8039ae473f"},"schema_version":"1.0"},"canonical_sha256":"8e320d02928e8795a39b9706a619dc324405286b8827af48567b116f213a89df","source":{"kind":"arxiv","id":"1401.2315","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.2315","created_at":"2026-05-18T03:02:45Z"},{"alias_kind":"arxiv_version","alias_value":"1401.2315v1","created_at":"2026-05-18T03:02:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.2315","created_at":"2026-05-18T03:02:45Z"},{"alias_kind":"pith_short_12","alias_value":"RYZA2AUSR2DZ","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"RYZA2AUSR2DZLI43","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"RYZA2AUS","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:RYZA2AUSR2DZLI43S4DKMGO4GJ","target":"record","payload":{"canonical_record":{"source":{"id":"1401.2315","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-10T12:47:40Z","cross_cats_sorted":[],"title_canon_sha256":"b4fa05071f0a60f67ba30f67a14fb8934075ed6a9631dbbf15e18b9a3d48a594","abstract_canon_sha256":"16360005a65ca2415513087d654e2fcbb0db8f618e531223f3171b8039ae473f"},"schema_version":"1.0"},"canonical_sha256":"8e320d02928e8795a39b9706a619dc324405286b8827af48567b116f213a89df","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:45.629467Z","signature_b64":"kVN52tsErfxOzZfCDO3lxKmxvp0WOeGu2IYcJwMGmH8cUM6Xl2eBTk3pnIC3LcF/sG/DWNQIxDpYohyyLBe2Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e320d02928e8795a39b9706a619dc324405286b8827af48567b116f213a89df","last_reissued_at":"2026-05-18T03:02:45.628711Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:45.628711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.2315","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-18T03:02:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ofGnlgfLCdJbEABVOmo9TC49lrabH7FSrTcRtX81X+XaoORSvWX3Y7buNhCbwd1nYQ/KKSujyIVuV7juNZLWCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T05:04:00.275688Z"},"content_sha256":"8339e786dc4ec202ea2d107eb8877e44fa37c81c68f4f4413842318352140e29","schema_version":"1.0","event_id":"sha256:8339e786dc4ec202ea2d107eb8877e44fa37c81c68f4f4413842318352140e29"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:RYZA2AUSR2DZLI43S4DKMGO4GJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Connected graphs cospectral with a Friendship graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alireza Abdollahi, Shahrooz Janbaz","submitted_at":"2014-01-10T12:47:40Z","abstract_excerpt":"Let $n$ be any positive integer, the friendship graph $F_n$ consist of $n$ edge-disjoint triangles that all of them meeting in one vertex. A graph $G$ is called cospectral with a graph $H$ if their adjacency matrices have the same eigenvalues. Recently in [http://arxiv.org/pdf/1310.6529v1.pdf] it is proved that if $G$ is any graph cospectral with $F_n$ $(n\\neq 16)$, then $G\\cong F_n$. In this note, we give a proof of special case of the latter: Any connected graph cospectral with $F_n$ is isomorphic to $F_n$. Our proof is independent of ones given in [http://arxiv.org/pdf/1310.6529v1.pdf] and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.2315","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":""},"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-18T03:02:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uNbN/Oikk2wiDBUCbL05boQnyGj+Tp4gC1h39/XbRiee3JYDvPrW65ebzY04io48hRVTlO7iTLduKcRGbqqTCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T05:04:00.276075Z"},"content_sha256":"095600d4a34af88dcd9943a833005f9bbd99c0b6a6872c9bb6e29d41a8ade579","schema_version":"1.0","event_id":"sha256:095600d4a34af88dcd9943a833005f9bbd99c0b6a6872c9bb6e29d41a8ade579"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RYZA2AUSR2DZLI43S4DKMGO4GJ/bundle.json","state_url":"https://pith.science/pith/RYZA2AUSR2DZLI43S4DKMGO4GJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RYZA2AUSR2DZLI43S4DKMGO4GJ/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-09T05:04:00Z","links":{"resolver":"https://pith.science/pith/RYZA2AUSR2DZLI43S4DKMGO4GJ","bundle":"https://pith.science/pith/RYZA2AUSR2DZLI43S4DKMGO4GJ/bundle.json","state":"https://pith.science/pith/RYZA2AUSR2DZLI43S4DKMGO4GJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RYZA2AUSR2DZLI43S4DKMGO4GJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:RYZA2AUSR2DZLI43S4DKMGO4GJ","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":"16360005a65ca2415513087d654e2fcbb0db8f618e531223f3171b8039ae473f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-10T12:47:40Z","title_canon_sha256":"b4fa05071f0a60f67ba30f67a14fb8934075ed6a9631dbbf15e18b9a3d48a594"},"schema_version":"1.0","source":{"id":"1401.2315","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.2315","created_at":"2026-05-18T03:02:45Z"},{"alias_kind":"arxiv_version","alias_value":"1401.2315v1","created_at":"2026-05-18T03:02:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.2315","created_at":"2026-05-18T03:02:45Z"},{"alias_kind":"pith_short_12","alias_value":"RYZA2AUSR2DZ","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"RYZA2AUSR2DZLI43","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"RYZA2AUS","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:095600d4a34af88dcd9943a833005f9bbd99c0b6a6872c9bb6e29d41a8ade579","target":"graph","created_at":"2026-05-18T03:02:45Z","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"},"paper":{"abstract_excerpt":"Let $n$ be any positive integer, the friendship graph $F_n$ consist of $n$ edge-disjoint triangles that all of them meeting in one vertex. A graph $G$ is called cospectral with a graph $H$ if their adjacency matrices have the same eigenvalues. Recently in [http://arxiv.org/pdf/1310.6529v1.pdf] it is proved that if $G$ is any graph cospectral with $F_n$ $(n\\neq 16)$, then $G\\cong F_n$. In this note, we give a proof of special case of the latter: Any connected graph cospectral with $F_n$ is isomorphic to $F_n$. Our proof is independent of ones given in [http://arxiv.org/pdf/1310.6529v1.pdf] and ","authors_text":"Alireza Abdollahi, Shahrooz Janbaz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-10T12:47:40Z","title":"Connected graphs cospectral with a Friendship graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.2315","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:8339e786dc4ec202ea2d107eb8877e44fa37c81c68f4f4413842318352140e29","target":"record","created_at":"2026-05-18T03:02:45Z","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":"16360005a65ca2415513087d654e2fcbb0db8f618e531223f3171b8039ae473f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-10T12:47:40Z","title_canon_sha256":"b4fa05071f0a60f67ba30f67a14fb8934075ed6a9631dbbf15e18b9a3d48a594"},"schema_version":"1.0","source":{"id":"1401.2315","kind":"arxiv","version":1}},"canonical_sha256":"8e320d02928e8795a39b9706a619dc324405286b8827af48567b116f213a89df","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8e320d02928e8795a39b9706a619dc324405286b8827af48567b116f213a89df","first_computed_at":"2026-05-18T03:02:45.628711Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:02:45.628711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kVN52tsErfxOzZfCDO3lxKmxvp0WOeGu2IYcJwMGmH8cUM6Xl2eBTk3pnIC3LcF/sG/DWNQIxDpYohyyLBe2Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T03:02:45.629467Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.2315","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8339e786dc4ec202ea2d107eb8877e44fa37c81c68f4f4413842318352140e29","sha256:095600d4a34af88dcd9943a833005f9bbd99c0b6a6872c9bb6e29d41a8ade579"],"state_sha256":"273d5caf11652261c08f57d89cb8b539e3822496a194ecc53a84b6543ebbbf79"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kpjPCnGfyfRMTdUYTaxx2Nu+uT67cbGOw9gLFJVhpz22dIPJZiDKl0Wp8qaiINXRxV+o91ow+7KcXeYZ+rD2Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T05:04:00.279830Z","bundle_sha256":"79fdebb4346a4fd9f5b8b25009cd8b74bbd7bde8bdd46b3c44914de9c5313af9"}}