{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:N77D257TF72OJHWIIIBJ465WKC","short_pith_number":"pith:N77D257T","schema_version":"1.0","canonical_sha256":"6ffe3d77f32ff4e49ec842029e7bb6508a2c51e916ca14d6ba5fa8d0cc3cc6b3","source":{"kind":"arxiv","id":"2605.25264","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2605.25264","created_at":"2026-05-26T02:04:26.178020+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.25264v1","created_at":"2026-05-26T02:04:26.178020+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.25264","created_at":"2026-05-26T02:04:26.178020+00:00"},{"alias_kind":"pith_short_12","alias_value":"N77D257TF72O","created_at":"2026-05-26T02:04:26.178020+00:00"},{"alias_kind":"pith_short_16","alias_value":"N77D257TF72OJHWI","created_at":"2026-05-26T02:04:26.178020+00:00"},{"alias_kind":"pith_short_8","alias_value":"N77D257T","created_at":"2026-05-26T02:04:26.178020+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/N77D257TF72OJHWIIIBJ465WKC","json":"https://pith.science/pith/N77D257TF72OJHWIIIBJ465WKC.json","graph_json":"https://pith.science/api/pith-number/N77D257TF72OJHWIIIBJ465WKC/graph.json","events_json":"https://pith.science/api/pith-number/N77D257TF72OJHWIIIBJ465WKC/events.json","paper":"https://pith.science/paper/N77D257T"},"agent_actions":{"view_html":"https://pith.science/pith/N77D257TF72OJHWIIIBJ465WKC","download_json":"https://pith.science/pith/N77D257TF72OJHWIIIBJ465WKC.json","view_paper":"https://pith.science/paper/N77D257T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.25264&json=true","fetch_graph":"https://pith.science/api/pith-number/N77D257TF72OJHWIIIBJ465WKC/graph.json","fetch_events":"https://pith.science/api/pith-number/N77D257TF72OJHWIIIBJ465WKC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N77D257TF72OJHWIIIBJ465WKC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N77D257TF72OJHWIIIBJ465WKC/action/storage_attestation","attest_author":"https://pith.science/pith/N77D257TF72OJHWIIIBJ465WKC/action/author_attestation","sign_citation":"https://pith.science/pith/N77D257TF72OJHWIIIBJ465WKC/action/citation_signature","submit_replication":"https://pith.science/pith/N77D257TF72OJHWIIIBJ465WKC/action/replication_record"}},"created_at":"2026-05-26T02:04:26.178020+00:00","updated_at":"2026-05-26T02:04:26.178020+00:00"}