{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:E2FI5HIMBHUN73KOLPPHBT3NRC","short_pith_number":"pith:E2FI5HIM","schema_version":"1.0","canonical_sha256":"268a8e9d0c09e8dfed4e5bde70cf6d88900eb2a3863375a056c672c335df537a","source":{"kind":"arxiv","id":"2605.17080","version":1},"attestation_state":"computed","paper":{"title":"Structural characterization and efficient recognition of probe diamond-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Luciano Norberto Grippo Min Chih Lin","submitted_at":"2026-05-16T16:55:54Z","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"},"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.17080","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-16T16:55:54Z","cross_cats_sorted":[],"title_canon_sha256":"ee3bb48fcd30be9ee9bf3c82a977184db718af771b2898fbac1c5d35880b5ddd","abstract_canon_sha256":"4691f0f5cfb7050292e63f4a2997bb76ae0e5d59889bb3f8507c870d92832cb0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:03:39.472665Z","signature_b64":"UFsDPVgPeFzG575KMmIKmNgymDko5GV6eayXEqsvxi06jitLHVg5LnwEt5oXJpfQMgWhFjmQA8YMwmvV4PHdBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"268a8e9d0c09e8dfed4e5bde70cf6d88900eb2a3863375a056c672c335df537a","last_reissued_at":"2026-05-20T00:03:39.472026Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:03:39.472026Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Structural characterization and efficient recognition of probe diamond-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Luciano Norberto Grippo Min Chih Lin","submitted_at":"2026-05-16T16:55:54Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.17080","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.17080/integrity.json","findings":[],"available":true,"detectors_run":[{"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","findings_count":0}],"snapshot_sha256":"eb5c1186f78ae78d9b7fdd8aa618b9e55eee4bb7d00e4fe721f4f76f6dd2d3e9"},"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.17080","created_at":"2026-05-20T00:03:39.472137+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.17080v1","created_at":"2026-05-20T00:03:39.472137+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.17080","created_at":"2026-05-20T00:03:39.472137+00:00"},{"alias_kind":"pith_short_12","alias_value":"E2FI5HIMBHUN","created_at":"2026-05-20T00:03:39.472137+00:00"},{"alias_kind":"pith_short_16","alias_value":"E2FI5HIMBHUN73KO","created_at":"2026-05-20T00:03:39.472137+00:00"},{"alias_kind":"pith_short_8","alias_value":"E2FI5HIM","created_at":"2026-05-20T00:03:39.472137+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/E2FI5HIMBHUN73KOLPPHBT3NRC","json":"https://pith.science/pith/E2FI5HIMBHUN73KOLPPHBT3NRC.json","graph_json":"https://pith.science/api/pith-number/E2FI5HIMBHUN73KOLPPHBT3NRC/graph.json","events_json":"https://pith.science/api/pith-number/E2FI5HIMBHUN73KOLPPHBT3NRC/events.json","paper":"https://pith.science/paper/E2FI5HIM"},"agent_actions":{"view_html":"https://pith.science/pith/E2FI5HIMBHUN73KOLPPHBT3NRC","download_json":"https://pith.science/pith/E2FI5HIMBHUN73KOLPPHBT3NRC.json","view_paper":"https://pith.science/paper/E2FI5HIM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.17080&json=true","fetch_graph":"https://pith.science/api/pith-number/E2FI5HIMBHUN73KOLPPHBT3NRC/graph.json","fetch_events":"https://pith.science/api/pith-number/E2FI5HIMBHUN73KOLPPHBT3NRC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E2FI5HIMBHUN73KOLPPHBT3NRC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E2FI5HIMBHUN73KOLPPHBT3NRC/action/storage_attestation","attest_author":"https://pith.science/pith/E2FI5HIMBHUN73KOLPPHBT3NRC/action/author_attestation","sign_citation":"https://pith.science/pith/E2FI5HIMBHUN73KOLPPHBT3NRC/action/citation_signature","submit_replication":"https://pith.science/pith/E2FI5HIMBHUN73KOLPPHBT3NRC/action/replication_record"}},"created_at":"2026-05-20T00:03:39.472137+00:00","updated_at":"2026-05-20T00:03:39.472137+00:00"}