{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:IDXC5KUWISPJOR566B565E6HOR","short_pith_number":"pith:IDXC5KUW","canonical_record":{"source":{"id":"1604.00654","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2016-04-03T16:59:25Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"94f1e973a5721789d9a98f0dab76d8799a1abab16a5f3eecf93f8663d60fb9ed","abstract_canon_sha256":"277d2244043a70372d2ba1d328d0a7d0c39ae8a920dec1ee4cf87fd9178ef865"},"schema_version":"1.0"},"canonical_sha256":"40ee2eaa96449e9747bef07bee93c7747c718d05430a6fb0457ac8ec7d7e9d2a","source":{"kind":"arxiv","id":"1604.00654","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.00654","created_at":"2026-05-18T01:17:48Z"},{"alias_kind":"arxiv_version","alias_value":"1604.00654v1","created_at":"2026-05-18T01:17:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.00654","created_at":"2026-05-18T01:17:48Z"},{"alias_kind":"pith_short_12","alias_value":"IDXC5KUWISPJ","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IDXC5KUWISPJOR56","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IDXC5KUW","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:IDXC5KUWISPJOR566B565E6HOR","target":"record","payload":{"canonical_record":{"source":{"id":"1604.00654","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2016-04-03T16:59:25Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"94f1e973a5721789d9a98f0dab76d8799a1abab16a5f3eecf93f8663d60fb9ed","abstract_canon_sha256":"277d2244043a70372d2ba1d328d0a7d0c39ae8a920dec1ee4cf87fd9178ef865"},"schema_version":"1.0"},"canonical_sha256":"40ee2eaa96449e9747bef07bee93c7747c718d05430a6fb0457ac8ec7d7e9d2a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:48.772156Z","signature_b64":"etKv2TiYD9lbAkqaCS/qe1qxxLoY0e3oOObRTXTUMN5iYxg9zENpDS3LNAJJdrj4LsoogZCLa8eywVhu4mKwCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"40ee2eaa96449e9747bef07bee93c7747c718d05430a6fb0457ac8ec7d7e9d2a","last_reissued_at":"2026-05-18T01:17:48.771457Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:48.771457Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.00654","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:17:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w/ndwCsC9Ouphxu+Bo6M+OMIIiV7ng0TkQxCSeh/NWQ/UqZm4zrDYJyk3qGepkQ+qVQk0q2tgrdW6ZYknHJSAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T10:51:57.070768Z"},"content_sha256":"8a88bb91e32cb8d8859aec1296a0e19227cb6bc9518f622ee442605055a615f8","schema_version":"1.0","event_id":"sha256:8a88bb91e32cb8d8859aec1296a0e19227cb6bc9518f622ee442605055a615f8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:IDXC5KUWISPJOR566B565E6HOR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Symbolic powers of cover ideal of very well-covered and bipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.AC","authors_text":"S. A. Seyed Fakhari","submitted_at":"2016-04-03T16:59:25Z","abstract_excerpt":"Let $G$ be a graph with $n$ vertices and $S=\\mathbb{K}[x_1,\\dots,x_n]$ be the polynomial ring in $n$ variables over a field $\\mathbb{K}$. Assume that $J(G)$ is the cover ideal of $G$ and $J(G)^{(k)}$ is its $k$-th symbolic power. We prove that if $G$ is a very well-covered graph such that $J(G)$ has linear resolution, then $J(G)^{(k)}$ has linear resolution, for every integer $k\\geq 1$. We also prove that for a every very well-covered graph $G$, the depth of symbolic powers of $J(G)$ forms a non-increasing sequence. Finally, we determine a linear upper bound for the regularity of powers of cov"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.00654","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:17:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aFNGGvLAJ/nvPxRr59gOC4cL2BKTG5Q6/6/iy6TZNf+CzQXi0NTFACsM9clmkUTrOk6DSxPDXflfjkXnHN6rBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T10:51:57.071102Z"},"content_sha256":"3ad3ec9d6c796212d1b31f5265228c57eb6ade29f46cac7b8b127e3b5112e357","schema_version":"1.0","event_id":"sha256:3ad3ec9d6c796212d1b31f5265228c57eb6ade29f46cac7b8b127e3b5112e357"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IDXC5KUWISPJOR566B565E6HOR/bundle.json","state_url":"https://pith.science/pith/IDXC5KUWISPJOR566B565E6HOR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IDXC5KUWISPJOR566B565E6HOR/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-25T10:51:57Z","links":{"resolver":"https://pith.science/pith/IDXC5KUWISPJOR566B565E6HOR","bundle":"https://pith.science/pith/IDXC5KUWISPJOR566B565E6HOR/bundle.json","state":"https://pith.science/pith/IDXC5KUWISPJOR566B565E6HOR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IDXC5KUWISPJOR566B565E6HOR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:IDXC5KUWISPJOR566B565E6HOR","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"277d2244043a70372d2ba1d328d0a7d0c39ae8a920dec1ee4cf87fd9178ef865","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2016-04-03T16:59:25Z","title_canon_sha256":"94f1e973a5721789d9a98f0dab76d8799a1abab16a5f3eecf93f8663d60fb9ed"},"schema_version":"1.0","source":{"id":"1604.00654","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.00654","created_at":"2026-05-18T01:17:48Z"},{"alias_kind":"arxiv_version","alias_value":"1604.00654v1","created_at":"2026-05-18T01:17:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.00654","created_at":"2026-05-18T01:17:48Z"},{"alias_kind":"pith_short_12","alias_value":"IDXC5KUWISPJ","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IDXC5KUWISPJOR56","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IDXC5KUW","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:3ad3ec9d6c796212d1b31f5265228c57eb6ade29f46cac7b8b127e3b5112e357","target":"graph","created_at":"2026-05-18T01:17:48Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Let $G$ be a graph with $n$ vertices and $S=\\mathbb{K}[x_1,\\dots,x_n]$ be the polynomial ring in $n$ variables over a field $\\mathbb{K}$. Assume that $J(G)$ is the cover ideal of $G$ and $J(G)^{(k)}$ is its $k$-th symbolic power. We prove that if $G$ is a very well-covered graph such that $J(G)$ has linear resolution, then $J(G)^{(k)}$ has linear resolution, for every integer $k\\geq 1$. We also prove that for a every very well-covered graph $G$, the depth of symbolic powers of $J(G)$ forms a non-increasing sequence. Finally, we determine a linear upper bound for the regularity of powers of cov","authors_text":"S. A. Seyed Fakhari","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2016-04-03T16:59:25Z","title":"Symbolic powers of cover ideal of very well-covered and bipartite graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.00654","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:8a88bb91e32cb8d8859aec1296a0e19227cb6bc9518f622ee442605055a615f8","target":"record","created_at":"2026-05-18T01:17:48Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"277d2244043a70372d2ba1d328d0a7d0c39ae8a920dec1ee4cf87fd9178ef865","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2016-04-03T16:59:25Z","title_canon_sha256":"94f1e973a5721789d9a98f0dab76d8799a1abab16a5f3eecf93f8663d60fb9ed"},"schema_version":"1.0","source":{"id":"1604.00654","kind":"arxiv","version":1}},"canonical_sha256":"40ee2eaa96449e9747bef07bee93c7747c718d05430a6fb0457ac8ec7d7e9d2a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"40ee2eaa96449e9747bef07bee93c7747c718d05430a6fb0457ac8ec7d7e9d2a","first_computed_at":"2026-05-18T01:17:48.771457Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:48.771457Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"etKv2TiYD9lbAkqaCS/qe1qxxLoY0e3oOObRTXTUMN5iYxg9zENpDS3LNAJJdrj4LsoogZCLa8eywVhu4mKwCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:48.772156Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.00654","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8a88bb91e32cb8d8859aec1296a0e19227cb6bc9518f622ee442605055a615f8","sha256:3ad3ec9d6c796212d1b31f5265228c57eb6ade29f46cac7b8b127e3b5112e357"],"state_sha256":"be5092b963bfce2434ea605239cfb53fa5dba0e9f76d27879e6f4265ec124b79"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JTIcmw09YMPlCVmQ+DIiJ5DxQ9tgq7cI8voX14fNTpcgSNGyIhAtcWvpWQfSeTAo0r1LMazDIn7isIUtFxIBAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T10:51:57.072990Z","bundle_sha256":"518748099439220be223b99f76489e25bebc8e6da2ef3230328649d6f2583883"}}