{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:TPMTXDJ53TBP3GGKILRFKKIYQX","short_pith_number":"pith:TPMTXDJ5","schema_version":"1.0","canonical_sha256":"9bd93b8d3ddcc2fd98ca42e255291885e166510a551b16921bff60f29e0b8ba8","source":{"kind":"arxiv","id":"1403.1628","version":1},"attestation_state":"computed","paper":{"title":"Disimplicial arcs, transitive vertices, and disimplicial eliminations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Francisco J. Soulignac, Martiniano Egu\\'ia","submitted_at":"2014-03-07T00:59:55Z","abstract_excerpt":"In this article we deal with the problems of finding the disimplicial arcs of a digraph and recognizing some interesting graph classes defined by their existence. A diclique of a digraph is a pair $V \\to W$ of sets of vertices such that $v \\to w$ is an arc for every $v \\in V$ and $w \\in W$. An arc $v \\to w$ is disimplicial when $N^-(w) \\to N^+(v)$ is a diclique. We show that the problem of finding the disimplicial arcs is equivalent, in terms of time and space complexity, to that of locating the transitive vertices. As a result, an efficient algorithm to find the bisimplicial edges of bipartit"},"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":"1403.1628","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-03-07T00:59:55Z","cross_cats_sorted":[],"title_canon_sha256":"512156f1c0b293c7789743f05b83df72985621c92006d3755d8e53b7fcb3b9b9","abstract_canon_sha256":"2700f9682319534e0516787e2159e518cc68baa3954023db82acb663d440e5f3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:56:52.940034Z","signature_b64":"HJjkgG7Ru2PYTFrRnrGeIve/l67b3ZVAzDTkvf6NugKdq2J93p3TLYMg5D2rlFfvbT/q4gzf1myGI/f1eotXCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9bd93b8d3ddcc2fd98ca42e255291885e166510a551b16921bff60f29e0b8ba8","last_reissued_at":"2026-05-18T02:56:52.939595Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:56:52.939595Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Disimplicial arcs, transitive vertices, and disimplicial eliminations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Francisco J. Soulignac, Martiniano Egu\\'ia","submitted_at":"2014-03-07T00:59:55Z","abstract_excerpt":"In this article we deal with the problems of finding the disimplicial arcs of a digraph and recognizing some interesting graph classes defined by their existence. A diclique of a digraph is a pair $V \\to W$ of sets of vertices such that $v \\to w$ is an arc for every $v \\in V$ and $w \\in W$. An arc $v \\to w$ is disimplicial when $N^-(w) \\to N^+(v)$ is a diclique. We show that the problem of finding the disimplicial arcs is equivalent, in terms of time and space complexity, to that of locating the transitive vertices. As a result, an efficient algorithm to find the bisimplicial edges of bipartit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.1628","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":""},"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":"1403.1628","created_at":"2026-05-18T02:56:52.939653+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.1628v1","created_at":"2026-05-18T02:56:52.939653+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.1628","created_at":"2026-05-18T02:56:52.939653+00:00"},{"alias_kind":"pith_short_12","alias_value":"TPMTXDJ53TBP","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"TPMTXDJ53TBP3GGK","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"TPMTXDJ5","created_at":"2026-05-18T12:28:49.207871+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/TPMTXDJ53TBP3GGKILRFKKIYQX","json":"https://pith.science/pith/TPMTXDJ53TBP3GGKILRFKKIYQX.json","graph_json":"https://pith.science/api/pith-number/TPMTXDJ53TBP3GGKILRFKKIYQX/graph.json","events_json":"https://pith.science/api/pith-number/TPMTXDJ53TBP3GGKILRFKKIYQX/events.json","paper":"https://pith.science/paper/TPMTXDJ5"},"agent_actions":{"view_html":"https://pith.science/pith/TPMTXDJ53TBP3GGKILRFKKIYQX","download_json":"https://pith.science/pith/TPMTXDJ53TBP3GGKILRFKKIYQX.json","view_paper":"https://pith.science/paper/TPMTXDJ5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.1628&json=true","fetch_graph":"https://pith.science/api/pith-number/TPMTXDJ53TBP3GGKILRFKKIYQX/graph.json","fetch_events":"https://pith.science/api/pith-number/TPMTXDJ53TBP3GGKILRFKKIYQX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TPMTXDJ53TBP3GGKILRFKKIYQX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TPMTXDJ53TBP3GGKILRFKKIYQX/action/storage_attestation","attest_author":"https://pith.science/pith/TPMTXDJ53TBP3GGKILRFKKIYQX/action/author_attestation","sign_citation":"https://pith.science/pith/TPMTXDJ53TBP3GGKILRFKKIYQX/action/citation_signature","submit_replication":"https://pith.science/pith/TPMTXDJ53TBP3GGKILRFKKIYQX/action/replication_record"}},"created_at":"2026-05-18T02:56:52.939653+00:00","updated_at":"2026-05-18T02:56:52.939653+00:00"}