{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:M6NOZ4LYL442EUQRCD7AU3UE3V","short_pith_number":"pith:M6NOZ4LY","schema_version":"1.0","canonical_sha256":"679aecf1785f39a2521110fe0a6e84dd4c00f6a0da0ba033d4dc9d00e609fd67","source":{"kind":"arxiv","id":"1205.1824","version":3},"attestation_state":"computed","paper":{"title":"An extremal problem on crossing vectors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Bartosz Walczak, Micha{\\l} Laso\\'n, Noah Streib, Piotr Micek, William T. Trotter","submitted_at":"2012-05-08T20:57:11Z","abstract_excerpt":"For positive integers $w$ and $k$, two vectors $A$ and $B$ from $\\mathbb{Z}^w$ are called $k$-crossing if there are two coordinates $i$ and $j$ such that $A[i]-B[i]\\geq k$ and $B[j]-A[j]\\geq k$. What is the maximum size of a family of pairwise $1$-crossing and pairwise non-$k$-crossing vectors in $\\mathbb{Z}^w$? We state a conjecture that the answer is $k^{w-1}$. We prove the conjecture for $w\\leq 3$ and provide weaker upper bounds for $w\\geq 4$. Also, for all $k$ and $w$, we construct several quite different examples of families of desired size $k^{w-1}$. This research is motivated by a natur"},"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":"1205.1824","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-05-08T20:57:11Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"150b4c614df29b50ae08abf2ec1e0c6467729f63f3eef9a37044c24807e19bdf","abstract_canon_sha256":"1a5c83f36e097775769552ea6f79966b97e5f18c4ed982a6bd5c15bb350a4656"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:57.093794Z","signature_b64":"2c8u4mFIO2mONUCi0Ninzf6m9QSQSxF0CeDohKMLRnRPSLUOgmK/BTn4lqHEUJefYx3E+hcVm6c1/HbO9fHMBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"679aecf1785f39a2521110fe0a6e84dd4c00f6a0da0ba033d4dc9d00e609fd67","last_reissued_at":"2026-05-18T02:44:57.093151Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:57.093151Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An extremal problem on crossing vectors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Bartosz Walczak, Micha{\\l} Laso\\'n, Noah Streib, Piotr Micek, William T. Trotter","submitted_at":"2012-05-08T20:57:11Z","abstract_excerpt":"For positive integers $w$ and $k$, two vectors $A$ and $B$ from $\\mathbb{Z}^w$ are called $k$-crossing if there are two coordinates $i$ and $j$ such that $A[i]-B[i]\\geq k$ and $B[j]-A[j]\\geq k$. What is the maximum size of a family of pairwise $1$-crossing and pairwise non-$k$-crossing vectors in $\\mathbb{Z}^w$? We state a conjecture that the answer is $k^{w-1}$. We prove the conjecture for $w\\leq 3$ and provide weaker upper bounds for $w\\geq 4$. Also, for all $k$ and $w$, we construct several quite different examples of families of desired size $k^{w-1}$. This research is motivated by a natur"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.1824","kind":"arxiv","version":3},"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":"1205.1824","created_at":"2026-05-18T02:44:57.093249+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.1824v3","created_at":"2026-05-18T02:44:57.093249+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.1824","created_at":"2026-05-18T02:44:57.093249+00:00"},{"alias_kind":"pith_short_12","alias_value":"M6NOZ4LYL442","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"M6NOZ4LYL442EUQR","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"M6NOZ4LY","created_at":"2026-05-18T12:27:14.488303+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/M6NOZ4LYL442EUQRCD7AU3UE3V","json":"https://pith.science/pith/M6NOZ4LYL442EUQRCD7AU3UE3V.json","graph_json":"https://pith.science/api/pith-number/M6NOZ4LYL442EUQRCD7AU3UE3V/graph.json","events_json":"https://pith.science/api/pith-number/M6NOZ4LYL442EUQRCD7AU3UE3V/events.json","paper":"https://pith.science/paper/M6NOZ4LY"},"agent_actions":{"view_html":"https://pith.science/pith/M6NOZ4LYL442EUQRCD7AU3UE3V","download_json":"https://pith.science/pith/M6NOZ4LYL442EUQRCD7AU3UE3V.json","view_paper":"https://pith.science/paper/M6NOZ4LY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.1824&json=true","fetch_graph":"https://pith.science/api/pith-number/M6NOZ4LYL442EUQRCD7AU3UE3V/graph.json","fetch_events":"https://pith.science/api/pith-number/M6NOZ4LYL442EUQRCD7AU3UE3V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M6NOZ4LYL442EUQRCD7AU3UE3V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M6NOZ4LYL442EUQRCD7AU3UE3V/action/storage_attestation","attest_author":"https://pith.science/pith/M6NOZ4LYL442EUQRCD7AU3UE3V/action/author_attestation","sign_citation":"https://pith.science/pith/M6NOZ4LYL442EUQRCD7AU3UE3V/action/citation_signature","submit_replication":"https://pith.science/pith/M6NOZ4LYL442EUQRCD7AU3UE3V/action/replication_record"}},"created_at":"2026-05-18T02:44:57.093249+00:00","updated_at":"2026-05-18T02:44:57.093249+00:00"}