{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:E2FI5HIMBHUN73KOLPPHBT3NRC","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":"4691f0f5cfb7050292e63f4a2997bb76ae0e5d59889bb3f8507c870d92832cb0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-16T16:55:54Z","title_canon_sha256":"ee3bb48fcd30be9ee9bf3c82a977184db718af771b2898fbac1c5d35880b5ddd"},"schema_version":"1.0","source":{"id":"2605.17080","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.17080","created_at":"2026-05-20T00:03:39Z"},{"alias_kind":"arxiv_version","alias_value":"2605.17080v1","created_at":"2026-05-20T00:03:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.17080","created_at":"2026-05-20T00:03:39Z"},{"alias_kind":"pith_short_12","alias_value":"E2FI5HIMBHUN","created_at":"2026-05-20T00:03:39Z"},{"alias_kind":"pith_short_16","alias_value":"E2FI5HIMBHUN73KO","created_at":"2026-05-20T00:03:39Z"},{"alias_kind":"pith_short_8","alias_value":"E2FI5HIM","created_at":"2026-05-20T00:03:39Z"}],"graph_snapshots":[{"event_id":"sha256:2e25dd96abf17f5cd318e2707ac0e7e5cdbba28c2f0752d3317b6453bf10300d","target":"graph","created_at":"2026-05-20T00:03:39Z","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":[{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T22:33:23.808404Z","status":"skipped","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T22:21:57.745337Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.17080/integrity.json","findings":[],"snapshot_sha256":"eb5c1186f78ae78d9b7fdd8aa618b9e55eee4bb7d00e4fe721f4f76f6dd2d3e9","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A graph is probe diamond-free if its vertex set admits a partition into probes and nonprobes, where the set of nonprobes is independent, such that adding edges only between pairs of nonprobes yields a diamond-free graph. Although this class admits a characterization by forbidden induced subgraphs, such a characterization does not directly lead to an efficient recognition algorithm. In this work we introduce a new structural characterization of probe diamond-free graphs based on a local condition, called the \\emph{locally union of complete split} property, together with an auxiliary bipartite g","authors_text":"Luciano Norberto Grippo Min Chih Lin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-16T16:55:54Z","title":"Structural characterization and efficient recognition of probe diamond-free graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.17080","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:d1c0634e3ce86e10111932608976d8a46ba2e7f2038cc97e5008dfa13768a2cb","target":"record","created_at":"2026-05-20T00:03:39Z","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":"4691f0f5cfb7050292e63f4a2997bb76ae0e5d59889bb3f8507c870d92832cb0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-16T16:55:54Z","title_canon_sha256":"ee3bb48fcd30be9ee9bf3c82a977184db718af771b2898fbac1c5d35880b5ddd"},"schema_version":"1.0","source":{"id":"2605.17080","kind":"arxiv","version":1}},"canonical_sha256":"268a8e9d0c09e8dfed4e5bde70cf6d88900eb2a3863375a056c672c335df537a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"268a8e9d0c09e8dfed4e5bde70cf6d88900eb2a3863375a056c672c335df537a","first_computed_at":"2026-05-20T00:03:39.472026Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:03:39.472026Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UFsDPVgPeFzG575KMmIKmNgymDko5GV6eayXEqsvxi06jitLHVg5LnwEt5oXJpfQMgWhFjmQA8YMwmvV4PHdBg==","signature_status":"signed_v1","signed_at":"2026-05-20T00:03:39.472665Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.17080","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d1c0634e3ce86e10111932608976d8a46ba2e7f2038cc97e5008dfa13768a2cb","sha256:2e25dd96abf17f5cd318e2707ac0e7e5cdbba28c2f0752d3317b6453bf10300d"],"state_sha256":"1f6d0ff5c3246df1511896f3e83ec16cf4cd86c2390540cd12040d01ace24dd1"}