{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:BL3ENAJCINREJDKZJJZHX5VZXY","short_pith_number":"pith:BL3ENAJC","schema_version":"1.0","canonical_sha256":"0af64681224362448d594a727bf6b9be25af7d2745c107fdf65c39d4740cf46c","source":{"kind":"arxiv","id":"1502.04377","version":1},"attestation_state":"computed","paper":{"title":"The Method(!) of \"Guess and Check\"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Doron Zeilberger, Shalosh B. Ekhad","submitted_at":"2015-02-15T22:45:59Z","abstract_excerpt":"The problems of enumerating lattice walks, with an arbitrary finite set of allowed steps, both in one and two dimensions, where one must always stay in the non-negative half-line and quarter-plane respectively, are used, as case studies, to illustrate the `naive' methodology of guess-and-check, where rigorous proofs are possible, but not worth the trouble. We argue that this is a metaphor for future math."},"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":"1502.04377","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-15T22:45:59Z","cross_cats_sorted":[],"title_canon_sha256":"bddd885f838c45e5af8a0f6799572d83a85bc62a5c467dd2911e34355c8387f6","abstract_canon_sha256":"1d8abe705e09ba0b1f660c8f0dbadc8344cee7d163d188f26f33b71ea639dd05"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:59.884734Z","signature_b64":"nkcRnAXpoyGj9rAwYEfxyeHS/5wnSCz96i90zBfTJijtOKM799f0dFe/yFKsQNszFnC9++zbQO0P6sOqfz5ECw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0af64681224362448d594a727bf6b9be25af7d2745c107fdf65c39d4740cf46c","last_reissued_at":"2026-05-18T02:26:59.884182Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:59.884182Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Method(!) of \"Guess and Check\"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Doron Zeilberger, Shalosh B. Ekhad","submitted_at":"2015-02-15T22:45:59Z","abstract_excerpt":"The problems of enumerating lattice walks, with an arbitrary finite set of allowed steps, both in one and two dimensions, where one must always stay in the non-negative half-line and quarter-plane respectively, are used, as case studies, to illustrate the `naive' methodology of guess-and-check, where rigorous proofs are possible, but not worth the trouble. We argue that this is a metaphor for future math."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.04377","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":"1502.04377","created_at":"2026-05-18T02:26:59.884258+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.04377v1","created_at":"2026-05-18T02:26:59.884258+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.04377","created_at":"2026-05-18T02:26:59.884258+00:00"},{"alias_kind":"pith_short_12","alias_value":"BL3ENAJCINRE","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"BL3ENAJCINREJDKZ","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"BL3ENAJC","created_at":"2026-05-18T12:29:14.074870+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/BL3ENAJCINREJDKZJJZHX5VZXY","json":"https://pith.science/pith/BL3ENAJCINREJDKZJJZHX5VZXY.json","graph_json":"https://pith.science/api/pith-number/BL3ENAJCINREJDKZJJZHX5VZXY/graph.json","events_json":"https://pith.science/api/pith-number/BL3ENAJCINREJDKZJJZHX5VZXY/events.json","paper":"https://pith.science/paper/BL3ENAJC"},"agent_actions":{"view_html":"https://pith.science/pith/BL3ENAJCINREJDKZJJZHX5VZXY","download_json":"https://pith.science/pith/BL3ENAJCINREJDKZJJZHX5VZXY.json","view_paper":"https://pith.science/paper/BL3ENAJC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.04377&json=true","fetch_graph":"https://pith.science/api/pith-number/BL3ENAJCINREJDKZJJZHX5VZXY/graph.json","fetch_events":"https://pith.science/api/pith-number/BL3ENAJCINREJDKZJJZHX5VZXY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BL3ENAJCINREJDKZJJZHX5VZXY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BL3ENAJCINREJDKZJJZHX5VZXY/action/storage_attestation","attest_author":"https://pith.science/pith/BL3ENAJCINREJDKZJJZHX5VZXY/action/author_attestation","sign_citation":"https://pith.science/pith/BL3ENAJCINREJDKZJJZHX5VZXY/action/citation_signature","submit_replication":"https://pith.science/pith/BL3ENAJCINREJDKZJJZHX5VZXY/action/replication_record"}},"created_at":"2026-05-18T02:26:59.884258+00:00","updated_at":"2026-05-18T02:26:59.884258+00:00"}