{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:G6FSTOQKRA7ZHR5QF7RSAMRZDS","short_pith_number":"pith:G6FSTOQK","schema_version":"1.0","canonical_sha256":"378b29ba0a883f93c7b02fe32032391c8bf90abb7b198f4613c0b724f75ad65a","source":{"kind":"arxiv","id":"1903.11121","version":1},"attestation_state":"computed","paper":{"title":"Laplacian Spectral Determination of Path-Friendship Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"A.R. Ashrafi, A.Z. Abdian, L.W. Beineke, M.R. Oboudi","submitted_at":"2019-03-26T19:16:06Z","abstract_excerpt":"A graph $G$ is said to be determined by the spectrum of its Laplacian matrix (DLS) if every graph with the same spectrum is isomorphic to $G$. van Dam and Haemers (2003) conjectured that almost all graphs have this property, but that is known to be the case only for a very few families. In some recent papers it is proved that the friendship graphs and starlike trees are DLS. If a friendship graph and a starlike tree are joined by merging their vertices of degree greater than 2, then the resulting graph is called a path-friendship graph. In this paper, it is proved that the path-friendship grap"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1903.11121","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-26T19:16:06Z","cross_cats_sorted":[],"title_canon_sha256":"a0c3c18722da51b392a77e0ca0a589761567ad35f7932f3e400469525f8e7b1f","abstract_canon_sha256":"4f34b538a1725a5db2caebbb52445f8f4187953377f6c3a89c623b0bb3b020a8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:04.118823Z","signature_b64":"1CgGFIhHdEsBWB4w6V2EZ+52th8F6lPrFNMdBBr02yJZ2F1R/6qsoPHhvV60Mjx3AtdNI6N++1Lum/5telP0Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"378b29ba0a883f93c7b02fe32032391c8bf90abb7b198f4613c0b724f75ad65a","last_reissued_at":"2026-05-17T23:50:04.118182Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:04.118182Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Laplacian Spectral Determination of Path-Friendship Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"A.R. Ashrafi, A.Z. Abdian, L.W. Beineke, M.R. Oboudi","submitted_at":"2019-03-26T19:16:06Z","abstract_excerpt":"A graph $G$ is said to be determined by the spectrum of its Laplacian matrix (DLS) if every graph with the same spectrum is isomorphic to $G$. van Dam and Haemers (2003) conjectured that almost all graphs have this property, but that is known to be the case only for a very few families. In some recent papers it is proved that the friendship graphs and starlike trees are DLS. If a friendship graph and a starlike tree are joined by merging their vertices of degree greater than 2, then the resulting graph is called a path-friendship graph. In this paper, it is proved that the path-friendship grap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.11121","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1903.11121","created_at":"2026-05-17T23:50:04.118277+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.11121v1","created_at":"2026-05-17T23:50:04.118277+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.11121","created_at":"2026-05-17T23:50:04.118277+00:00"},{"alias_kind":"pith_short_12","alias_value":"G6FSTOQKRA7Z","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"G6FSTOQKRA7ZHR5Q","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"G6FSTOQK","created_at":"2026-05-18T12:33:18.533446+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.07909","citing_title":"No two Jellyfish graphs are L-cospectral and Q-cospectral","ref_index":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/G6FSTOQKRA7ZHR5QF7RSAMRZDS","json":"https://pith.science/pith/G6FSTOQKRA7ZHR5QF7RSAMRZDS.json","graph_json":"https://pith.science/api/pith-number/G6FSTOQKRA7ZHR5QF7RSAMRZDS/graph.json","events_json":"https://pith.science/api/pith-number/G6FSTOQKRA7ZHR5QF7RSAMRZDS/events.json","paper":"https://pith.science/paper/G6FSTOQK"},"agent_actions":{"view_html":"https://pith.science/pith/G6FSTOQKRA7ZHR5QF7RSAMRZDS","download_json":"https://pith.science/pith/G6FSTOQKRA7ZHR5QF7RSAMRZDS.json","view_paper":"https://pith.science/paper/G6FSTOQK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.11121&json=true","fetch_graph":"https://pith.science/api/pith-number/G6FSTOQKRA7ZHR5QF7RSAMRZDS/graph.json","fetch_events":"https://pith.science/api/pith-number/G6FSTOQKRA7ZHR5QF7RSAMRZDS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G6FSTOQKRA7ZHR5QF7RSAMRZDS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G6FSTOQKRA7ZHR5QF7RSAMRZDS/action/storage_attestation","attest_author":"https://pith.science/pith/G6FSTOQKRA7ZHR5QF7RSAMRZDS/action/author_attestation","sign_citation":"https://pith.science/pith/G6FSTOQKRA7ZHR5QF7RSAMRZDS/action/citation_signature","submit_replication":"https://pith.science/pith/G6FSTOQKRA7ZHR5QF7RSAMRZDS/action/replication_record"}},"created_at":"2026-05-17T23:50:04.118277+00:00","updated_at":"2026-05-17T23:50:04.118277+00:00"}