{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:N77D257TF72OJHWIIIBJ465WKC","short_pith_number":"pith:N77D257T","canonical_record":{"source":{"id":"2605.25264","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-24T21:34:09Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"72365bc2e8c1ee3f5c41b446fb984c9cc9394503ef1466ecbab21278c9075971","abstract_canon_sha256":"15760543df3b41e18c2b5ebcecbdcb0b0a14f474810458dd4321b8e74ce97042"},"schema_version":"1.0"},"canonical_sha256":"6ffe3d77f32ff4e49ec842029e7bb6508a2c51e916ca14d6ba5fa8d0cc3cc6b3","source":{"kind":"arxiv","id":"2605.25264","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.25264","created_at":"2026-05-26T02:04:26Z"},{"alias_kind":"arxiv_version","alias_value":"2605.25264v1","created_at":"2026-05-26T02:04:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.25264","created_at":"2026-05-26T02:04:26Z"},{"alias_kind":"pith_short_12","alias_value":"N77D257TF72O","created_at":"2026-05-26T02:04:26Z"},{"alias_kind":"pith_short_16","alias_value":"N77D257TF72OJHWI","created_at":"2026-05-26T02:04:26Z"},{"alias_kind":"pith_short_8","alias_value":"N77D257T","created_at":"2026-05-26T02:04:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:N77D257TF72OJHWIIIBJ465WKC","target":"record","payload":{"canonical_record":{"source":{"id":"2605.25264","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-24T21:34:09Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"72365bc2e8c1ee3f5c41b446fb984c9cc9394503ef1466ecbab21278c9075971","abstract_canon_sha256":"15760543df3b41e18c2b5ebcecbdcb0b0a14f474810458dd4321b8e74ce97042"},"schema_version":"1.0"},"canonical_sha256":"6ffe3d77f32ff4e49ec842029e7bb6508a2c51e916ca14d6ba5fa8d0cc3cc6b3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T02:04:26.178735Z","signature_b64":"ncItHPPDtSfE2RS6ps51nG0QM79ttB01vMLbBDwu6seSA2kayJVgoJyXSQQU7Gq5/cCnST2Wty1Knc5cxwFVDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ffe3d77f32ff4e49ec842029e7bb6508a2c51e916ca14d6ba5fa8d0cc3cc6b3","last_reissued_at":"2026-05-26T02:04:26.177878Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T02:04:26.177878Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.25264","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-26T02:04:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FglkFxQ4UiJsNTJUyYD0YEb6gxTeRcILn+RE+NKg4rzl91vZjl7YegvLpkYfWw2vcDe++EoiX1A8S5Oj7SwQAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T08:08:13.454309Z"},"content_sha256":"0d84df0ddd2e5a49d1e17cbf534b276ce1d1b1cd6408548251667836aa820526","schema_version":"1.0","event_id":"sha256:0d84df0ddd2e5a49d1e17cbf534b276ce1d1b1cd6408548251667836aa820526"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:N77D257TF72OJHWIIIBJ465WKC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The $\\Delta$ property: a bridge between split graphs and Number Theory","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Victor N. Schv\\\"ollner","submitted_at":"2026-05-24T21:34:09Z","abstract_excerpt":"For a split graph $S$, the combinatorics of 2-switches on $S$ is faithfully encoded by the factor graph $\\Phi(S)$, a multigraph whose induced cycles have length at most $4$. In this paper we address the following question: for which $n \\in \\mathbb{N}$ is there a split graph $S$ whose factor graph contains an $n$-simple triangle, that is, a triangle all of whose edges have multiplicity $n$? We show that the answer is governed by a purely arithmetic condition, the $\\Delta$ property, relating the differences and sums of complementary divisors of $n$, and thereby establish a two-way bridge between"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.25264","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/2605.25264/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-05-26T02:04:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eKGm7r/CrHQyVdbJ6WHsAccebFmICOADuKRtthLygzSiy6IiQxam6t6WjQgMYBEJ3xK5o1ggFaGWX+dBmRIrBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T08:08:13.455079Z"},"content_sha256":"0feddcef0085f3643232332a041893de5e89a430b9df18c20c3f016c4995c8ee","schema_version":"1.0","event_id":"sha256:0feddcef0085f3643232332a041893de5e89a430b9df18c20c3f016c4995c8ee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N77D257TF72OJHWIIIBJ465WKC/bundle.json","state_url":"https://pith.science/pith/N77D257TF72OJHWIIIBJ465WKC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N77D257TF72OJHWIIIBJ465WKC/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-11T08:08:13Z","links":{"resolver":"https://pith.science/pith/N77D257TF72OJHWIIIBJ465WKC","bundle":"https://pith.science/pith/N77D257TF72OJHWIIIBJ465WKC/bundle.json","state":"https://pith.science/pith/N77D257TF72OJHWIIIBJ465WKC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N77D257TF72OJHWIIIBJ465WKC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:N77D257TF72OJHWIIIBJ465WKC","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":"15760543df3b41e18c2b5ebcecbdcb0b0a14f474810458dd4321b8e74ce97042","cross_cats_sorted":["math.NT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-24T21:34:09Z","title_canon_sha256":"72365bc2e8c1ee3f5c41b446fb984c9cc9394503ef1466ecbab21278c9075971"},"schema_version":"1.0","source":{"id":"2605.25264","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.25264","created_at":"2026-05-26T02:04:26Z"},{"alias_kind":"arxiv_version","alias_value":"2605.25264v1","created_at":"2026-05-26T02:04:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.25264","created_at":"2026-05-26T02:04:26Z"},{"alias_kind":"pith_short_12","alias_value":"N77D257TF72O","created_at":"2026-05-26T02:04:26Z"},{"alias_kind":"pith_short_16","alias_value":"N77D257TF72OJHWI","created_at":"2026-05-26T02:04:26Z"},{"alias_kind":"pith_short_8","alias_value":"N77D257T","created_at":"2026-05-26T02:04:26Z"}],"graph_snapshots":[{"event_id":"sha256:0feddcef0085f3643232332a041893de5e89a430b9df18c20c3f016c4995c8ee","target":"graph","created_at":"2026-05-26T02:04:26Z","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/2605.25264/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"For a split graph $S$, the combinatorics of 2-switches on $S$ is faithfully encoded by the factor graph $\\Phi(S)$, a multigraph whose induced cycles have length at most $4$. In this paper we address the following question: for which $n \\in \\mathbb{N}$ is there a split graph $S$ whose factor graph contains an $n$-simple triangle, that is, a triangle all of whose edges have multiplicity $n$? We show that the answer is governed by a purely arithmetic condition, the $\\Delta$ property, relating the differences and sums of complementary divisors of $n$, and thereby establish a two-way bridge between","authors_text":"Victor N. Schv\\\"ollner","cross_cats":["math.NT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-24T21:34:09Z","title":"The $\\Delta$ property: a bridge between split graphs and Number Theory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.25264","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:0d84df0ddd2e5a49d1e17cbf534b276ce1d1b1cd6408548251667836aa820526","target":"record","created_at":"2026-05-26T02:04:26Z","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":"15760543df3b41e18c2b5ebcecbdcb0b0a14f474810458dd4321b8e74ce97042","cross_cats_sorted":["math.NT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-24T21:34:09Z","title_canon_sha256":"72365bc2e8c1ee3f5c41b446fb984c9cc9394503ef1466ecbab21278c9075971"},"schema_version":"1.0","source":{"id":"2605.25264","kind":"arxiv","version":1}},"canonical_sha256":"6ffe3d77f32ff4e49ec842029e7bb6508a2c51e916ca14d6ba5fa8d0cc3cc6b3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6ffe3d77f32ff4e49ec842029e7bb6508a2c51e916ca14d6ba5fa8d0cc3cc6b3","first_computed_at":"2026-05-26T02:04:26.177878Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-26T02:04:26.177878Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ncItHPPDtSfE2RS6ps51nG0QM79ttB01vMLbBDwu6seSA2kayJVgoJyXSQQU7Gq5/cCnST2Wty1Knc5cxwFVDQ==","signature_status":"signed_v1","signed_at":"2026-05-26T02:04:26.178735Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.25264","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0d84df0ddd2e5a49d1e17cbf534b276ce1d1b1cd6408548251667836aa820526","sha256:0feddcef0085f3643232332a041893de5e89a430b9df18c20c3f016c4995c8ee"],"state_sha256":"909232b973fc821c55eb53223c6f2e5c7061f204bafb299ee0af86e81f723f64"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RB61kKJztTCmqzhRO0U9EzTlTKSEAR1R/MqYt7CQhwjVn76cUI4zXsOGMB9GSdwgT52MSgH0yJGOGUEKMKHdDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T08:08:13.459452Z","bundle_sha256":"74f07ae18f84b0c17675d00d4c3d5411d56588870dd2932fb00869d00275efdb"}}