{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:6VZUITU6JBRSOC6N3I7IG75IC4","short_pith_number":"pith:6VZUITU6","canonical_record":{"source":{"id":"1901.01212","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2019-01-04T17:10:12Z","cross_cats_sorted":[],"title_canon_sha256":"b8d0c9b78911e58b6571b1b2340e6611e70cd026cdc208ab0cc9e69c2c04c1b1","abstract_canon_sha256":"8d269dc7b9c75ecb15ffd771cd301f69fa88f6d5add6132c5b6f0c6fc89af809"},"schema_version":"1.0"},"canonical_sha256":"f573444e9e4863270bcdda3e837fa8173b2132ab6f2304db0246f9af46ede7ab","source":{"kind":"arxiv","id":"1901.01212","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.01212","created_at":"2026-05-17T23:56:56Z"},{"alias_kind":"arxiv_version","alias_value":"1901.01212v1","created_at":"2026-05-17T23:56:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.01212","created_at":"2026-05-17T23:56:56Z"},{"alias_kind":"pith_short_12","alias_value":"6VZUITU6JBRS","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"6VZUITU6JBRSOC6N","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"6VZUITU6","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:6VZUITU6JBRSOC6N3I7IG75IC4","target":"record","payload":{"canonical_record":{"source":{"id":"1901.01212","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2019-01-04T17:10:12Z","cross_cats_sorted":[],"title_canon_sha256":"b8d0c9b78911e58b6571b1b2340e6611e70cd026cdc208ab0cc9e69c2c04c1b1","abstract_canon_sha256":"8d269dc7b9c75ecb15ffd771cd301f69fa88f6d5add6132c5b6f0c6fc89af809"},"schema_version":"1.0"},"canonical_sha256":"f573444e9e4863270bcdda3e837fa8173b2132ab6f2304db0246f9af46ede7ab","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:56.725868Z","signature_b64":"B4q4V3uT9cjPKgn0rR+vipmWuCUHRIRx3KsrvJLJceI++go/yhxOQYYRR8FQoqexbYiKHlpKjITiZZc26JR+CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f573444e9e4863270bcdda3e837fa8173b2132ab6f2304db0246f9af46ede7ab","last_reissued_at":"2026-05-17T23:56:56.725300Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:56.725300Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.01212","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-17T23:56:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/arZhYzQljmt8CPe/pfLESPcZ+TOaTTqvQpW6Zjtyd3SuaZDe+LEUQB7wqH3fq6rXkYmhKN0b9o0EU3HbzuDBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:08:04.197695Z"},"content_sha256":"90537f5817cfd0208728ba86719266c4aa88f589975de09fef4c8e0ea3db6ca6","schema_version":"1.0","event_id":"sha256:90537f5817cfd0208728ba86719266c4aa88f589975de09fef4c8e0ea3db6ca6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:6VZUITU6JBRSOC6N3I7IG75IC4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Intrinsic linking and knotting are arbitrarily complex in directed graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Benjamin Pagano, Ramin Naimi, Thomas W. Mattman","submitted_at":"2019-01-04T17:10:12Z","abstract_excerpt":"Fleming and Foisy recently proved the existence of a digraph whose every embedding contains a $4$-component link, and left open the possibility that a directed graph with an intrinsic $n$-component link might exist. We show that, indeed, this is the case. In fact, much as Flapan, Mellor, and Naimi show for graphs, knotting and linking are arbitrarily complex in directed graphs. Specifically, we prove the analog for digraphs of the main theorem of their paper: for any $n$ and $\\alpha$, every embedding of a sufficiently large complete digraph in $\\mathbb{R}^3$ contains an oriented link with comp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.01212","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-17T23:56:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PVmGk+8NHPQ34dkMgf23RyQsnsRSr3k4pDUAT1gbVYCXo1gO5BWQ+VOhFrBIZl/4nyNZsMw2MmFC8ZmCqf8bBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:08:04.198378Z"},"content_sha256":"ed925bc88db4a39d69d89a1eefbe7c63f11c7b26186539bf2af7388030fac35c","schema_version":"1.0","event_id":"sha256:ed925bc88db4a39d69d89a1eefbe7c63f11c7b26186539bf2af7388030fac35c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6VZUITU6JBRSOC6N3I7IG75IC4/bundle.json","state_url":"https://pith.science/pith/6VZUITU6JBRSOC6N3I7IG75IC4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6VZUITU6JBRSOC6N3I7IG75IC4/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-27T08:08:04Z","links":{"resolver":"https://pith.science/pith/6VZUITU6JBRSOC6N3I7IG75IC4","bundle":"https://pith.science/pith/6VZUITU6JBRSOC6N3I7IG75IC4/bundle.json","state":"https://pith.science/pith/6VZUITU6JBRSOC6N3I7IG75IC4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6VZUITU6JBRSOC6N3I7IG75IC4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:6VZUITU6JBRSOC6N3I7IG75IC4","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":"8d269dc7b9c75ecb15ffd771cd301f69fa88f6d5add6132c5b6f0c6fc89af809","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2019-01-04T17:10:12Z","title_canon_sha256":"b8d0c9b78911e58b6571b1b2340e6611e70cd026cdc208ab0cc9e69c2c04c1b1"},"schema_version":"1.0","source":{"id":"1901.01212","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.01212","created_at":"2026-05-17T23:56:56Z"},{"alias_kind":"arxiv_version","alias_value":"1901.01212v1","created_at":"2026-05-17T23:56:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.01212","created_at":"2026-05-17T23:56:56Z"},{"alias_kind":"pith_short_12","alias_value":"6VZUITU6JBRS","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"6VZUITU6JBRSOC6N","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"6VZUITU6","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:ed925bc88db4a39d69d89a1eefbe7c63f11c7b26186539bf2af7388030fac35c","target":"graph","created_at":"2026-05-17T23:56:56Z","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":"Fleming and Foisy recently proved the existence of a digraph whose every embedding contains a $4$-component link, and left open the possibility that a directed graph with an intrinsic $n$-component link might exist. We show that, indeed, this is the case. In fact, much as Flapan, Mellor, and Naimi show for graphs, knotting and linking are arbitrarily complex in directed graphs. Specifically, we prove the analog for digraphs of the main theorem of their paper: for any $n$ and $\\alpha$, every embedding of a sufficiently large complete digraph in $\\mathbb{R}^3$ contains an oriented link with comp","authors_text":"Benjamin Pagano, Ramin Naimi, Thomas W. Mattman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2019-01-04T17:10:12Z","title":"Intrinsic linking and knotting are arbitrarily complex in directed graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.01212","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:90537f5817cfd0208728ba86719266c4aa88f589975de09fef4c8e0ea3db6ca6","target":"record","created_at":"2026-05-17T23:56:56Z","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":"8d269dc7b9c75ecb15ffd771cd301f69fa88f6d5add6132c5b6f0c6fc89af809","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2019-01-04T17:10:12Z","title_canon_sha256":"b8d0c9b78911e58b6571b1b2340e6611e70cd026cdc208ab0cc9e69c2c04c1b1"},"schema_version":"1.0","source":{"id":"1901.01212","kind":"arxiv","version":1}},"canonical_sha256":"f573444e9e4863270bcdda3e837fa8173b2132ab6f2304db0246f9af46ede7ab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f573444e9e4863270bcdda3e837fa8173b2132ab6f2304db0246f9af46ede7ab","first_computed_at":"2026-05-17T23:56:56.725300Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:56.725300Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"B4q4V3uT9cjPKgn0rR+vipmWuCUHRIRx3KsrvJLJceI++go/yhxOQYYRR8FQoqexbYiKHlpKjITiZZc26JR+CQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:56.725868Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.01212","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:90537f5817cfd0208728ba86719266c4aa88f589975de09fef4c8e0ea3db6ca6","sha256:ed925bc88db4a39d69d89a1eefbe7c63f11c7b26186539bf2af7388030fac35c"],"state_sha256":"ad61b9be81fcacd6eb569e45d02bc9ac3d9632c2e0660bea8149db0ed5de58ca"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BBtwhdGjzSpnjGc0U9aSiqmWsXamNaBEa3+TvpYNuVOxWDIqz+5X4HP6e2ByXvkHv42xfJudDBYmSH6namWjAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T08:08:04.201863Z","bundle_sha256":"08bcd3557cf08239a8b7f1d58d9fea2daf4a1cfe129e0e20f58c43092078c950"}}