{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:CDCQUQVUV4CKVTSW572KS5C3XZ","short_pith_number":"pith:CDCQUQVU","canonical_record":{"source":{"id":"1412.6201","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-19T02:53:57Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"0bbe69a99feb6c902f97b149e22907954da600b742ebb3ad589fb09f9ce7b43e","abstract_canon_sha256":"53b5e76a55f321d380634b9bad443d7a8a32d7682ce79f20b0f7fc1d1a00dc49"},"schema_version":"1.0"},"canonical_sha256":"10c50a42b4af04aace56eff4a9745bbe67ddd87455c3dd4d9db0356e3ad411f5","source":{"kind":"arxiv","id":"1412.6201","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.6201","created_at":"2026-05-18T02:30:39Z"},{"alias_kind":"arxiv_version","alias_value":"1412.6201v1","created_at":"2026-05-18T02:30:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.6201","created_at":"2026-05-18T02:30:39Z"},{"alias_kind":"pith_short_12","alias_value":"CDCQUQVUV4CK","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"CDCQUQVUV4CKVTSW","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"CDCQUQVU","created_at":"2026-05-18T12:28:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:CDCQUQVUV4CKVTSW572KS5C3XZ","target":"record","payload":{"canonical_record":{"source":{"id":"1412.6201","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-19T02:53:57Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"0bbe69a99feb6c902f97b149e22907954da600b742ebb3ad589fb09f9ce7b43e","abstract_canon_sha256":"53b5e76a55f321d380634b9bad443d7a8a32d7682ce79f20b0f7fc1d1a00dc49"},"schema_version":"1.0"},"canonical_sha256":"10c50a42b4af04aace56eff4a9745bbe67ddd87455c3dd4d9db0356e3ad411f5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:39.382225Z","signature_b64":"rLnbuj1bI9eNgsJRRK+CQ2EzCNQUmx2lHbkwTI4iysCv+4hhllmk1VAezvQr5te5PmQOI6RS3ipCRVRUeKFeDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"10c50a42b4af04aace56eff4a9745bbe67ddd87455c3dd4d9db0356e3ad411f5","last_reissued_at":"2026-05-18T02:30:39.381789Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:39.381789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.6201","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:30:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4EYRWPzcSKPzZ5IfbP0+rHH4IUduGSzoZpI/hYZO61yOau+NOvK2ccC4Uu+RI8buQ8M/sV3DFGVk0wCfkioLDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:33:01.555623Z"},"content_sha256":"75dae669d9ade579f89e48254a21c791de56e0d902440d784e5bbc66aa7a614f","schema_version":"1.0","event_id":"sha256:75dae669d9ade579f89e48254a21c791de56e0d902440d784e5bbc66aa7a614f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:CDCQUQVUV4CKVTSW572KS5C3XZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Upper Bound on the Size of Obstructions for Bounded Linear Rank-Width","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Mamadou Moustapha Kant\\'e, O-joung Kwon","submitted_at":"2014-12-19T02:53:57Z","abstract_excerpt":"We provide a doubly exponential upper bound in $p$ on the size of forbidden pivot-minors for symmetric or skew-symmetric matrices over a fixed finite field $\\mathbb{F}$ of linear rank-width at most $p$. As a corollary, we obtain a doubly exponential upper bound in $p$ on the size of forbidden vertex-minors for graphs of linear rank-width at most $p$. This solves an open question raised by Jeong, Kwon, and Oum [Excluded vertex-minors for graphs of linear rank-width at most $k$. European J. Combin., 41:242--257, 2014]. We also give a doubly exponential upper bound in $p$ on the size of forbidden"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.6201","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:30:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vEnQPvEd3J+gSzORf7P61PNyyhZHNV1fJ9Qjd3Q/+d3+gQYNoRXu/oKPe1lWkYdCgsXfvqiAvhxqf0AVvwsLDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:33:01.556066Z"},"content_sha256":"c49e2dda42201ae46b9d3ffe94535e52ceb3f6e52920fe0296b4292e039daa96","schema_version":"1.0","event_id":"sha256:c49e2dda42201ae46b9d3ffe94535e52ceb3f6e52920fe0296b4292e039daa96"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CDCQUQVUV4CKVTSW572KS5C3XZ/bundle.json","state_url":"https://pith.science/pith/CDCQUQVUV4CKVTSW572KS5C3XZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CDCQUQVUV4CKVTSW572KS5C3XZ/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-05-28T10:33:01Z","links":{"resolver":"https://pith.science/pith/CDCQUQVUV4CKVTSW572KS5C3XZ","bundle":"https://pith.science/pith/CDCQUQVUV4CKVTSW572KS5C3XZ/bundle.json","state":"https://pith.science/pith/CDCQUQVUV4CKVTSW572KS5C3XZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CDCQUQVUV4CKVTSW572KS5C3XZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:CDCQUQVUV4CKVTSW572KS5C3XZ","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":"53b5e76a55f321d380634b9bad443d7a8a32d7682ce79f20b0f7fc1d1a00dc49","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-19T02:53:57Z","title_canon_sha256":"0bbe69a99feb6c902f97b149e22907954da600b742ebb3ad589fb09f9ce7b43e"},"schema_version":"1.0","source":{"id":"1412.6201","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.6201","created_at":"2026-05-18T02:30:39Z"},{"alias_kind":"arxiv_version","alias_value":"1412.6201v1","created_at":"2026-05-18T02:30:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.6201","created_at":"2026-05-18T02:30:39Z"},{"alias_kind":"pith_short_12","alias_value":"CDCQUQVUV4CK","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"CDCQUQVUV4CKVTSW","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"CDCQUQVU","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:c49e2dda42201ae46b9d3ffe94535e52ceb3f6e52920fe0296b4292e039daa96","target":"graph","created_at":"2026-05-18T02:30:39Z","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 provide a doubly exponential upper bound in $p$ on the size of forbidden pivot-minors for symmetric or skew-symmetric matrices over a fixed finite field $\\mathbb{F}$ of linear rank-width at most $p$. As a corollary, we obtain a doubly exponential upper bound in $p$ on the size of forbidden vertex-minors for graphs of linear rank-width at most $p$. This solves an open question raised by Jeong, Kwon, and Oum [Excluded vertex-minors for graphs of linear rank-width at most $k$. European J. Combin., 41:242--257, 2014]. We also give a doubly exponential upper bound in $p$ on the size of forbidden","authors_text":"Mamadou Moustapha Kant\\'e, O-joung Kwon","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-19T02:53:57Z","title":"An Upper Bound on the Size of Obstructions for Bounded Linear Rank-Width"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.6201","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:75dae669d9ade579f89e48254a21c791de56e0d902440d784e5bbc66aa7a614f","target":"record","created_at":"2026-05-18T02:30:39Z","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":"53b5e76a55f321d380634b9bad443d7a8a32d7682ce79f20b0f7fc1d1a00dc49","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-19T02:53:57Z","title_canon_sha256":"0bbe69a99feb6c902f97b149e22907954da600b742ebb3ad589fb09f9ce7b43e"},"schema_version":"1.0","source":{"id":"1412.6201","kind":"arxiv","version":1}},"canonical_sha256":"10c50a42b4af04aace56eff4a9745bbe67ddd87455c3dd4d9db0356e3ad411f5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"10c50a42b4af04aace56eff4a9745bbe67ddd87455c3dd4d9db0356e3ad411f5","first_computed_at":"2026-05-18T02:30:39.381789Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:30:39.381789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rLnbuj1bI9eNgsJRRK+CQ2EzCNQUmx2lHbkwTI4iysCv+4hhllmk1VAezvQr5te5PmQOI6RS3ipCRVRUeKFeDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:30:39.382225Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.6201","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:75dae669d9ade579f89e48254a21c791de56e0d902440d784e5bbc66aa7a614f","sha256:c49e2dda42201ae46b9d3ffe94535e52ceb3f6e52920fe0296b4292e039daa96"],"state_sha256":"ee2e1b4707d9d483ebde34fe8dbe9dde7ba6a31dadef81b5faadbd81e5b3b7b7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hmXYpJSLesIpVZtLtgCIJcbBlt/NxoeR7lF8M+i8C742gODZQRAK7rlRj9in0xJDxR8VHtesRggLjY7XZ31dCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T10:33:01.558759Z","bundle_sha256":"a42b916f604957489ea4892f26f2fcf4bb874eced392e3aeecbc6fb2f2931b9b"}}