{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:G6FSTOQKRA7ZHR5QF7RSAMRZDS","short_pith_number":"pith:G6FSTOQK","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"},"canonical_sha256":"378b29ba0a883f93c7b02fe32032391c8bf90abb7b198f4613c0b724f75ad65a","source":{"kind":"arxiv","id":"1903.11121","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.11121","created_at":"2026-05-17T23:50:04Z"},{"alias_kind":"arxiv_version","alias_value":"1903.11121v1","created_at":"2026-05-17T23:50:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.11121","created_at":"2026-05-17T23:50:04Z"},{"alias_kind":"pith_short_12","alias_value":"G6FSTOQKRA7Z","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"G6FSTOQKRA7ZHR5Q","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"G6FSTOQK","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:G6FSTOQKRA7ZHR5QF7RSAMRZDS","target":"record","payload":{"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"},"canonical_sha256":"378b29ba0a883f93c7b02fe32032391c8bf90abb7b198f4613c0b724f75ad65a","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"},"source_kind":"arxiv","source_id":"1903.11121","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-17T23:50:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qyRFGJ6j68VC0BLeMr0ZD4th+6JsjHLmH6U/B+Xe28tLk2nlXsAubK99xYRcDcsSVzwcd0PZoBLUj7TfEzlwCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T09:55:45.565610Z"},"content_sha256":"077adf155d9a873254dae989212740df9086b4a4a5e7eda3581ebe75274d1f9f","schema_version":"1.0","event_id":"sha256:077adf155d9a873254dae989212740df9086b4a4a5e7eda3581ebe75274d1f9f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:G6FSTOQKRA7ZHR5QF7RSAMRZDS","target":"graph","payload":{"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"},"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-17T23:50:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PIL4EQW4K0gYB2y9twoE9+Yk1cmrSx2sTUMkHgvRIO5GwNONFB3qUXTV5I0UGyLQsjJUNx/F0MTKHHT/Ggf1AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T09:55:45.566104Z"},"content_sha256":"14e7e0a09aabbfee966e132222d176f78baf23e2b5859ab30a9c351714149847","schema_version":"1.0","event_id":"sha256:14e7e0a09aabbfee966e132222d176f78baf23e2b5859ab30a9c351714149847"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G6FSTOQKRA7ZHR5QF7RSAMRZDS/bundle.json","state_url":"https://pith.science/pith/G6FSTOQKRA7ZHR5QF7RSAMRZDS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G6FSTOQKRA7ZHR5QF7RSAMRZDS/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-16T09:55:45Z","links":{"resolver":"https://pith.science/pith/G6FSTOQKRA7ZHR5QF7RSAMRZDS","bundle":"https://pith.science/pith/G6FSTOQKRA7ZHR5QF7RSAMRZDS/bundle.json","state":"https://pith.science/pith/G6FSTOQKRA7ZHR5QF7RSAMRZDS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G6FSTOQKRA7ZHR5QF7RSAMRZDS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:G6FSTOQKRA7ZHR5QF7RSAMRZDS","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":"4f34b538a1725a5db2caebbb52445f8f4187953377f6c3a89c623b0bb3b020a8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-26T19:16:06Z","title_canon_sha256":"a0c3c18722da51b392a77e0ca0a589761567ad35f7932f3e400469525f8e7b1f"},"schema_version":"1.0","source":{"id":"1903.11121","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.11121","created_at":"2026-05-17T23:50:04Z"},{"alias_kind":"arxiv_version","alias_value":"1903.11121v1","created_at":"2026-05-17T23:50:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.11121","created_at":"2026-05-17T23:50:04Z"},{"alias_kind":"pith_short_12","alias_value":"G6FSTOQKRA7Z","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"G6FSTOQKRA7ZHR5Q","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"G6FSTOQK","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:14e7e0a09aabbfee966e132222d176f78baf23e2b5859ab30a9c351714149847","target":"graph","created_at":"2026-05-17T23:50:04Z","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":"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","authors_text":"A.R. Ashrafi, A.Z. Abdian, L.W. Beineke, M.R. Oboudi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-26T19:16:06Z","title":"Laplacian Spectral Determination of Path-Friendship Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.11121","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:077adf155d9a873254dae989212740df9086b4a4a5e7eda3581ebe75274d1f9f","target":"record","created_at":"2026-05-17T23:50:04Z","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":"4f34b538a1725a5db2caebbb52445f8f4187953377f6c3a89c623b0bb3b020a8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-26T19:16:06Z","title_canon_sha256":"a0c3c18722da51b392a77e0ca0a589761567ad35f7932f3e400469525f8e7b1f"},"schema_version":"1.0","source":{"id":"1903.11121","kind":"arxiv","version":1}},"canonical_sha256":"378b29ba0a883f93c7b02fe32032391c8bf90abb7b198f4613c0b724f75ad65a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"378b29ba0a883f93c7b02fe32032391c8bf90abb7b198f4613c0b724f75ad65a","first_computed_at":"2026-05-17T23:50:04.118182Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:50:04.118182Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1CgGFIhHdEsBWB4w6V2EZ+52th8F6lPrFNMdBBr02yJZ2F1R/6qsoPHhvV60Mjx3AtdNI6N++1Lum/5telP0Cg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:50:04.118823Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.11121","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:077adf155d9a873254dae989212740df9086b4a4a5e7eda3581ebe75274d1f9f","sha256:14e7e0a09aabbfee966e132222d176f78baf23e2b5859ab30a9c351714149847"],"state_sha256":"25d72193ce85e50f607291c1a0b8ffc45434d1036e79e2e7e908e4a16ae4de6c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cLFFpKC2S2dB0CJ5NfhRQBe3wvVedklZL/pFTLuQKFc1ecIh2yWtCFEPcUzxOiPk3D1dwyVVudmjagPnfQcFCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T09:55:45.570184Z","bundle_sha256":"470c4b6ebf4edcfec09f8fa3e5499506199e7b9f8868f76c8ccaf5a894bb0fc2"}}