{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1993:AL6PECC5X5OV65CZFBPY7CE4CO","short_pith_number":"pith:AL6PECC5","schema_version":"1.0","canonical_sha256":"02fcf2085dbf5d5f7459285f8f889c13a960f7b6bfa74ecca3193e4295731385","source":{"kind":"arxiv","id":"math/9308215","version":1},"attestation_state":"computed","paper":{"title":"Dominating functions and graphs","license":"","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Juris Stepr\\=ans, Reinhard Diestel, Saharon Shelah","submitted_at":"1993-08-15T00:00:00Z","abstract_excerpt":"A graph is called dominating if its vertices can be labelled with integers in such a way that for every function f: omega-> omega the graph contains a ray whose sequence of labels eventually exceeds f. We obtain a characterization of these graphs by producing a small family of dominating graphs with the property that every dominating graph must contain some member of the family."},"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/9308215","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.LO","submitted_at":"1993-08-15T00:00:00Z","cross_cats_sorted":[],"title_canon_sha256":"c3707b26c2aa2d4e035bb81b7bf12cd7ff757c00e63e56fb7b072ca8a464bbd4","abstract_canon_sha256":"de28bb9f3091374568d0cb03f33592c97c3a79fbc256619cf3b779c23dc10a1d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:05:51.969081Z","signature_b64":"dwQeJmXP8dgcFYyJAA4yW9AC41ZdjpmqOlSPrm0qOLpKAhdYEY15yz/8rIfV+km0JZ9Ha3GTv0P5mjRwDTuWAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"02fcf2085dbf5d5f7459285f8f889c13a960f7b6bfa74ecca3193e4295731385","last_reissued_at":"2026-05-18T01:05:51.968418Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:05:51.968418Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dominating functions and graphs","license":"","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Juris Stepr\\=ans, Reinhard Diestel, Saharon Shelah","submitted_at":"1993-08-15T00:00:00Z","abstract_excerpt":"A graph is called dominating if its vertices can be labelled with integers in such a way that for every function f: omega-> omega the graph contains a ray whose sequence of labels eventually exceeds f. We obtain a characterization of these graphs by producing a small family of dominating graphs with the property that every dominating graph must contain some member of the family."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/9308215","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":"math/9308215","created_at":"2026-05-18T01:05:51.968525+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/9308215v1","created_at":"2026-05-18T01:05:51.968525+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/9308215","created_at":"2026-05-18T01:05:51.968525+00:00"},{"alias_kind":"pith_short_12","alias_value":"AL6PECC5X5OV","created_at":"2026-05-18T12:25:47.102015+00:00"},{"alias_kind":"pith_short_16","alias_value":"AL6PECC5X5OV65CZ","created_at":"2026-05-18T12:25:47.102015+00:00"},{"alias_kind":"pith_short_8","alias_value":"AL6PECC5","created_at":"2026-05-18T12:25:47.102015+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/AL6PECC5X5OV65CZFBPY7CE4CO","json":"https://pith.science/pith/AL6PECC5X5OV65CZFBPY7CE4CO.json","graph_json":"https://pith.science/api/pith-number/AL6PECC5X5OV65CZFBPY7CE4CO/graph.json","events_json":"https://pith.science/api/pith-number/AL6PECC5X5OV65CZFBPY7CE4CO/events.json","paper":"https://pith.science/paper/AL6PECC5"},"agent_actions":{"view_html":"https://pith.science/pith/AL6PECC5X5OV65CZFBPY7CE4CO","download_json":"https://pith.science/pith/AL6PECC5X5OV65CZFBPY7CE4CO.json","view_paper":"https://pith.science/paper/AL6PECC5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/9308215&json=true","fetch_graph":"https://pith.science/api/pith-number/AL6PECC5X5OV65CZFBPY7CE4CO/graph.json","fetch_events":"https://pith.science/api/pith-number/AL6PECC5X5OV65CZFBPY7CE4CO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AL6PECC5X5OV65CZFBPY7CE4CO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AL6PECC5X5OV65CZFBPY7CE4CO/action/storage_attestation","attest_author":"https://pith.science/pith/AL6PECC5X5OV65CZFBPY7CE4CO/action/author_attestation","sign_citation":"https://pith.science/pith/AL6PECC5X5OV65CZFBPY7CE4CO/action/citation_signature","submit_replication":"https://pith.science/pith/AL6PECC5X5OV65CZFBPY7CE4CO/action/replication_record"}},"created_at":"2026-05-18T01:05:51.968525+00:00","updated_at":"2026-05-18T01:05:51.968525+00:00"}