{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:DOK63CCPDQ3RO3E3AQ3OCTK4FM","short_pith_number":"pith:DOK63CCP","schema_version":"1.0","canonical_sha256":"1b95ed884f1c37176c9b0436e14d5c2b3d353808e272830fe1087e79dd473933","source":{"kind":"arxiv","id":"1607.05466","version":2},"attestation_state":"computed","paper":{"title":"Laplacian spectral characterization of roses","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Changxiang He, Edwin R. van Dam","submitted_at":"2016-07-19T09:00:49Z","abstract_excerpt":"A rose graph is a graph consisting of cycles that all meet in one vertex. We show that except for two specific examples, these rose graphs are determined by the Laplacian spectrum, thus proving a conjecture posed by Lui and Huang [F.J. Liu and Q.X. Huang, Laplacian spectral characterization of 3-rose graphs, Linear Algebra Appl. 439 (2013), 2914--2920]. We also show that if two rose graphs have a so-called universal Laplacian matrix with the same spectrum, then they must be isomorphic. In memory of Horst Sachs (1927-2016), we show the specific case of the latter result for the adjacency matrix"},"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":"1607.05466","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-19T09:00:49Z","cross_cats_sorted":[],"title_canon_sha256":"00da37d5aaa8b419f771063b5befebc6fe5b42c3bf783406382d63e4358559c2","abstract_canon_sha256":"8c35eb2568b06808c7431d94d18be3da22bbc830eccc9b26c6f5ed54fc2754d3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:57.886800Z","signature_b64":"2djHSkf5gg+b4fClDb0aZoKUd8SOQ2iyKQ8N/eF5Gh8fbK0yHtUW+AlNgAtJf6xaMI1WTUoO9knZbf99iKojAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b95ed884f1c37176c9b0436e14d5c2b3d353808e272830fe1087e79dd473933","last_reissued_at":"2026-05-18T00:34:57.885975Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:57.885975Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Laplacian spectral characterization of roses","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Changxiang He, Edwin R. van Dam","submitted_at":"2016-07-19T09:00:49Z","abstract_excerpt":"A rose graph is a graph consisting of cycles that all meet in one vertex. We show that except for two specific examples, these rose graphs are determined by the Laplacian spectrum, thus proving a conjecture posed by Lui and Huang [F.J. Liu and Q.X. Huang, Laplacian spectral characterization of 3-rose graphs, Linear Algebra Appl. 439 (2013), 2914--2920]. We also show that if two rose graphs have a so-called universal Laplacian matrix with the same spectrum, then they must be isomorphic. In memory of Horst Sachs (1927-2016), we show the specific case of the latter result for the adjacency matrix"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.05466","kind":"arxiv","version":2},"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":"1607.05466","created_at":"2026-05-18T00:34:57.886128+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.05466v2","created_at":"2026-05-18T00:34:57.886128+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.05466","created_at":"2026-05-18T00:34:57.886128+00:00"},{"alias_kind":"pith_short_12","alias_value":"DOK63CCPDQ3R","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"DOK63CCPDQ3RO3E3","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"DOK63CCP","created_at":"2026-05-18T12:30:12.583610+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DOK63CCPDQ3RO3E3AQ3OCTK4FM","json":"https://pith.science/pith/DOK63CCPDQ3RO3E3AQ3OCTK4FM.json","graph_json":"https://pith.science/api/pith-number/DOK63CCPDQ3RO3E3AQ3OCTK4FM/graph.json","events_json":"https://pith.science/api/pith-number/DOK63CCPDQ3RO3E3AQ3OCTK4FM/events.json","paper":"https://pith.science/paper/DOK63CCP"},"agent_actions":{"view_html":"https://pith.science/pith/DOK63CCPDQ3RO3E3AQ3OCTK4FM","download_json":"https://pith.science/pith/DOK63CCPDQ3RO3E3AQ3OCTK4FM.json","view_paper":"https://pith.science/paper/DOK63CCP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.05466&json=true","fetch_graph":"https://pith.science/api/pith-number/DOK63CCPDQ3RO3E3AQ3OCTK4FM/graph.json","fetch_events":"https://pith.science/api/pith-number/DOK63CCPDQ3RO3E3AQ3OCTK4FM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DOK63CCPDQ3RO3E3AQ3OCTK4FM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DOK63CCPDQ3RO3E3AQ3OCTK4FM/action/storage_attestation","attest_author":"https://pith.science/pith/DOK63CCPDQ3RO3E3AQ3OCTK4FM/action/author_attestation","sign_citation":"https://pith.science/pith/DOK63CCPDQ3RO3E3AQ3OCTK4FM/action/citation_signature","submit_replication":"https://pith.science/pith/DOK63CCPDQ3RO3E3AQ3OCTK4FM/action/replication_record"}},"created_at":"2026-05-18T00:34:57.886128+00:00","updated_at":"2026-05-18T00:34:57.886128+00:00"}