{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:CVFRDBR2ML6XRE7FJOJLYLYVRH","short_pith_number":"pith:CVFRDBR2","schema_version":"1.0","canonical_sha256":"154b11863a62fd7893e54b92bc2f1589c70184b67e16295c5b3c683eb12361e1","source":{"kind":"arxiv","id":"2507.05700","version":2},"attestation_state":"computed","paper":{"title":"Comparing the $\\mathrm{v}$-number and $h$-polynomials of edge ideals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.AC","authors_text":"Adam Van Tuyl, Kamalesh Saha","submitted_at":"2025-07-08T06:21:21Z","abstract_excerpt":"In this paper, we compare the $\\mathrm{v}$-numbers and the degree of the $h$-polynomials associated with edge ideals of connected graphs. We prove that the $\\mathrm{v}$-number can be arbitrarily larger or smaller than the degree of the $h$-polynomial for the edge ideal of a connected graph. We also establish that for any pair of positive integers $(v,d)$ with $v \\leq d$, there exists a connected graph $H(v,d)$ with the $\\mathrm{v}$-number equal to $v$ and the degree of $h$-polynomial equal to $d$. Additionally, we show that the sum of the $\\mathrm{v}$-number and the degree of the $h$-polynomia"},"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":"2507.05700","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2025-07-08T06:21:21Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"338c5fea30b8ae64f341c7c535e05aaf7a4245959434017e2a75c76587b66526","abstract_canon_sha256":"1e91a94f5438bf9329b133e37dd3a3045ad9890a7340d4fcf3b9896e85fb9f95"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:39:13.153863Z","signature_b64":"eRvIORjQeGXP4mXN+l2cj2IgHan3P5tK+BAtdAlC8g9QEpLQ2tSMrLTtx8kdMDboAobB/dbDq+S5N+d8t8cYAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"154b11863a62fd7893e54b92bc2f1589c70184b67e16295c5b3c683eb12361e1","last_reissued_at":"2026-07-05T11:39:13.153273Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:39:13.153273Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Comparing the $\\mathrm{v}$-number and $h$-polynomials of edge ideals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.AC","authors_text":"Adam Van Tuyl, Kamalesh Saha","submitted_at":"2025-07-08T06:21:21Z","abstract_excerpt":"In this paper, we compare the $\\mathrm{v}$-numbers and the degree of the $h$-polynomials associated with edge ideals of connected graphs. We prove that the $\\mathrm{v}$-number can be arbitrarily larger or smaller than the degree of the $h$-polynomial for the edge ideal of a connected graph. We also establish that for any pair of positive integers $(v,d)$ with $v \\leq d$, there exists a connected graph $H(v,d)$ with the $\\mathrm{v}$-number equal to $v$ and the degree of $h$-polynomial equal to $d$. Additionally, we show that the sum of the $\\mathrm{v}$-number and the degree of the $h$-polynomia"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.05700","kind":"arxiv","version":2},"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/2507.05700/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":"2507.05700","created_at":"2026-07-05T11:39:13.153360+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.05700v2","created_at":"2026-07-05T11:39:13.153360+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.05700","created_at":"2026-07-05T11:39:13.153360+00:00"},{"alias_kind":"pith_short_12","alias_value":"CVFRDBR2ML6X","created_at":"2026-07-05T11:39:13.153360+00:00"},{"alias_kind":"pith_short_16","alias_value":"CVFRDBR2ML6XRE7F","created_at":"2026-07-05T11:39:13.153360+00:00"},{"alias_kind":"pith_short_8","alias_value":"CVFRDBR2","created_at":"2026-07-05T11:39:13.153360+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/CVFRDBR2ML6XRE7FJOJLYLYVRH","json":"https://pith.science/pith/CVFRDBR2ML6XRE7FJOJLYLYVRH.json","graph_json":"https://pith.science/api/pith-number/CVFRDBR2ML6XRE7FJOJLYLYVRH/graph.json","events_json":"https://pith.science/api/pith-number/CVFRDBR2ML6XRE7FJOJLYLYVRH/events.json","paper":"https://pith.science/paper/CVFRDBR2"},"agent_actions":{"view_html":"https://pith.science/pith/CVFRDBR2ML6XRE7FJOJLYLYVRH","download_json":"https://pith.science/pith/CVFRDBR2ML6XRE7FJOJLYLYVRH.json","view_paper":"https://pith.science/paper/CVFRDBR2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.05700&json=true","fetch_graph":"https://pith.science/api/pith-number/CVFRDBR2ML6XRE7FJOJLYLYVRH/graph.json","fetch_events":"https://pith.science/api/pith-number/CVFRDBR2ML6XRE7FJOJLYLYVRH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CVFRDBR2ML6XRE7FJOJLYLYVRH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CVFRDBR2ML6XRE7FJOJLYLYVRH/action/storage_attestation","attest_author":"https://pith.science/pith/CVFRDBR2ML6XRE7FJOJLYLYVRH/action/author_attestation","sign_citation":"https://pith.science/pith/CVFRDBR2ML6XRE7FJOJLYLYVRH/action/citation_signature","submit_replication":"https://pith.science/pith/CVFRDBR2ML6XRE7FJOJLYLYVRH/action/replication_record"}},"created_at":"2026-07-05T11:39:13.153360+00:00","updated_at":"2026-07-05T11:39:13.153360+00:00"}