{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:C7RB3B2TANPQGLRMPQYBASUHJU","short_pith_number":"pith:C7RB3B2T","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"},"canonical_sha256":"17e21d8753035f032e2c7c30104a874d3092f51fe2331898aa3c81e0b97bb564","source":{"kind":"arxiv","id":"1810.04870","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.04870","created_at":"2026-05-17T23:53:41Z"},{"alias_kind":"arxiv_version","alias_value":"1810.04870v2","created_at":"2026-05-17T23:53:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.04870","created_at":"2026-05-17T23:53:41Z"},{"alias_kind":"pith_short_12","alias_value":"C7RB3B2TANPQ","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"C7RB3B2TANPQGLRM","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"C7RB3B2T","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:C7RB3B2TANPQGLRMPQYBASUHJU","target":"record","payload":{"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"},"canonical_sha256":"17e21d8753035f032e2c7c30104a874d3092f51fe2331898aa3c81e0b97bb564","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"},"source_kind":"arxiv","source_id":"1810.04870","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:53:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cNli9yCzfPhOEFYPlCaaiVEgALvNwf2/2KDOA27b5t4wLaay/LY6nPl1h5X18d6v36Luyfd6Um1Ie+xsXEj5DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T13:27:45.181017Z"},"content_sha256":"088a575a3def1b58b6846ba5ee9cf983b9a1849e91c3d48bf9a980dcc369b9f7","schema_version":"1.0","event_id":"sha256:088a575a3def1b58b6846ba5ee9cf983b9a1849e91c3d48bf9a980dcc369b9f7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:C7RB3B2TANPQGLRMPQYBASUHJU","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:53:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l8CbPuJq2gbFeaMgvy9LAfwkpQZhZ89XuLdsqq0nsiMSEfQST7aRS7Spnxc7A58CwPH1Ejm3k3jNvC+cLX0cAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T13:27:45.181375Z"},"content_sha256":"64c7f65d2c8954aa1d30f1ceff69b49233218e1fd135276703c6dfbae5ed1bda","schema_version":"1.0","event_id":"sha256:64c7f65d2c8954aa1d30f1ceff69b49233218e1fd135276703c6dfbae5ed1bda"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C7RB3B2TANPQGLRMPQYBASUHJU/bundle.json","state_url":"https://pith.science/pith/C7RB3B2TANPQGLRMPQYBASUHJU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C7RB3B2TANPQGLRMPQYBASUHJU/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-03T13:27:45Z","links":{"resolver":"https://pith.science/pith/C7RB3B2TANPQGLRMPQYBASUHJU","bundle":"https://pith.science/pith/C7RB3B2TANPQGLRMPQYBASUHJU/bundle.json","state":"https://pith.science/pith/C7RB3B2TANPQGLRMPQYBASUHJU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C7RB3B2TANPQGLRMPQYBASUHJU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:C7RB3B2TANPQGLRMPQYBASUHJU","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":"0899b955f72cc0a3edab6877b259b22a391373dc83dcea798fb137ee5dee75d4","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-11T07:22:38Z","title_canon_sha256":"8883d16e5df9dc60a623bef83384c1d35f4ee67cb99797fbce4e6cc903e3028d"},"schema_version":"1.0","source":{"id":"1810.04870","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.04870","created_at":"2026-05-17T23:53:41Z"},{"alias_kind":"arxiv_version","alias_value":"1810.04870v2","created_at":"2026-05-17T23:53:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.04870","created_at":"2026-05-17T23:53:41Z"},{"alias_kind":"pith_short_12","alias_value":"C7RB3B2TANPQ","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"C7RB3B2TANPQGLRM","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"C7RB3B2T","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:64c7f65d2c8954aa1d30f1ceff69b49233218e1fd135276703c6dfbae5ed1bda","target":"graph","created_at":"2026-05-17T23:53:41Z","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"},"paper":{"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.","authors_text":"Aleksandar Ilic, Milan Basic","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-11T07:22:38Z","title":"Path matrix and path energy of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.04870","kind":"arxiv","version":2},"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:088a575a3def1b58b6846ba5ee9cf983b9a1849e91c3d48bf9a980dcc369b9f7","target":"record","created_at":"2026-05-17T23:53:41Z","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":"0899b955f72cc0a3edab6877b259b22a391373dc83dcea798fb137ee5dee75d4","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-11T07:22:38Z","title_canon_sha256":"8883d16e5df9dc60a623bef83384c1d35f4ee67cb99797fbce4e6cc903e3028d"},"schema_version":"1.0","source":{"id":"1810.04870","kind":"arxiv","version":2}},"canonical_sha256":"17e21d8753035f032e2c7c30104a874d3092f51fe2331898aa3c81e0b97bb564","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"17e21d8753035f032e2c7c30104a874d3092f51fe2331898aa3c81e0b97bb564","first_computed_at":"2026-05-17T23:53:41.838562Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:41.838562Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LZ20fn6QZDo+yliEVKp6/OqcOSSeEFAmUUYlIhDw5Ht5n6VEG3HwyLrQ54+9LWyvAuVgjMh4N4lCxZksj/XpCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:41.838992Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.04870","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:088a575a3def1b58b6846ba5ee9cf983b9a1849e91c3d48bf9a980dcc369b9f7","sha256:64c7f65d2c8954aa1d30f1ceff69b49233218e1fd135276703c6dfbae5ed1bda"],"state_sha256":"a7435dcb4baf9774ac5304ba7d758d4fad010e363d7ccee2ab1a5dc2f4bfc84b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1RH4LKjWYDpopj+jLbr53Co7CyMPDwh4GrelcHrAQ327OySjF8iVuG86Z2jZTL9fV5DK0b3/AUWxEq4zJpRwBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T13:27:45.183259Z","bundle_sha256":"e6a8eccadcf48b2d423a5c4383a9e6ea72ac7feec5898008b81e4254d96c878d"}}