{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:JEM3CEZKFE4673E2FUPQKQXRSM","short_pith_number":"pith:JEM3CEZK","schema_version":"1.0","canonical_sha256":"4919b1132a2939efec9a2d1f0542f19305a19d616e47f59d483ca8c01afdd1fd","source":{"kind":"arxiv","id":"1805.02715","version":1},"attestation_state":"computed","paper":{"title":"Anti-van der Waerden Numbers of Graph Products","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alex Schulte, Hunter Rehm, Nathan Warnberg","submitted_at":"2018-05-07T19:42:57Z","abstract_excerpt":"In this paper, anti-van der Waerden numbers on Cartesian products of graphs are investigated and a conjecture made by Schulte, et al (see arXiv:1802.01509) is answered. In particular, the anti-van der Waerden number of the Cartesian product of two graphs has an upper bound of four. This result is then used to determine the anti-van der Waerden number for any Cartesian product of two paths."},"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":"1805.02715","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-07T19:42:57Z","cross_cats_sorted":[],"title_canon_sha256":"5a84bc50042777cdb6314aeba29814e75f7fa14518ae42d9c4bee607d9165251","abstract_canon_sha256":"1d2a0c6781f184619329e7c2b93a3d8627e57793ba2897a6fe8e3f88544e4fa9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:35.964571Z","signature_b64":"lbtAd6elSVCyJJODU1x09UdRR4boWrHPBgXEBW7ze+XQGZhqAleaSLAf3gZ/6draicSHzZy5abg9SecYOp/cBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4919b1132a2939efec9a2d1f0542f19305a19d616e47f59d483ca8c01afdd1fd","last_reissued_at":"2026-05-18T00:16:35.963872Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:35.963872Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Anti-van der Waerden Numbers of Graph Products","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alex Schulte, Hunter Rehm, Nathan Warnberg","submitted_at":"2018-05-07T19:42:57Z","abstract_excerpt":"In this paper, anti-van der Waerden numbers on Cartesian products of graphs are investigated and a conjecture made by Schulte, et al (see arXiv:1802.01509) is answered. In particular, the anti-van der Waerden number of the Cartesian product of two graphs has an upper bound of four. This result is then used to determine the anti-van der Waerden number for any Cartesian product of two paths."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.02715","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":"1805.02715","created_at":"2026-05-18T00:16:35.963987+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.02715v1","created_at":"2026-05-18T00:16:35.963987+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.02715","created_at":"2026-05-18T00:16:35.963987+00:00"},{"alias_kind":"pith_short_12","alias_value":"JEM3CEZKFE46","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"JEM3CEZKFE4673E2","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"JEM3CEZK","created_at":"2026-05-18T12:32:31.084164+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/JEM3CEZKFE4673E2FUPQKQXRSM","json":"https://pith.science/pith/JEM3CEZKFE4673E2FUPQKQXRSM.json","graph_json":"https://pith.science/api/pith-number/JEM3CEZKFE4673E2FUPQKQXRSM/graph.json","events_json":"https://pith.science/api/pith-number/JEM3CEZKFE4673E2FUPQKQXRSM/events.json","paper":"https://pith.science/paper/JEM3CEZK"},"agent_actions":{"view_html":"https://pith.science/pith/JEM3CEZKFE4673E2FUPQKQXRSM","download_json":"https://pith.science/pith/JEM3CEZKFE4673E2FUPQKQXRSM.json","view_paper":"https://pith.science/paper/JEM3CEZK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.02715&json=true","fetch_graph":"https://pith.science/api/pith-number/JEM3CEZKFE4673E2FUPQKQXRSM/graph.json","fetch_events":"https://pith.science/api/pith-number/JEM3CEZKFE4673E2FUPQKQXRSM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JEM3CEZKFE4673E2FUPQKQXRSM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JEM3CEZKFE4673E2FUPQKQXRSM/action/storage_attestation","attest_author":"https://pith.science/pith/JEM3CEZKFE4673E2FUPQKQXRSM/action/author_attestation","sign_citation":"https://pith.science/pith/JEM3CEZKFE4673E2FUPQKQXRSM/action/citation_signature","submit_replication":"https://pith.science/pith/JEM3CEZKFE4673E2FUPQKQXRSM/action/replication_record"}},"created_at":"2026-05-18T00:16:35.963987+00:00","updated_at":"2026-05-18T00:16:35.963987+00:00"}