{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:2YBV32HYUGPYA2PVVAOHJDYGOO","short_pith_number":"pith:2YBV32HY","schema_version":"1.0","canonical_sha256":"d6035de8f8a19f8069f5a81c748f0673aefc50a07e37689f986b1910c0916486","source":{"kind":"arxiv","id":"1503.07842","version":1},"attestation_state":"computed","paper":{"title":"Resistance distances in corona and neighborhood corona graphs with Laplacian generalized inverse approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.SP"],"primary_cat":"math.CO","authors_text":"Fu-Tao Hu, Jia-Bao Liu, Xiang-Feng Pan","submitted_at":"2015-03-18T12:43:42Z","abstract_excerpt":"Let $G_1$ and $G_2$ be two graphs on disjoint sets of $n_1$ and $n_2$ vertices, respectively. The corona of graphs $G_1$ and $G_2$, denoted by $G_1\\circ G_2$, is the graph formed from one copy of $G_1$ and $n_1$ copies of $G_2$ where the $i$-th vertex of $G_1$ is adjacent to every vertex in the $i$-th copy of $G_2$. The neighborhood corona of $G_1$ and $G_2$, denoted by $G_1\\diamond G_2$, is the graph obtained by taking one copy of $G_1$ and $n_1$ copies of $G_2$ and joining every neighbor of the $i$-th vertex of $G_1$ to every vertex in the $i$-th copy of $G_2$ by a new edge. In this paper, t"},"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":"1503.07842","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-18T12:43:42Z","cross_cats_sorted":["math.SP"],"title_canon_sha256":"b68e56a99d045425b9d30cdb32aa6d86e5f5b90b6fc2321c7c041b17de20dd2e","abstract_canon_sha256":"e3c212d791f0a38c783f57991f1c77776778f43a9dc74c1653a14c248950d1dc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:18.585617Z","signature_b64":"wl8FdaxKSU6/9lTMBlGfVP3Mu3zHRZodRZEi0pQSrJr2nowG9PnAs25gnuR6Xw0DmXD/ylYandmaUYBg4l5MCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d6035de8f8a19f8069f5a81c748f0673aefc50a07e37689f986b1910c0916486","last_reissued_at":"2026-05-18T02:20:18.585009Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:18.585009Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Resistance distances in corona and neighborhood corona graphs with Laplacian generalized inverse approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.SP"],"primary_cat":"math.CO","authors_text":"Fu-Tao Hu, Jia-Bao Liu, Xiang-Feng Pan","submitted_at":"2015-03-18T12:43:42Z","abstract_excerpt":"Let $G_1$ and $G_2$ be two graphs on disjoint sets of $n_1$ and $n_2$ vertices, respectively. The corona of graphs $G_1$ and $G_2$, denoted by $G_1\\circ G_2$, is the graph formed from one copy of $G_1$ and $n_1$ copies of $G_2$ where the $i$-th vertex of $G_1$ is adjacent to every vertex in the $i$-th copy of $G_2$. The neighborhood corona of $G_1$ and $G_2$, denoted by $G_1\\diamond G_2$, is the graph obtained by taking one copy of $G_1$ and $n_1$ copies of $G_2$ and joining every neighbor of the $i$-th vertex of $G_1$ to every vertex in the $i$-th copy of $G_2$ by a new edge. In this paper, t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.07842","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":"1503.07842","created_at":"2026-05-18T02:20:18.585094+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.07842v1","created_at":"2026-05-18T02:20:18.585094+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.07842","created_at":"2026-05-18T02:20:18.585094+00:00"},{"alias_kind":"pith_short_12","alias_value":"2YBV32HYUGPY","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"2YBV32HYUGPYA2PV","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"2YBV32HY","created_at":"2026-05-18T12:29:02.477457+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/2YBV32HYUGPYA2PVVAOHJDYGOO","json":"https://pith.science/pith/2YBV32HYUGPYA2PVVAOHJDYGOO.json","graph_json":"https://pith.science/api/pith-number/2YBV32HYUGPYA2PVVAOHJDYGOO/graph.json","events_json":"https://pith.science/api/pith-number/2YBV32HYUGPYA2PVVAOHJDYGOO/events.json","paper":"https://pith.science/paper/2YBV32HY"},"agent_actions":{"view_html":"https://pith.science/pith/2YBV32HYUGPYA2PVVAOHJDYGOO","download_json":"https://pith.science/pith/2YBV32HYUGPYA2PVVAOHJDYGOO.json","view_paper":"https://pith.science/paper/2YBV32HY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.07842&json=true","fetch_graph":"https://pith.science/api/pith-number/2YBV32HYUGPYA2PVVAOHJDYGOO/graph.json","fetch_events":"https://pith.science/api/pith-number/2YBV32HYUGPYA2PVVAOHJDYGOO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2YBV32HYUGPYA2PVVAOHJDYGOO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2YBV32HYUGPYA2PVVAOHJDYGOO/action/storage_attestation","attest_author":"https://pith.science/pith/2YBV32HYUGPYA2PVVAOHJDYGOO/action/author_attestation","sign_citation":"https://pith.science/pith/2YBV32HYUGPYA2PVVAOHJDYGOO/action/citation_signature","submit_replication":"https://pith.science/pith/2YBV32HYUGPYA2PVVAOHJDYGOO/action/replication_record"}},"created_at":"2026-05-18T02:20:18.585094+00:00","updated_at":"2026-05-18T02:20:18.585094+00:00"}