{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:Q32VQTCUEWMP4RO6ZFKTKHJEFR","short_pith_number":"pith:Q32VQTCU","canonical_record":{"source":{"id":"1111.4600","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-11-20T01:23:24Z","cross_cats_sorted":[],"title_canon_sha256":"9480ecd8facc04d19f58308f41eb54d74d73f71fbe13be781bd89151a0fd37d4","abstract_canon_sha256":"7f42496fed88074778ec901fcaa180a2aafc67433eefeee27c2df018635463cb"},"schema_version":"1.0"},"canonical_sha256":"86f5584c542598fe45dec955351d242c734502dcbe3611290dbcb35202a0b19e","source":{"kind":"arxiv","id":"1111.4600","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.4600","created_at":"2026-05-18T04:08:03Z"},{"alias_kind":"arxiv_version","alias_value":"1111.4600v1","created_at":"2026-05-18T04:08:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.4600","created_at":"2026-05-18T04:08:03Z"},{"alias_kind":"pith_short_12","alias_value":"Q32VQTCUEWMP","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"Q32VQTCUEWMP4RO6","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"Q32VQTCU","created_at":"2026-05-18T12:26:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:Q32VQTCUEWMP4RO6ZFKTKHJEFR","target":"record","payload":{"canonical_record":{"source":{"id":"1111.4600","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-11-20T01:23:24Z","cross_cats_sorted":[],"title_canon_sha256":"9480ecd8facc04d19f58308f41eb54d74d73f71fbe13be781bd89151a0fd37d4","abstract_canon_sha256":"7f42496fed88074778ec901fcaa180a2aafc67433eefeee27c2df018635463cb"},"schema_version":"1.0"},"canonical_sha256":"86f5584c542598fe45dec955351d242c734502dcbe3611290dbcb35202a0b19e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:08:03.011123Z","signature_b64":"NOqLfGi4Wu1yk9C1AlwOIaoTDhZm0R1hYRI+a13EEpc6yBjZsvYzWG+wiVnEdSEYMFWWd3Bv/oT3/5MZ12WKBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86f5584c542598fe45dec955351d242c734502dcbe3611290dbcb35202a0b19e","last_reissued_at":"2026-05-18T04:08:03.010595Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:08:03.010595Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1111.4600","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-18T04:08:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0f/mUTYuYqr/bVkyz5y/MbUdJmbDtsY3tMETdRFS4+RdAcINl8fjCZx58qLNEPxBJksbRodRbX7GhODt8/frBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T22:48:07.443510Z"},"content_sha256":"ceeb08f218d959ac21e3242ad34c663836493abb70ee126baa6464ba899874b0","schema_version":"1.0","event_id":"sha256:ceeb08f218d959ac21e3242ad34c663836493abb70ee126baa6464ba899874b0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:Q32VQTCUEWMP4RO6ZFKTKHJEFR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Transience of Linear Max-Plus Dynamical Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Bernadette Charron-Bost, Matthias F\\\"ugger, Thomas Nowak","submitted_at":"2011-11-20T01:23:24Z","abstract_excerpt":"We study the transients of linear max-plus dynamical systems. For that, we consider for each irreducible max-plus matrix A, the weighted graph G(A) such that A is the adjacency matrix of G(A). Based on a novel graph-theoretic counterpart to the number-theoretic Brauer's theorem, we propose two new methods for the construction of arbitrarily long paths in G(A) with maximal weight. That leads to two new upper bounds on the transient of a linear max-plus system which both improve on the bounds previously given by Even and Rajsbaum (STOC 1990, Theory of Computing Systems 1997), by Bouillard and Ga"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.4600","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-18T04:08:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H1J9TWwCqlOSWdqWZhCwkmMbpeFOiSXABm2LHEF9BRDomkf4ZayM3fcuTmAeuzoO2ALkDhhyeWMb4kPzJPclDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T22:48:07.444157Z"},"content_sha256":"61dae5ddcdd2f712330b4b1dc76bf566f83a1ad993098ca87bceddecbf2ac6c7","schema_version":"1.0","event_id":"sha256:61dae5ddcdd2f712330b4b1dc76bf566f83a1ad993098ca87bceddecbf2ac6c7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q32VQTCUEWMP4RO6ZFKTKHJEFR/bundle.json","state_url":"https://pith.science/pith/Q32VQTCUEWMP4RO6ZFKTKHJEFR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q32VQTCUEWMP4RO6ZFKTKHJEFR/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-29T22:48:07Z","links":{"resolver":"https://pith.science/pith/Q32VQTCUEWMP4RO6ZFKTKHJEFR","bundle":"https://pith.science/pith/Q32VQTCUEWMP4RO6ZFKTKHJEFR/bundle.json","state":"https://pith.science/pith/Q32VQTCUEWMP4RO6ZFKTKHJEFR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q32VQTCUEWMP4RO6ZFKTKHJEFR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:Q32VQTCUEWMP4RO6ZFKTKHJEFR","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":"7f42496fed88074778ec901fcaa180a2aafc67433eefeee27c2df018635463cb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-11-20T01:23:24Z","title_canon_sha256":"9480ecd8facc04d19f58308f41eb54d74d73f71fbe13be781bd89151a0fd37d4"},"schema_version":"1.0","source":{"id":"1111.4600","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.4600","created_at":"2026-05-18T04:08:03Z"},{"alias_kind":"arxiv_version","alias_value":"1111.4600v1","created_at":"2026-05-18T04:08:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.4600","created_at":"2026-05-18T04:08:03Z"},{"alias_kind":"pith_short_12","alias_value":"Q32VQTCUEWMP","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"Q32VQTCUEWMP4RO6","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"Q32VQTCU","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:61dae5ddcdd2f712330b4b1dc76bf566f83a1ad993098ca87bceddecbf2ac6c7","target":"graph","created_at":"2026-05-18T04:08:03Z","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":"We study the transients of linear max-plus dynamical systems. For that, we consider for each irreducible max-plus matrix A, the weighted graph G(A) such that A is the adjacency matrix of G(A). Based on a novel graph-theoretic counterpart to the number-theoretic Brauer's theorem, we propose two new methods for the construction of arbitrarily long paths in G(A) with maximal weight. That leads to two new upper bounds on the transient of a linear max-plus system which both improve on the bounds previously given by Even and Rajsbaum (STOC 1990, Theory of Computing Systems 1997), by Bouillard and Ga","authors_text":"Bernadette Charron-Bost, Matthias F\\\"ugger, Thomas Nowak","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-11-20T01:23:24Z","title":"On the Transience of Linear Max-Plus Dynamical Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.4600","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:ceeb08f218d959ac21e3242ad34c663836493abb70ee126baa6464ba899874b0","target":"record","created_at":"2026-05-18T04:08:03Z","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":"7f42496fed88074778ec901fcaa180a2aafc67433eefeee27c2df018635463cb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-11-20T01:23:24Z","title_canon_sha256":"9480ecd8facc04d19f58308f41eb54d74d73f71fbe13be781bd89151a0fd37d4"},"schema_version":"1.0","source":{"id":"1111.4600","kind":"arxiv","version":1}},"canonical_sha256":"86f5584c542598fe45dec955351d242c734502dcbe3611290dbcb35202a0b19e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"86f5584c542598fe45dec955351d242c734502dcbe3611290dbcb35202a0b19e","first_computed_at":"2026-05-18T04:08:03.010595Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:08:03.010595Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NOqLfGi4Wu1yk9C1AlwOIaoTDhZm0R1hYRI+a13EEpc6yBjZsvYzWG+wiVnEdSEYMFWWd3Bv/oT3/5MZ12WKBg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:08:03.011123Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.4600","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ceeb08f218d959ac21e3242ad34c663836493abb70ee126baa6464ba899874b0","sha256:61dae5ddcdd2f712330b4b1dc76bf566f83a1ad993098ca87bceddecbf2ac6c7"],"state_sha256":"a07124dbab390086317ac23229967c4f3f087299ad700ab7647574c8a9261d1a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dD02EeQ3m+rWaIGQO8UhVliGMZrD9E4M7CjMZucXyGkDVHGPzGj9h609tQune/le7vL33MkdNaZHzYHYQFu1CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T22:48:07.447493Z","bundle_sha256":"a9f7d5531ca55684c8bdfe0ed1b2bb10bd3f87eb28559e8d2b776d96042d01dd"}}