{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:Z5JC22RE4T6IU3EZ2ESNKE2JBR","short_pith_number":"pith:Z5JC22RE","canonical_record":{"source":{"id":"1801.08043","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-23T11:22:39Z","cross_cats_sorted":[],"title_canon_sha256":"17d56ed82ca56cf99dd040cfd5a2b069a6f68d66a840c5b5e01743e23c7a4309","abstract_canon_sha256":"72acf1abb0b792033e680b18e6c4fe3b73a4d30c78c1d6a6391a646d1d6a729b"},"schema_version":"1.0"},"canonical_sha256":"cf522d6a24e4fc8a6c99d124d513490c5968b9696540a5beb42da42edeba5b70","source":{"kind":"arxiv","id":"1801.08043","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.08043","created_at":"2026-05-18T00:25:08Z"},{"alias_kind":"arxiv_version","alias_value":"1801.08043v1","created_at":"2026-05-18T00:25:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.08043","created_at":"2026-05-18T00:25:08Z"},{"alias_kind":"pith_short_12","alias_value":"Z5JC22RE4T6I","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"Z5JC22RE4T6IU3EZ","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"Z5JC22RE","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:Z5JC22RE4T6IU3EZ2ESNKE2JBR","target":"record","payload":{"canonical_record":{"source":{"id":"1801.08043","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-23T11:22:39Z","cross_cats_sorted":[],"title_canon_sha256":"17d56ed82ca56cf99dd040cfd5a2b069a6f68d66a840c5b5e01743e23c7a4309","abstract_canon_sha256":"72acf1abb0b792033e680b18e6c4fe3b73a4d30c78c1d6a6391a646d1d6a729b"},"schema_version":"1.0"},"canonical_sha256":"cf522d6a24e4fc8a6c99d124d513490c5968b9696540a5beb42da42edeba5b70","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:08.455651Z","signature_b64":"MIoxOSFbQJEfiuMzwoxdjFyLpnyWmo4rEAU4qFGh+ukhq8mDvQJ1tNslijS1HPuu8tsmrpuA8nXq6HqueHzPCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cf522d6a24e4fc8a6c99d124d513490c5968b9696540a5beb42da42edeba5b70","last_reissued_at":"2026-05-18T00:25:08.455000Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:08.455000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.08043","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:25:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MYBGdTdNLjHHhQzdncIyiKOS+KeQSxzdO/tEqJyJGdELu8IWctyvkbq9pcDBEIjrDZo2YdDiWbjsuY/EL5amBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T08:50:44.648001Z"},"content_sha256":"44bb0f727096c6dfe56e979892044d1a65a6aee681dfd122d3ea2ba0e9059cbb","schema_version":"1.0","event_id":"sha256:44bb0f727096c6dfe56e979892044d1a65a6aee681dfd122d3ea2ba0e9059cbb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:Z5JC22RE4T6IU3EZ2ESNKE2JBR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Toll number of the strong product of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Polona Repolusk, Tanja Gologranc","submitted_at":"2018-01-23T11:22:39Z","abstract_excerpt":"A tolled walk $T$ between two non-adjacent vertices $u$ and $v$ in a graph $G$ is a walk, in which $u$ is adjacent only to the second vertex of $T$ and $v$ is adjacent only to the second-to-last vertex of $T$. A toll interval between $u,v\\in V(G)$ is a set $T_G(u,v)=\\{x\\in V(G)~|~x \\textrm{ lies on a tolled walk between } u \\textrm{\\, and\\,} v\\}$. A set $S \\subseteq V(G)$ is toll convex, if $T_{G}(u,v)\\subseteq S$ for all $u,v\\in S$. A toll closure of a set $S \\subseteq V(G)$ is the union of toll intervals between all pairs of vertices from $S$. The size of a smallest set $S$ whose toll closur"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.08043","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:25:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ty7I6JKx2GdGxD4VyyHFhO8h7OAHZk7HQ/7FKQ56qr2Ek1+JRrBm8lmxhKz7PS7YpY+/OWJ6kJ0xnoeJ+wTXDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T08:50:44.648580Z"},"content_sha256":"fe2726ca35b03f586bfe412a6f44cd1881ef19e1dddc91d64540a6d77dd0ff64","schema_version":"1.0","event_id":"sha256:fe2726ca35b03f586bfe412a6f44cd1881ef19e1dddc91d64540a6d77dd0ff64"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z5JC22RE4T6IU3EZ2ESNKE2JBR/bundle.json","state_url":"https://pith.science/pith/Z5JC22RE4T6IU3EZ2ESNKE2JBR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z5JC22RE4T6IU3EZ2ESNKE2JBR/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-06-21T08:50:44Z","links":{"resolver":"https://pith.science/pith/Z5JC22RE4T6IU3EZ2ESNKE2JBR","bundle":"https://pith.science/pith/Z5JC22RE4T6IU3EZ2ESNKE2JBR/bundle.json","state":"https://pith.science/pith/Z5JC22RE4T6IU3EZ2ESNKE2JBR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z5JC22RE4T6IU3EZ2ESNKE2JBR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:Z5JC22RE4T6IU3EZ2ESNKE2JBR","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":"72acf1abb0b792033e680b18e6c4fe3b73a4d30c78c1d6a6391a646d1d6a729b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-23T11:22:39Z","title_canon_sha256":"17d56ed82ca56cf99dd040cfd5a2b069a6f68d66a840c5b5e01743e23c7a4309"},"schema_version":"1.0","source":{"id":"1801.08043","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.08043","created_at":"2026-05-18T00:25:08Z"},{"alias_kind":"arxiv_version","alias_value":"1801.08043v1","created_at":"2026-05-18T00:25:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.08043","created_at":"2026-05-18T00:25:08Z"},{"alias_kind":"pith_short_12","alias_value":"Z5JC22RE4T6I","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"Z5JC22RE4T6IU3EZ","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"Z5JC22RE","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:fe2726ca35b03f586bfe412a6f44cd1881ef19e1dddc91d64540a6d77dd0ff64","target":"graph","created_at":"2026-05-18T00:25:08Z","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":"A tolled walk $T$ between two non-adjacent vertices $u$ and $v$ in a graph $G$ is a walk, in which $u$ is adjacent only to the second vertex of $T$ and $v$ is adjacent only to the second-to-last vertex of $T$. A toll interval between $u,v\\in V(G)$ is a set $T_G(u,v)=\\{x\\in V(G)~|~x \\textrm{ lies on a tolled walk between } u \\textrm{\\, and\\,} v\\}$. A set $S \\subseteq V(G)$ is toll convex, if $T_{G}(u,v)\\subseteq S$ for all $u,v\\in S$. A toll closure of a set $S \\subseteq V(G)$ is the union of toll intervals between all pairs of vertices from $S$. The size of a smallest set $S$ whose toll closur","authors_text":"Polona Repolusk, Tanja Gologranc","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-23T11:22:39Z","title":"Toll number of the strong product of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.08043","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:44bb0f727096c6dfe56e979892044d1a65a6aee681dfd122d3ea2ba0e9059cbb","target":"record","created_at":"2026-05-18T00:25:08Z","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":"72acf1abb0b792033e680b18e6c4fe3b73a4d30c78c1d6a6391a646d1d6a729b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-23T11:22:39Z","title_canon_sha256":"17d56ed82ca56cf99dd040cfd5a2b069a6f68d66a840c5b5e01743e23c7a4309"},"schema_version":"1.0","source":{"id":"1801.08043","kind":"arxiv","version":1}},"canonical_sha256":"cf522d6a24e4fc8a6c99d124d513490c5968b9696540a5beb42da42edeba5b70","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cf522d6a24e4fc8a6c99d124d513490c5968b9696540a5beb42da42edeba5b70","first_computed_at":"2026-05-18T00:25:08.455000Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:08.455000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MIoxOSFbQJEfiuMzwoxdjFyLpnyWmo4rEAU4qFGh+ukhq8mDvQJ1tNslijS1HPuu8tsmrpuA8nXq6HqueHzPCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:08.455651Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.08043","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:44bb0f727096c6dfe56e979892044d1a65a6aee681dfd122d3ea2ba0e9059cbb","sha256:fe2726ca35b03f586bfe412a6f44cd1881ef19e1dddc91d64540a6d77dd0ff64"],"state_sha256":"26d362bd9961eefa00f64fcd4ee7c4fe8f3d2619dca60bc687df6fc61907295b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IJ323IxztD144ng0HiItalBV+VFPg9w65aatErI7cB73xSwW8EXUDWLSeyukM1M914O1C7rcSnpr+ORDCpSsCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T08:50:44.651160Z","bundle_sha256":"b89cf60fb424e20c2c8f0fdf5d5c190df279e4e8f6870d9e082cda77c6407abc"}}