{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:ERCN247MLFOITNAGHLADCX6RXB","short_pith_number":"pith:ERCN247M","schema_version":"1.0","canonical_sha256":"2444dd73ec595c89b4063ac0315fd1b877dcab58921646aa3485d50d31c672e1","source":{"kind":"arxiv","id":"2410.07756","version":3},"attestation_state":"computed","paper":{"title":"Graphs with nonnegative resistance curvature","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","math.MG"],"primary_cat":"math.CO","authors_text":"Karel Devriendt","submitted_at":"2024-10-10T09:35:07Z","abstract_excerpt":"This article introduces and studies a new class of graphs motivated by discrete curvature. We call a graph resistance nonnegative if there exists a distribution on its spanning trees such that every vertex has expected degree at most two in a random spanning tree; these are precisely the graphs that admit a metric with nonnegative resistance curvature, a discrete curvature introduced by Devriendt and Lambiotte. We show that this class of graphs lies between Hamiltonian and $1$-tough graphs and, surprisingly, that a graph is resistance nonnegative if and only if its twice-dilated matching polyt"},"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":"2410.07756","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-10-10T09:35:07Z","cross_cats_sorted":["cs.DM","math.MG"],"title_canon_sha256":"80689b3aa56347ab766e996d9ee5878751235942f4d2354c169317e6b8b4ffb4","abstract_canon_sha256":"43d4e5cf70f4fbe317ff9d499d220c506336102581ab8b477cc08e3dda9c6491"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:49:47.530858Z","signature_b64":"c6IEYiUac8T7TETsiqJJG8QxMWpJl/ZSBJ0zuqSEXhAr15b6Mj9IVTv3RYef7TYo2oEWcJe4M4KMIszOScxCBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2444dd73ec595c89b4063ac0315fd1b877dcab58921646aa3485d50d31c672e1","last_reissued_at":"2026-07-05T11:49:47.530431Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:49:47.530431Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graphs with nonnegative resistance curvature","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","math.MG"],"primary_cat":"math.CO","authors_text":"Karel Devriendt","submitted_at":"2024-10-10T09:35:07Z","abstract_excerpt":"This article introduces and studies a new class of graphs motivated by discrete curvature. We call a graph resistance nonnegative if there exists a distribution on its spanning trees such that every vertex has expected degree at most two in a random spanning tree; these are precisely the graphs that admit a metric with nonnegative resistance curvature, a discrete curvature introduced by Devriendt and Lambiotte. We show that this class of graphs lies between Hamiltonian and $1$-tough graphs and, surprisingly, that a graph is resistance nonnegative if and only if its twice-dilated matching polyt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.07756","kind":"arxiv","version":3},"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/2410.07756/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":"2410.07756","created_at":"2026-07-05T11:49:47.530487+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.07756v3","created_at":"2026-07-05T11:49:47.530487+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.07756","created_at":"2026-07-05T11:49:47.530487+00:00"},{"alias_kind":"pith_short_12","alias_value":"ERCN247MLFOI","created_at":"2026-07-05T11:49:47.530487+00:00"},{"alias_kind":"pith_short_16","alias_value":"ERCN247MLFOITNAG","created_at":"2026-07-05T11:49:47.530487+00:00"},{"alias_kind":"pith_short_8","alias_value":"ERCN247M","created_at":"2026-07-05T11:49:47.530487+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.21333","citing_title":"Ramanujan Graph Rewiring with Non Negative Resistance Curvature","ref_index":22,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ERCN247MLFOITNAGHLADCX6RXB","json":"https://pith.science/pith/ERCN247MLFOITNAGHLADCX6RXB.json","graph_json":"https://pith.science/api/pith-number/ERCN247MLFOITNAGHLADCX6RXB/graph.json","events_json":"https://pith.science/api/pith-number/ERCN247MLFOITNAGHLADCX6RXB/events.json","paper":"https://pith.science/paper/ERCN247M"},"agent_actions":{"view_html":"https://pith.science/pith/ERCN247MLFOITNAGHLADCX6RXB","download_json":"https://pith.science/pith/ERCN247MLFOITNAGHLADCX6RXB.json","view_paper":"https://pith.science/paper/ERCN247M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.07756&json=true","fetch_graph":"https://pith.science/api/pith-number/ERCN247MLFOITNAGHLADCX6RXB/graph.json","fetch_events":"https://pith.science/api/pith-number/ERCN247MLFOITNAGHLADCX6RXB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ERCN247MLFOITNAGHLADCX6RXB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ERCN247MLFOITNAGHLADCX6RXB/action/storage_attestation","attest_author":"https://pith.science/pith/ERCN247MLFOITNAGHLADCX6RXB/action/author_attestation","sign_citation":"https://pith.science/pith/ERCN247MLFOITNAGHLADCX6RXB/action/citation_signature","submit_replication":"https://pith.science/pith/ERCN247MLFOITNAGHLADCX6RXB/action/replication_record"}},"created_at":"2026-07-05T11:49:47.530487+00:00","updated_at":"2026-07-05T11:49:47.530487+00:00"}