{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2000:EIZ7OT23JV32XVBBC44REZBU3D","short_pith_number":"pith:EIZ7OT23","canonical_record":{"source":{"id":"math/0005128","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.GT","submitted_at":"2000-05-12T19:41:01Z","cross_cats_sorted":[],"title_canon_sha256":"172b397d8e96c8aad1b3b18d3eb9337f2983d4c51d9fa462a97587471d2890f9","abstract_canon_sha256":"49c57993d1bfb3affd2a297f933cbceda6a74ee1522490d8cd0bde363496221f"},"schema_version":"1.0"},"canonical_sha256":"2233f74f5b4d77abd4211739126434d8d9a9fd59b0ca0b0af37d3060bd7befae","source":{"kind":"arxiv","id":"math/0005128","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0005128","created_at":"2026-07-04T14:34:30Z"},{"alias_kind":"arxiv_version","alias_value":"math/0005128v1","created_at":"2026-07-04T14:34:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0005128","created_at":"2026-07-04T14:34:30Z"},{"alias_kind":"pith_short_12","alias_value":"EIZ7OT23JV32","created_at":"2026-07-04T14:34:30Z"},{"alias_kind":"pith_short_16","alias_value":"EIZ7OT23JV32XVBB","created_at":"2026-07-04T14:34:30Z"},{"alias_kind":"pith_short_8","alias_value":"EIZ7OT23","created_at":"2026-07-04T14:34:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2000:EIZ7OT23JV32XVBBC44REZBU3D","target":"record","payload":{"canonical_record":{"source":{"id":"math/0005128","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.GT","submitted_at":"2000-05-12T19:41:01Z","cross_cats_sorted":[],"title_canon_sha256":"172b397d8e96c8aad1b3b18d3eb9337f2983d4c51d9fa462a97587471d2890f9","abstract_canon_sha256":"49c57993d1bfb3affd2a297f933cbceda6a74ee1522490d8cd0bde363496221f"},"schema_version":"1.0"},"canonical_sha256":"2233f74f5b4d77abd4211739126434d8d9a9fd59b0ca0b0af37d3060bd7befae","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:34:30.302163Z","signature_b64":"uSpVdAy0FI34ITcnjpTyWlj1SBGoCGwvDHcARS0XeLiY98Xw1PIuiNo2xNCLNOvZ7LWyqKiJjp/zGEgV7XvhCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2233f74f5b4d77abd4211739126434d8d9a9fd59b0ca0b0af37d3060bd7befae","last_reissued_at":"2026-07-04T14:34:30.301803Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:34:30.301803Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"math/0005128","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-07-04T14:34:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5RTiljMvDwp5MmwNzTeEHRpvPO+3loBGuFlxjQIp/QwYsp3pgzV+QHMo1Bb/ZiDmqnvZoFRGsI/VNaTh+jqkAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T22:47:34.011835Z"},"content_sha256":"b90a03fca1cf04d7b40a5c28698419d4dbb3498921cd29520dd507719d2df74e","schema_version":"1.0","event_id":"sha256:b90a03fca1cf04d7b40a5c28698419d4dbb3498921cd29520dd507719d2df74e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2000:EIZ7OT23JV32XVBBC44REZBU3D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"From planar graphs to embedded graphs - a new approach to Kauffman and Vogel's polynomial","license":"","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Rui Pedro Carpentier","submitted_at":"2000-05-12T19:41:01Z","abstract_excerpt":"In \\cite{4} Kauffman and Vogel constructed a rigid vertex regular isotopy invariant for unoriented four-valent graphs embedded in three dimensional space. It assigns to each embedded graph $G$ a polynomial, denoted $[G]$, in three variables, $A$, $B$ and $a$, satisfies the skein relation: $$ [\\psdiag{2}{6}{overcross}]=A [\\psdiag{2}{6}{horlines}]+B [\\psdiag{2}{6}{verlines}]+[\\psdiag{2}{6}{vertex}]$$ and is defined in terms of a state-sum and the Dubrovnik polynomial for links. Using the graphical calculus of \\cite{4} it is shown that the polynomial of a planar graph can be calculated recursivel"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0005128","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/math/0005128/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T14:34:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"31LJK9SdQMaQ3t37r6Qe7Cn6koOHeCyEh7iZKwoxLuXiDdcYO3zOSicDG/MPeFJJLLatDATYKLwovEjirAl3DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T22:47:34.012198Z"},"content_sha256":"42ddff49bc707ef4bb16538d26a9b65f0751e0288cc2926542e8e236eff55c63","schema_version":"1.0","event_id":"sha256:42ddff49bc707ef4bb16538d26a9b65f0751e0288cc2926542e8e236eff55c63"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EIZ7OT23JV32XVBBC44REZBU3D/bundle.json","state_url":"https://pith.science/pith/EIZ7OT23JV32XVBBC44REZBU3D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EIZ7OT23JV32XVBBC44REZBU3D/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-07-04T22:47:34Z","links":{"resolver":"https://pith.science/pith/EIZ7OT23JV32XVBBC44REZBU3D","bundle":"https://pith.science/pith/EIZ7OT23JV32XVBBC44REZBU3D/bundle.json","state":"https://pith.science/pith/EIZ7OT23JV32XVBBC44REZBU3D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EIZ7OT23JV32XVBBC44REZBU3D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2000:EIZ7OT23JV32XVBBC44REZBU3D","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":"49c57993d1bfb3affd2a297f933cbceda6a74ee1522490d8cd0bde363496221f","cross_cats_sorted":[],"license":"","primary_cat":"math.GT","submitted_at":"2000-05-12T19:41:01Z","title_canon_sha256":"172b397d8e96c8aad1b3b18d3eb9337f2983d4c51d9fa462a97587471d2890f9"},"schema_version":"1.0","source":{"id":"math/0005128","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0005128","created_at":"2026-07-04T14:34:30Z"},{"alias_kind":"arxiv_version","alias_value":"math/0005128v1","created_at":"2026-07-04T14:34:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0005128","created_at":"2026-07-04T14:34:30Z"},{"alias_kind":"pith_short_12","alias_value":"EIZ7OT23JV32","created_at":"2026-07-04T14:34:30Z"},{"alias_kind":"pith_short_16","alias_value":"EIZ7OT23JV32XVBB","created_at":"2026-07-04T14:34:30Z"},{"alias_kind":"pith_short_8","alias_value":"EIZ7OT23","created_at":"2026-07-04T14:34:30Z"}],"graph_snapshots":[{"event_id":"sha256:42ddff49bc707ef4bb16538d26a9b65f0751e0288cc2926542e8e236eff55c63","target":"graph","created_at":"2026-07-04T14:34:30Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/math/0005128/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In \\cite{4} Kauffman and Vogel constructed a rigid vertex regular isotopy invariant for unoriented four-valent graphs embedded in three dimensional space. It assigns to each embedded graph $G$ a polynomial, denoted $[G]$, in three variables, $A$, $B$ and $a$, satisfies the skein relation: $$ [\\psdiag{2}{6}{overcross}]=A [\\psdiag{2}{6}{horlines}]+B [\\psdiag{2}{6}{verlines}]+[\\psdiag{2}{6}{vertex}]$$ and is defined in terms of a state-sum and the Dubrovnik polynomial for links. Using the graphical calculus of \\cite{4} it is shown that the polynomial of a planar graph can be calculated recursivel","authors_text":"Rui Pedro Carpentier","cross_cats":[],"headline":"","license":"","primary_cat":"math.GT","submitted_at":"2000-05-12T19:41:01Z","title":"From planar graphs to embedded graphs - a new approach to Kauffman and Vogel's polynomial"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0005128","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:b90a03fca1cf04d7b40a5c28698419d4dbb3498921cd29520dd507719d2df74e","target":"record","created_at":"2026-07-04T14:34:30Z","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":"49c57993d1bfb3affd2a297f933cbceda6a74ee1522490d8cd0bde363496221f","cross_cats_sorted":[],"license":"","primary_cat":"math.GT","submitted_at":"2000-05-12T19:41:01Z","title_canon_sha256":"172b397d8e96c8aad1b3b18d3eb9337f2983d4c51d9fa462a97587471d2890f9"},"schema_version":"1.0","source":{"id":"math/0005128","kind":"arxiv","version":1}},"canonical_sha256":"2233f74f5b4d77abd4211739126434d8d9a9fd59b0ca0b0af37d3060bd7befae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2233f74f5b4d77abd4211739126434d8d9a9fd59b0ca0b0af37d3060bd7befae","first_computed_at":"2026-07-04T14:34:30.301803Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:34:30.301803Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uSpVdAy0FI34ITcnjpTyWlj1SBGoCGwvDHcARS0XeLiY98Xw1PIuiNo2xNCLNOvZ7LWyqKiJjp/zGEgV7XvhCg==","signature_status":"signed_v1","signed_at":"2026-07-04T14:34:30.302163Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0005128","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b90a03fca1cf04d7b40a5c28698419d4dbb3498921cd29520dd507719d2df74e","sha256:42ddff49bc707ef4bb16538d26a9b65f0751e0288cc2926542e8e236eff55c63"],"state_sha256":"58a129eae09187159b9ca7b82a30b591a465a8b320a7dd2606d39a269121331c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q8wXyzW5HE1U3r3FhRCWhLORHaznix0ZwRhdkYxc3Au7Rhf5KNS0apYokRf8Vx4gu0XB8v0LexPsoeukstX2Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T22:47:34.014174Z","bundle_sha256":"5962a753aa2901442557893177f8068e4851749f78acac995af70a2bf39f5169"}}