{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:S77WHKPZF72WXDUVDMDFDQZEDI","short_pith_number":"pith:S77WHKPZ","schema_version":"1.0","canonical_sha256":"97ff63a9f92ff56b8e951b0651c3241a1a4c5a55d7d8cb6eef67c287043ad387","source":{"kind":"arxiv","id":"1912.00417","version":1},"attestation_state":"computed","paper":{"title":"A graph inequality on the common neighbourhood","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fenglin Huang, Junchi Zuo, Mingxuan Zou, Shuhan Zhou, Xiaomin Chen","submitted_at":"2019-12-01T14:35:09Z","abstract_excerpt":"In this note we prove a graph inequality based on the sizes of the common neighbourhoods. We also characterize the extremal graphs that achieve the equality.\n  The result was first discovered as a consequence of the classical Forster's theorem in electric networks. We also present a short combinatorial proof that was inspired by a similar inequality related to the celebrated Tur\\'an's theorem."},"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":"1912.00417","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-12-01T14:35:09Z","cross_cats_sorted":[],"title_canon_sha256":"6536595464e8111a5764f4fca3d077802112bb710b04b74718b9e5accf2513bf","abstract_canon_sha256":"37c1fded9e0af5332155954300db49cf90aafac76cd0192844c50eb1910fbe60"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:23:13.623392Z","signature_b64":"2LI0tNG/14VjF5jXQOyxiWPNIYaYaJw+CegJUOpouzvKtdgzA7mQRYtZxilEYrGsyfxe3otWAteQRRtOYZxPDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"97ff63a9f92ff56b8e951b0651c3241a1a4c5a55d7d8cb6eef67c287043ad387","last_reissued_at":"2026-07-05T00:23:13.623013Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:23:13.623013Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A graph inequality on the common neighbourhood","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fenglin Huang, Junchi Zuo, Mingxuan Zou, Shuhan Zhou, Xiaomin Chen","submitted_at":"2019-12-01T14:35:09Z","abstract_excerpt":"In this note we prove a graph inequality based on the sizes of the common neighbourhoods. We also characterize the extremal graphs that achieve the equality.\n  The result was first discovered as a consequence of the classical Forster's theorem in electric networks. We also present a short combinatorial proof that was inspired by a similar inequality related to the celebrated Tur\\'an's theorem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.00417","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1912.00417/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1912.00417","created_at":"2026-07-05T00:23:13.623071+00:00"},{"alias_kind":"arxiv_version","alias_value":"1912.00417v1","created_at":"2026-07-05T00:23:13.623071+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.00417","created_at":"2026-07-05T00:23:13.623071+00:00"},{"alias_kind":"pith_short_12","alias_value":"S77WHKPZF72W","created_at":"2026-07-05T00:23:13.623071+00:00"},{"alias_kind":"pith_short_16","alias_value":"S77WHKPZF72WXDUV","created_at":"2026-07-05T00:23:13.623071+00:00"},{"alias_kind":"pith_short_8","alias_value":"S77WHKPZ","created_at":"2026-07-05T00:23:13.623071+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/S77WHKPZF72WXDUVDMDFDQZEDI","json":"https://pith.science/pith/S77WHKPZF72WXDUVDMDFDQZEDI.json","graph_json":"https://pith.science/api/pith-number/S77WHKPZF72WXDUVDMDFDQZEDI/graph.json","events_json":"https://pith.science/api/pith-number/S77WHKPZF72WXDUVDMDFDQZEDI/events.json","paper":"https://pith.science/paper/S77WHKPZ"},"agent_actions":{"view_html":"https://pith.science/pith/S77WHKPZF72WXDUVDMDFDQZEDI","download_json":"https://pith.science/pith/S77WHKPZF72WXDUVDMDFDQZEDI.json","view_paper":"https://pith.science/paper/S77WHKPZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1912.00417&json=true","fetch_graph":"https://pith.science/api/pith-number/S77WHKPZF72WXDUVDMDFDQZEDI/graph.json","fetch_events":"https://pith.science/api/pith-number/S77WHKPZF72WXDUVDMDFDQZEDI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S77WHKPZF72WXDUVDMDFDQZEDI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S77WHKPZF72WXDUVDMDFDQZEDI/action/storage_attestation","attest_author":"https://pith.science/pith/S77WHKPZF72WXDUVDMDFDQZEDI/action/author_attestation","sign_citation":"https://pith.science/pith/S77WHKPZF72WXDUVDMDFDQZEDI/action/citation_signature","submit_replication":"https://pith.science/pith/S77WHKPZF72WXDUVDMDFDQZEDI/action/replication_record"}},"created_at":"2026-07-05T00:23:13.623071+00:00","updated_at":"2026-07-05T00:23:13.623071+00:00"}