{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:PCZFMI65WRRTCG4HQOZBM2XCPR","short_pith_number":"pith:PCZFMI65","canonical_record":{"source":{"id":"1710.01947","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-05T10:14:12Z","cross_cats_sorted":[],"title_canon_sha256":"a444c9dc89b8fc3c485495996494e6443d95b4ac1a187b13adcf142c41d389b8","abstract_canon_sha256":"a0a201e3beb568f20bf88c418e1627a6ac6c1b53796596b33b715e5eb263f714"},"schema_version":"1.0"},"canonical_sha256":"78b25623ddb463311b8783b2166ae27c52c3a4675385e576547fb932354e1527","source":{"kind":"arxiv","id":"1710.01947","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.01947","created_at":"2026-05-18T00:33:37Z"},{"alias_kind":"arxiv_version","alias_value":"1710.01947v1","created_at":"2026-05-18T00:33:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.01947","created_at":"2026-05-18T00:33:37Z"},{"alias_kind":"pith_short_12","alias_value":"PCZFMI65WRRT","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PCZFMI65WRRTCG4H","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PCZFMI65","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:PCZFMI65WRRTCG4HQOZBM2XCPR","target":"record","payload":{"canonical_record":{"source":{"id":"1710.01947","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-05T10:14:12Z","cross_cats_sorted":[],"title_canon_sha256":"a444c9dc89b8fc3c485495996494e6443d95b4ac1a187b13adcf142c41d389b8","abstract_canon_sha256":"a0a201e3beb568f20bf88c418e1627a6ac6c1b53796596b33b715e5eb263f714"},"schema_version":"1.0"},"canonical_sha256":"78b25623ddb463311b8783b2166ae27c52c3a4675385e576547fb932354e1527","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:38.000281Z","signature_b64":"NL9eoc/bd7ze6Ga3ixHSCIDq7acxnwnI2yms9Y96rWjBhUuHMH0wL0I4mg33XVjRHTlTN3ExYxdFdYTozHYXDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78b25623ddb463311b8783b2166ae27c52c3a4675385e576547fb932354e1527","last_reissued_at":"2026-05-18T00:33:37.999789Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:37.999789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.01947","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-18T00:33:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E3KIVPDDgRbipJb6pHFwpgVu9ZzjQp78wU/zlwBXEWxhlqtM+80mqaFpdx6cZzC9t1OBv/KoYrmkEpkBarwpAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:28:43.102852Z"},"content_sha256":"1d35a98cf6b7b25772119b28d46d556d2c8418e8d757fef532d8a919c7bc9f6c","schema_version":"1.0","event_id":"sha256:1d35a98cf6b7b25772119b28d46d556d2c8418e8d757fef532d8a919c7bc9f6c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:PCZFMI65WRRTCG4HQOZBM2XCPR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Feedback vertex number of Sierpi\\'{n}ski-type graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Baoyindureng Wu, Biao Zhao, LiLi Yuan","submitted_at":"2017-10-05T10:14:12Z","abstract_excerpt":"The feedback vertex number $\\tau(G)$ of a graph $G$ is the minimum number of vertices that can be deleted from $G$ such that the resultant graph does not contain a cycle. We show that $\\tau(S_p^n)=p^{n-1}(p-2)$ for the Sierpi\\'{n}ski graph $S_p^n$ with $p\\geq 2$ and $n\\geq 1$. The generalized Sierpi\\'{n}ski triangle graph $\\hat{S_p^n}$ is obtained by contracting all non-clique edges from the Sierpi\\'{n}ski graph $S_p^{n+1}$. We prove that $\\tau(\\hat{S}_3^n)=\\frac {3^n+1} 2=\\frac{|V(\\hat{S}_3^n)|} 3$, and give an upper bound for $\\tau(\\hat{S}_p^n)$ for the case when $p\\geq 4$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.01947","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-18T00:33:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iyAOj3ao3b6/vhxefzNnvF/N6eKIgQ3aUgkv+7cNuqkbQuIk8WSecvecLtbGAcaawmb3wrvavr+78thlCHe2CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:28:43.103519Z"},"content_sha256":"d6b80fb58909c24bb8b8efaaaae6c73d8dc9f63cb0b265fc40334ad48134fa14","schema_version":"1.0","event_id":"sha256:d6b80fb58909c24bb8b8efaaaae6c73d8dc9f63cb0b265fc40334ad48134fa14"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PCZFMI65WRRTCG4HQOZBM2XCPR/bundle.json","state_url":"https://pith.science/pith/PCZFMI65WRRTCG4HQOZBM2XCPR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PCZFMI65WRRTCG4HQOZBM2XCPR/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-02T14:28:43Z","links":{"resolver":"https://pith.science/pith/PCZFMI65WRRTCG4HQOZBM2XCPR","bundle":"https://pith.science/pith/PCZFMI65WRRTCG4HQOZBM2XCPR/bundle.json","state":"https://pith.science/pith/PCZFMI65WRRTCG4HQOZBM2XCPR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PCZFMI65WRRTCG4HQOZBM2XCPR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:PCZFMI65WRRTCG4HQOZBM2XCPR","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":"a0a201e3beb568f20bf88c418e1627a6ac6c1b53796596b33b715e5eb263f714","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-05T10:14:12Z","title_canon_sha256":"a444c9dc89b8fc3c485495996494e6443d95b4ac1a187b13adcf142c41d389b8"},"schema_version":"1.0","source":{"id":"1710.01947","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.01947","created_at":"2026-05-18T00:33:37Z"},{"alias_kind":"arxiv_version","alias_value":"1710.01947v1","created_at":"2026-05-18T00:33:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.01947","created_at":"2026-05-18T00:33:37Z"},{"alias_kind":"pith_short_12","alias_value":"PCZFMI65WRRT","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PCZFMI65WRRTCG4H","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PCZFMI65","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:d6b80fb58909c24bb8b8efaaaae6c73d8dc9f63cb0b265fc40334ad48134fa14","target":"graph","created_at":"2026-05-18T00:33:37Z","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":"The feedback vertex number $\\tau(G)$ of a graph $G$ is the minimum number of vertices that can be deleted from $G$ such that the resultant graph does not contain a cycle. We show that $\\tau(S_p^n)=p^{n-1}(p-2)$ for the Sierpi\\'{n}ski graph $S_p^n$ with $p\\geq 2$ and $n\\geq 1$. The generalized Sierpi\\'{n}ski triangle graph $\\hat{S_p^n}$ is obtained by contracting all non-clique edges from the Sierpi\\'{n}ski graph $S_p^{n+1}$. We prove that $\\tau(\\hat{S}_3^n)=\\frac {3^n+1} 2=\\frac{|V(\\hat{S}_3^n)|} 3$, and give an upper bound for $\\tau(\\hat{S}_p^n)$ for the case when $p\\geq 4$.","authors_text":"Baoyindureng Wu, Biao Zhao, LiLi Yuan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-05T10:14:12Z","title":"Feedback vertex number of Sierpi\\'{n}ski-type graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.01947","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:1d35a98cf6b7b25772119b28d46d556d2c8418e8d757fef532d8a919c7bc9f6c","target":"record","created_at":"2026-05-18T00:33:37Z","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":"a0a201e3beb568f20bf88c418e1627a6ac6c1b53796596b33b715e5eb263f714","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-05T10:14:12Z","title_canon_sha256":"a444c9dc89b8fc3c485495996494e6443d95b4ac1a187b13adcf142c41d389b8"},"schema_version":"1.0","source":{"id":"1710.01947","kind":"arxiv","version":1}},"canonical_sha256":"78b25623ddb463311b8783b2166ae27c52c3a4675385e576547fb932354e1527","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"78b25623ddb463311b8783b2166ae27c52c3a4675385e576547fb932354e1527","first_computed_at":"2026-05-18T00:33:37.999789Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:37.999789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NL9eoc/bd7ze6Ga3ixHSCIDq7acxnwnI2yms9Y96rWjBhUuHMH0wL0I4mg33XVjRHTlTN3ExYxdFdYTozHYXDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:38.000281Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.01947","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1d35a98cf6b7b25772119b28d46d556d2c8418e8d757fef532d8a919c7bc9f6c","sha256:d6b80fb58909c24bb8b8efaaaae6c73d8dc9f63cb0b265fc40334ad48134fa14"],"state_sha256":"ef01a4a0de98febea8bdf77263661263987fc2cb334ccd668e0160aeb9cd7e8d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O5kroqg1bpbzuNGfX6JIyFXKLRIOzEPd1zmi8g6SxmZCrQNjIhso7e8iuD0/Q2dca3WNVM55bTyfh4Kk2XzECQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T14:28:43.106579Z","bundle_sha256":"8a141089c8ff1afaea3b5adaa523ca30b14d61fdb67dc227a6364792a63842c7"}}