{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:7H4ZOCCSBLDC5EKTDWDRSAH3KQ","short_pith_number":"pith:7H4ZOCCS","canonical_record":{"source":{"id":"1906.04339","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-11T01:24:32Z","cross_cats_sorted":[],"title_canon_sha256":"a7c0ae492e02fa3ca8af3db6cbb84f587d8550076e4e619263ed3b0844070c36","abstract_canon_sha256":"533fde2b5d302fa97bb825944379f0a8f66b2726e790370e6cfd566bd9b719f2"},"schema_version":"1.0"},"canonical_sha256":"f9f99708520ac62e91531d871900fb5405aba5fe035d34f13d81c49af2842779","source":{"kind":"arxiv","id":"1906.04339","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.04339","created_at":"2026-05-17T23:43:39Z"},{"alias_kind":"arxiv_version","alias_value":"1906.04339v1","created_at":"2026-05-17T23:43:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.04339","created_at":"2026-05-17T23:43:39Z"},{"alias_kind":"pith_short_12","alias_value":"7H4ZOCCSBLDC","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"7H4ZOCCSBLDC5EKT","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"7H4ZOCCS","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:7H4ZOCCSBLDC5EKTDWDRSAH3KQ","target":"record","payload":{"canonical_record":{"source":{"id":"1906.04339","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-11T01:24:32Z","cross_cats_sorted":[],"title_canon_sha256":"a7c0ae492e02fa3ca8af3db6cbb84f587d8550076e4e619263ed3b0844070c36","abstract_canon_sha256":"533fde2b5d302fa97bb825944379f0a8f66b2726e790370e6cfd566bd9b719f2"},"schema_version":"1.0"},"canonical_sha256":"f9f99708520ac62e91531d871900fb5405aba5fe035d34f13d81c49af2842779","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:39.624208Z","signature_b64":"GT/izqH8V/sTBtqfKMRZo7Vbx3DGV7yuV/aktpwtxE/KqjKc878vELQi+eycsFr+lHDbA7C0jSfio+WpoI9GAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f9f99708520ac62e91531d871900fb5405aba5fe035d34f13d81c49af2842779","last_reissued_at":"2026-05-17T23:43:39.623605Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:39.623605Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.04339","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:43:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u4Zl6xxFOT35IVO4lxb40y+zFzqbVs5ngZ5CTXdIXGazd/Ch8ZIHX7mVd2IkAnpIF6FOpf1+uffcXh7wyVSNDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T03:11:18.792285Z"},"content_sha256":"161b642d6172a6ca4e546b823e6abe9ce88849ab63fcc07f5d8141227946f64e","schema_version":"1.0","event_id":"sha256:161b642d6172a6ca4e546b823e6abe9ce88849ab63fcc07f5d8141227946f64e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:7H4ZOCCSBLDC5EKTDWDRSAH3KQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Resistance distance-based graph invariants and spanning trees of graphs derived from the strong product of $P_2$ and $C_n$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jianping Li, Yingui Pan","submitted_at":"2019-06-11T01:24:32Z","abstract_excerpt":"Let $G_n$ be a graph obtained by the strong product of $P_2$ and $C_n$, where $n\\geqslant3$. In this paper, explicit expressions for the Kirchhoff index, multiplicative degree-Kirchhoff index and number of spanning trees of $G_n$ are determined, respectively. It is surprising to find that the Kirchhoff (resp. multiplicative degree-Kirchhoff) index of $G_n$ is almost one-sixth of its Wiener (resp. Gutman) index. Moreover, let $\\mathcal{G}^r_n$ be the set of subgraphs obtained from $G_n$ by deleting any $r$ vertical edges of $G_n$, where $0\\leqslant r\\leqslant n$. Explicit formulas for the Kirch"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.04339","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:43:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o8q9CS8IpypV4leklGPCmZC0llgbeV7m05yPZmrVyugmKFSHf0Ay40GTS5i0P8d9Be6FKuEoHFHdqoWEcF7DDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T03:11:18.792847Z"},"content_sha256":"d3f327fcd45412bc61393630a5f7942356193463a29b56db04b2e21b5ad810e0","schema_version":"1.0","event_id":"sha256:d3f327fcd45412bc61393630a5f7942356193463a29b56db04b2e21b5ad810e0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7H4ZOCCSBLDC5EKTDWDRSAH3KQ/bundle.json","state_url":"https://pith.science/pith/7H4ZOCCSBLDC5EKTDWDRSAH3KQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7H4ZOCCSBLDC5EKTDWDRSAH3KQ/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-03T03:11:18Z","links":{"resolver":"https://pith.science/pith/7H4ZOCCSBLDC5EKTDWDRSAH3KQ","bundle":"https://pith.science/pith/7H4ZOCCSBLDC5EKTDWDRSAH3KQ/bundle.json","state":"https://pith.science/pith/7H4ZOCCSBLDC5EKTDWDRSAH3KQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7H4ZOCCSBLDC5EKTDWDRSAH3KQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:7H4ZOCCSBLDC5EKTDWDRSAH3KQ","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":"533fde2b5d302fa97bb825944379f0a8f66b2726e790370e6cfd566bd9b719f2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-11T01:24:32Z","title_canon_sha256":"a7c0ae492e02fa3ca8af3db6cbb84f587d8550076e4e619263ed3b0844070c36"},"schema_version":"1.0","source":{"id":"1906.04339","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.04339","created_at":"2026-05-17T23:43:39Z"},{"alias_kind":"arxiv_version","alias_value":"1906.04339v1","created_at":"2026-05-17T23:43:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.04339","created_at":"2026-05-17T23:43:39Z"},{"alias_kind":"pith_short_12","alias_value":"7H4ZOCCSBLDC","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"7H4ZOCCSBLDC5EKT","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"7H4ZOCCS","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:d3f327fcd45412bc61393630a5f7942356193463a29b56db04b2e21b5ad810e0","target":"graph","created_at":"2026-05-17T23:43:39Z","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 $G_n$ be a graph obtained by the strong product of $P_2$ and $C_n$, where $n\\geqslant3$. In this paper, explicit expressions for the Kirchhoff index, multiplicative degree-Kirchhoff index and number of spanning trees of $G_n$ are determined, respectively. It is surprising to find that the Kirchhoff (resp. multiplicative degree-Kirchhoff) index of $G_n$ is almost one-sixth of its Wiener (resp. Gutman) index. Moreover, let $\\mathcal{G}^r_n$ be the set of subgraphs obtained from $G_n$ by deleting any $r$ vertical edges of $G_n$, where $0\\leqslant r\\leqslant n$. Explicit formulas for the Kirch","authors_text":"Jianping Li, Yingui Pan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-11T01:24:32Z","title":"Resistance distance-based graph invariants and spanning trees of graphs derived from the strong product of $P_2$ and $C_n$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.04339","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:161b642d6172a6ca4e546b823e6abe9ce88849ab63fcc07f5d8141227946f64e","target":"record","created_at":"2026-05-17T23:43:39Z","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":"533fde2b5d302fa97bb825944379f0a8f66b2726e790370e6cfd566bd9b719f2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-11T01:24:32Z","title_canon_sha256":"a7c0ae492e02fa3ca8af3db6cbb84f587d8550076e4e619263ed3b0844070c36"},"schema_version":"1.0","source":{"id":"1906.04339","kind":"arxiv","version":1}},"canonical_sha256":"f9f99708520ac62e91531d871900fb5405aba5fe035d34f13d81c49af2842779","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f9f99708520ac62e91531d871900fb5405aba5fe035d34f13d81c49af2842779","first_computed_at":"2026-05-17T23:43:39.623605Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:39.623605Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GT/izqH8V/sTBtqfKMRZo7Vbx3DGV7yuV/aktpwtxE/KqjKc878vELQi+eycsFr+lHDbA7C0jSfio+WpoI9GAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:39.624208Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.04339","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:161b642d6172a6ca4e546b823e6abe9ce88849ab63fcc07f5d8141227946f64e","sha256:d3f327fcd45412bc61393630a5f7942356193463a29b56db04b2e21b5ad810e0"],"state_sha256":"b3f2d9fe4272e87cc4231f142d6bc922f567a7c671f3295ffb7bf87f623e7202"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LfZcjILZ89oz9xV8G+yYIxafqpsUTBEJ9Dzpq68JM0/QmYc7WfxceB7IaRhnRhy46fS+oMbT9OMWdnvzYyBAAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T03:11:18.796081Z","bundle_sha256":"773fb4f88954c6c721cca26824a5c152b02f939a0a4abc3b6a6ba3357aa33ba1"}}