{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:FSQAN5RHS352ZUH5BREXUOOKG6","short_pith_number":"pith:FSQAN5RH","schema_version":"1.0","canonical_sha256":"2ca006f62796fbacd0fd0c497a39ca37931c7360dcf119b52d1d1510244d1532","source":{"kind":"arxiv","id":"1705.08743","version":2},"attestation_state":"computed","paper":{"title":"Fast algorithms for anti-distance matrices as a generalization of Boolean matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Michiel de Bondt","submitted_at":"2017-05-24T13:18:14Z","abstract_excerpt":"We show that Boolean matrix multiplication, computed as a sum of products of column vectors with row vectors, is essentially the same as Warshall's algorithm for computing the transitive closure matrix of a graph from its adjacency matrix.\n  Warshall's algorithm can be generalized to Floyd's algorithm for computing the distance matrix of a graph with weighted edges. We will generalize Boolean matrices in the same way, keeping matrix multiplication essentially equivalent to the Floyd-Warshall algorithm. This way, we get matrices over a semiring, which are similar to the so-called \"funny matrice"},"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":"1705.08743","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-05-24T13:18:14Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"dda6598ba605cb6d8bbd142afeb680f7e1bde6439500e347ee9c99d0b4586eb3","abstract_canon_sha256":"66715bef1ede714286b5c710e04701aa46f38507b9dad74aa898060649680bd2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:12.701021Z","signature_b64":"RvxSSJ8z3opTPIt3Ia++A/NyPbP9lrdSuOEaGztZLLCK0HWxjxr6GzMkFVQJksuTETwiOutaq6WJkDFQ+/H/Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ca006f62796fbacd0fd0c497a39ca37931c7360dcf119b52d1d1510244d1532","last_reissued_at":"2026-05-18T00:31:12.700385Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:12.700385Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast algorithms for anti-distance matrices as a generalization of Boolean matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Michiel de Bondt","submitted_at":"2017-05-24T13:18:14Z","abstract_excerpt":"We show that Boolean matrix multiplication, computed as a sum of products of column vectors with row vectors, is essentially the same as Warshall's algorithm for computing the transitive closure matrix of a graph from its adjacency matrix.\n  Warshall's algorithm can be generalized to Floyd's algorithm for computing the distance matrix of a graph with weighted edges. We will generalize Boolean matrices in the same way, keeping matrix multiplication essentially equivalent to the Floyd-Warshall algorithm. This way, we get matrices over a semiring, which are similar to the so-called \"funny matrice"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.08743","kind":"arxiv","version":2},"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":"1705.08743","created_at":"2026-05-18T00:31:12.700488+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.08743v2","created_at":"2026-05-18T00:31:12.700488+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.08743","created_at":"2026-05-18T00:31:12.700488+00:00"},{"alias_kind":"pith_short_12","alias_value":"FSQAN5RHS352","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"FSQAN5RHS352ZUH5","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"FSQAN5RH","created_at":"2026-05-18T12:31:15.632608+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/FSQAN5RHS352ZUH5BREXUOOKG6","json":"https://pith.science/pith/FSQAN5RHS352ZUH5BREXUOOKG6.json","graph_json":"https://pith.science/api/pith-number/FSQAN5RHS352ZUH5BREXUOOKG6/graph.json","events_json":"https://pith.science/api/pith-number/FSQAN5RHS352ZUH5BREXUOOKG6/events.json","paper":"https://pith.science/paper/FSQAN5RH"},"agent_actions":{"view_html":"https://pith.science/pith/FSQAN5RHS352ZUH5BREXUOOKG6","download_json":"https://pith.science/pith/FSQAN5RHS352ZUH5BREXUOOKG6.json","view_paper":"https://pith.science/paper/FSQAN5RH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.08743&json=true","fetch_graph":"https://pith.science/api/pith-number/FSQAN5RHS352ZUH5BREXUOOKG6/graph.json","fetch_events":"https://pith.science/api/pith-number/FSQAN5RHS352ZUH5BREXUOOKG6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FSQAN5RHS352ZUH5BREXUOOKG6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FSQAN5RHS352ZUH5BREXUOOKG6/action/storage_attestation","attest_author":"https://pith.science/pith/FSQAN5RHS352ZUH5BREXUOOKG6/action/author_attestation","sign_citation":"https://pith.science/pith/FSQAN5RHS352ZUH5BREXUOOKG6/action/citation_signature","submit_replication":"https://pith.science/pith/FSQAN5RHS352ZUH5BREXUOOKG6/action/replication_record"}},"created_at":"2026-05-18T00:31:12.700488+00:00","updated_at":"2026-05-18T00:31:12.700488+00:00"}