{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:L2IOFTBNBFTDS2ZBQ6E3BTV4XY","short_pith_number":"pith:L2IOFTBN","canonical_record":{"source":{"id":"1712.05859","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-15T22:11:45Z","cross_cats_sorted":[],"title_canon_sha256":"989636bf3ab9ccb3e2e5f3e00a8b19d975f37bc81494468b56a1996befa8cd67","abstract_canon_sha256":"339eb73a4ca9524539d9473d57358c6027019f6bb2fee7b527f53bb80438fd6b"},"schema_version":"1.0"},"canonical_sha256":"5e90e2cc2d0966396b218789b0cebcbe2319b0349b2783b5ae28294e7889fa90","source":{"kind":"arxiv","id":"1712.05859","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.05859","created_at":"2026-05-18T00:27:51Z"},{"alias_kind":"arxiv_version","alias_value":"1712.05859v1","created_at":"2026-05-18T00:27:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.05859","created_at":"2026-05-18T00:27:51Z"},{"alias_kind":"pith_short_12","alias_value":"L2IOFTBNBFTD","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"L2IOFTBNBFTDS2ZB","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"L2IOFTBN","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:L2IOFTBNBFTDS2ZBQ6E3BTV4XY","target":"record","payload":{"canonical_record":{"source":{"id":"1712.05859","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-15T22:11:45Z","cross_cats_sorted":[],"title_canon_sha256":"989636bf3ab9ccb3e2e5f3e00a8b19d975f37bc81494468b56a1996befa8cd67","abstract_canon_sha256":"339eb73a4ca9524539d9473d57358c6027019f6bb2fee7b527f53bb80438fd6b"},"schema_version":"1.0"},"canonical_sha256":"5e90e2cc2d0966396b218789b0cebcbe2319b0349b2783b5ae28294e7889fa90","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:51.702803Z","signature_b64":"qOcjgOh/Ncpy6QSVLs8qTJkAwsUFs8Ndei6a76dwU9VrHBjCGdjHhws1d8MZq6QIzgsVDFGJJys1/ZceXoyVAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e90e2cc2d0966396b218789b0cebcbe2319b0349b2783b5ae28294e7889fa90","last_reissued_at":"2026-05-18T00:27:51.702085Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:51.702085Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.05859","source_version":1,"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-18T00:27:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xei8g04ihozawyJ8Ni9Z1REiHRte4Y52pe3zCcdNIB3rDm0XtKvGZyR8xOnJCYbjcrWBKHTeg3oUNeYSOZ5HAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T21:18:02.127858Z"},"content_sha256":"74158db3cfadec4757021cd335729fb43ef2c5709c63b4023c95210bc1a7cbd9","schema_version":"1.0","event_id":"sha256:74158db3cfadec4757021cd335729fb43ef2c5709c63b4023c95210bc1a7cbd9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:L2IOFTBNBFTDS2ZBQ6E3BTV4XY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Resistance distance in bent linear 2-trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Amanda E. Francis, Emily J. Evans, Wayne Barrett","submitted_at":"2017-12-15T22:11:45Z","abstract_excerpt":"In this note we consider the bent linear 2-tree and provide an explicit formula for the resistance distance $r_{G_n}(1,n)$ between the first and last vertices of the graph. We call the graph $G_n$ with vertex set $V(G_n) = \\{ 1, 2, \\ldots, n\\}$ and $\\{i,j\\} \\in E(G_n)$ if and only if $0<|i-j| \\leq 2$ a straight linear 2-tree. We define the graph $H_n$ with $V(H_n)= V(G_n)$ and $E(H_n) = (E(G_n) \\cup \\{k,k+3\\})\\setminus(\\{k+1,k+3\\}$ to be a bent linear 2-tree with bend at vertex $k$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.05859","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"},"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-18T00:27:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gcsxOQuoun2XtAveeCxlb6vFBmajNdPvuyWQaY58ANRKi93Z9ChxHAUUZxY0Vvq7FV7YMELDsHg2xp40Eth5CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T21:18:02.128514Z"},"content_sha256":"b7c93efbf7cd480a31c655a669bb0321c75e7d6aee68e5357c9b6bb98e6535e0","schema_version":"1.0","event_id":"sha256:b7c93efbf7cd480a31c655a669bb0321c75e7d6aee68e5357c9b6bb98e6535e0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L2IOFTBNBFTDS2ZBQ6E3BTV4XY/bundle.json","state_url":"https://pith.science/pith/L2IOFTBNBFTDS2ZBQ6E3BTV4XY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L2IOFTBNBFTDS2ZBQ6E3BTV4XY/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-05-27T21:18:02Z","links":{"resolver":"https://pith.science/pith/L2IOFTBNBFTDS2ZBQ6E3BTV4XY","bundle":"https://pith.science/pith/L2IOFTBNBFTDS2ZBQ6E3BTV4XY/bundle.json","state":"https://pith.science/pith/L2IOFTBNBFTDS2ZBQ6E3BTV4XY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L2IOFTBNBFTDS2ZBQ6E3BTV4XY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:L2IOFTBNBFTDS2ZBQ6E3BTV4XY","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":"339eb73a4ca9524539d9473d57358c6027019f6bb2fee7b527f53bb80438fd6b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-15T22:11:45Z","title_canon_sha256":"989636bf3ab9ccb3e2e5f3e00a8b19d975f37bc81494468b56a1996befa8cd67"},"schema_version":"1.0","source":{"id":"1712.05859","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.05859","created_at":"2026-05-18T00:27:51Z"},{"alias_kind":"arxiv_version","alias_value":"1712.05859v1","created_at":"2026-05-18T00:27:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.05859","created_at":"2026-05-18T00:27:51Z"},{"alias_kind":"pith_short_12","alias_value":"L2IOFTBNBFTD","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"L2IOFTBNBFTDS2ZB","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"L2IOFTBN","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:b7c93efbf7cd480a31c655a669bb0321c75e7d6aee68e5357c9b6bb98e6535e0","target":"graph","created_at":"2026-05-18T00:27:51Z","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":"In this note we consider the bent linear 2-tree and provide an explicit formula for the resistance distance $r_{G_n}(1,n)$ between the first and last vertices of the graph. We call the graph $G_n$ with vertex set $V(G_n) = \\{ 1, 2, \\ldots, n\\}$ and $\\{i,j\\} \\in E(G_n)$ if and only if $0<|i-j| \\leq 2$ a straight linear 2-tree. We define the graph $H_n$ with $V(H_n)= V(G_n)$ and $E(H_n) = (E(G_n) \\cup \\{k,k+3\\})\\setminus(\\{k+1,k+3\\}$ to be a bent linear 2-tree with bend at vertex $k$.","authors_text":"Amanda E. Francis, Emily J. Evans, Wayne Barrett","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-15T22:11:45Z","title":"Resistance distance in bent linear 2-trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.05859","kind":"arxiv","version":1},"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:74158db3cfadec4757021cd335729fb43ef2c5709c63b4023c95210bc1a7cbd9","target":"record","created_at":"2026-05-18T00:27:51Z","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":"339eb73a4ca9524539d9473d57358c6027019f6bb2fee7b527f53bb80438fd6b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-15T22:11:45Z","title_canon_sha256":"989636bf3ab9ccb3e2e5f3e00a8b19d975f37bc81494468b56a1996befa8cd67"},"schema_version":"1.0","source":{"id":"1712.05859","kind":"arxiv","version":1}},"canonical_sha256":"5e90e2cc2d0966396b218789b0cebcbe2319b0349b2783b5ae28294e7889fa90","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5e90e2cc2d0966396b218789b0cebcbe2319b0349b2783b5ae28294e7889fa90","first_computed_at":"2026-05-18T00:27:51.702085Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:51.702085Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qOcjgOh/Ncpy6QSVLs8qTJkAwsUFs8Ndei6a76dwU9VrHBjCGdjHhws1d8MZq6QIzgsVDFGJJys1/ZceXoyVAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:51.702803Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.05859","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:74158db3cfadec4757021cd335729fb43ef2c5709c63b4023c95210bc1a7cbd9","sha256:b7c93efbf7cd480a31c655a669bb0321c75e7d6aee68e5357c9b6bb98e6535e0"],"state_sha256":"8b1fbd67988df371c82f48b61e5ce45ba84464df305b2a5cb381334b841a9ce2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q3RSPTtYuAzpe51Nn4aCKUIyK5IsGn1fg/fRM447NZx3IHY0b9uRUgema6Vc5Zeft/OxwzbqpIfzllvsRRmsCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T21:18:02.131465Z","bundle_sha256":"225d04f1d8ee1c4d7215f8ce0bf2875726ce6f0b1d1559b524fd8f7a4106c1f5"}}