{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:XT65WM7OMASJQZQ3T7VGKMU244","short_pith_number":"pith:XT65WM7O","canonical_record":{"source":{"id":"1307.5411","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-20T12:17:12Z","cross_cats_sorted":[],"title_canon_sha256":"bcefeddcea957b5a421f4bc64508ddee795a01b282c20aa7e7c1308f4c980874","abstract_canon_sha256":"93e7d6c1bfea614a31e35b10ee14f6c6bcd23237b1384d1622677bf488fb0f75"},"schema_version":"1.0"},"canonical_sha256":"bcfddb33ee602498661b9fea65329ae704f52b052a00e0231db240de885304be","source":{"kind":"arxiv","id":"1307.5411","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.5411","created_at":"2026-05-18T03:17:55Z"},{"alias_kind":"arxiv_version","alias_value":"1307.5411v1","created_at":"2026-05-18T03:17:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.5411","created_at":"2026-05-18T03:17:55Z"},{"alias_kind":"pith_short_12","alias_value":"XT65WM7OMASJ","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XT65WM7OMASJQZQ3","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XT65WM7O","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:XT65WM7OMASJQZQ3T7VGKMU244","target":"record","payload":{"canonical_record":{"source":{"id":"1307.5411","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-20T12:17:12Z","cross_cats_sorted":[],"title_canon_sha256":"bcefeddcea957b5a421f4bc64508ddee795a01b282c20aa7e7c1308f4c980874","abstract_canon_sha256":"93e7d6c1bfea614a31e35b10ee14f6c6bcd23237b1384d1622677bf488fb0f75"},"schema_version":"1.0"},"canonical_sha256":"bcfddb33ee602498661b9fea65329ae704f52b052a00e0231db240de885304be","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:55.869024Z","signature_b64":"V1TpuVSoqjzHgHKnGb4s6ops6A7SOb+dYnd5AIOf4+CcK5SHG+Mn265SPOzhrMRA+En35TgrE0jC0GVLOLyqAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bcfddb33ee602498661b9fea65329ae704f52b052a00e0231db240de885304be","last_reissued_at":"2026-05-18T03:17:55.868453Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:55.868453Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.5411","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:17:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/b+QREB9AxoyvNEAOUDdn6Dvk5pkA+XMtFHFmGIYO+SvDeHO0pnQgTIwg7gxoBW3FE9ca3XgtItO+s8qF1dZCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T13:02:09.117055Z"},"content_sha256":"7920f7ef09351b00b8d874688e8bc73f1be8f806b6f9353208d999b11c05560a","schema_version":"1.0","event_id":"sha256:7920f7ef09351b00b8d874688e8bc73f1be8f806b6f9353208d999b11c05560a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:XT65WM7OMASJQZQ3T7VGKMU244","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graphs cospectral with a friendship graph or its complement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alireza Abdollahi, Mohammad Reza Oboudi, Shahrooz Janbaz","submitted_at":"2013-07-20T12:17:12Z","abstract_excerpt":"Let $n$ be any positive integer and let $F_n$ be the friendship (or Dutch windmill) graph with $2n+1$ vertices and $3n$ edges. Here we study graphs with the same adjacency spectrum as the $F_n$. Two graphs are called cospectral if the eigenvalues multiset of their adjacency matrices are the same. Let $G$ be a graph cospectral with $F_n$. Here we prove that if $G$ has no cycle of length 4 or 5, then $G\\cong F_n$. Moreover if $G$ is connected and planar then $G\\cong F_n$. All but one of connected components of $G$ are isomorphic to $K_2$. The complement $\\bar{F_n}$ of the friendship graph is det"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.5411","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:17:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dMeFS4FCoGjMPM500lLP+BdtD8N6Le+WjxfQRmBsd/Uihxo2Ocv0geAXkEETGZMbuLQ45/r2bSLcKYLhlQr5BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T13:02:09.117447Z"},"content_sha256":"e776e9afd99e013f2533a2b6352ed46e3d1511ce592d7a583ce8bae17cfcebe7","schema_version":"1.0","event_id":"sha256:e776e9afd99e013f2533a2b6352ed46e3d1511ce592d7a583ce8bae17cfcebe7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XT65WM7OMASJQZQ3T7VGKMU244/bundle.json","state_url":"https://pith.science/pith/XT65WM7OMASJQZQ3T7VGKMU244/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XT65WM7OMASJQZQ3T7VGKMU244/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-08T13:02:09Z","links":{"resolver":"https://pith.science/pith/XT65WM7OMASJQZQ3T7VGKMU244","bundle":"https://pith.science/pith/XT65WM7OMASJQZQ3T7VGKMU244/bundle.json","state":"https://pith.science/pith/XT65WM7OMASJQZQ3T7VGKMU244/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XT65WM7OMASJQZQ3T7VGKMU244/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:XT65WM7OMASJQZQ3T7VGKMU244","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":"93e7d6c1bfea614a31e35b10ee14f6c6bcd23237b1384d1622677bf488fb0f75","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-20T12:17:12Z","title_canon_sha256":"bcefeddcea957b5a421f4bc64508ddee795a01b282c20aa7e7c1308f4c980874"},"schema_version":"1.0","source":{"id":"1307.5411","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.5411","created_at":"2026-05-18T03:17:55Z"},{"alias_kind":"arxiv_version","alias_value":"1307.5411v1","created_at":"2026-05-18T03:17:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.5411","created_at":"2026-05-18T03:17:55Z"},{"alias_kind":"pith_short_12","alias_value":"XT65WM7OMASJ","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XT65WM7OMASJQZQ3","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XT65WM7O","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:e776e9afd99e013f2533a2b6352ed46e3d1511ce592d7a583ce8bae17cfcebe7","target":"graph","created_at":"2026-05-18T03:17:55Z","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 and let $F_n$ be the friendship (or Dutch windmill) graph with $2n+1$ vertices and $3n$ edges. Here we study graphs with the same adjacency spectrum as the $F_n$. Two graphs are called cospectral if the eigenvalues multiset of their adjacency matrices are the same. Let $G$ be a graph cospectral with $F_n$. Here we prove that if $G$ has no cycle of length 4 or 5, then $G\\cong F_n$. Moreover if $G$ is connected and planar then $G\\cong F_n$. All but one of connected components of $G$ are isomorphic to $K_2$. The complement $\\bar{F_n}$ of the friendship graph is det","authors_text":"Alireza Abdollahi, Mohammad Reza Oboudi, Shahrooz Janbaz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-20T12:17:12Z","title":"Graphs cospectral with a friendship graph or its complement"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.5411","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:7920f7ef09351b00b8d874688e8bc73f1be8f806b6f9353208d999b11c05560a","target":"record","created_at":"2026-05-18T03:17:55Z","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":"93e7d6c1bfea614a31e35b10ee14f6c6bcd23237b1384d1622677bf488fb0f75","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-20T12:17:12Z","title_canon_sha256":"bcefeddcea957b5a421f4bc64508ddee795a01b282c20aa7e7c1308f4c980874"},"schema_version":"1.0","source":{"id":"1307.5411","kind":"arxiv","version":1}},"canonical_sha256":"bcfddb33ee602498661b9fea65329ae704f52b052a00e0231db240de885304be","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bcfddb33ee602498661b9fea65329ae704f52b052a00e0231db240de885304be","first_computed_at":"2026-05-18T03:17:55.868453Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:17:55.868453Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V1TpuVSoqjzHgHKnGb4s6ops6A7SOb+dYnd5AIOf4+CcK5SHG+Mn265SPOzhrMRA+En35TgrE0jC0GVLOLyqAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:17:55.869024Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.5411","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7920f7ef09351b00b8d874688e8bc73f1be8f806b6f9353208d999b11c05560a","sha256:e776e9afd99e013f2533a2b6352ed46e3d1511ce592d7a583ce8bae17cfcebe7"],"state_sha256":"efd30236d44decbcc02583a4e06030ed0481d9ca219d7feaf06057703546ff50"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sw3Fatn+99FCth9wXm+57vqOZw0VbNvs1FW/S28dvTTVu/LZWE4vDP0jVCBW6qUlUNJ8bmPaefqnAX+YQh6eCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T13:02:09.119308Z","bundle_sha256":"aafa47dd8ae6dc8c27e39ad566204a1995d25ec101c9dd566ecdb24cf9283398"}}