{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:XWZTNE2WAVFSNWIOR7RLVXOIQL","short_pith_number":"pith:XWZTNE2W","canonical_record":{"source":{"id":"1502.02433","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-09T11:07:01Z","cross_cats_sorted":[],"title_canon_sha256":"98df1cd44276c571db8f0359e48f518f392f0a2bcf8d8ad462edd9dacc7c5aec","abstract_canon_sha256":"8503c31b555c39416dc7823ccfd98aef17c2225191fc36acd7d07690db8d1f87"},"schema_version":"1.0"},"canonical_sha256":"bdb3369356054b26d90e8fe2baddc882fc4e12b542206872703a0fe7edcd1a93","source":{"kind":"arxiv","id":"1502.02433","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.02433","created_at":"2026-05-18T02:27:42Z"},{"alias_kind":"arxiv_version","alias_value":"1502.02433v1","created_at":"2026-05-18T02:27:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.02433","created_at":"2026-05-18T02:27:42Z"},{"alias_kind":"pith_short_12","alias_value":"XWZTNE2WAVFS","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XWZTNE2WAVFSNWIO","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XWZTNE2W","created_at":"2026-05-18T12:29:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:XWZTNE2WAVFSNWIOR7RLVXOIQL","target":"record","payload":{"canonical_record":{"source":{"id":"1502.02433","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-09T11:07:01Z","cross_cats_sorted":[],"title_canon_sha256":"98df1cd44276c571db8f0359e48f518f392f0a2bcf8d8ad462edd9dacc7c5aec","abstract_canon_sha256":"8503c31b555c39416dc7823ccfd98aef17c2225191fc36acd7d07690db8d1f87"},"schema_version":"1.0"},"canonical_sha256":"bdb3369356054b26d90e8fe2baddc882fc4e12b542206872703a0fe7edcd1a93","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:42.376501Z","signature_b64":"EYzAlSCoDWrenHfq7T9MCfub6hp5zPt18tVvE27vz7zfGWvc4dBZF/yexHmtlJoDsamQJS0jRMQhDUvT2F7+AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bdb3369356054b26d90e8fe2baddc882fc4e12b542206872703a0fe7edcd1a93","last_reissued_at":"2026-05-18T02:27:42.375615Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:42.375615Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.02433","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:27:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q0dMTed3pvbNTkxCwXeDVgsvA6MhtUuNOdE2u33Z7V5KWhjOkhhAqYja7Z/AVcINZUDpCO5jDzaEZl3Z4+OfAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:29:26.550210Z"},"content_sha256":"6447271b7a9f9a1a9d07620ac3163929d9940dfa18fbc157710c6fc9f97bc258","schema_version":"1.0","event_id":"sha256:6447271b7a9f9a1a9d07620ac3163929d9940dfa18fbc157710c6fc9f97bc258"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:XWZTNE2WAVFSNWIOR7RLVXOIQL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A tournament approach to pattern avoiding matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Asaf Shapira, Raphy Yuster","submitted_at":"2015-02-09T11:07:01Z","abstract_excerpt":"We consider the following Tur\\'an-type problem: given a fixed tournament $H$, what is the least integer $t=t(n,H)$ so that adding $t$ edges to any $n$-vertex tournament, results in a digraph containing a copy of $H$. Similarly, what is the least integer $t=t(T_n,H)$ so that adding $t$ edges to the $n$-vertex transitive tournament, results in a digraph containing a copy of $H$. Besides proving several results on these problems, our main contributions are the following:\n  (1) Pach and Tardos conjectured that if $M$ is an acyclic $0/1$ matrix, then any $n \\times n$ matrix with $n(\\log n)^{O(1)}$ "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.02433","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:27:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qp4yZLhnl3xJdvjg2v5s3gFe7IV19x4cPIbpwS7Rxf9Ydqi0l28Zdf+I+s1FsnHuexkgWZImV3vY81GZrSZ1DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:29:26.550566Z"},"content_sha256":"fe8c7c8f930ab78620dc8c839aa1b0a857bfc9a4647abfdf3b709e7b8d8c6f6d","schema_version":"1.0","event_id":"sha256:fe8c7c8f930ab78620dc8c839aa1b0a857bfc9a4647abfdf3b709e7b8d8c6f6d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XWZTNE2WAVFSNWIOR7RLVXOIQL/bundle.json","state_url":"https://pith.science/pith/XWZTNE2WAVFSNWIOR7RLVXOIQL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XWZTNE2WAVFSNWIOR7RLVXOIQL/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-03T22:29:26Z","links":{"resolver":"https://pith.science/pith/XWZTNE2WAVFSNWIOR7RLVXOIQL","bundle":"https://pith.science/pith/XWZTNE2WAVFSNWIOR7RLVXOIQL/bundle.json","state":"https://pith.science/pith/XWZTNE2WAVFSNWIOR7RLVXOIQL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XWZTNE2WAVFSNWIOR7RLVXOIQL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:XWZTNE2WAVFSNWIOR7RLVXOIQL","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"8503c31b555c39416dc7823ccfd98aef17c2225191fc36acd7d07690db8d1f87","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-09T11:07:01Z","title_canon_sha256":"98df1cd44276c571db8f0359e48f518f392f0a2bcf8d8ad462edd9dacc7c5aec"},"schema_version":"1.0","source":{"id":"1502.02433","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.02433","created_at":"2026-05-18T02:27:42Z"},{"alias_kind":"arxiv_version","alias_value":"1502.02433v1","created_at":"2026-05-18T02:27:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.02433","created_at":"2026-05-18T02:27:42Z"},{"alias_kind":"pith_short_12","alias_value":"XWZTNE2WAVFS","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XWZTNE2WAVFSNWIO","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XWZTNE2W","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:fe8c7c8f930ab78620dc8c839aa1b0a857bfc9a4647abfdf3b709e7b8d8c6f6d","target":"graph","created_at":"2026-05-18T02:27:42Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We consider the following Tur\\'an-type problem: given a fixed tournament $H$, what is the least integer $t=t(n,H)$ so that adding $t$ edges to any $n$-vertex tournament, results in a digraph containing a copy of $H$. Similarly, what is the least integer $t=t(T_n,H)$ so that adding $t$ edges to the $n$-vertex transitive tournament, results in a digraph containing a copy of $H$. Besides proving several results on these problems, our main contributions are the following:\n  (1) Pach and Tardos conjectured that if $M$ is an acyclic $0/1$ matrix, then any $n \\times n$ matrix with $n(\\log n)^{O(1)}$ ","authors_text":"Asaf Shapira, Raphy Yuster","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-09T11:07:01Z","title":"A tournament approach to pattern avoiding matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.02433","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:6447271b7a9f9a1a9d07620ac3163929d9940dfa18fbc157710c6fc9f97bc258","target":"record","created_at":"2026-05-18T02:27:42Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"8503c31b555c39416dc7823ccfd98aef17c2225191fc36acd7d07690db8d1f87","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-09T11:07:01Z","title_canon_sha256":"98df1cd44276c571db8f0359e48f518f392f0a2bcf8d8ad462edd9dacc7c5aec"},"schema_version":"1.0","source":{"id":"1502.02433","kind":"arxiv","version":1}},"canonical_sha256":"bdb3369356054b26d90e8fe2baddc882fc4e12b542206872703a0fe7edcd1a93","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bdb3369356054b26d90e8fe2baddc882fc4e12b542206872703a0fe7edcd1a93","first_computed_at":"2026-05-18T02:27:42.375615Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:27:42.375615Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EYzAlSCoDWrenHfq7T9MCfub6hp5zPt18tVvE27vz7zfGWvc4dBZF/yexHmtlJoDsamQJS0jRMQhDUvT2F7+AA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:27:42.376501Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.02433","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6447271b7a9f9a1a9d07620ac3163929d9940dfa18fbc157710c6fc9f97bc258","sha256:fe8c7c8f930ab78620dc8c839aa1b0a857bfc9a4647abfdf3b709e7b8d8c6f6d"],"state_sha256":"fb50f9ed08229b168fcc86d93e6571f74553394bd9fd02b48136759f2c80d553"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mWcfD8RBHaXIPyqfycv9bRHrFI8BOe8JkPVw8iXqKEBpScmdSVircpFBae2HHD6TRCNO7+RUAO0U5UNtUfWRDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T22:29:26.552681Z","bundle_sha256":"f1e58f9a5c510231500b6e59b413d74c1cbac675e3050b6986388bb078529cf0"}}