{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:TXP3O63HEOEUWCOAWTAXHPYALG","short_pith_number":"pith:TXP3O63H","schema_version":"1.0","canonical_sha256":"9ddfb77b6723894b09c0b4c173bf00598656985d5e57ef415182524347a7d273","source":{"kind":"arxiv","id":"1308.2281","version":1},"attestation_state":"computed","paper":{"title":"On the determinant of the distance matrix of a bicyclic graph","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Guang-Hui Xu, Ju-Li Zhang, Shi-Cai Gong","submitted_at":"2013-08-10T06:42:15Z","abstract_excerpt":"Two cycles are referred as disjoint if they have no common edges. In this paper, we will investigate the determinant of the distance matrix of a graph, giving a formula for the determinant of the distance matrix of a bicyclic graph whose two cycles are disjoint, which extends the formula for the determinant of the distance matrix of a tree, as well as that of a unicyclic graph."},"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":"1308.2281","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2013-08-10T06:42:15Z","cross_cats_sorted":[],"title_canon_sha256":"670ac67e9db2e8cd717a5f5ff14446d52ad6929d5f3782a27bed84c2c359254e","abstract_canon_sha256":"5ee095ad6038501dc81b375e22b67bc4d5575d82c242e32dd47f8fcecf7d5d2a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:16:07.938963Z","signature_b64":"QBKOceGrPjKUzarH6aba2CVGsMWpNW68gCgCTTTt0EWWsbEOiA53F3R4tN7MjuUTJeX24aghH+db4LQdcugKBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ddfb77b6723894b09c0b4c173bf00598656985d5e57ef415182524347a7d273","last_reissued_at":"2026-05-18T03:16:07.938411Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:16:07.938411Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the determinant of the distance matrix of a bicyclic graph","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Guang-Hui Xu, Ju-Li Zhang, Shi-Cai Gong","submitted_at":"2013-08-10T06:42:15Z","abstract_excerpt":"Two cycles are referred as disjoint if they have no common edges. In this paper, we will investigate the determinant of the distance matrix of a graph, giving a formula for the determinant of the distance matrix of a bicyclic graph whose two cycles are disjoint, which extends the formula for the determinant of the distance matrix of a tree, as well as that of a unicyclic graph."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.2281","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":"1308.2281","created_at":"2026-05-18T03:16:07.938500+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.2281v1","created_at":"2026-05-18T03:16:07.938500+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.2281","created_at":"2026-05-18T03:16:07.938500+00:00"},{"alias_kind":"pith_short_12","alias_value":"TXP3O63HEOEU","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_16","alias_value":"TXP3O63HEOEUWCOA","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_8","alias_value":"TXP3O63H","created_at":"2026-05-18T12:28:02.375192+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/TXP3O63HEOEUWCOAWTAXHPYALG","json":"https://pith.science/pith/TXP3O63HEOEUWCOAWTAXHPYALG.json","graph_json":"https://pith.science/api/pith-number/TXP3O63HEOEUWCOAWTAXHPYALG/graph.json","events_json":"https://pith.science/api/pith-number/TXP3O63HEOEUWCOAWTAXHPYALG/events.json","paper":"https://pith.science/paper/TXP3O63H"},"agent_actions":{"view_html":"https://pith.science/pith/TXP3O63HEOEUWCOAWTAXHPYALG","download_json":"https://pith.science/pith/TXP3O63HEOEUWCOAWTAXHPYALG.json","view_paper":"https://pith.science/paper/TXP3O63H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.2281&json=true","fetch_graph":"https://pith.science/api/pith-number/TXP3O63HEOEUWCOAWTAXHPYALG/graph.json","fetch_events":"https://pith.science/api/pith-number/TXP3O63HEOEUWCOAWTAXHPYALG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TXP3O63HEOEUWCOAWTAXHPYALG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TXP3O63HEOEUWCOAWTAXHPYALG/action/storage_attestation","attest_author":"https://pith.science/pith/TXP3O63HEOEUWCOAWTAXHPYALG/action/author_attestation","sign_citation":"https://pith.science/pith/TXP3O63HEOEUWCOAWTAXHPYALG/action/citation_signature","submit_replication":"https://pith.science/pith/TXP3O63HEOEUWCOAWTAXHPYALG/action/replication_record"}},"created_at":"2026-05-18T03:16:07.938500+00:00","updated_at":"2026-05-18T03:16:07.938500+00:00"}