{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:C7RB3B2TANPQGLRMPQYBASUHJU","short_pith_number":"pith:C7RB3B2T","schema_version":"1.0","canonical_sha256":"17e21d8753035f032e2c7c30104a874d3092f51fe2331898aa3c81e0b97bb564","source":{"kind":"arxiv","id":"1810.04870","version":2},"attestation_state":"computed","paper":{"title":"Path matrix and path energy of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Aleksandar Ilic, Milan Basic","submitted_at":"2018-10-11T07:22:38Z","abstract_excerpt":"Given a graph $G$, we associate a path matrix $P$ whose $(i, j)$ entry represents the maximum number of vertex disjoint paths between the vertices $i$ and $j$, with zeros on the main diagonal. In this note, we resolve four conjectures from [M. M. Shikare, P. P. Malavadkar, S. C. Patekar, I. Gutman, \\emph{On Path Eigenvalues and Path Energy of Graphs}, MATCH Commun. Math. Comput. Chem. {\\bf 79} (2018), 387--398.] on the path energy of graphs and finally present efficient $O(|E| |V|^3)$ algorithm for computing the path matrix used for verifying computational results."},"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":"1810.04870","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-11T07:22:38Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"8883d16e5df9dc60a623bef83384c1d35f4ee67cb99797fbce4e6cc903e3028d","abstract_canon_sha256":"0899b955f72cc0a3edab6877b259b22a391373dc83dcea798fb137ee5dee75d4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:41.838992Z","signature_b64":"LZ20fn6QZDo+yliEVKp6/OqcOSSeEFAmUUYlIhDw5Ht5n6VEG3HwyLrQ54+9LWyvAuVgjMh4N4lCxZksj/XpCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"17e21d8753035f032e2c7c30104a874d3092f51fe2331898aa3c81e0b97bb564","last_reissued_at":"2026-05-17T23:53:41.838562Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:41.838562Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Path matrix and path energy of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Aleksandar Ilic, Milan Basic","submitted_at":"2018-10-11T07:22:38Z","abstract_excerpt":"Given a graph $G$, we associate a path matrix $P$ whose $(i, j)$ entry represents the maximum number of vertex disjoint paths between the vertices $i$ and $j$, with zeros on the main diagonal. In this note, we resolve four conjectures from [M. M. Shikare, P. P. Malavadkar, S. C. Patekar, I. Gutman, \\emph{On Path Eigenvalues and Path Energy of Graphs}, MATCH Commun. Math. Comput. Chem. {\\bf 79} (2018), 387--398.] on the path energy of graphs and finally present efficient $O(|E| |V|^3)$ algorithm for computing the path matrix used for verifying computational results."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.04870","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":"1810.04870","created_at":"2026-05-17T23:53:41.838628+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.04870v2","created_at":"2026-05-17T23:53:41.838628+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.04870","created_at":"2026-05-17T23:53:41.838628+00:00"},{"alias_kind":"pith_short_12","alias_value":"C7RB3B2TANPQ","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"C7RB3B2TANPQGLRM","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"C7RB3B2T","created_at":"2026-05-18T12:32:16.446611+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/C7RB3B2TANPQGLRMPQYBASUHJU","json":"https://pith.science/pith/C7RB3B2TANPQGLRMPQYBASUHJU.json","graph_json":"https://pith.science/api/pith-number/C7RB3B2TANPQGLRMPQYBASUHJU/graph.json","events_json":"https://pith.science/api/pith-number/C7RB3B2TANPQGLRMPQYBASUHJU/events.json","paper":"https://pith.science/paper/C7RB3B2T"},"agent_actions":{"view_html":"https://pith.science/pith/C7RB3B2TANPQGLRMPQYBASUHJU","download_json":"https://pith.science/pith/C7RB3B2TANPQGLRMPQYBASUHJU.json","view_paper":"https://pith.science/paper/C7RB3B2T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.04870&json=true","fetch_graph":"https://pith.science/api/pith-number/C7RB3B2TANPQGLRMPQYBASUHJU/graph.json","fetch_events":"https://pith.science/api/pith-number/C7RB3B2TANPQGLRMPQYBASUHJU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C7RB3B2TANPQGLRMPQYBASUHJU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C7RB3B2TANPQGLRMPQYBASUHJU/action/storage_attestation","attest_author":"https://pith.science/pith/C7RB3B2TANPQGLRMPQYBASUHJU/action/author_attestation","sign_citation":"https://pith.science/pith/C7RB3B2TANPQGLRMPQYBASUHJU/action/citation_signature","submit_replication":"https://pith.science/pith/C7RB3B2TANPQGLRMPQYBASUHJU/action/replication_record"}},"created_at":"2026-05-17T23:53:41.838628+00:00","updated_at":"2026-05-17T23:53:41.838628+00:00"}