{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:FK6ZZRS7FIBDORYSE55DUDY75D","short_pith_number":"pith:FK6ZZRS7","schema_version":"1.0","canonical_sha256":"2abd9cc65f2a02374712277a3a0f1fe8f3683647061d053160baaf736c5e84b5","source":{"kind":"arxiv","id":"1602.05890","version":1},"attestation_state":"computed","paper":{"title":"Depth stability of edge ideals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AC","authors_text":"J\\\"urgen Herzog, Takayuki Hibi","submitted_at":"2016-02-18T17:43:37Z","abstract_excerpt":"Let $G$ be a connected finite simple graph and let $I_G$ be the edge ideal of $G$. The smallest number $k$ for which $\\depth S/I_G^k$ stabilizes is denoted by $\\dstab(I_G)$. We show that $\\dstab(I_G)<\\ell(I_G)$ where $\\ell(I_G)$ denotes the analytic spread of $I$. For trees we give a stronger upper bound for $\\dstab(I_G)$. We also show for any two integers $1\\leq a<b$ there exists a tree for which $\\dstab(I_G)=a$ and $\\ell(I_G)=b$."},"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":"1602.05890","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2016-02-18T17:43:37Z","cross_cats_sorted":[],"title_canon_sha256":"21e04acdf43dd9ba0d7ffbb9bdd872a6ec96434c67aa6bf326a2c71f05f5b8fa","abstract_canon_sha256":"feecbd0f221c00b12215e6d7ba301fd5e9fb0c506516cfa077e38bbab6848c3f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:22.952407Z","signature_b64":"sxXW35Q3d4o0QLgC2vlarSylhuLx/2BC8EueIkJJxOgkJrbGYXXCfnXQvKvvFPf5G0lS0hI9TmpEE0UQVjv1BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2abd9cc65f2a02374712277a3a0f1fe8f3683647061d053160baaf736c5e84b5","last_reissued_at":"2026-05-18T01:20:22.951894Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:22.951894Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Depth stability of edge ideals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AC","authors_text":"J\\\"urgen Herzog, Takayuki Hibi","submitted_at":"2016-02-18T17:43:37Z","abstract_excerpt":"Let $G$ be a connected finite simple graph and let $I_G$ be the edge ideal of $G$. The smallest number $k$ for which $\\depth S/I_G^k$ stabilizes is denoted by $\\dstab(I_G)$. We show that $\\dstab(I_G)<\\ell(I_G)$ where $\\ell(I_G)$ denotes the analytic spread of $I$. For trees we give a stronger upper bound for $\\dstab(I_G)$. We also show for any two integers $1\\leq a<b$ there exists a tree for which $\\dstab(I_G)=a$ and $\\ell(I_G)=b$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.05890","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":"1602.05890","created_at":"2026-05-18T01:20:22.951982+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.05890v1","created_at":"2026-05-18T01:20:22.951982+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.05890","created_at":"2026-05-18T01:20:22.951982+00:00"},{"alias_kind":"pith_short_12","alias_value":"FK6ZZRS7FIBD","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"FK6ZZRS7FIBDORYS","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"FK6ZZRS7","created_at":"2026-05-18T12:30:15.759754+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/FK6ZZRS7FIBDORYSE55DUDY75D","json":"https://pith.science/pith/FK6ZZRS7FIBDORYSE55DUDY75D.json","graph_json":"https://pith.science/api/pith-number/FK6ZZRS7FIBDORYSE55DUDY75D/graph.json","events_json":"https://pith.science/api/pith-number/FK6ZZRS7FIBDORYSE55DUDY75D/events.json","paper":"https://pith.science/paper/FK6ZZRS7"},"agent_actions":{"view_html":"https://pith.science/pith/FK6ZZRS7FIBDORYSE55DUDY75D","download_json":"https://pith.science/pith/FK6ZZRS7FIBDORYSE55DUDY75D.json","view_paper":"https://pith.science/paper/FK6ZZRS7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.05890&json=true","fetch_graph":"https://pith.science/api/pith-number/FK6ZZRS7FIBDORYSE55DUDY75D/graph.json","fetch_events":"https://pith.science/api/pith-number/FK6ZZRS7FIBDORYSE55DUDY75D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FK6ZZRS7FIBDORYSE55DUDY75D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FK6ZZRS7FIBDORYSE55DUDY75D/action/storage_attestation","attest_author":"https://pith.science/pith/FK6ZZRS7FIBDORYSE55DUDY75D/action/author_attestation","sign_citation":"https://pith.science/pith/FK6ZZRS7FIBDORYSE55DUDY75D/action/citation_signature","submit_replication":"https://pith.science/pith/FK6ZZRS7FIBDORYSE55DUDY75D/action/replication_record"}},"created_at":"2026-05-18T01:20:22.951982+00:00","updated_at":"2026-05-18T01:20:22.951982+00:00"}