{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2005:X662LA7ORUTYEULXDKLI2OXKIP","short_pith_number":"pith:X662LA7O","schema_version":"1.0","canonical_sha256":"bfbda583ee8d278251771a968d3aea43e47672a0d8c8466d56801ad3a9460f34","source":{"kind":"arxiv","id":"math/0511133","version":1},"attestation_state":"computed","paper":{"title":"Intrinsically linked graphs and even linking number","license":"","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Alexander Diesl, Thomas Fleming","submitted_at":"2005-11-05T16:01:50Z","abstract_excerpt":"We study intrinsically linked graphs where we require that every embedding of the graph contains not just a non-split link, but a link that satisfies some additional property. Examples of properties we address in this paper are: a two component link with lk(A,L) = k2^r, k not 0, a non-split n-component link where all linking numbers are even, or an n-component link with components L, A_i where lk(L,A_i) = 3k, k not 0. Links with other properties are considered as well. For a given property, we prove that every embedding of a certain complete graph contains a link with that property. The size o"},"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":"math/0511133","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.GT","submitted_at":"2005-11-05T16:01:50Z","cross_cats_sorted":[],"title_canon_sha256":"95ae0b68ae7bce6897b4f6124c956b32c8a7888cc32d2705a37468c5e22f5b50","abstract_canon_sha256":"7d0126140df1874de627ae0abe47b6f2c20398b4a768bf55e2f82484bc66f177"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:31.971523Z","signature_b64":"Kfv3wVbyA7DmBBqcqoDV8YIciy01oeYnlYryhjF1rzSp+8kiu1Jk/I0d5oU6xRD7JmfMQMWOhSuHtgvFDcd+AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bfbda583ee8d278251771a968d3aea43e47672a0d8c8466d56801ad3a9460f34","last_reissued_at":"2026-05-18T02:41:31.971103Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:31.971103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Intrinsically linked graphs and even linking number","license":"","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Alexander Diesl, Thomas Fleming","submitted_at":"2005-11-05T16:01:50Z","abstract_excerpt":"We study intrinsically linked graphs where we require that every embedding of the graph contains not just a non-split link, but a link that satisfies some additional property. Examples of properties we address in this paper are: a two component link with lk(A,L) = k2^r, k not 0, a non-split n-component link where all linking numbers are even, or an n-component link with components L, A_i where lk(L,A_i) = 3k, k not 0. Links with other properties are considered as well. For a given property, we prove that every embedding of a certain complete graph contains a link with that property. The size o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0511133","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":"math/0511133","created_at":"2026-05-18T02:41:31.971166+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0511133v1","created_at":"2026-05-18T02:41:31.971166+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0511133","created_at":"2026-05-18T02:41:31.971166+00:00"},{"alias_kind":"pith_short_12","alias_value":"X662LA7ORUTY","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_16","alias_value":"X662LA7ORUTYEULX","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_8","alias_value":"X662LA7O","created_at":"2026-05-18T12:25:53.939244+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/X662LA7ORUTYEULXDKLI2OXKIP","json":"https://pith.science/pith/X662LA7ORUTYEULXDKLI2OXKIP.json","graph_json":"https://pith.science/api/pith-number/X662LA7ORUTYEULXDKLI2OXKIP/graph.json","events_json":"https://pith.science/api/pith-number/X662LA7ORUTYEULXDKLI2OXKIP/events.json","paper":"https://pith.science/paper/X662LA7O"},"agent_actions":{"view_html":"https://pith.science/pith/X662LA7ORUTYEULXDKLI2OXKIP","download_json":"https://pith.science/pith/X662LA7ORUTYEULXDKLI2OXKIP.json","view_paper":"https://pith.science/paper/X662LA7O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0511133&json=true","fetch_graph":"https://pith.science/api/pith-number/X662LA7ORUTYEULXDKLI2OXKIP/graph.json","fetch_events":"https://pith.science/api/pith-number/X662LA7ORUTYEULXDKLI2OXKIP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X662LA7ORUTYEULXDKLI2OXKIP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X662LA7ORUTYEULXDKLI2OXKIP/action/storage_attestation","attest_author":"https://pith.science/pith/X662LA7ORUTYEULXDKLI2OXKIP/action/author_attestation","sign_citation":"https://pith.science/pith/X662LA7ORUTYEULXDKLI2OXKIP/action/citation_signature","submit_replication":"https://pith.science/pith/X662LA7ORUTYEULXDKLI2OXKIP/action/replication_record"}},"created_at":"2026-05-18T02:41:31.971166+00:00","updated_at":"2026-05-18T02:41:31.971166+00:00"}