{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:HZGAKO376U2OPNFKO3T6X5USPA","short_pith_number":"pith:HZGAKO37","schema_version":"1.0","canonical_sha256":"3e4c053b7ff534e7b4aa76e7ebf692780270168d032239416c4dcdeb85030e07","source":{"kind":"arxiv","id":"1807.06866","version":1},"attestation_state":"computed","paper":{"title":"Vertex Tur\\'an problems for the oriented hypercube","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abhishek Methuku, Bal\\'azs Patk\\'os, D\\'aniel Gerbner, D\\'aniel T. Nagy, M\\'at\\'e Vizer","submitted_at":"2018-07-18T11:13:37Z","abstract_excerpt":"In this short note we consider the oriented vertex Tur\\'an problem in the hypercube: for a fixed oriented graph $\\overrightarrow{F}$, determine the maximum size $ex_v(\\overrightarrow{F}, \\overrightarrow{Q_n})$ of a subset $U$ of the vertices of the oriented hypercube $\\overrightarrow{Q_n}$ such that the induced subgraph $\\overrightarrow{Q_n}[U]$ does not contain any copy of $\\overrightarrow{F}$. We obtain the exact value of $ex_v(\\overrightarrow{P_k}, \\overrightarrow{Q_n})$ for the directed path $\\overrightarrow{P_k}$, the exact value of $ex_v(\\overrightarrow{V_2}, \\overrightarrow{Q_n})$ for t"},"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":"1807.06866","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-18T11:13:37Z","cross_cats_sorted":[],"title_canon_sha256":"04d42810e69acbbe755ae74f404ee2404c49a43427b6a0ffdb8ac7a1fdd6b093","abstract_canon_sha256":"155324b1b1d3ca4e6a99e89458dd4437e8a870d8c0f862b0534cf321dc0f999d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:25.514563Z","signature_b64":"J/s2ukMUt4ofV0kffrANyERGlf4nDtW8zpyG+k8cU111CiexgQ1af+zBT4EUN7l/v1D+natBu64L4oFHzx3kBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e4c053b7ff534e7b4aa76e7ebf692780270168d032239416c4dcdeb85030e07","last_reissued_at":"2026-05-18T00:10:25.513812Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:25.513812Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Vertex Tur\\'an problems for the oriented hypercube","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abhishek Methuku, Bal\\'azs Patk\\'os, D\\'aniel Gerbner, D\\'aniel T. Nagy, M\\'at\\'e Vizer","submitted_at":"2018-07-18T11:13:37Z","abstract_excerpt":"In this short note we consider the oriented vertex Tur\\'an problem in the hypercube: for a fixed oriented graph $\\overrightarrow{F}$, determine the maximum size $ex_v(\\overrightarrow{F}, \\overrightarrow{Q_n})$ of a subset $U$ of the vertices of the oriented hypercube $\\overrightarrow{Q_n}$ such that the induced subgraph $\\overrightarrow{Q_n}[U]$ does not contain any copy of $\\overrightarrow{F}$. We obtain the exact value of $ex_v(\\overrightarrow{P_k}, \\overrightarrow{Q_n})$ for the directed path $\\overrightarrow{P_k}$, the exact value of $ex_v(\\overrightarrow{V_2}, \\overrightarrow{Q_n})$ for t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.06866","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":"1807.06866","created_at":"2026-05-18T00:10:25.513913+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.06866v1","created_at":"2026-05-18T00:10:25.513913+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.06866","created_at":"2026-05-18T00:10:25.513913+00:00"},{"alias_kind":"pith_short_12","alias_value":"HZGAKO376U2O","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"HZGAKO376U2OPNFK","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"HZGAKO37","created_at":"2026-05-18T12:32:28.185984+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/HZGAKO376U2OPNFKO3T6X5USPA","json":"https://pith.science/pith/HZGAKO376U2OPNFKO3T6X5USPA.json","graph_json":"https://pith.science/api/pith-number/HZGAKO376U2OPNFKO3T6X5USPA/graph.json","events_json":"https://pith.science/api/pith-number/HZGAKO376U2OPNFKO3T6X5USPA/events.json","paper":"https://pith.science/paper/HZGAKO37"},"agent_actions":{"view_html":"https://pith.science/pith/HZGAKO376U2OPNFKO3T6X5USPA","download_json":"https://pith.science/pith/HZGAKO376U2OPNFKO3T6X5USPA.json","view_paper":"https://pith.science/paper/HZGAKO37","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.06866&json=true","fetch_graph":"https://pith.science/api/pith-number/HZGAKO376U2OPNFKO3T6X5USPA/graph.json","fetch_events":"https://pith.science/api/pith-number/HZGAKO376U2OPNFKO3T6X5USPA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HZGAKO376U2OPNFKO3T6X5USPA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HZGAKO376U2OPNFKO3T6X5USPA/action/storage_attestation","attest_author":"https://pith.science/pith/HZGAKO376U2OPNFKO3T6X5USPA/action/author_attestation","sign_citation":"https://pith.science/pith/HZGAKO376U2OPNFKO3T6X5USPA/action/citation_signature","submit_replication":"https://pith.science/pith/HZGAKO376U2OPNFKO3T6X5USPA/action/replication_record"}},"created_at":"2026-05-18T00:10:25.513913+00:00","updated_at":"2026-05-18T00:10:25.513913+00:00"}