{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:N3TLD6PRU5UUFIUMZBO4X3D7AC","short_pith_number":"pith:N3TLD6PR","canonical_record":{"source":{"id":"2605.03369","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.AC","submitted_at":"2026-05-05T05:19:06Z","cross_cats_sorted":[],"title_canon_sha256":"f6b7c1b69e6045214e5ce53c56c4b723424c9e036cee91da4f2f913080d2f93e","abstract_canon_sha256":"9ca86d3b0cca3c946872f0ca4af299ac811453ac1b12eca074dec4ae3f537ba7"},"schema_version":"1.0"},"canonical_sha256":"6ee6b1f9f1a76942a28cc85dcbec7f00902a698c32de73fc1c56820ad8fd90f2","source":{"kind":"arxiv","id":"2605.03369","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.03369","created_at":"2026-05-20T01:05:15Z"},{"alias_kind":"arxiv_version","alias_value":"2605.03369v2","created_at":"2026-05-20T01:05:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.03369","created_at":"2026-05-20T01:05:15Z"},{"alias_kind":"pith_short_12","alias_value":"N3TLD6PRU5UU","created_at":"2026-05-20T01:05:15Z"},{"alias_kind":"pith_short_16","alias_value":"N3TLD6PRU5UUFIUM","created_at":"2026-05-20T01:05:15Z"},{"alias_kind":"pith_short_8","alias_value":"N3TLD6PR","created_at":"2026-05-20T01:05:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:N3TLD6PRU5UUFIUMZBO4X3D7AC","target":"record","payload":{"canonical_record":{"source":{"id":"2605.03369","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.AC","submitted_at":"2026-05-05T05:19:06Z","cross_cats_sorted":[],"title_canon_sha256":"f6b7c1b69e6045214e5ce53c56c4b723424c9e036cee91da4f2f913080d2f93e","abstract_canon_sha256":"9ca86d3b0cca3c946872f0ca4af299ac811453ac1b12eca074dec4ae3f537ba7"},"schema_version":"1.0"},"canonical_sha256":"6ee6b1f9f1a76942a28cc85dcbec7f00902a698c32de73fc1c56820ad8fd90f2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T01:05:15.281473Z","signature_b64":"VVxNjCgmy1lu3Vo5PdX2Ui5x5tF4UsWi5TFSaxoyIS83ZzzY2fG1tDBRR6rb+VhBjLwW5YAcnSJM8nF1RMyBCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ee6b1f9f1a76942a28cc85dcbec7f00902a698c32de73fc1c56820ad8fd90f2","last_reissued_at":"2026-05-20T01:05:15.280579Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T01:05:15.280579Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.03369","source_version":2,"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-20T01:05:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NXuasWKbfddcLhTb0qDJ0T0Sf9+RAAIi+xoxqdgMgK/eMJThdDvzqt7u8qZtE+sfdANioiW8XvkMQshfF4wxDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T05:03:27.690986Z"},"content_sha256":"7c95d3c2397bdbce0aa7a797110ac33593303356d8621dbcab58dfc3c96f058e","schema_version":"1.0","event_id":"sha256:7c95d3c2397bdbce0aa7a797110ac33593303356d8621dbcab58dfc3c96f058e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:N3TLD6PRU5UUFIUMZBO4X3D7AC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Admissible subgraphs and the depth of symbolic powers of cover ideals of graphs","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"The depth of the t-th symbolic power of the cover ideal of a cycle graph C_n equals n-1 minus floor of t n over 2t plus 1.","cross_cats":[],"primary_cat":"math.AC","authors_text":"Nguyen Thu Hang, Thanh Vu, Tran Duc Dung","submitted_at":"2026-05-05T05:19:06Z","abstract_excerpt":"Let $G$ be a simple graph. We introduce the notion of $t$-admissible subgraphs of $G$ and show how to use them to compute the depth of the $t$-th symbolic powers of the cover ideal of $G$. As an application, we prove that \\[ \\depth\\big(S/J(C_n)^{(t)}\\big) = n - 1 - \\left\\lfloor \\frac{tn}{2t+1} \\right\\rfloor \\] for all $t \\ge 2$ and $n \\ge 3$, where $S = K[x_1,\\ldots,x_n]$ and $J(C_n)$ is the cover ideal of the cycle on $n$ vertices."},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We prove that depth(S/J(C_n)^{(t)}) = n - 1 - floor(tn/(2t+1)) for all t ≥ 2 and n ≥ 3, where S = K[x1,...,xn] and J(C_n) is the cover ideal of the cycle on n vertices.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the newly defined t-admissible subgraphs correctly encode the depth information for the symbolic powers, allowing the reduction to the stated formula for cycles without hidden restrictions on the graph or the base field.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"The depth of the t-th symbolic power of the cover ideal of the cycle graph C_n equals n-1 minus the floor of tn over 2t+1, for t at least 2 and n at least 3.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"The depth of the t-th symbolic power of the cover ideal of a cycle graph C_n equals n-1 minus floor of t n over 2t plus 1.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"93bb9afd165cf5510f656399cd5c301093620e8ced691e6600b352e82d81a147"},"source":{"id":"2605.03369","kind":"arxiv","version":2},"verdict":{"id":"912e134a-e61c-431f-afff-2f6ace0e4afb","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-07T12:57:52.019153Z","strongest_claim":"We prove that depth(S/J(C_n)^{(t)}) = n - 1 - floor(tn/(2t+1)) for all t ≥ 2 and n ≥ 3, where S = K[x1,...,xn] and J(C_n) is the cover ideal of the cycle on n vertices.","one_line_summary":"The depth of the t-th symbolic power of the cover ideal of the cycle graph C_n equals n-1 minus the floor of tn over 2t+1, for t at least 2 and n at least 3.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the newly defined t-admissible subgraphs correctly encode the depth information for the symbolic powers, allowing the reduction to the stated formula for cycles without hidden restrictions on the graph or the base field.","pith_extraction_headline":"The depth of the t-th symbolic power of the cover ideal of a cycle graph C_n equals n-1 minus floor of t n over 2t plus 1."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.03369/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_compliance","ran_at":"2026-05-19T15:27:42.383413Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"95b7326298c423f9e0b62d7564d47ee2845469cc5ae6d92d2f7b56e02463e5c2"},"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":"912e134a-e61c-431f-afff-2f6ace0e4afb"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T01:05:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OPfGPrAwUMKHCbGjYkuoy+qV5/N/S03HTesW7Rl7Dp3IwrQ4FDGZx2LO+qVQaLPFu9EUnFFWDiJdqC8PRQYXAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T05:03:27.691971Z"},"content_sha256":"c3ce8ab06cd64c08316a3d646c9da639fca7e8d856739639f63b9da4212133a4","schema_version":"1.0","event_id":"sha256:c3ce8ab06cd64c08316a3d646c9da639fca7e8d856739639f63b9da4212133a4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N3TLD6PRU5UUFIUMZBO4X3D7AC/bundle.json","state_url":"https://pith.science/pith/N3TLD6PRU5UUFIUMZBO4X3D7AC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N3TLD6PRU5UUFIUMZBO4X3D7AC/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-05-23T05:03:27Z","links":{"resolver":"https://pith.science/pith/N3TLD6PRU5UUFIUMZBO4X3D7AC","bundle":"https://pith.science/pith/N3TLD6PRU5UUFIUMZBO4X3D7AC/bundle.json","state":"https://pith.science/pith/N3TLD6PRU5UUFIUMZBO4X3D7AC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N3TLD6PRU5UUFIUMZBO4X3D7AC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:N3TLD6PRU5UUFIUMZBO4X3D7AC","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":"9ca86d3b0cca3c946872f0ca4af299ac811453ac1b12eca074dec4ae3f537ba7","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.AC","submitted_at":"2026-05-05T05:19:06Z","title_canon_sha256":"f6b7c1b69e6045214e5ce53c56c4b723424c9e036cee91da4f2f913080d2f93e"},"schema_version":"1.0","source":{"id":"2605.03369","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.03369","created_at":"2026-05-20T01:05:15Z"},{"alias_kind":"arxiv_version","alias_value":"2605.03369v2","created_at":"2026-05-20T01:05:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.03369","created_at":"2026-05-20T01:05:15Z"},{"alias_kind":"pith_short_12","alias_value":"N3TLD6PRU5UU","created_at":"2026-05-20T01:05:15Z"},{"alias_kind":"pith_short_16","alias_value":"N3TLD6PRU5UUFIUM","created_at":"2026-05-20T01:05:15Z"},{"alias_kind":"pith_short_8","alias_value":"N3TLD6PR","created_at":"2026-05-20T01:05:15Z"}],"graph_snapshots":[{"event_id":"sha256:c3ce8ab06cd64c08316a3d646c9da639fca7e8d856739639f63b9da4212133a4","target":"graph","created_at":"2026-05-20T01:05:15Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We prove that depth(S/J(C_n)^{(t)}) = n - 1 - floor(tn/(2t+1)) for all t ≥ 2 and n ≥ 3, where S = K[x1,...,xn] and J(C_n) is the cover ideal of the cycle on n vertices."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the newly defined t-admissible subgraphs correctly encode the depth information for the symbolic powers, allowing the reduction to the stated formula for cycles without hidden restrictions on the graph or the base field."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"The depth of the t-th symbolic power of the cover ideal of the cycle graph C_n equals n-1 minus the floor of tn over 2t+1, for t at least 2 and n at least 3."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"The depth of the t-th symbolic power of the cover ideal of a cycle graph C_n equals n-1 minus floor of t n over 2t plus 1."}],"snapshot_sha256":"93bb9afd165cf5510f656399cd5c301093620e8ced691e6600b352e82d81a147"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T15:27:42.383413Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.03369/integrity.json","findings":[],"snapshot_sha256":"95b7326298c423f9e0b62d7564d47ee2845469cc5ae6d92d2f7b56e02463e5c2","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $G$ be a simple graph. We introduce the notion of $t$-admissible subgraphs of $G$ and show how to use them to compute the depth of the $t$-th symbolic powers of the cover ideal of $G$. As an application, we prove that \\[ \\depth\\big(S/J(C_n)^{(t)}\\big) = n - 1 - \\left\\lfloor \\frac{tn}{2t+1} \\right\\rfloor \\] for all $t \\ge 2$ and $n \\ge 3$, where $S = K[x_1,\\ldots,x_n]$ and $J(C_n)$ is the cover ideal of the cycle on $n$ vertices.","authors_text":"Nguyen Thu Hang, Thanh Vu, Tran Duc Dung","cross_cats":[],"headline":"The depth of the t-th symbolic power of the cover ideal of a cycle graph C_n equals n-1 minus floor of t n over 2t plus 1.","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.AC","submitted_at":"2026-05-05T05:19:06Z","title":"Admissible subgraphs and the depth of symbolic powers of cover ideals of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.03369","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-07T12:57:52.019153Z","id":"912e134a-e61c-431f-afff-2f6ace0e4afb","model_set":{"reader":"grok-4.3"},"one_line_summary":"The depth of the t-th symbolic power of the cover ideal of the cycle graph C_n equals n-1 minus the floor of tn over 2t+1, for t at least 2 and n at least 3.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"The depth of the t-th symbolic power of the cover ideal of a cycle graph C_n equals n-1 minus floor of t n over 2t plus 1.","strongest_claim":"We prove that depth(S/J(C_n)^{(t)}) = n - 1 - floor(tn/(2t+1)) for all t ≥ 2 and n ≥ 3, where S = K[x1,...,xn] and J(C_n) is the cover ideal of the cycle on n vertices.","weakest_assumption":"That the newly defined t-admissible subgraphs correctly encode the depth information for the symbolic powers, allowing the reduction to the stated formula for cycles without hidden restrictions on the graph or the base field."}},"verdict_id":"912e134a-e61c-431f-afff-2f6ace0e4afb"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:7c95d3c2397bdbce0aa7a797110ac33593303356d8621dbcab58dfc3c96f058e","target":"record","created_at":"2026-05-20T01:05:15Z","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":"9ca86d3b0cca3c946872f0ca4af299ac811453ac1b12eca074dec4ae3f537ba7","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.AC","submitted_at":"2026-05-05T05:19:06Z","title_canon_sha256":"f6b7c1b69e6045214e5ce53c56c4b723424c9e036cee91da4f2f913080d2f93e"},"schema_version":"1.0","source":{"id":"2605.03369","kind":"arxiv","version":2}},"canonical_sha256":"6ee6b1f9f1a76942a28cc85dcbec7f00902a698c32de73fc1c56820ad8fd90f2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6ee6b1f9f1a76942a28cc85dcbec7f00902a698c32de73fc1c56820ad8fd90f2","first_computed_at":"2026-05-20T01:05:15.280579Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T01:05:15.280579Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VVxNjCgmy1lu3Vo5PdX2Ui5x5tF4UsWi5TFSaxoyIS83ZzzY2fG1tDBRR6rb+VhBjLwW5YAcnSJM8nF1RMyBCA==","signature_status":"signed_v1","signed_at":"2026-05-20T01:05:15.281473Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.03369","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7c95d3c2397bdbce0aa7a797110ac33593303356d8621dbcab58dfc3c96f058e","sha256:c3ce8ab06cd64c08316a3d646c9da639fca7e8d856739639f63b9da4212133a4"],"state_sha256":"1c63a2852f9b05f679cc750ed241ff1ae5ace015e62617f85aad6b15d0495dd6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lzKLiYs3GkEYqaWj2wrtzrIEouCo605XrMeNcZcgBGBZEqhGegu7RdjBWN3KNEZRVXkLITTwDtlQA1E3PVgTBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T05:03:27.696961Z","bundle_sha256":"d5e5118bbe9967e7928803989926917fae73fa1c9ca24085b775eb95dac0f7de"}}