{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:J73CVGAT4CJM7A2BTNITPCBPFG","short_pith_number":"pith:J73CVGAT","schema_version":"1.0","canonical_sha256":"4ff62a9813e092cf83419b5137882f2994f28fa96bcca25281dddc7f28642430","source":{"kind":"arxiv","id":"math/0601083","version":2},"attestation_state":"computed","paper":{"title":"Decisive creatures and large continuum","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Jakob Kellner, Saharon Shelah","submitted_at":"2006-01-04T22:15:06Z","abstract_excerpt":"For $f,g\\in\\omega\\ho$ let $\\mycfa_{f,g}$ be the minimal number of uniform $g$-splitting trees needed to cover the uniform $f$-splitting tree, i.e. for every branch $\\nu$ of the $f$-tree, one of the $g$-trees contains $\\nu$. $\\myc_{f,g}$ is the dual notion: For every branch $\\nu$, one of the $g$-trees guesses $\\nu(m)$ infinitely often.\n  It is consistent that $\\myc_{f_\\epsilon,g_\\epsilon}=\\mycfa_{f_\\epsilon,g_\\epsilon}=\\kappa_\\epsilon$ for $\\al1$ many pairwise different cardinals $\\kappa_\\epsilon$ and suitable pairs $(f_\\epsilon,g_\\epsilon)$.\n  For the proof we use creatures with sufficient big"},"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":"math/0601083","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2006-01-04T22:15:06Z","cross_cats_sorted":[],"title_canon_sha256":"45fd2d78f8377b4c999aa6264e96698fcc8f9759ab0e82959047ac8e87e8953b","abstract_canon_sha256":"3abc2f94bd8677169f88f87cf05eac0d6422db2c5296f9e9a6fe3693ced25b97"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:31:00.307808Z","signature_b64":"yW39TaSO35+wdGUzXWn4KAIFmUFG5mZujIEuYzwyQQOvVaqsdr2JzDuCpV87a4M/at3aTIDKo57bJ4uDgCkrCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ff62a9813e092cf83419b5137882f2994f28fa96bcca25281dddc7f28642430","last_reissued_at":"2026-05-18T04:31:00.306792Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:31:00.306792Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decisive creatures and large continuum","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Jakob Kellner, Saharon Shelah","submitted_at":"2006-01-04T22:15:06Z","abstract_excerpt":"For $f,g\\in\\omega\\ho$ let $\\mycfa_{f,g}$ be the minimal number of uniform $g$-splitting trees needed to cover the uniform $f$-splitting tree, i.e. for every branch $\\nu$ of the $f$-tree, one of the $g$-trees contains $\\nu$. $\\myc_{f,g}$ is the dual notion: For every branch $\\nu$, one of the $g$-trees guesses $\\nu(m)$ infinitely often.\n  It is consistent that $\\myc_{f_\\epsilon,g_\\epsilon}=\\mycfa_{f_\\epsilon,g_\\epsilon}=\\kappa_\\epsilon$ for $\\al1$ many pairwise different cardinals $\\kappa_\\epsilon$ and suitable pairs $(f_\\epsilon,g_\\epsilon)$.\n  For the proof we use creatures with sufficient big"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0601083","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":""},"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":"math/0601083","created_at":"2026-05-18T04:31:00.306981+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0601083v2","created_at":"2026-05-18T04:31:00.306981+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0601083","created_at":"2026-05-18T04:31:00.306981+00:00"},{"alias_kind":"pith_short_12","alias_value":"J73CVGAT4CJM","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_16","alias_value":"J73CVGAT4CJM7A2B","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_8","alias_value":"J73CVGAT","created_at":"2026-05-18T12:25:54.717736+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/J73CVGAT4CJM7A2BTNITPCBPFG","json":"https://pith.science/pith/J73CVGAT4CJM7A2BTNITPCBPFG.json","graph_json":"https://pith.science/api/pith-number/J73CVGAT4CJM7A2BTNITPCBPFG/graph.json","events_json":"https://pith.science/api/pith-number/J73CVGAT4CJM7A2BTNITPCBPFG/events.json","paper":"https://pith.science/paper/J73CVGAT"},"agent_actions":{"view_html":"https://pith.science/pith/J73CVGAT4CJM7A2BTNITPCBPFG","download_json":"https://pith.science/pith/J73CVGAT4CJM7A2BTNITPCBPFG.json","view_paper":"https://pith.science/paper/J73CVGAT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0601083&json=true","fetch_graph":"https://pith.science/api/pith-number/J73CVGAT4CJM7A2BTNITPCBPFG/graph.json","fetch_events":"https://pith.science/api/pith-number/J73CVGAT4CJM7A2BTNITPCBPFG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J73CVGAT4CJM7A2BTNITPCBPFG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J73CVGAT4CJM7A2BTNITPCBPFG/action/storage_attestation","attest_author":"https://pith.science/pith/J73CVGAT4CJM7A2BTNITPCBPFG/action/author_attestation","sign_citation":"https://pith.science/pith/J73CVGAT4CJM7A2BTNITPCBPFG/action/citation_signature","submit_replication":"https://pith.science/pith/J73CVGAT4CJM7A2BTNITPCBPFG/action/replication_record"}},"created_at":"2026-05-18T04:31:00.306981+00:00","updated_at":"2026-05-18T04:31:00.306981+00:00"}